Question were simple. They do have a question bank. a) Find the nearest K point given a set of N point. b) Print a tree level-by level. c) Given a dictionary find and set of two words find path from one word to another such that all the intermediate words are also from dictionary. Example: GOD -> GID -> DID -> DIG -> DOG. At each time we are allowed only one character change. d) Design an Hangman. { They expect MVC architecture. }