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 that works in O(n^2) time and takes O(n^2) space. Please let me know if something is wrong.
- dd January 09, 20171. Make a hashmap that maps string to a set of points.
2. Loop n^2 pairs of points.
a. Get the line equation y = mx + c, which is constructed with 2 points.
b. Add "m, c" as key and the points as values into the hashmap.
2. Count the max number of points found across different "m, c" s.