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.
The best possible solution would be one that traverses the big string only once. This requires list of words to be indexed in a structure that can be transversed linearly, in parallel with the big string, in one pass, achieving a final complexity of O(n).
- arindamc October 09, 2016Trie data structure can be used to solve the problem.
1. First build the trie using the list of words.
2. Now go through the bigger string one by one word and see if it matches with the trie nodes
3.If any point no match is found, return false.
4. If we reach the end of string return true.