Interview Question Software Developers
Country: India
is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.
Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.
Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.
Got the solution. We can check for all the nodes whether there is cycle with that node. Consider the edges to be reversed, the problem turns out to be finding the root node for a node. Now, we need to calculate the start_time and end_time for all the nodes and we need to store the start_time, end_time, root_node for different components within a array. Now, given a node, we know the start_time, end_time for the node. We can do a binary search over that array to figure out the best fitting component(by taking max_value for a node for which start_time<=start_time for the given node) , which in turn gives us the root_node.
- lifeenergy999 June 19, 2016