Datasets:
| {"problem_number": 1, "title": "Two Sum", "slug": "two-sum", "difficulty": "Easy", "topic_tags": ["Array", "Hash Table"], "solution_archetype": "hash-map", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/two-sum/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/hash-map"} | |
| {"problem_number": 2, "title": "Add Two Numbers", "slug": "add-two-numbers", "difficulty": "Medium", "topic_tags": ["Recursion", "Linked List", "Math"], "solution_archetype": "math", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/add-two-numbers/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/math"} | |
| {"problem_number": 3, "title": "Longest Substring Without Repeating Characters", "slug": "longest-substring-without-repeating-characters", "difficulty": "Medium", "topic_tags": ["Hash Table", "String", "Sliding Window"], "solution_archetype": "hash-map", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/longest-substring-without-repeating-characters/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/hash-map"} | |
| {"problem_number": 4, "title": "Median of Two Sorted Arrays", "slug": "median-of-two-sorted-arrays", "difficulty": "Hard", "topic_tags": ["Array", "Binary Search", "Divide and Conquer"], "solution_archetype": "monotonic-stack", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/median-of-two-sorted-arrays/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/monotonic-stack"} | |
| {"problem_number": 5, "title": "Longest Palindromic Substring", "slug": "longest-palindromic-substring", "difficulty": "Medium", "topic_tags": ["Two Pointers", "String", "Dynamic Programming"], "solution_archetype": "two-pointers", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/longest-palindromic-substring/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/two-pointers"} | |
| {"problem_number": 6, "title": "Zigzag Conversion", "slug": "zigzag-conversion", "difficulty": "Medium", "topic_tags": ["String"], "solution_archetype": "counting", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/zigzag-conversion/", "pattern_reference": null} | |
| {"problem_number": 7, "title": "Reverse Integer", "slug": "reverse-integer", "difficulty": "Medium", "topic_tags": ["Math"], "solution_archetype": "math", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/reverse-integer/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/math"} | |
| {"problem_number": 8, "title": "String to Integer (atoi)", "slug": "string-to-integer-atoi", "difficulty": "Medium", "topic_tags": ["String"], "solution_archetype": "counting", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/string-to-integer-atoi/", "pattern_reference": null} | |
| {"problem_number": 9, "title": "Palindrome Number", "slug": "palindrome-number", "difficulty": "Easy", "topic_tags": ["Math"], "solution_archetype": "math", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/palindrome-number/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/math"} | |
| {"problem_number": 10, "title": "Regular Expression Matching", "slug": "regular-expression-matching", "difficulty": "Hard", "topic_tags": ["Recursion", "String", "Dynamic Programming"], "solution_archetype": "dynamic-programming", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/regular-expression-matching/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/dynamic-programming"} | |
| {"problem_number": 11, "title": "Container With Most Water", "slug": "container-with-most-water", "difficulty": "Medium", "topic_tags": ["Greedy", "Array", "Two Pointers"], "solution_archetype": "greedy", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/container-with-most-water/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/greedy"} | |
| {"problem_number": 12, "title": "Integer to Roman", "slug": "integer-to-roman", "difficulty": "Medium", "topic_tags": ["Hash Table", "Math", "String"], "solution_archetype": "hash-map", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/integer-to-roman/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/hash-map"} | |
| {"problem_number": 13, "title": "Roman to Integer", "slug": "roman-to-integer", "difficulty": "Easy", "topic_tags": ["Hash Table", "Math", "String"], "solution_archetype": "hash-map", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/roman-to-integer/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/hash-map"} | |
| {"problem_number": 14, "title": "Longest Common Prefix", "slug": "longest-common-prefix", "difficulty": "Easy", "topic_tags": ["Trie", "Array", "String"], "solution_archetype": "trie", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/longest-common-prefix/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/trie"} | |
| {"problem_number": 15, "title": "3Sum", "slug": "3sum", "difficulty": "Medium", "topic_tags": ["Array", "Two Pointers", "Sorting"], "solution_archetype": "two-pointers", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/3sum/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/two-pointers"} | |
| {"problem_number": 16, "title": "3Sum Closest", "slug": "3sum-closest", "difficulty": "Medium", "topic_tags": ["Array", "Two Pointers", "Sorting"], "solution_archetype": "two-pointers", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/3sum-closest/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/two-pointers"} | |
| {"problem_number": 18, "title": "4Sum", "slug": "4sum", "difficulty": "Medium", "topic_tags": ["Array", "Two Pointers", "Sorting"], "solution_archetype": "two-pointers", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/4sum/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/two-pointers"} | |
| {"problem_number": 19, "title": "Remove Nth Node From End of List", "slug": "remove-nth-node-from-end-of-list", "difficulty": "Medium", "topic_tags": ["Linked List", "Two Pointers"], "solution_archetype": "linked-list", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/remove-nth-node-from-end-of-list/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/linked-list"} | |
| {"problem_number": 20, "title": "Valid Parentheses", "slug": "valid-parentheses", "difficulty": "Easy", "topic_tags": ["Stack", "String"], "solution_archetype": "stack", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/valid-parentheses/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/stack"} | |
| {"problem_number": 21, "title": "Merge Two Sorted Lists", "slug": "merge-two-sorted-lists", "difficulty": "Easy", "topic_tags": ["Recursion", "Linked List"], "solution_archetype": "linked-list", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/merge-two-sorted-lists/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/linked-list"} | |
| {"problem_number": 22, "title": "Generate Parentheses", "slug": "generate-parentheses", "difficulty": "Medium", "topic_tags": ["String", "Dynamic Programming", "Backtracking"], "solution_archetype": "dynamic-programming", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/generate-parentheses/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/dynamic-programming"} | |
| {"problem_number": 23, "title": "Merge k Sorted Lists", "slug": "merge-k-sorted-lists", "difficulty": "Hard", "topic_tags": ["Linked List", "Divide and Conquer", "Heap (Priority Queue)", "Merge Sort"], "solution_archetype": "heap", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/merge-k-sorted-lists/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/heap"} | |
| {"problem_number": 24, "title": "Swap Nodes in Pairs", "slug": "swap-nodes-in-pairs", "difficulty": "Medium", "topic_tags": ["Recursion", "Linked List"], "solution_archetype": "linked-list", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/swap-nodes-in-pairs/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/linked-list"} | |
| {"problem_number": 29, "title": "Divide Two Integers", "slug": "divide-two-integers", "difficulty": "Medium", "topic_tags": ["Bit Manipulation", "Math"], "solution_archetype": "bitmask", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/divide-two-integers/", "pattern_reference": null} | |
| {"problem_number": 32, "title": "Longest Valid Parentheses", "slug": "longest-valid-parentheses", "difficulty": "Hard", "topic_tags": ["Stack", "String", "Dynamic Programming"], "solution_archetype": "dynamic-programming", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/longest-valid-parentheses/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/dynamic-programming"} | |
| {"problem_number": 33, "title": "Search in Rotated Sorted Array", "slug": "search-in-rotated-sorted-array", "difficulty": "Medium", "topic_tags": ["Array", "Binary Search"], "solution_archetype": "monotonic-stack", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/search-in-rotated-sorted-array/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/monotonic-stack"} | |
| {"problem_number": 34, "title": "Find First and Last Position of Element in Sorted Array", "slug": "find-first-and-last-position-of-element-in-sorted-array", "difficulty": "Medium", "topic_tags": ["Array", "Binary Search"], "solution_archetype": "monotonic-stack", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/monotonic-stack"} | |
| {"problem_number": 35, "title": "Search Insert Position", "slug": "search-insert-position", "difficulty": "Easy", "topic_tags": ["Array", "Binary Search"], "solution_archetype": "monotonic-stack", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/search-insert-position/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/monotonic-stack"} | |
| {"problem_number": 38, "title": "Count and Say", "slug": "count-and-say", "difficulty": "Medium", "topic_tags": ["String"], "solution_archetype": "counting", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/count-and-say/", "pattern_reference": null} | |
| {"problem_number": 39, "title": "Combination Sum", "slug": "combination-sum", "difficulty": "Medium", "topic_tags": ["Array", "Backtracking"], "solution_archetype": "backtracking", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/combination-sum/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/backtracking"} | |
| {"problem_number": 40, "title": "Combination Sum II", "slug": "combination-sum-ii", "difficulty": "Medium", "topic_tags": ["Array", "Backtracking"], "solution_archetype": "backtracking", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/combination-sum-ii/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/backtracking"} | |
| {"problem_number": 42, "title": "Trapping Rain Water", "slug": "trapping-rain-water", "difficulty": "Hard", "topic_tags": ["Stack", "Array", "Two Pointers", "Dynamic Programming", "Monotonic Stack"], "solution_archetype": "stack", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/trapping-rain-water/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/stack"} | |
| {"problem_number": 43, "title": "Multiply Strings", "slug": "multiply-strings", "difficulty": "Medium", "topic_tags": ["Math", "String", "Simulation"], "solution_archetype": "math", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/multiply-strings/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/math"} | |
| {"problem_number": 44, "title": "Wildcard Matching", "slug": "wildcard-matching", "difficulty": "Hard", "topic_tags": ["Greedy", "Recursion", "String", "Dynamic Programming"], "solution_archetype": "dynamic-programming", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/wildcard-matching/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/dynamic-programming"} | |
| {"problem_number": 46, "title": "Permutations", "slug": "permutations", "difficulty": "Medium", "topic_tags": ["Array", "Backtracking"], "solution_archetype": "backtracking", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/permutations/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/backtracking"} | |
| {"problem_number": 54, "title": "Spiral Matrix", "slug": "spiral-matrix", "difficulty": "Medium", "topic_tags": ["Array", "Matrix", "Simulation"], "solution_archetype": "grid", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/spiral-matrix/", "pattern_reference": null} | |
| {"problem_number": 56, "title": "Merge Intervals", "slug": "merge-intervals", "difficulty": "Medium", "topic_tags": ["Array", "Sorting"], "solution_archetype": "linear-scan", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/merge-intervals/", "pattern_reference": null} | |
| {"problem_number": 57, "title": "Insert Interval", "slug": "insert-interval", "difficulty": "Medium", "topic_tags": ["Array"], "solution_archetype": "bespoke", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/insert-interval/", "pattern_reference": null} | |
| {"problem_number": 58, "title": "Length of Last Word", "slug": "length-of-last-word", "difficulty": "Easy", "topic_tags": ["String"], "solution_archetype": "counting", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/length-of-last-word/", "pattern_reference": null} | |
| {"problem_number": 59, "title": "Spiral Matrix II", "slug": "spiral-matrix-ii", "difficulty": "Medium", "topic_tags": ["Array", "Matrix", "Simulation"], "solution_archetype": "grid", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/spiral-matrix-ii/", "pattern_reference": null} | |
| {"problem_number": 67, "title": "Add Binary", "slug": "add-binary", "difficulty": "Easy", "topic_tags": ["Bit Manipulation", "Math", "String", "Simulation"], "solution_archetype": "bitmask", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/add-binary/", "pattern_reference": null} | |
| {"problem_number": 71, "title": "Simplify Path", "slug": "simplify-path", "difficulty": "Medium", "topic_tags": ["Stack", "String"], "solution_archetype": "stack", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/simplify-path/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/stack"} | |
| {"problem_number": 94, "title": "Binary Tree Inorder Traversal", "slug": "binary-tree-inorder-traversal", "difficulty": "Easy", "topic_tags": ["Stack", "Tree", "Depth-First Search", "Binary Tree"], "solution_archetype": "stack", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/binary-tree-inorder-traversal/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/stack"} | |
| {"problem_number": 98, "title": "Validate Binary Search Tree", "slug": "validate-binary-search-tree", "difficulty": "Medium", "topic_tags": ["Tree", "Depth-First Search", "Binary Search Tree", "Binary Tree"], "solution_archetype": "dfs", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/validate-binary-search-tree/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/dfs"} | |
| {"problem_number": 99, "title": "Recover Binary Search Tree", "slug": "recover-binary-search-tree", "difficulty": "Medium", "topic_tags": ["Tree", "Depth-First Search", "Binary Search Tree", "Binary Tree"], "solution_archetype": "dfs", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/recover-binary-search-tree/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/dfs"} | |
| {"problem_number": 100, "title": "Same Tree", "slug": "same-tree", "difficulty": "Easy", "topic_tags": ["Tree", "Depth-First Search", "Breadth-First Search", "Binary Tree"], "solution_archetype": "dfs", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/same-tree/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/dfs"} | |
| {"problem_number": 101, "title": "Symmetric Tree", "slug": "symmetric-tree", "difficulty": "Easy", "topic_tags": ["Tree", "Depth-First Search", "Breadth-First Search", "Binary Tree"], "solution_archetype": "dfs", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/symmetric-tree/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/dfs"} | |
| {"problem_number": 102, "title": "Binary Tree Level Order Traversal", "slug": "binary-tree-level-order-traversal", "difficulty": "Medium", "topic_tags": ["Tree", "Breadth-First Search", "Binary Tree"], "solution_archetype": "bfs", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/binary-tree-level-order-traversal/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/bfs"} | |
| {"problem_number": 103, "title": "Binary Tree Zigzag Level Order Traversal", "slug": "binary-tree-zigzag-level-order-traversal", "difficulty": "Medium", "topic_tags": ["Tree", "Breadth-First Search", "Binary Tree"], "solution_archetype": "bfs", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/bfs"} | |
| {"problem_number": 107, "title": "Binary Tree Level Order Traversal II", "slug": "binary-tree-level-order-traversal-ii", "difficulty": "Medium", "topic_tags": ["Tree", "Breadth-First Search", "Binary Tree"], "solution_archetype": "bfs", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/binary-tree-level-order-traversal-ii/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/bfs"} | |
| {"problem_number": 108, "title": "Convert Sorted Array to Binary Search Tree", "slug": "convert-sorted-array-to-binary-search-tree", "difficulty": "Easy", "topic_tags": ["Tree", "Binary Search Tree", "Array", "Divide and Conquer", "Binary Tree"], "solution_archetype": "tree-recursion", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/", "pattern_reference": null} | |
| {"problem_number": 109, "title": "Convert Sorted List to Binary Search Tree", "slug": "convert-sorted-list-to-binary-search-tree", "difficulty": "Medium", "topic_tags": ["Tree", "Binary Search Tree", "Linked List", "Divide and Conquer", "Binary Tree"], "solution_archetype": "tree-recursion", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/", "pattern_reference": null} | |
| {"problem_number": 134, "title": "Gas Station", "slug": "gas-station", "difficulty": "Medium", "topic_tags": ["Greedy", "Array"], "solution_archetype": "greedy", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/gas-station/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/greedy"} | |
| {"problem_number": 135, "title": "Candy", "slug": "candy", "difficulty": "Hard", "topic_tags": ["Greedy", "Array"], "solution_archetype": "greedy", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/candy/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/greedy"} | |
| {"problem_number": 136, "title": "Single Number", "slug": "single-number", "difficulty": "Easy", "topic_tags": ["Bit Manipulation", "Array"], "solution_archetype": "bitmask", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/single-number/", "pattern_reference": null} | |
| {"problem_number": 137, "title": "Single Number II", "slug": "single-number-ii", "difficulty": "Medium", "topic_tags": ["Bit Manipulation", "Array"], "solution_archetype": "bitmask", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/single-number-ii/", "pattern_reference": null} | |
| {"problem_number": 147, "title": "Insertion Sort List", "slug": "insertion-sort-list", "difficulty": "Medium", "topic_tags": ["Linked List", "Sorting"], "solution_archetype": "linear-scan", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/insertion-sort-list/", "pattern_reference": null} | |
| {"problem_number": 164, "title": "Maximum Gap", "slug": "maximum-gap", "difficulty": "Medium", "topic_tags": ["Array", "Bucket Sort", "Radix Sort", "Sorting"], "solution_archetype": "linear-scan", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/maximum-gap/", "pattern_reference": null} | |
| {"problem_number": 175, "title": "Combine Two Tables", "slug": "combine-two-tables", "difficulty": "Easy", "topic_tags": ["Database"], "solution_archetype": "pandas-relational", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/combine-two-tables/", "pattern_reference": null} | |
| {"problem_number": 176, "title": "Second Highest Salary", "slug": "second-highest-salary", "difficulty": "Medium", "topic_tags": ["Database"], "solution_archetype": "pandas-relational", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/second-highest-salary/", "pattern_reference": null} | |
| {"problem_number": 177, "title": "Nth Highest Salary", "slug": "nth-highest-salary", "difficulty": "Medium", "topic_tags": ["Database"], "solution_archetype": "pandas-relational", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/nth-highest-salary/", "pattern_reference": null} | |
| {"problem_number": 178, "title": "Rank Scores", "slug": "rank-scores", "difficulty": "Medium", "topic_tags": ["Database"], "solution_archetype": "pandas-relational", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/rank-scores/", "pattern_reference": null} | |
| {"problem_number": 179, "title": "Largest Number", "slug": "largest-number", "difficulty": "Medium", "topic_tags": ["Greedy", "Array", "String", "Sorting"], "solution_archetype": "greedy", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/largest-number/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/greedy"} | |
| {"problem_number": 192, "title": "Word Frequency", "slug": "word-frequency", "difficulty": "Medium", "topic_tags": ["Shell"], "solution_archetype": "bespoke", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/word-frequency/", "pattern_reference": null} | |
| {"problem_number": 193, "title": "Valid Phone Numbers", "slug": "valid-phone-numbers", "difficulty": "Easy", "topic_tags": ["Shell"], "solution_archetype": "bespoke", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/valid-phone-numbers/", "pattern_reference": null} | |
| {"problem_number": 194, "title": "Transpose File", "slug": "transpose-file", "difficulty": "Medium", "topic_tags": ["Shell"], "solution_archetype": "bespoke", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/transpose-file/", "pattern_reference": null} | |
| {"problem_number": 207, "title": "Course Schedule", "slug": "course-schedule", "difficulty": "Medium", "topic_tags": ["Depth-First Search", "Breadth-First Search", "Graph", "Topological Sort"], "solution_archetype": "graph-traversal", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/course-schedule/", "pattern_reference": null} | |
| {"problem_number": 209, "title": "Minimum Size Subarray Sum", "slug": "minimum-size-subarray-sum", "difficulty": "Medium", "topic_tags": ["Array", "Binary Search", "Prefix Sum", "Sliding Window"], "solution_archetype": "binary-search", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/minimum-size-subarray-sum/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/binary-search"} | |
| {"problem_number": 210, "title": "Course Schedule II", "slug": "course-schedule-ii", "difficulty": "Medium", "topic_tags": ["Depth-First Search", "Breadth-First Search", "Graph", "Topological Sort"], "solution_archetype": "graph-traversal", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/course-schedule-ii/", "pattern_reference": null} | |
| {"problem_number": 215, "title": "Kth Largest Element in an Array", "slug": "kth-largest-element-in-an-array", "difficulty": "Medium", "topic_tags": ["Array", "Divide and Conquer", "Quickselect", "Sorting", "Heap (Priority Queue)"], "solution_archetype": "heap", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/kth-largest-element-in-an-array/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/heap"} | |
| {"problem_number": 218, "title": "The Skyline Problem", "slug": "the-skyline-problem", "difficulty": "Hard", "topic_tags": ["Binary Indexed Tree", "Segment Tree", "Array", "Divide and Conquer", "Ordered Set", "Sorting", "Line Sweep", "Heap (Priority Queue)"], "solution_archetype": "heap", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/the-skyline-problem/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/heap"} | |
| {"problem_number": 220, "title": "Contains Duplicate III", "slug": "contains-duplicate-iii", "difficulty": "Hard", "topic_tags": ["Array", "Bucket Sort", "Ordered Set", "Sorting", "Sliding Window"], "solution_archetype": "sorting", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/contains-duplicate-iii/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/sorting"} | |
| {"problem_number": 238, "title": "Product of Array Except Self", "slug": "product-of-array-except-self", "difficulty": "Medium", "topic_tags": ["Array", "Prefix Sum"], "solution_archetype": "prefix-sum", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/product-of-array-except-self/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/prefix-sum"} | |
| {"problem_number": 239, "title": "Sliding Window Maximum", "slug": "sliding-window-maximum", "difficulty": "Hard", "topic_tags": ["Queue", "Array", "Sliding Window", "Monotonic Queue", "Heap (Priority Queue)"], "solution_archetype": "sliding-window", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/sliding-window-maximum/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/sliding-window"} | |
| {"problem_number": 284, "title": "Peeking Iterator", "slug": "peeking-iterator", "difficulty": "Medium", "topic_tags": ["Design", "Array", "Iterator"], "solution_archetype": "design", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/peeking-iterator/", "pattern_reference": null} | |
| {"problem_number": 289, "title": "Game of Life", "slug": "game-of-life", "difficulty": "Medium", "topic_tags": ["Array", "Matrix", "Simulation"], "solution_archetype": "grid", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/game-of-life/", "pattern_reference": null} | |
| {"problem_number": 295, "title": "Find Median from Data Stream", "slug": "find-median-from-data-stream", "difficulty": "Hard", "topic_tags": ["Design", "Two Pointers", "Data Stream", "Sorting", "Heap (Priority Queue)"], "solution_archetype": "design", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/find-median-from-data-stream/", "pattern_reference": null} | |
| {"problem_number": 303, "title": "Range Sum Query - Immutable", "slug": "range-sum-query-immutable", "difficulty": "Easy", "topic_tags": ["Design", "Array", "Prefix Sum"], "solution_archetype": "prefix-sum", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/range-sum-query-immutable/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/prefix-sum"} | |
| {"problem_number": 304, "title": "Range Sum Query 2D - Immutable", "slug": "range-sum-query-2d-immutable", "difficulty": "Medium", "topic_tags": ["Design", "Array", "Matrix", "Prefix Sum"], "solution_archetype": "prefix-sum", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/range-sum-query-2d-immutable/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/prefix-sum"} | |
| {"problem_number": 307, "title": "Range Sum Query - Mutable", "slug": "range-sum-query-mutable", "difficulty": "Medium", "topic_tags": ["Design", "Binary Indexed Tree", "Segment Tree", "Array", "Divide and Conquer"], "solution_archetype": "design", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/range-sum-query-mutable/", "pattern_reference": null} | |
| {"problem_number": 310, "title": "Minimum Height Trees", "slug": "minimum-height-trees", "difficulty": "Medium", "topic_tags": ["Depth-First Search", "Breadth-First Search", "Graph", "Topological Sort"], "solution_archetype": "graph-traversal", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/minimum-height-trees/", "pattern_reference": null} | |
| {"problem_number": 332, "title": "Reconstruct Itinerary", "slug": "reconstruct-itinerary", "difficulty": "Hard", "topic_tags": ["Depth-First Search", "Graph", "Eulerian Circuit"], "solution_archetype": "graph-traversal", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/reconstruct-itinerary/", "pattern_reference": null} | |
| {"problem_number": 373, "title": "Find K Pairs with Smallest Sums", "slug": "find-k-pairs-with-smallest-sums", "difficulty": "Medium", "topic_tags": ["Array", "Heap (Priority Queue)"], "solution_archetype": "heap", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/find-k-pairs-with-smallest-sums/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/heap"} | |
| {"problem_number": 427, "title": "Construct Quad Tree", "slug": "construct-quad-tree", "difficulty": "Medium", "topic_tags": ["Tree", "Array", "Divide and Conquer", "Matrix"], "solution_archetype": "tree-recursion", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/construct-quad-tree/", "pattern_reference": null} | |
| {"problem_number": 440, "title": "K-th Smallest in Lexicographical Order", "slug": "k-th-smallest-in-lexicographical-order", "difficulty": "Hard", "topic_tags": ["Trie"], "solution_archetype": "trie", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/trie"} | |
| {"problem_number": 495, "title": "Teemo Attacking", "slug": "teemo-attacking", "difficulty": "Easy", "topic_tags": ["Array", "Simulation"], "solution_archetype": "simulation", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/teemo-attacking/", "pattern_reference": null} | |
| {"problem_number": 643, "title": "Maximum Average Subarray I", "slug": "maximum-average-subarray-i", "difficulty": "Easy", "topic_tags": ["Array", "Sliding Window"], "solution_archetype": "sliding-window", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/maximum-average-subarray-i/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/sliding-window"} | |
| {"problem_number": 713, "title": "Subarray Product Less Than K", "slug": "subarray-product-less-than-k", "difficulty": "Medium", "topic_tags": ["Array", "Binary Search", "Prefix Sum", "Sliding Window"], "solution_archetype": "binary-search", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/subarray-product-less-than-k/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/binary-search"} | |
| {"problem_number": 718, "title": "Maximum Length of Repeated Subarray", "slug": "maximum-length-of-repeated-subarray", "difficulty": "Medium", "topic_tags": ["Array", "Binary Search", "Dynamic Programming", "Sliding Window", "Hash Function", "Rolling Hash"], "solution_archetype": "binary-search", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/maximum-length-of-repeated-subarray/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/binary-search"} | |
| {"problem_number": 803, "title": "Bricks Falling When Hit", "slug": "bricks-falling-when-hit", "difficulty": "Hard", "topic_tags": ["Union Find", "Array", "Matrix"], "solution_archetype": "union-find", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/bricks-falling-when-hit/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/union-find"} | |
| {"problem_number": 985, "title": "Sum of Even Numbers After Queries", "slug": "sum-of-even-numbers-after-queries", "difficulty": "Medium", "topic_tags": ["Array", "Simulation"], "solution_archetype": "simulation", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/sum-of-even-numbers-after-queries/", "pattern_reference": null} | |
| {"problem_number": 1023, "title": "Camelcase Matching", "slug": "camelcase-matching", "difficulty": "Medium", "topic_tags": ["Trie", "Array", "Two Pointers", "String", "String Matching"], "solution_archetype": "trie", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/camelcase-matching/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/trie"} | |
| {"problem_number": 1044, "title": "Longest Duplicate Substring", "slug": "longest-duplicate-substring", "difficulty": "Hard", "topic_tags": ["String", "Binary Search", "Suffix Array", "Sliding Window", "Hash Function", "Rolling Hash"], "solution_archetype": "string-scan", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/longest-duplicate-substring/", "pattern_reference": null} | |
| {"problem_number": 1052, "title": "Grumpy Bookstore Owner", "slug": "grumpy-bookstore-owner", "difficulty": "Medium", "topic_tags": ["Array", "Sliding Window"], "solution_archetype": "sliding-window", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/grumpy-bookstore-owner/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/sliding-window"} | |
| {"problem_number": 1061, "title": "Lexicographically Smallest Equivalent String", "slug": "lexicographically-smallest-equivalent-string", "difficulty": "Medium", "topic_tags": ["Union Find", "String"], "solution_archetype": "union-find", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/lexicographically-smallest-equivalent-string/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/union-find"} | |
| {"problem_number": 1208, "title": "Get Equal Substrings Within Budget", "slug": "get-equal-substrings-within-budget", "difficulty": "Medium", "topic_tags": ["String", "Binary Search", "Prefix Sum", "Sliding Window"], "solution_archetype": "string-scan", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/get-equal-substrings-within-budget/", "pattern_reference": null} | |
| {"problem_number": 1234, "title": "Replace the Substring for Balanced String", "slug": "replace-the-substring-for-balanced-string", "difficulty": "Medium", "topic_tags": ["String", "Sliding Window"], "solution_archetype": "string-scan", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/replace-the-substring-for-balanced-string/", "pattern_reference": null} | |
| {"problem_number": 1389, "title": "Create Target Array in the Given Order", "slug": "create-target-array-in-the-given-order", "difficulty": "Easy", "topic_tags": ["Array", "Simulation"], "solution_archetype": "simulation", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/create-target-array-in-the-given-order/", "pattern_reference": null} | |
| {"problem_number": 1627, "title": "Graph Connectivity With Threshold", "slug": "graph-connectivity-with-threshold", "difficulty": "Hard", "topic_tags": ["Union Find", "Array", "Math", "Number Theory"], "solution_archetype": "union-find", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/graph-connectivity-with-threshold/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/union-find"} | |
| {"problem_number": 1984, "title": "Minimum Difference Between Highest and Lowest of K Scores", "slug": "minimum-difference-between-highest-and-lowest-of-k-scores", "difficulty": "Easy", "topic_tags": ["Array", "Sorting", "Sliding Window"], "solution_archetype": "sorting", "has_reference_solution": true, "leetcode_url": "https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores/", "pattern_reference": "https://www.stealthinterview.ai/leetcode/patterns/sorting"} | |