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.
Two-pointer solution: start with the whole string and count the frequency of the characters and how many distinct ones there are(call it cnt). If cnt < k, then impossible. If cnt > k you need to shorten the string. So start with i=0 and j=length(s). Increase i only if s[i] will make the count of that character zero. If not then decrease j.
- Cristian Plop February 07, 2017