GATE CSE
First time here? Checkout the FAQ!
x
+6 votes
161 views

Loading Question

asked in DS by Veteran (10.6k points)  
retagged ago by | 161 views
Nice question ..But time taking before arriving at a conclusion.
Yes. The only way i am knowing is by writing all permutations. I want to know if it can be solved by some logic.
In such questions as I said earlier you have to do what is mentioned in the question and solve accordingly.This was the confusion which I had earlier.Let me rectify

1 Answer

+7 votes
Best answer

This is a problem whose soltution lies in Catalan number.In this case for any permutation no of pushes >= no of pops for any prefix of permutaion 

So 5th Catalan no is given by :   2nC/ (n+1)

                                          =   10C5 / 6

                                          =   42

Hence the answer to this question should be 42.

Plz refer to the link :

http://math.stackexchange.com/questions/17769/using-one-stack-to-find-number-of-permutations

answered by Veteran (66.5k points)  
selected by
Answer is correct. But how do you conclude this formula.??

Try to do with 3  numbers . 

The number of permutation is equal to no. of post-order of binary search tree . since with 3 nodes number of binary search tree are 2nC/ (n+1) .

Of course the formula is correct. But this question is fill in the blank type. Ijust want to know how such conclusion can be obtained.
i already give you hint try with small number then you idea .
It is analogous to balanced parantheses problem with prefix property.Check for it u will get the idea .Only the difference is instead of opening and closing brackets , we are using push and pop here.
Thank you guys.
I dont know who has downvoted my comment and for what reason..It is better to give valid argument also if one is downvoting.

One does not become great by simply downvoting..If one want to show skill , then give legitimate comments ..I have no problem..

But don't do this silly thing..


Top Users Jun 2017
  1. Bikram

    3704 Points

  2. Hemant Parihar

    1502 Points

  3. junaid ahmad

    1432 Points

  4. Arnab Bhadra

    1416 Points

  5. Niraj Singh 2

    1391 Points

  6. Debashish Deka

    1246 Points

  7. Rupendra Choudhary

    1194 Points

  8. rahul sharma 5

    1158 Points

  9. Arjun

    956 Points

  10. srestha

    950 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 Jun 19 - 25
  1. Bikram

    1960 Points

  2. Niraj Singh 2

    1386 Points

  3. junaid ahmad

    502 Points

  4. Debashish Deka

    414 Points

  5. sudsho

    410 Points


23,373 questions
30,079 answers
67,406 comments
28,396 users