* * Problem: * Design a class that simulates a Stack data structure, implementing the following two * operations: * * push(int num): Pushes the number num on the stack. * * pop(): Returns the most frequent number in the stack. If there is a tie, return the * number which was pushed later. *
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected