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.
1.As each triplet is unique we should run the function till we get n!/6(n-3)! to get all possible triplets
- Kartik6402 December 14, 20142.As we receive we start building a directed graph with no node repeating, so after all the triplets are processed we have the entire directed graph to process.
3.From this we can understand the node with no inputs is the head and node with no outputs is the tail. to understand this we need to maintain the graph as an adjacency list for better performance.
4.The length of the string is also given. In case of "helloworld" the length is 10 so we start from "h" and process the graph using back tracking algorithms until we find "d" in the 10th place if we dont find d in the 10 th position we backtrack one step back and proceed with the other adjacent node.
5. Finally the word formed starting from h and ending with d in the 10th location is our word "helloworld".
This is the only possible solution i could come up with.