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.
Resort to simple graph algorithm. We have a forest and need to find all unique trees.
Solution summary: Memoize "visited" nodes (ie non-zero numbers), these nodes have been added to a graph and need not be observed again. We will traverse the matrix, and upon discovering a non-zero entity, non-visited entity, perform a DFS on it. Because we visit each space exactly once, O(m*n) time, where m * n is size of the matrix. Print as we go along, enforcing only a single pass.
/////////////////////////////////////////////////////////////
CODE:
- Austin July 31, 2014