I’m unable to understand the “Playing with cards(In Stack)” problem. Could you explain me using another example in simple words? Expecially the Q iterations and ith, Ai-1th iterations? Please explain me using Q > 1 iterations if possible.
Can't understand the problem statement
hello @Jajatee
in this question u are given a stack A0 , and a number q(number of iteration)
now using A0 u need to obtain A1 and B1 (procedure explained in problem)
now using A1 u need to obtain A2 and B2
now using A2 u need to obtain A3 and B3
now using A3 u need to obtain A4 and B4
…
…
…
now using Aq-1 u need to obtain Aq and Bq
at the end u need to print content of B1 ,B2,B3,…Bq , Aq
Do I have to use a dynamic array for creating A0, A1, A2, A3… B0, B1…BQ??
So do I need to create a dynamic array?
no , any type of array will work.
refer this for implementation ->
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.