Skip to main content

Blood Relation

There are N persons in a country. N is very big in millions.
Design a efficient data structure and algorithm to find out whether there is blood relations between given two person or say they have a common ancestor .


My solution:
Used a map //UID by Nandan Nilekani :)
struct person
{
struct person *father;
struct person *mother;
list child; //However may not be needed for this problem
string name ...i.e. //Add more
}

struct person * findAncestor ( struct person *a, struct person *b)
{
Take first node in stack.
While ( stack is not null )
{
Mark Node.
Push Its ancestor in stack;
}

Take second node in stack.
while ( stack is not null )
{
If marked return Node,
push ancestor in stack.
}
return NULL;
}

It has a drawback, i need to clear the flagged node before i apply the search algorithm again.
But till now the best i know.
Labels:

Comments

Post a Comment

Popular posts from this blog

Car Parking Problem

There is n parking slots and n-1 car already parked. Lets say car parked with initial arrangement and we want to make the car to be parked to some other arrangement. Lets say n = 5, inital = free, 3, 4, 1, 2 desired = 1, free, 2, 4 ,3 Give an algorithm with minimum steps needed to get desired arrangement. Told by one of my friend and after a lot of search i really got a nice solution. I will post solution in comment part
3 comments
Read more

DEShaw Interview Questions

ther are N numbers frm 1 to N and starting from index 1 we will keep deleting every alternate going in cyclic order with array. Only one element will be left at the end. Tell us the index of element in array we started. e.g. there are 5 nums 1 2 3 4 5 then after 1st iteration 1 3 5 will be remained. .. then 1 will be next to be elliminated and then 5 3 will remain alone... give sum efficient algorithm to calculate which numer will remain at the end Answer: 2*(n-2^p)+1 where p=floor(log2 n)
Post a Comment
Read more

One way : Heap or Stack allocation

Took my time to find solution for this and it actually made me realize how much i have to learn. Now question is how can we enforce the creation of objects whether on heap or stack. Creating object on Heap only. Make your destructor private and create a destroy function. Class A {  ~A(){} public:  A(){} void destroy() { delete this; } } Now if you can not create your object: A a; // error: 'A::~A()' is private A  a = new A(); Great. Now all the objects will be allocated to heap only. Making destructor private a better choice than constructor as we don't know number of constructor so early in programming. Creating object on stack While i knew that it has to do something with operator new, but could not figure out how can i create object on stack and return the memory back to class initialization. Though answer was simple, i had to google for that: Overload operator new, new[], operator delete and delete[] and make them private ;) class A { pr...
Post a Comment
Read more