Consider a shuffle game. There are 3 glasses numbered from 1 to 3 and one ball is hidden under any one of the glass. Then any 2 of the glasses are shuffled. This operation is made 3 times.
Given an integer N ranged [1, 3] and 3 pairs of integers of the same range. The N-th glass contain the ball initially and every pair of the given integers represents the indices of the glasses needs to be shuffled. Remember the glasses are renumbered after each shuffle.
The task is to find out the index of the glass which contains the ball after all the shuffle operation.
N = 3
Firstly the 3rd glass contain the ball.
After the first shuffle operation (3, 1), 1st glass contain the ball.
After the second shuffle operation (2, 1), 2nd glass contain the ball.
After the third shuffle operation (1, 2), 1st glass contain the ball.
N = 1
Approach: The simplest approach will be to run a loop for every shuffle operation.
If any of the 2 glasses being shuffled contain the ball then it is obvious to change the value of N to the index of the glass being shuffled with.
If any of the 2 shuffling glasses doesn’t contain the ball, then nothing needs to be done.
Below is the implementation of the above code:
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- RGYB(color) Slots Game to guess the correct color for the correct slot
- Find the position of box which occupies the given ball
- In how many ways the ball will come back to the first boy after N turns
- Count of distinct numbers formed by shuffling the digits of a large number N
- Maximum sum of values in a given range of an Array for Q queries when shuffling is allowed
- Count of elements which are not at the correct position
- Find total no of collisions taking place between the balls in which initial direction of each ball is given
- Puzzle | Weight of Heavy Ball
- Ways to choose balls such that at least one ball is chosen
- Range Queries for Longest Correct Bracket Subsequence Set | 2
- Find out the minimum number of coins required to pay total amount
- Find out the prime numbers in the form of A+nB or B+nA
- Position of an element after stable sort
- Check if it is possible to return to the starting position after moving in the given directions
- Position after taking N steps to the right and left in an alternate manner
- Insert N elements in a Linked List one after other at middle position
- Find array sum using Bitwise OR after splitting given array in two halves after K circular shifts
- Possibility of moving out of maze
- Maximum given sized rectangles that can be cut out of a sheet of paper
- Check if there exists a number with X factors out of which exactly K are prime
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.