Playing with Cards(in stack)

[Bansaljatin05 (Jatin Bansal)]

please explain the sample test case

[jaiskid (Neeraj jaiswal)]

@Bansaljatin05 hey jatin go to this discuss

Playing cards problem statement

@ankit152 Hey ankit Consider the input is : 5 1 3 4 7 6 5 In this input Q is 1 so ther is only 1 iteration. Now there are three stacks intially: A0 - [3, 4,7, 6, 5] A1 - [] B1 - [] In first iteration we will look in stack A(iteration - 1) i.e. A0 and check whether the number is divisible by iteration th prime number i.e. 1st prime number i.e. 2 and if it is divisible then we add it in B(iteration) i.e. B1 stack else A(iteration) i.e. A1 stack. SO after first iteration the three stacks wi…