GeekInterview.com
Series: Subject: Topic:
Question: 9 of 246

Efficient Algorithm to print count and possible string combinations of a string by retaining order and length of charactersined

Problem: Given a input string as "0000" and following input scheme for the zeroes, print the possible combinations by retaining order of the characters. Input Scheme: A "0" B "00" C "000" D "0000" Example: "AAAA" is one string with length and order of characters retained
Asked by: taru22 | Member Since Apr-2012 | Asked on: Apr 17th, 2012

View all questions by taru22

This Question is not yet answered!

Related Answered Questions

Related Open Questions

User Panel

Register
Login
Lost Password
Get Activation Code

Categories

Data Modeling

Data Structures

OLAP

OOPS

UML

Interview Coaching

Do you find yourself busy most of the time? Why?

How do you deal and overcome major challenges?

How productive are you?

Has anyone asked you for help? What did you do?

How to handle academic gap while applying for a job?

How do you handle workplace problems?

How do you handle difficult situations?

Do you like working in a team or alone? Explain.

Describe a time when you had to work under pressure.

Have you experienced being given too many tasks?

Connect

twitter fb Linkedin GPlus RSS

Ads

Interview Question

 Ask Interview Question?

 

Latest Questions

Interview & Career Tips

Get invaluable Interview and Career Tips delivered directly to your inbox. Get your news alert set up today, Once you confirm your Email subscription, you will be able to download Job Inteview Questions Ebook . Please contact me if you there is any issue with the download.

Subscribe