Frequency Stack - Amazon Top Interview Questions


Problem Statement :


Implement a frequency stack with the following methods:

FrequencyStack() constructs a new instance of a frequency stack
append(int val) appends val to the stack
pop() pops and returns the most frequent element in the stack. If there's more than one most frequent element, the one that's closer to the top of the stack should be popped first.
You can assume that for pop, the stack is non-empty when they are called.

Constraints

n ≤ 100,000 where n is the number of methods that will be called to append and pop

Example 1

Input

methods = ["constructor", "append", "append", "append", "pop", "pop", "pop"]

arguments = [[], [1], [1], [2], [], [], []]`

Output

[None, None, None, None, 1, 2, 1]


Solution :



title-img 




                        Solution in C++ :

class FrequencyStack {
    public:
    vector<stack<int>> frequencyToElement;
    unordered_map<int, int> freq;
    FrequencyStack() {
        frequencyToElement.resize(1);
    }

    void append(int val) {
        freq[val]++;
        if (freq[val] >= frequencyToElement.size()) frequencyToElement.push_back({});
        frequencyToElement[freq[val]].push(val);
    }

    int pop() {
        int frequency = frequencyToElement.size() - 1;
        int val = frequencyToElement[frequency].top();
        frequencyToElement[frequency].pop();
        if (frequencyToElement[frequency].size() == 0) frequencyToElement.pop_back();
        freq[val]--;
        return val;
    }
};
                    


                        Solution in Java :

import java.util.*;

class FrequencyStack {
    int i;
    PriorityQueue<Item> pq;
    HashMap<Integer, Integer> sz;
    public FrequencyStack() {
        pq = new PriorityQueue<Item>();
        sz = new HashMap<Integer, Integer>();
        i = 0;
    }

    public void append(int val) {
        int s = 1 + sz.getOrDefault(val, 0);
        pq.add(new Item(val, s, i));
        i++;
        sz.put(val, s);
    }

    public int pop() {
        while (!pq.isEmpty()) {
            Item n = pq.poll();
            int realS = sz.get(n.val);
            if (n.s == realS) {
                sz.put(n.val, realS - 1);
                return n.val;
            }
        }
        return -1;
    }

    static class Item implements Comparable<Item> {
        int val;
        int s;
        long comp;
        public Item(int val, int s, int ind) {
            this.val = val;
            this.s = s;
            comp = 100000L * s + ind;
        }

        public int compareTo(Item i) {
            if (comp > i.comp)
                return -1;
            else if (comp < i.comp)
                return 1;
            else
                return 0;
        }
    }
}
                    


                        Solution in Python : 
                            
class FrequencyStack:
    def __init__(self):
        self.frequencies = defaultdict(int)
        self.heap = []
        self.index = 0

    def append(self, val: int) -> int:
        self.frequencies[val] += 1
        self.index += 1
        heappush(self.heap, (-self.frequencies[val], -self.index, val))

    def pop(self) -> int:
        val = heappop(self.heap)[2]
        self.frequencies[val] -= 1
        return val


View More Similar Problems

Tree: Postorder Traversal

Complete the postorder function in the editor below. It received 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's postorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the postorder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the

View Solution →

Tree: Inorder Traversal

In this challenge, you are required to implement inorder traversal of a tree. Complete the inorder function in your editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's inorder traversal as a single line of space-separated values. Input Format Our hidden tester code passes the root node of a binary tree to your $inOrder* func

View Solution →

Tree: Height of a Binary Tree

The height of a binary tree is the number of edges between the tree's root and its furthest leaf. For example, the following binary tree is of height : image Function Description Complete the getHeight or height function in the editor. It must return the height of a binary tree as an integer. getHeight or height has the following parameter(s): root: a reference to the root of a binary

View Solution →

Tree : Top View

Given a pointer to the root of a binary tree, print the top view of the binary tree. The tree as seen from the top the nodes, is called the top view of the tree. For example : 1 \ 2 \ 5 / \ 3 6 \ 4 Top View : 1 -> 2 -> 5 -> 6 Complete the function topView and print the resulting values on a single line separated by space.

View Solution →

Tree: Level Order Traversal

Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function levelOrder and print the values in a single line separated by a space. For example: 1 \ 2 \ 5 / \ 3 6 \ 4 F

View Solution →

Binary Search Tree : Insertion

You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function. Input Format You are given a function, Node * insert (Node * root ,int data) { } Constraints No. of nodes in the tree <

View Solution →