akshaycmpn
BAN USERvery nice, but i screwed up since i was trying to think from top to bottom , as in
fib(n-1)+fib(n-2) approach :( and there was time constraint to write program
DFS is the correct and optimal answer.
Initialise all nodes with white color
Visit a node color it grey, continue with its connected nodes
while doing so if u find the visiting node grey then the its cyclic
1.find X
2.make it the starting point of search
3.Find Y using recurrsion from X.
4.once found pass the handle(java) and Z to next function
5.find Z considering Y as a root
6.if found yupppy :)
sorting wont be feasible since sorting for every entry will impact huge file io cost
- akshaycmpn January 17, 2011use hashtable.. while traversing the file once 100ram buffer by buffer
- akshaycmpn January 17, 2011i am never going to apply here... epic only like to take interview ,but not hire ppl :(
- akshaycmpn January 17, 2011inheritance is more useful over interface when it comes to reusability , isn't it?
- akshaycmpn January 16, 2011
I think everyone is talking about one company in this thread.
- akshaycmpn January 03, 2012I don't want to talk about my abilities in this thread. I have aced many job interviews and I have a job. I feel satisfied when I prove to myself and I feel good when I am challenged in ethical way.
All have there own capability . No one will get upset by reading my stuff.
When students give interview in Microsoft or Google ppl feel good about it ,no matter how well or pore they do. Ppl who are determined to succeed don't give up by reading what others say.
As I said this is my last talk, I cannot go further on this.
All the best for job hunters :)