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 would go a different path
- nikolay.ivanchev March 21, 2016Define 3 sets, one for characters that aren't in the word N, one for characters that are in the word I and one of partial words P. In P we will put partial words and how many characters were matched
Take a word - if you get full match, put each character in M. If you get a match less then the number of characters of the word put it in P.
However if you get zero matches, take each character and put it in N. Then scan each word in P and remove each character that is in the word with zero matches. If by removing a character you get to a length of the previously matched ones, remove it from P and put the characters in M
Repeat until you get out of words or the elements of N and M are 26.
Now take all characters in M and start permutate them with length of M.length and increasing until we guess..
I would guess that duplicates won't play otherwise there is no way to properly code on a whiteboard a proper solution
It worth asking questions like are there duplicates like in paraLLeL which can significantly decrease the time to crack the final solution