Redirecting to
NADOS

Stack To Queue Adapter - Add Efficient

  Prev   Next

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

1. You are required to complete the code of our StackToQueueAdapter class. The class should mimic the behaviour of a Queue and implement FIFO semantic.
2. Here is the list of functions that are written in the class 
    2.1. add -> Accepts new data if there is space available in the underlying array or 
    print "Queue overflow" otherwise.
    2.2. remove -> Removes and returns value according to FIFO, if available or print 
    "Queue underflow" otherwise and return -1.
    2.3. peek -> Returns value according to FIFO, if available or print "Queue 
    underflow" otherwise and return -1.
    2.4. size -> Returns the number of elements available in the queue.
3. Input and Output is managed for you.
Input Format 
Input is managed for you
Output Format 
Output is managed for you
Question Video
Constraints 
Note -> add and size should work in constant time. remove and peek should work in linear time.
Sample Input 
add 10
add 20
add 30
add 40
add 50
remove
remove
add 60
add 70
peek
remove
peek
remove
peek
remove
peek
remove
peek
remove
peek
remove
quit
Sample Output 
10
20
30
30
40
40
50
50
60
60
70
70
Queue underflow
Queue underflow


  • Asked in Companies
  • Related Topics






Video Solution

Code Solution

Run
 
Run
Id Name