This repository contains my solutions to LeetCode problems implemented in Rust.
- Total problems solved: 69
- Easy: 10 (14.5%)
- Medium: 47 (68.1%)
- Hard: 12 (17.4%)
This repository uses GitHub Actions to automatically maintain an up-to-date listing of all solutions. The automation:
- Triggers whenever a new solution is pushed to the main branch
- Scans all solution directories (those starting with
id_) - Extracts problem metadata from the source files, including:
- Problem ID
- Title
- Difficulty level
- Topic tags
- Generates a formatted table of all solutions
- Updates statistics about problem difficulties
- Automatically commits and pushes the updated README.md
The automation script is written in Rust and can be found in .github/scripts/update_readme/.
Each solution file must include a documentation header in this format:
///
/// # Problem Title (Difficulty) [Tag1, Tag2]
/// LeetCode Problem {id}
///| ID | Title | Difficulty | Tags |
|---|---|---|---|
| 1 | Two sums | Easy | Array, Hash Table |
| 7 | Reverse Integer | Medium | Math |
| 9 | Palindrome Number | Easy | Math |
| 10 | Regular Expression Matching | Hard | String, Dynamic Programming, Recursion |
| 12 | Integer to Roman | Medium | Hash Table, Math, String |
| 20 | Valid Parentheses | Easy | String, Stack |
| 29 | Divide Two Integers | Medium | Math, Bit Manipulation |
| 37 | Sudoku Solver | Hard | Array, Hash Table, Backtracking, Matrix |
| 239 | Sliding Window Maximum | Hard | Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue |
| 273 | Integer to English Words | Hard | Math, String, Recursion |
| 567 | Permutation in String | Medium | Hash Table, Two Pointers, String, Sliding Window |
| 670 | Maximum Swap | Medium | Math, Greedy |
| 729 | My Calendar I | Medium | Array, Binary Search, Design, Segment Tree, Ordered Set |
| 773 | Sliding Puzzle | Hard | Array, Breadth First Search, Matrix |
| 796 | Rotate String | Easy | String, String Matching |
| 862 | Shortest Subarray with Sum at Least K | Hard | Array, Binary Search, Queue, Sliding Window, Heap (Priority Queue), Prefix Sum, Monotonic Queue |
| 921 | Minimum Add to Make Parentheses Valid | Medium | String, Stack, Greedy |
| 951 | Minimum Add to Make Parentheses Valid | Medium | String, Stack, Greedy |
| 962 | Maximum Width Ramp | Medium | Array, Stack, Monotonic Stack |
| 1072 | Flip Columns For Maximum Number of Equal Rows | Medium | Array, Hash Table, Matrix |
| 1106 | Parsing A Boolean Expression | Hard | String, Stack, Recursion |
| 1233 | Remove Sub-Folders from the Filesystem | Medium | Array, String, Depth-First Search, Trie |
| 1277 | Count Square Submatrices with All Ones | Medium | Array, Dynamic Programming, Matrix |
| 1331 | Rank Transform of an Array | Easy | Array, Hash Table, Sorting |
| 1405 | Longest Happy String | Medium | String, Greedy, Heap (Priority Queue) |
| 1497 | Check If Array Pairs Are Divisible by k | Medium | Array, Hash Table, Counting |
| 1545 | Find Kth Bit in Nth Binary String | Medium | String, Recursion, Simulation |
| 1574 | Shortest Subarray to be Removed to Make Array Sorted | Medium | Array, Two Pointers, Binary Search, Stack, Monotonic Stack |
| 1590 | Make Sum Divisible by P | Medium | Array, Hash Table, Prefix Sum |
| 1593 | Split a String Into the Max Number of Unique Substrings | Medium | Hash Table, String, Backtracking |
| 1652 | Defuse the Bomb | Easy | Array, Sliding Window |
| 1671 | Minimum Number of Removals to Make Mountain Array | Hard | Array, Binary Search, Dynamic Programming, Greedy |
| 1813 | Sentence Similarity III | Medium | Array, Two Pointers, String |
| 1829 | Maximum XOR for Each Query | Medium | Array, Bit Manipulation, Prefix Sum |
| 1861 | Rotating the Box | Medium | Array, Two Pointers, Matrix |
| 1942 | The Number of the Smallest Unoccupied Chair | Medium | Array, Hash Table, Heap (Priority Queue) |
| 1957 | Delete Characters to Make Fancy String | Easy | String |
| 1963 | Minimum Number of Swaps to Make the String Balanced | Medium | Two Pointers, String, Stack, Greedy |
| 1975 | Maximum Matrix Sum | Medium | Array, Greedy, Matrix |
| 2044 | Count Number of Maximum Bitwise-OR Subsets | Medium | Array, Backtracking, Bit Manipulation, Enumeration |
| 2064 | Minimized Maximum of Products Distributed to Any Store | Medium | Array, Binary Search |
| 2070 | Most Beautiful Item for Each Query | Medium | Array, Binary Search, Sorting |
| 2222 | Number of Ways to Select Buildings | Medium | String, Dynamic Programming, Prefix Sum |
| 2257 | Count Unguarded Cells in the Grid | Medium | Array, Matrix, Simulation |
| 2275 | Largest Combination With Bitwise AND Greater Than Zero | Medium | Array, Hash Table, Bit Manipulation, Counting |
| 2416 | Sum of Prefix Scores of Strings | Hard | Array, String, Trie, Counting |
| 2423 | Remove Letter To Equalize Frequency | Easy | Hash Table, String, Counting |
| 2458 | Height of Binary Tree After Subtree Removal Queries | Hard | Array, Tree, Depth-First Search, Breadth-First Search, Binary Tree |
| 2461 | Maximum Sum of Distinct Subarrays With Length K | Medium | Array, Hash Table, Sliding Window |
| 2463 | Minimum Total Distance Traveled | Hard | Array, Dynamic Programming, Sorting |
| 2490 | Circular Sentence | Easy | String |
| 2501 | Longest Square Streak in an Array | Medium | Array, Hash Table, Binary Search, Dynamic Programming, Sorting |
| 2516 | Take K of Each Character From Left and Right | Medium | Hash Table, String, Sliding Window |
| 2563 | Count the Number of Fair Pairs | Medium | Array, Two Pointers, Binary Search, Sorting |
| 2583 | Kth Largest Sum in a Binary Tree | Medium | Tree, Breadth-First Search, Sorting, Binary Tree |
| 2601 | Prime Subtraction Operation | Medium | Array, Math, Binary Search, Greedy, Number Theory |
| 2641 | Cousins in Binary Tree II | Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree |
| 2684 | Maximum Number of Moves in a Grid | Medium | Array, Dynamic Programming, Matrix |
| 2696 | Minimum String Length After Removing Substrings | Easy | String, Stack, Simulation |
| 2914 | Minimum Changes to Make Binary String Beautiful | Medium | String |
| 2924 | Find Champion II | Medium | Graph |
| 2938 | Separate Black and White Balls | Medium | Two Pointers, String, Greedy |
| 3011 | Find if Array Can Be Sorted | Medium | Array, Bit Manipulation, Sorting |
| 3017 | Count the Number of Houses at a Certain Distance II | Hard | Graph, Prefix Sum |
| 3043 | Find the Length of the Longest Common Prefix | Medium | Array, Hash Table, String, Trie |
| 3090 | Shortest Subarray With OR at Least K II | Medium | Array, Bit Manipulation, Sliding Window |
| 3133 | Minimum Array End | Medium | Bit Manipulation |
| 3163 | String Compression III | Medium | String |
| 3254 | Find the Power of K-Size Subarrays I | Medium | Array, Sliding Window |
- LeetCode CLI: A command-line tool to create new LeetCode problem projects.
This project is open-source and available under the MIT License.