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.
I think you can assume the dictionary is a trie of words. And your input string is "ABC". Search for characters A, B and C in the children of the root. Let's say you found B. Record this information that B has been found in another data structure. Now follow the branch with root as B. And look for A and C in it children. Let's say you found A. Record this information. Now try to find C in the children of A. If you find it, then you can print the anagram as "BAC". Then backtrack and look for other anagrams accordingly.
- Amy Lee September 27, 2014