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.
As always the algo is not that important, the important part is finding the edge cases and unclear specifications.
- plushy June 09, 2014Gotchas
1)Some substrings may intersect, for example "ab" and "bcd". Given a source string "abcd" the solution is "a" however most of the code in the answers here above will give the solution "cd".
Clarifications:
1) Do we remove only the substings that are present in the original string or those modified too? Given the substring "ab" and source "aabb" do we end up with "ab" or ""?
2) Do we remove several strings at once if they intersect? For the example given above of "abcd" can we remove "abc" and "cd" at the same time?
So the implementation should be recursive and should explore each substring and each substring occurence.