You are on page 1of 1

QUEUE

Find Duplicates:

Searching in queue:

Find kth term: (allll possible scenario):

Largest and smallest:

Middle term:

Range: (printing the numbers present between two numbers)

Reserve:

Count: (the duplicates, number of prime numbers)

Replace two queues with each other:

Suppose there are two queues and one counter for depositing the money in a bank and the person
sitting in the counter wants to handle the customers one by one from each queue such as first person of
queue 1 then queue 2 then again come back to queue 1:

You might also like