Q1) Given a newspaper and a set of ‘l’ words, give an efficient algorithm to find the ‘l’ words in the newspaper.
Q2) Find the next higher number in set of permutations of a given number. Q3) Given preorder of a BST, find if each non-leaf node has just one child or not. To be done in linear time. Q4) Given a dictionary of words, two APIs Is_word(string) Is_prefix(string) And a NxN matrix with each postion consisting of a character. If from any position (i,j) you can move in any of the four directions, find out the all the valid words that can be formed in the matrix. (looping is not allowed, i.e. for forming a word position if you start from (i,j) and move to (i-1,j) then from this position you cannot go back to (i,j)) Q5) Given that there are n players and each one of them has played exactly one game with every other player. Also given is an API that tells whether player ‘a’ won or lost to player ‘b’, where ‘a’ and ‘b’ could be any of the players. Arrange the n players in a length n array such that player at position ‘i’ has won from player at ‘i+1’ and lost to player at ‘i-1’. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/LzG-OrtjDmoJ. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
