Implement strtok: How do you handle consecutive delimiters, end of string delimiters, and starting delimiters. How would u make it more efficient (the delimiter loop can be replaced by an associative array, what is the lenght of the array (255 - Can be reduced to 32)
Write a function f(a, b) which takes two string arguments and returns a string containing only the characters found in both strings in the order of a. Write a version which is order N-squared and one which is order N.
khanji has a LOT of characters in their alphabet and are using a way of compressing it so that the most common characters are 1 byte and the less common are 2 bytes. If it's a '1 byte' character, it starts with a 0, If it's a 2 byte character, it starts with a 1. If you're at a particular character (at the beginning), how do you find where the previous character begins?
Starred