https://github.com/zanebrackley/leetcode-solutions
This repository serves as a personal archive of my progress and learning journey through solving algorithmic and data structure problems on LeetCode.
https://github.com/zanebrackley/leetcode-solutions
leetcode-cpp leetcode-csharp leetcode-java leetcode-python leetcode-solutions
Last synced: 2 months ago
JSON representation
This repository serves as a personal archive of my progress and learning journey through solving algorithmic and data structure problems on LeetCode.
- Host: GitHub
- URL: https://github.com/zanebrackley/leetcode-solutions
- Owner: ZaneBrackley
- Created: 2025-03-10T07:55:36.000Z (3 months ago)
- Default Branch: main
- Last Pushed: 2025-03-25T00:46:57.000Z (2 months ago)
- Last Synced: 2025-03-25T01:29:29.715Z (2 months ago)
- Topics: leetcode-cpp, leetcode-csharp, leetcode-java, leetcode-python, leetcode-solutions
- Language: Java
- Homepage:
- Size: 150 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode Solutions 📚
Welcome to my **LeetCode Solutions** repository! Here, I store my solutions to various LeetCode problems using the **LeetHub v2 Chrome extension**, which automatically syncs my submissions to GitHub.
## 🚀 About
This repository serves as a personal archive of my progress and learning journey through solving algorithmic and data structure problems on LeetCode.
## 🏗 Structure
LeetHub v2 organizes solutions in the following format:
```
📂 LeetCode-Solutions
┣ 📂 problem-name
┃ ┣ 📜 solution.extension (e.g., solution.py, solution.java)
┃ ┣ 📜 README.md (auto-generated problem description)
┗ 📜 README.md
```
Each solution includes:
- **Problem description** (auto-generated by LeetHub)
- **Code implementation**
- **Time and space complexity analysis**
# LeetCode Topics
## Array
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/ZaneBrackley/LeetCode-Solutions/tree/master/0004-median-of-two-sorted-arrays) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0027-remove-element) |
| [0042-trapping-rain-water](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0042-trapping-rain-water) |
| [0045-jump-game-ii](https://github.com/ZaneBrackley/LeetCode-Solutions/tree/master/0045-jump-game-ii) |
| [0055-jump-game](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0055-jump-game) |
| [0066-plus-one](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0066-plus-one) |
| [0068-text-justification](https://github.com/ZaneBrackley/LeetCode-Solutions/tree/master/0068-text-justification) |
| [0073-set-matrix-zeroes](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0073-set-matrix-zeroes) |
| [0074-search-a-2d-matrix](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0074-search-a-2d-matrix) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0088-merge-sorted-array](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0088-merge-sorted-array) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/ZaneBrackley/LeetCode-Solutions/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0169-majority-element](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0169-majority-element) |
| [0189-rotate-array](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0189-rotate-array) |
| [0198-house-robber](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0198-house-robber) |
| [0209-minimum-size-subarray-sum](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0209-minimum-size-subarray-sum) |
| [0213-house-robber-ii](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0213-house-robber-ii) |
| [0228-summary-ranges](https://github.com/ZaneBrackley/LeetCode-Solutions/tree/master/0228-summary-ranges) |
| [0238-product-of-array-except-self](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0238-product-of-array-except-self) |
| [0274-h-index](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0274-h-index) |
| [0289-game-of-life](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0289-game-of-life) |
| [0322-coin-change](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0322-coin-change) |
| [0407-trapping-rain-water-ii](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0407-trapping-rain-water-ii) |
## Two Pointers
| |
| ------- |
| [0026-remove-duplicates-from-sorted-array](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0027-remove-element) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0042-trapping-rain-water](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0042-trapping-rain-water) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0088-merge-sorted-array](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0088-merge-sorted-array) |
| [0125-valid-palindrome](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0125-valid-palindrome) |
| [0151-reverse-words-in-a-string](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0151-reverse-words-in-a-string) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/ZaneBrackley/LeetCode-Solutions/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0189-rotate-array](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0189-rotate-array) |
## Sorting
| |
| ------- |
| [0088-merge-sorted-array](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0088-merge-sorted-array) |
| [0169-majority-element](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0169-majority-element) |
| [0242-valid-anagram](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0242-valid-anagram) |
| [0274-h-index](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0274-h-index) |
## String
| |
| ------- |
| [0012-integer-to-roman](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0013-roman-to-integer) |
| [0014-longest-common-prefix](https://github.com/ZaneBrackley/LeetCode-Solutions/tree/master/0014-longest-common-prefix) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0058-length-of-last-word](https://github.com/ZaneBrackley/LeetCode-Solutions/tree/master/0058-length-of-last-word) |
| [0068-text-justification](https://github.com/ZaneBrackley/LeetCode-Solutions/tree/master/0068-text-justification) |
| [0125-valid-palindrome](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0125-valid-palindrome) |
| [0151-reverse-words-in-a-string](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0151-reverse-words-in-a-string) |
| [0242-valid-anagram](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0242-valid-anagram) |
| [0273-integer-to-english-words](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0273-integer-to-english-words) |
| [0290-word-pattern](https://github.com/ZaneBrackley/LeetCode-Solutions/tree/master/0290-word-pattern) |
## Math
| |
| ------- |
| [0012-integer-to-roman](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0013-roman-to-integer) |
| [0066-plus-one](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0066-plus-one) |
| [0189-rotate-array](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0189-rotate-array) |
| [0273-integer-to-english-words](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0273-integer-to-english-words) |
## Hash Table
| |
| ------- |
| [0012-integer-to-roman](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0013-roman-to-integer) |
| [0073-set-matrix-zeroes](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0073-set-matrix-zeroes) |
| [0169-majority-element](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0169-majority-element) |
| [0242-valid-anagram](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0242-valid-anagram) |
| [0290-word-pattern](https://github.com/ZaneBrackley/LeetCode-Solutions/tree/master/0290-word-pattern) |
## Divide and Conquer
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/ZaneBrackley/LeetCode-Solutions/tree/master/0004-median-of-two-sorted-arrays) |
| [0023-merge-k-sorted-lists](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0023-merge-k-sorted-lists) |
| [0169-majority-element](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0169-majority-element) |
## Counting
| |
| ------- |
| [0169-majority-element](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0169-majority-element) |
## Dynamic Programming
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0042-trapping-rain-water) |
| [0045-jump-game-ii](https://github.com/ZaneBrackley/LeetCode-Solutions/tree/master/0045-jump-game-ii) |
| [0055-jump-game](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0055-jump-game) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0124-binary-tree-maximum-path-sum](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0124-binary-tree-maximum-path-sum) |
| [0198-house-robber](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0198-house-robber) |
| [0213-house-robber-ii](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0213-house-robber-ii) |
| [0322-coin-change](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0322-coin-change) |
| [0337-house-robber-iii](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0337-house-robber-iii) |
## Tree
| |
| ------- |
| [0124-binary-tree-maximum-path-sum](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0124-binary-tree-maximum-path-sum) |
| [0226-invert-binary-tree](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0226-invert-binary-tree) |
| [0337-house-robber-iii](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0337-house-robber-iii) |
## Depth-First Search
| |
| ------- |
| [0124-binary-tree-maximum-path-sum](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0124-binary-tree-maximum-path-sum) |
| [0226-invert-binary-tree](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0226-invert-binary-tree) |
| [0337-house-robber-iii](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0337-house-robber-iii) |
## Binary Tree
| |
| ------- |
| [0124-binary-tree-maximum-path-sum](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0124-binary-tree-maximum-path-sum) |
| [0226-invert-binary-tree](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0226-invert-binary-tree) |
| [0337-house-robber-iii](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0337-house-robber-iii) |
## Breadth-First Search
| |
| ------- |
| [0226-invert-binary-tree](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0226-invert-binary-tree) |
| [0322-coin-change](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0322-coin-change) |
| [0407-trapping-rain-water-ii](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0407-trapping-rain-water-ii) |
## Binary Search
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/ZaneBrackley/LeetCode-Solutions/tree/master/0004-median-of-two-sorted-arrays) |
| [0074-search-a-2d-matrix](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0074-search-a-2d-matrix) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/ZaneBrackley/LeetCode-Solutions/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0209-minimum-size-subarray-sum](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0209-minimum-size-subarray-sum) |
## Matrix
| |
| ------- |
| [0073-set-matrix-zeroes](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0073-set-matrix-zeroes) |
| [0074-search-a-2d-matrix](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0074-search-a-2d-matrix) |
| [0289-game-of-life](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0289-game-of-life) |
| [0407-trapping-rain-water-ii](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0407-trapping-rain-water-ii) |
## Stack
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0042-trapping-rain-water) |
## Monotonic Stack
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0042-trapping-rain-water) |
## Heap (Priority Queue)
| |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0023-merge-k-sorted-lists) |
| [0407-trapping-rain-water-ii](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0407-trapping-rain-water-ii) |
## String Matching
| |
| ------- |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
## Recursion
| |
| ------- |
| [0273-integer-to-english-words](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0273-integer-to-english-words) |
## Simulation
| |
| ------- |
| [0068-text-justification](https://github.com/ZaneBrackley/LeetCode-Solutions/tree/master/0068-text-justification) |
| [0289-game-of-life](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0289-game-of-life) |
## Database
| |
| ------- |
| [0175-combine-two-tables](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0175-combine-two-tables) |
| [0577-employee-bonus](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0577-employee-bonus) |
## Greedy
| |
| ------- |
| [0045-jump-game-ii](https://github.com/ZaneBrackley/LeetCode-Solutions/tree/master/0045-jump-game-ii) |
| [0055-jump-game](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0055-jump-game) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
## Sliding Window
| |
| ------- |
| [0209-minimum-size-subarray-sum](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0209-minimum-size-subarray-sum) |
## Prefix Sum
| |
| ------- |
| [0209-minimum-size-subarray-sum](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0209-minimum-size-subarray-sum) |
| [0238-product-of-array-except-self](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0238-product-of-array-except-self) |
## Counting Sort
| |
| ------- |
| [0274-h-index](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0274-h-index) |
## Linked List
| |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0023-merge-k-sorted-lists) |
## Merge Sort
| |
| ------- |
| [0023-merge-k-sorted-lists](https://github.com/ZaneBrackley/LeetCode-Daily-Solutions/tree/master/0023-merge-k-sorted-lists) |
## Trie
| |
| ------- |
| [0014-longest-common-prefix](https://github.com/ZaneBrackley/LeetCode-Solutions/tree/master/0014-longest-common-prefix) |