Coding Challenge Series / Technical Interview Series

You have a list of strings. Eliminate duplicates.

Sure, simple enough if the list is small. What if the list has thousands of entries? A simple solution simply :) won’t do.

Coding Challenge Series / Technical Interview Series

Decode a HTML URL encoded string.

A URL encoded string is a series of characters, where the sequence %## is a single byte hex encoded character.

Hi%20there!

becomes

Hi there!

Do not use any standard function for hex or decoding functions that may be provided by the language or platform you choose.

Don’t forget to consider CPU/memory/object usage as part of your solution!

Coding Challenge Series / Technical Interview Series

A function you create is provided as a parameter a string of arbitrary length. This string has special characteristics though — once a character is read, it is zeroed out and is then read-only.

You may access the string’s individual characters either as an array or a function (whichever your programming language supports, for example string[#] or string.getChar(#)); no other built-in string functions may be used.

The function you create must do the following:

• Find the longest segment delimited by a character, provided as a second parameter to the function
• The start of the string and the end of the string should be treated as if they are the delimiter character.
• Return the longest segment as a new string.
• Your function may not make a copy of the entire string (only if it matches the long segment).
• If two segments are the same length, return the last one found.