Add stack-queue module: ten stack and queue interview problems, monotonic stack, min stack, queue from stacks and stack from a queue, brute-force cross-checks, dry-run traces, operation counts, pitfalls (11 tests)

Co-Authored-By: Claude Sonnet 5.5 <[email protected]> Claude-Session: https://claude.ai/code/session_017ic4b6nxynun5JFivebVb1
2026-11-12 22:35:43 +05:30
parent c5c435ae20
commit b9aeb78b24
36 changed files with 2164 additions and 0 deletions
@@ -0,0 +1,13 @@
+All ten problems on their headline examples
+===========================================
+
+ 1. isBalanced("{[()]}") = true; isBalanced("([)]") = false
+ 2. evaluate([2, 1, +, 3, *]) = 9; 7 / -3 truncates toward zero: -2
+ 3. push -2, 0, -3: getMin = -3; pop; top = 0, getMin = -2  (both implementations agree)
+ 4. nextGreater([1, 3, 4, 2]) = [3, 4, -1, -1]
+ 5. dailyTemperatures([73, 74, 75, 71, 69, 72, 76, 73]) = [1, 1, 4, 2, 1, 1, 0, 0]
+ 6. nextGreaterCircular([1, 2, 3, 4, 3]) = [2, 3, 4, -1, 4]
+ 7. largestRectangle([2, 1, 5, 6, 2, 3]) = 10
+ 8. decode("3[a2[bc]]") = "abcbcabcbcabcbc"; decode("2[abc]3[cd]ef") = "abcabccdcdcdef"
+ 9. enqueue a, b, c; dequeue = a; enqueue d; dequeue = b; peek = c; size = 2
+10. push a, b, c; top = c; pop = c; pop = b; size = 1