Hmm... It's been so long, since I blogged. There is more than a good reason for this prolonged absence. A couple of them are my interest shift from prose to poetry , no interesting topics for me to log a blog and so on...
In one of my previous blogs, I have posted some questions which I though would help people preparing for Campus Interviews! Now, in this blog I am posting such a question which will definitely not be asked in any of the interviews for it's complexity and uniqueness. Try to solve the puzzle or question or riddle or whatever you may want to call it.
HINT: Don't waste your time GOOGLing, as you most probably than not would not find a solution on web. Because, I created this question and I don't think the probability of you stumbling upon such a question as this, is more than 0.000001.
Here goes the question!
Suppose, there is a number made up of a series of ascending order numbers(with a maximum limit), find a way to retrieve the numbers hidden in the number ;). I am positive, you didn't understand a thing what I said! O.K. let me give an example! Suppose, there is a number such as 12123 and max limit is 30. Then the solution to the problem is: this number is made up of 1, 21 and 23 and not 1,2,12 and 3 or 12 and 123. I want an effective algorithm which takes pretty little time and can give at least one solution (in case more than one solution exists!)
Disclaimer:If, still, you didn't understand the question, you are not eligible to solve this. Because, I don't want big time DUMBO's breaking their heads to solve this.
One More HINT: You can use Computers or JAVA program or C program to solve this.
Happy Solving ;)
