Solve problems that are commonly asked in Java coding interviews related to common data structures.

Ace the Java Coding Interview

Data structures are among the fundamentals of computer science and are often a core decision in developing efficient programs. They are categorized as a vital benchmark of computer science knowledge when it comes to industry interviews. This module contains a detailed review of common data structures in Java. We'll also become well-equipped with different data structures by implementing them.
By the end of this module, we'll have expertise in solving problems in data structures.

Data Structures

# Statement

Design a stack data structure to retrieve the minimum value in $O(1)$ time. The following functions must be implemented:

- `min()`: Returns the minimum value in the stack in constant time.
- `push(int value)`: Pushes a value onto the stack.
- `pop()`: Removes and returns a value from the top of the stack.

All functions should be implemented with a time complexity of $O(1)$.

**Constraints:**


* $-10^5 \leq$ `value` $\leq 10^5$


# Examples


Challenge 10: Create Stack where min() gives minimum in O(1)

Statement