stanimir
BAN USER
Comments (5)
Reputation 0
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
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.
then you are left w/ Hanoi tower algorithm that's:
- stanimir December 28, 2011a stack: if the stack is empty add the string,
if the current string length is less than the head of the stack push it. Otherwise pop the stack and concatenate w/ the current element. Repeat the operation w/ the next head of the stack.
If there are no more elements in the array pop the stack and consider it the current element (basically popping and concatenating till stack is empty).
When the stack has one element and no more elements in the source array of strings, it's done.
I suppose that was the question about, but it still sucks for concatenation.