📌 1. Core Java Stack and Queue Classes

✅ Stack

java
CopyEdit
Stack<Integer> stack = new Stack<>();
stack.push(1);         // insert
int val = stack.pop(); // remove and return top
int peek = stack.peek(); // view top
boolean empty = stack.isEmpty();

Stack is LIFO (Last In First Out)

✅ Queue (via LinkedList)

java
CopyEdit
Queue<Integer> queue = new LinkedList<>();
queue.offer(1);        // insert
int val = queue.poll(); // remove and return front
int peek = queue.peek(); // view front
boolean empty = queue.isEmpty();

Queue is FIFO (First In First Out)


🧱 2. Boilerplate Templates

🔁 Iterate over a Stack

java
CopyEdit
for (int val : stack) {
    // use val
}

🔁 Iterate over a Queue

java
CopyEdit
while (!queue.isEmpty()) {
    int current = queue.poll();
}


🧩 3. Stack Patterns

✅ Valid Parentheses / Balanced Brackets

java
CopyEdit
Stack<Character> stack = new Stack<>();
for (char c : s.toCharArray()) {
    if (c == '(' || c == '{' || c == '[') {
        stack.push(c);
    } else {
        if (stack.isEmpty()) return false;
        char top = stack.pop();
        if (!isMatching(top, c)) return false;
    }
}
return stack.isEmpty();

✅ Monotonic Stack

Used in: Next Greater Element, Largest Rectangle in Histogram