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 agree with this one. Actually, there are several ways to solve this problem:
- nickyang07 January 17, 20151. Count each char in "S", and scan the dictionary, for each word, compare the count.
However, when the size of the dictionary is big, there will be lots of repeated count. Eg. In the dict., we have "cat", "cats"
2. It is good to build a trie, but not easy to solve in the interview.
3. The problem statement clearly states "S" only has 4 char, which means the permutation is not expensive at all. After that, all you need to do is just to build a hashmap for all permutation, and scan the dict.