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.
It can be done in O(m+n), where n is length of a and m is length of b
- Brinder Pal Singh March 25, 2014Suppose a = string whose anagrams are to be found
and b = string to be searched
Algo:
1. search for first occurrence of first character of a in b. If not found return false.
2. Suppose that location is i.
3. Now anagram can be present from i-n-1 to i+n-1 position.
4. Take next character of a and search in range found in step 3.
5. If found repeat step 4 with next character of a until length of a Else repeat step 1 starting at i+n position.
6. If all characters found return true;