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.
Here's my Python 3.5 solution using a two-dimensional dict (hash table):
Time complexity: O(n log n) since collect_columns is called once per node (total n times), and merge_columns takes at most O(log n) time (iterates once per tree column at most).
- takepwn February 27, 2016Space complexity: O(n) since at most one new hash table is created per node (if each node has its own column), and nodes are stored only once.