Citrix System Inc Interview Report
- 0of 0 votes
AnswersYou have been given a dictionary containing some words which data structure you will
- priyankajaggi4 September 10, 2011 in India
use to store all those words and why
You have been given a word you have to find its anagrams within that dictionary
Now you haven’t been given any word you have to find all the anagrams already existing
within given dictionary.
Now you can have as much time as you want for preprocessing of dictionary words
already existing but the solution should give efficient result for accessing the anagram of
given word
Suppose the length of each word in dictionary is of length N and it has M no of words in
dictionary then how much time it will take for preprocessing and after preprocessing to
find the angrams in dictionary
(they were asking for as many solutions as you can give for each question)| Report Duplicate | Flag | PURGE
Citrix System Inc Software Engineer / Developer - 0of 0 votes
AnswersYou have a BST in which each and every node has an extra pointer (called rand) which
- priyankajaggi4 September 10, 2011 in India
is pointing to any random node within the tree. Now if that rand pointer is pointing to any
of its inorder successor then its fine otherwise you have to make it null.
Now you are also having the duplicate entries in that BST. Now how will you handle it.
Next question was suppose the tree is not BST and also has duplicate entries what will
you do now to handle that rand pointer.
What is the time complexity and space complexity in every solution| Report Duplicate | Flag | PURGE
Citrix System Inc Software Engineer / Developer Algorithm