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.
I think this problem will require DP
- nayak.aditya.2010 April 23, 2014for input sorted on length assume we get 1,3 1,7 2,4 2,8 2,7 3,10 3,8
and on sorting the breadth we get 1,3 2,4 1,7 2,7 2,8 3,8 3,10
we will get two increasing series starting from 0th index to 6th excluding 3rd element and one from 3rd to 6th so we need to maintain them in an array using dp to get the longest increasing subsequence