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.
One good trick here is to mark already clustered cells with clusterId >=2.
With this approach one can iterate through the matrix and "visit" cells with 1 only (not visited yet). Visit method will mark visited node with clusterId and recursively visit all direct neighbours with value=1 to construct the whole cluster. Number of clusters is clusterId - 2.
The code is in Scala but in imperative 'Java like' way
Time complexity of this solution is O(n) because we visit each node at most once.
- tomasz.lasica December 22, 2014