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.
*Edit* sorry for double post, wasn't logged in...
Should work in O(k * n)...
Basic idea is you go through all Strings and create the possible palindromes.
This is done by reversing the String and checking if substrings of this reversal build a palindrome
with the original String.
(abcb) -> Possible Endings: bcba, cba, a
Furthermore when adding new candidates we cut off parts from the front and check if the rest
is in our palindrome candidates. If the center part is also a palindrome, we have a full palindrome.
(abc) -> Possible Endings: cba
(abc) (dad | cba)
- snegele May 24, 2015