Re: [algogeeks] INTERVAL SATISFIABILITY PROBLEM

hmmm i fgured it out -Rohit On Thu, Feb 11, 2010 at 12:03 PM, Miroslav Balaz wrote: > EASY! > > > 2010/2/10 Rohit Saraf > >> There are n men. And you have been given say m information's like : >>m_i was born after m_j died >>m_i talked to m_j sometime >> >> You need to find the consist

Re: [algogeeks] INTERVAL SATISFIABILITY PROBLEM

EASY! 2010/2/10 Rohit Saraf > There are n men. And you have been given say m information's like : >m_i was born after m_j died >m_i talked to m_j sometime > > You need to find the consistency of the sets of information in O(n+m). > > > > -Rohit > > -- > You received this message because

[algogeeks] Re: Merge two BST in O(n) time with O(1)

Your algorithm is correct. But > 3. Remove the children from this place and store them as BST3 and BST4. This is not required , because trying to merge BST2 with BST1,which is equivalent to finding a place to insert a pointer to root of BST2 in BST1. Whenever you need a place for a new node, you

[algogeeks] INTERVAL SATISFIABILITY PROBLEM

There are n men. And you have been given say m information's like : m_i was born after m_j died m_i talked to m_j sometime You need to find the consistency of the sets of information in O(n+m). -Rohit -- You received this message because you are subscribed to the Google Groups "Algorit