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.
Algorithm:
- abhi June 24, 20151) Go through first list till the end node. Store this end node in the hash.
2) Now if any lists among remaining m-1 lists has same end node then that list is intersecting with this list. Otherwise keep on saving the end nodes only.
Time Complexity: O(nm)
Space Complexity: O(m) Since only last node on m lists is stored in hash.
We can further reduce the time complexity to O(m) if we keep track of last node in our linked list implementation.