Permutations without backtracking




Comment hidden because of low score. Click to expand.
0
of 0 vote

working java code here
solvekarlo.com/index.php?subj=2&page=28

- antipotato October 16, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
-1
of 1 vote

Do you need to store all the permutations, or just print them?

How much faster do you expect to get? For any solution to this problem, you're going through n! strings with n characters each at the minimum.

- eugene.yarovoi July 11, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

@eugene : Well I need to print them.Oh then you want to say that there is no such solution with time complexity less than what the backtracking problem gives.

- Sibendu Dey July 13, 2013 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 votes

Yes I'm searching for that iterative solution but unable to get so.

- Sibendu Dey July 13, 2013 | Flag




Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

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.

Learn More

Resume Review

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.

Learn More

Mock Interviews

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.

Learn More