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.
My understanding:
- fish266 February 26, 20151. The problem just ask if any such subseq exist, so do DP with N^2 as longest common subseq is overkilling for this problem.
2. My idea is simple, if any exist, then a subseq with length of 2 must exist. Thus we just need to check any char pair (a,b) and see if it appears more than once in the string, using linear scan. Worst case would be O(26*26*n), assuming only lower-case chars in the string. Although with large constant, it's still linear.