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.
For a palindrome, it should have a pattern like this:
aa
aXa
where 'a' is a set of palindromic characters. e.g.
abba
abXba .. and so on.
An algo could be:
1. find a character that matches with another one. We can use a 'diff' that goes from 1 to length/2. If the characters at i-th and (i+diff)-th position matches, it's a potential palindrome.
2. if the diff==1, the characters are side by side, like 'ss', which is a palindrome anyway.
3. if the diff>1, check the characters from both sides, up to the middle of the substring. if it matches from both sides, it's a palindrome.
Something like this (elaborated with sysouts) ... can be tuned, though.
Output comes as
- partha.mishra February 08, 2015