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 can think of a O(n^2) algorithm where N = number of words
- avinash.bhardwaj27 May 06, 20171. sort the list of words in increasing order of words length.
2. Take the first word and remove it from the list and add it to a new list representing a group.
3. start from the first word and search this substring in all the words bigger than this. If a substring match occurs then remove it from the list and add to the group list.
4. go back to step 2 and repeat with next word in the list.
5. When the last word of the list is scanned then return the groups of words created so far