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.
Use a window sweeping algorithm.
- Anonymous March 10, 2014Count number of times each character appears in s.
Start two pointers (call them L and R) at the beginning of t. Move R to the right, maintain character counts of string from L to R. If count of some character exceed that of s, then increment L, till the count are all <= counts of s.
If counts become equal you have found a susbtring which is an anagram.
I will leave the details to you.