Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/letsmakecakes/problem-solving-odyssey
Here you can find my Leetcode solved problems.
https://github.com/letsmakecakes/problem-solving-odyssey
leetcode leetcode-python leetcode-solutions
Last synced: 1 day ago
JSON representation
Here you can find my Leetcode solved problems.
- Host: GitHub
- URL: https://github.com/letsmakecakes/problem-solving-odyssey
- Owner: letsmakecakes
- Created: 2023-10-19T17:44:47.000Z (over 1 year ago)
- Default Branch: master
- Last Pushed: 2025-01-28T15:48:20.000Z (1 day ago)
- Last Synced: 2025-01-28T16:21:24.696Z (1 day ago)
- Topics: leetcode, leetcode-python, leetcode-solutions
- Language: Python
- Homepage:
- Size: 341 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode Topics
## Linked List
| |
| ------- |
| [0002-add-two-numbers](https://github.com/letsmakecakes/DSA/tree/master/0002-add-two-numbers) |
| [0021-merge-two-sorted-lists](https://github.com/letsmakecakes/DSA/tree/master/0021-merge-two-sorted-lists) |
| [0025-reverse-nodes-in-k-group](https://github.com/letsmakecakes/DSA/tree/master/0025-reverse-nodes-in-k-group) |
| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/letsmakecakes/DSA/tree/master/0109-convert-sorted-list-to-binary-search-tree) |
| [0141-linked-list-cycle](https://github.com/letsmakecakes/DSA/tree/master/0141-linked-list-cycle) |
| [0143-reorder-list](https://github.com/letsmakecakes/DSA/tree/master/0143-reorder-list) |
| [0908-middle-of-the-linked-list](https://github.com/letsmakecakes/DSA/tree/master/0908-middle-of-the-linked-list) |
## Two Pointers
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/letsmakecakes/DSA/tree/master/0005-longest-palindromic-substring) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/letsmakecakes/DSA/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0141-linked-list-cycle](https://github.com/letsmakecakes/DSA/tree/master/0141-linked-list-cycle) |
| [0143-reorder-list](https://github.com/letsmakecakes/DSA/tree/master/0143-reorder-list) |
| [0283-move-zeroes](https://github.com/letsmakecakes/DSA/tree/master/0283-move-zeroes) |
| [0908-middle-of-the-linked-list](https://github.com/letsmakecakes/DSA/tree/master/0908-middle-of-the-linked-list) |
| [1894-merge-strings-alternately](https://github.com/letsmakecakes/DSA/tree/master/1894-merge-strings-alternately) |
## Stack
| |
| ------- |
| [0020-valid-parentheses](https://github.com/letsmakecakes/DSA/tree/master/0020-valid-parentheses) |
| [0094-binary-tree-inorder-traversal](https://github.com/letsmakecakes/DSA/tree/master/0094-binary-tree-inorder-traversal) |
| [0143-reorder-list](https://github.com/letsmakecakes/DSA/tree/master/0143-reorder-list) |
| [0155-min-stack](https://github.com/letsmakecakes/DSA/tree/master/0155-min-stack) |
| [0496-next-greater-element-i](https://github.com/letsmakecakes/DSA/tree/master/0496-next-greater-element-i) |
## Recursion
| |
| ------- |
| [0002-add-two-numbers](https://github.com/letsmakecakes/DSA/tree/master/0002-add-two-numbers) |
| [0021-merge-two-sorted-lists](https://github.com/letsmakecakes/DSA/tree/master/0021-merge-two-sorted-lists) |
| [0025-reverse-nodes-in-k-group](https://github.com/letsmakecakes/DSA/tree/master/0025-reverse-nodes-in-k-group) |
| [0143-reorder-list](https://github.com/letsmakecakes/DSA/tree/master/0143-reorder-list) |
## Divide and Conquer
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/letsmakecakes/DSA/tree/master/0004-median-of-two-sorted-arrays) |
| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/letsmakecakes/DSA/tree/master/0109-convert-sorted-list-to-binary-search-tree) |
## Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/letsmakecakes/DSA/tree/master/0094-binary-tree-inorder-traversal) |
| [0096-unique-binary-search-trees](https://github.com/letsmakecakes/DSA/tree/master/0096-unique-binary-search-trees) |
| [0098-validate-binary-search-tree](https://github.com/letsmakecakes/DSA/tree/master/0098-validate-binary-search-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/letsmakecakes/DSA/tree/master/0102-binary-tree-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/0104-maximum-depth-of-binary-tree) |
| [0107-binary-tree-level-order-traversal-ii](https://github.com/letsmakecakes/DSA/tree/master/0107-binary-tree-level-order-traversal-ii) |
| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/letsmakecakes/DSA/tree/master/0109-convert-sorted-list-to-binary-search-tree) |
| [0199-binary-tree-right-side-view](https://github.com/letsmakecakes/DSA/tree/master/0199-binary-tree-right-side-view) |
| [0226-invert-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/0226-invert-binary-tree) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/letsmakecakes/DSA/tree/master/0230-kth-smallest-element-in-a-bst) |
## Binary Search Tree
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/letsmakecakes/DSA/tree/master/0004-median-of-two-sorted-arrays) |
| [0096-unique-binary-search-trees](https://github.com/letsmakecakes/DSA/tree/master/0096-unique-binary-search-trees) |
| [0098-validate-binary-search-tree](https://github.com/letsmakecakes/DSA/tree/master/0098-validate-binary-search-tree) |
| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/letsmakecakes/DSA/tree/master/0109-convert-sorted-list-to-binary-search-tree) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/letsmakecakes/DSA/tree/master/0230-kth-smallest-element-in-a-bst) |
| [0268-missing-number](https://github.com/letsmakecakes/DSA/tree/master/0268-missing-number) |
## Binary Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/letsmakecakes/DSA/tree/master/0094-binary-tree-inorder-traversal) |
| [0096-unique-binary-search-trees](https://github.com/letsmakecakes/DSA/tree/master/0096-unique-binary-search-trees) |
| [0098-validate-binary-search-tree](https://github.com/letsmakecakes/DSA/tree/master/0098-validate-binary-search-tree) |
| [0102-binary-tree-level-order-traversal](https://github.com/letsmakecakes/DSA/tree/master/0102-binary-tree-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/0104-maximum-depth-of-binary-tree) |
| [0107-binary-tree-level-order-traversal-ii](https://github.com/letsmakecakes/DSA/tree/master/0107-binary-tree-level-order-traversal-ii) |
| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/letsmakecakes/DSA/tree/master/0109-convert-sorted-list-to-binary-search-tree) |
| [0199-binary-tree-right-side-view](https://github.com/letsmakecakes/DSA/tree/master/0199-binary-tree-right-side-view) |
| [0226-invert-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/0226-invert-binary-tree) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/letsmakecakes/DSA/tree/master/0230-kth-smallest-element-in-a-bst) |
## Depth-First Search
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/letsmakecakes/DSA/tree/master/0094-binary-tree-inorder-traversal) |
| [0098-validate-binary-search-tree](https://github.com/letsmakecakes/DSA/tree/master/0098-validate-binary-search-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/0104-maximum-depth-of-binary-tree) |
| [0199-binary-tree-right-side-view](https://github.com/letsmakecakes/DSA/tree/master/0199-binary-tree-right-side-view) |
| [0226-invert-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/0226-invert-binary-tree) |
| [0230-kth-smallest-element-in-a-bst](https://github.com/letsmakecakes/DSA/tree/master/0230-kth-smallest-element-in-a-bst) |
## Breadth-First Search
| |
| ------- |
| [0102-binary-tree-level-order-traversal](https://github.com/letsmakecakes/DSA/tree/master/0102-binary-tree-level-order-traversal) |
| [0104-maximum-depth-of-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/0104-maximum-depth-of-binary-tree) |
| [0107-binary-tree-level-order-traversal-ii](https://github.com/letsmakecakes/DSA/tree/master/0107-binary-tree-level-order-traversal-ii) |
| [0199-binary-tree-right-side-view](https://github.com/letsmakecakes/DSA/tree/master/0199-binary-tree-right-side-view) |
| [0226-invert-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/0226-invert-binary-tree) |
## Array
| |
| ------- |
| [0001-two-sum](https://github.com/letsmakecakes/DSA/tree/master/0001-two-sum) |
| [0004-median-of-two-sorted-arrays](https://github.com/letsmakecakes/DSA/tree/master/0004-median-of-two-sorted-arrays) |
| [0066-plus-one](https://github.com/letsmakecakes/DSA/tree/master/0066-plus-one) |
| [0217-contains-duplicate](https://github.com/letsmakecakes/DSA/tree/master/0217-contains-duplicate) |
| [0268-missing-number](https://github.com/letsmakecakes/DSA/tree/master/0268-missing-number) |
| [0283-move-zeroes](https://github.com/letsmakecakes/DSA/tree/master/0283-move-zeroes) |
| [0496-next-greater-element-i](https://github.com/letsmakecakes/DSA/tree/master/0496-next-greater-element-i) |
| [0932-monotonic-array](https://github.com/letsmakecakes/DSA/tree/master/0932-monotonic-array) |
| [1626-can-make-arithmetic-progression-from-sequence](https://github.com/letsmakecakes/DSA/tree/master/1626-can-make-arithmetic-progression-from-sequence) |
| [1950-sign-of-the-product-of-an-array](https://github.com/letsmakecakes/DSA/tree/master/1950-sign-of-the-product-of-an-array) |
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/letsmakecakes/DSA/tree/master/0001-two-sum) |
| [0013-roman-to-integer](https://github.com/letsmakecakes/DSA/tree/master/0013-roman-to-integer) |
| [0141-linked-list-cycle](https://github.com/letsmakecakes/DSA/tree/master/0141-linked-list-cycle) |
| [0217-contains-duplicate](https://github.com/letsmakecakes/DSA/tree/master/0217-contains-duplicate) |
| [0268-missing-number](https://github.com/letsmakecakes/DSA/tree/master/0268-missing-number) |
| [0389-find-the-difference](https://github.com/letsmakecakes/DSA/tree/master/0389-find-the-difference) |
| [0496-next-greater-element-i](https://github.com/letsmakecakes/DSA/tree/master/0496-next-greater-element-i) |
## Math
| |
| ------- |
| [0002-add-two-numbers](https://github.com/letsmakecakes/DSA/tree/master/0002-add-two-numbers) |
| [0013-roman-to-integer](https://github.com/letsmakecakes/DSA/tree/master/0013-roman-to-integer) |
| [0066-plus-one](https://github.com/letsmakecakes/DSA/tree/master/0066-plus-one) |
| [0096-unique-binary-search-trees](https://github.com/letsmakecakes/DSA/tree/master/0096-unique-binary-search-trees) |
| [0268-missing-number](https://github.com/letsmakecakes/DSA/tree/master/0268-missing-number) |
| [1950-sign-of-the-product-of-an-array](https://github.com/letsmakecakes/DSA/tree/master/1950-sign-of-the-product-of-an-array) |
## Bit Manipulation
| |
| ------- |
| [0268-missing-number](https://github.com/letsmakecakes/DSA/tree/master/0268-missing-number) |
| [0389-find-the-difference](https://github.com/letsmakecakes/DSA/tree/master/0389-find-the-difference) |
## Sorting
| |
| ------- |
| [0217-contains-duplicate](https://github.com/letsmakecakes/DSA/tree/master/0217-contains-duplicate) |
| [0268-missing-number](https://github.com/letsmakecakes/DSA/tree/master/0268-missing-number) |
| [0389-find-the-difference](https://github.com/letsmakecakes/DSA/tree/master/0389-find-the-difference) |
| [1626-can-make-arithmetic-progression-from-sequence](https://github.com/letsmakecakes/DSA/tree/master/1626-can-make-arithmetic-progression-from-sequence) |
## String
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/letsmakecakes/DSA/tree/master/0005-longest-palindromic-substring) |
| [0013-roman-to-integer](https://github.com/letsmakecakes/DSA/tree/master/0013-roman-to-integer) |
| [0020-valid-parentheses](https://github.com/letsmakecakes/DSA/tree/master/0020-valid-parentheses) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/letsmakecakes/DSA/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0389-find-the-difference](https://github.com/letsmakecakes/DSA/tree/master/0389-find-the-difference) |
| [0459-repeated-substring-pattern](https://github.com/letsmakecakes/DSA/tree/master/0459-repeated-substring-pattern) |
| [1894-merge-strings-alternately](https://github.com/letsmakecakes/DSA/tree/master/1894-merge-strings-alternately) |
## Dynamic Programming
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/letsmakecakes/DSA/tree/master/0005-longest-palindromic-substring) |
| [0096-unique-binary-search-trees](https://github.com/letsmakecakes/DSA/tree/master/0096-unique-binary-search-trees) |
## String Matching
| |
| ------- |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/letsmakecakes/DSA/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0459-repeated-substring-pattern](https://github.com/letsmakecakes/DSA/tree/master/0459-repeated-substring-pattern) |
## Design
| |
| ------- |
| [0155-min-stack](https://github.com/letsmakecakes/DSA/tree/master/0155-min-stack) |
## Monotonic Stack
| |
| ------- |
| [0496-next-greater-element-i](https://github.com/letsmakecakes/DSA/tree/master/0496-next-greater-element-i) |