#1009Hard#2 in Expedia Group's list· asked at 5 companies
Maximum Frequency Stack
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: ["FreqStack","push","push","push","push","push","push","pop","pop","pop","pop"] [[],[5],[7],[5],[7],[4],[5],[],[],[],[]] Output: [null,null,null,null,null,null,null,5,7,5,4]
Constraints
- •
0 <= val <= 10^9 - •
At most
2 * 10^4calls will be made topushandpop. - •
There is at least one element in the stack before calling
pop.