We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
classSolution{constructor(){this.stack=[];this.queue=[];}pushCharacter(char){//store original array herethis.stack.push(char);}enqueueCharacter(char){//store reverse array herethis.queue.unshift(char);}popCharacter(){//return first character from stackreturnthis.stack.pop();}dequeueCharacter(){//return first character from queuereturnthis.queue.pop();}}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
An unexpected error occurred. Please try reloading the page. If problem persists, please contact support@hackerrank.com
Day 18: Queues and Stacks
You are viewing a single comment's thread. Return to all comments →
Javascript