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.
This problem is ambiguous. I think you meant "substring" instead of "subsequence".
- Fallen April 21, 2014And this problem can be solved in linear time using window sliding technique. First remove characters from s1 those also appear on s3. So s1 is exploded into smaller strings. Now for any of these smaller strings, let's call it s4, keep track of the characters seen so far. For an example, if we need to find the shortest substring from string "abbbcba" that also contains "abc", when we find the second a, we don't need the first a any longer. So using a double ended queue we can solve it in O(N) time and O(N + 26) => O(N) space in worst case.