Implement Stack Using Queue | JavaScript Machine Coding | Frontend Interview

Published: 24 January 2024
on channel: Manish K. Dudeja
85
1

Hello Everyone,

In this video, we have discussed the problem generally asked in the JavaScript Coding/ Machine Coding round at the Frontend interview.

Problem Statement: Implement Stack Using Queue

Suppose you have a stack, which has only follow interface:
class Queue {
enqueue(element) { /* add element to queue, similar to Array.prototype.push */ }
peek() { /* get the head element*/ }
dequeue() { /* remove the head element, similar to Array.prototype.shift */ }
size() { /* count of elements */ }
}

Could you implement a Queue by using only the above Stack? A Queue must have the following interface
class Stack {
push(element) { /* add element to stack */ }
peek() { /* get the top element */ }
pop() { /* remove the top element */}
size() { /* count of elements */}
}

We have discussed the following problem areas:
1. Problem Statement
2. Approach the Solution
3. Solution Implement

Let's Connect:
Github: https://github.com/mkdudeja
Topmate: https://topmate.io/mkdudeja
Twitter:   / mkdudeja  
LinkedIn:   / mkdudeja  
Facebook:   / mkdudeja  
Instagram:   / mkdudeja  

Thanks,
Manish K. Dudeja

#javascript #reactjs #frontendinterview #interviewquestion


On this page of the site you can watch the video online Implement Stack Using Queue | JavaScript Machine Coding | Frontend Interview with a duration of hours minute second in good quality, which was uploaded by the user Manish K. Dudeja 24 January 2024, share the link with friends and acquaintances, this video has already been watched 85 times on youtube and it was liked by 1 viewers. Enjoy your viewing!