Given a dictionary of strings and another string find out if the string is an exact match to some words in the dictionary or varies at most in only one place of some word of the dictionary?
Given a set of random strings, write a function that returns a set that groups all the anagrams together.
Ex: star, dog, car, rats, arc - > {(star, rats), (arc,car), dog}
Given a string and two words which are present in the string, find the minimum distance between the words
Example: "the brown quick frog quick the", "the" "quick" Min Distance: 1
"the quick the brown quick brown the frog", "the" "brown" Min Distance: 2
C/Java code would be helpful?
