Problem Statement :
Implement FreqStack, a class which simulates the operation of a stack-like data structure.
FreqStack has two functions:
1. push(int x), which pushes an integer x onto the stack.
2. pop(), which removes and returns the most frequent element in the stack.
If there is a tie for most frequent element, the element closest to the top of the stack is removed and returned.
Solution :
The idea here is to maintain frequency Map and bucket of stacks.
Below is the working code( refer the comments in the code).
Thank you for visting the page, post your comments and suggestions.
Happy Coding !! :)
Implement FreqStack, a class which simulates the operation of a stack-like data structure.
FreqStack has two functions:
1. push(int x), which pushes an integer x onto the stack.
2. pop(), which removes and returns the most frequent element in the stack.
If there is a tie for most frequent element, the element closest to the top of the stack is removed and returned.
Solution :
The idea here is to maintain frequency Map and bucket of stacks.
Below is the working code( refer the comments in the code).
Thank you for visting the page, post your comments and suggestions.
Happy Coding !! :)
No comments:
Post a Comment