{"id":24764945,"url":"https://github.com/letsmakecakes/problem-solving-odyssey","last_synced_at":"2025-09-09T06:09:50.009Z","repository":{"id":266714911,"uuid":"707343146","full_name":"letsmakecakes/problem-solving-odyssey","owner":"letsmakecakes","description":"Here you can find my Leetcode solved problems.","archived":false,"fork":false,"pushed_at":"2025-03-12T18:22:27.000Z","size":458,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-12T19:28:12.195Z","etag":null,"topics":["leetcode","leetcode-python","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/letsmakecakes.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-10-19T17:44:47.000Z","updated_at":"2025-03-12T18:22:30.000Z","dependencies_parsed_at":"2025-01-28T16:20:34.506Z","dependency_job_id":"2d8fa6be-1d7d-4d0f-b3e8-ae3654cf5310","html_url":"https://github.com/letsmakecakes/problem-solving-odyssey","commit_stats":null,"previous_names":["letsmakecakes/dsa","letsmakecakes/problem-solving-odyssey"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/letsmakecakes%2Fproblem-solving-odyssey","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/letsmakecakes%2Fproblem-solving-odyssey/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/letsmakecakes%2Fproblem-solving-odyssey/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/letsmakecakes%2Fproblem-solving-odyssey/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/letsmakecakes","download_url":"https://codeload.github.com/letsmakecakes/problem-solving-odyssey/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245130473,"owners_count":20565658,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["leetcode","leetcode-python","leetcode-solutions"],"created_at":"2025-01-28T22:36:20.372Z","updated_at":"2025-09-09T06:09:49.999Z","avatar_url":"https://github.com/letsmakecakes.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Linked List\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/letsmakecakes/DSA/tree/master/0002-add-two-numbers) |\n| [0021-merge-two-sorted-lists](https://github.com/letsmakecakes/DSA/tree/master/0021-merge-two-sorted-lists) |\n| [0025-reverse-nodes-in-k-group](https://github.com/letsmakecakes/DSA/tree/master/0025-reverse-nodes-in-k-group) |\n| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/letsmakecakes/DSA/tree/master/0109-convert-sorted-list-to-binary-search-tree) |\n| [0141-linked-list-cycle](https://github.com/letsmakecakes/DSA/tree/master/0141-linked-list-cycle) |\n| [0143-reorder-list](https://github.com/letsmakecakes/DSA/tree/master/0143-reorder-list) |\n| [0147-insertion-sort-list](https://github.com/letsmakecakes/DSA/tree/master/0147-insertion-sort-list) |\n| [0203-remove-linked-list-elements](https://github.com/letsmakecakes/DSA/tree/master/0203-remove-linked-list-elements) |\n| [0528-swapping-nodes-in-a-linked-list](https://github.com/letsmakecakes/DSA/tree/master/0528-swapping-nodes-in-a-linked-list) |\n| [0838-design-linked-list](https://github.com/letsmakecakes/DSA/tree/master/0838-design-linked-list) |\n| [0908-middle-of-the-linked-list](https://github.com/letsmakecakes/DSA/tree/master/0908-middle-of-the-linked-list) |\n## Two Pointers\n|  |\n| ------- |\n| [0005-longest-palindromic-substring](https://github.com/letsmakecakes/DSA/tree/master/0005-longest-palindromic-substring) |\n| [0015-3sum](https://github.com/letsmakecakes/DSA/tree/master/0015-3sum) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/letsmakecakes/DSA/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [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) |\n| [0075-sort-colors](https://github.com/letsmakecakes/DSA/tree/master/0075-sort-colors) |\n| [0125-valid-palindrome](https://github.com/letsmakecakes/DSA/tree/master/0125-valid-palindrome) |\n| [0141-linked-list-cycle](https://github.com/letsmakecakes/DSA/tree/master/0141-linked-list-cycle) |\n| [0143-reorder-list](https://github.com/letsmakecakes/DSA/tree/master/0143-reorder-list) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/letsmakecakes/DSA/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0283-move-zeroes](https://github.com/letsmakecakes/DSA/tree/master/0283-move-zeroes) |\n| [0287-find-the-duplicate-number](https://github.com/letsmakecakes/DSA/tree/master/0287-find-the-duplicate-number) |\n| [0528-swapping-nodes-in-a-linked-list](https://github.com/letsmakecakes/DSA/tree/master/0528-swapping-nodes-in-a-linked-list) |\n| [0908-middle-of-the-linked-list](https://github.com/letsmakecakes/DSA/tree/master/0908-middle-of-the-linked-list) |\n| [1894-merge-strings-alternately](https://github.com/letsmakecakes/DSA/tree/master/1894-merge-strings-alternately) |\n## Stack\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/letsmakecakes/DSA/tree/master/0020-valid-parentheses) |\n| [0032-longest-valid-parentheses](https://github.com/letsmakecakes/DSA/tree/master/0032-longest-valid-parentheses) |\n| [0094-binary-tree-inorder-traversal](https://github.com/letsmakecakes/DSA/tree/master/0094-binary-tree-inorder-traversal) |\n| [0143-reorder-list](https://github.com/letsmakecakes/DSA/tree/master/0143-reorder-list) |\n| [0144-binary-tree-preorder-traversal](https://github.com/letsmakecakes/DSA/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/letsmakecakes/DSA/tree/master/0145-binary-tree-postorder-traversal) |\n| [0150-evaluate-reverse-polish-notation](https://github.com/letsmakecakes/DSA/tree/master/0150-evaluate-reverse-polish-notation) |\n| [0155-min-stack](https://github.com/letsmakecakes/DSA/tree/master/0155-min-stack) |\n| [0225-implement-stack-using-queues](https://github.com/letsmakecakes/DSA/tree/master/0225-implement-stack-using-queues) |\n| [0316-remove-duplicate-letters](https://github.com/letsmakecakes/DSA/tree/master/0316-remove-duplicate-letters) |\n| [0496-next-greater-element-i](https://github.com/letsmakecakes/DSA/tree/master/0496-next-greater-element-i) |\n| [1552-build-an-array-with-stack-operations](https://github.com/letsmakecakes/DSA/tree/master/1552-build-an-array-with-stack-operations) |\n## Recursion\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/letsmakecakes/DSA/tree/master/0002-add-two-numbers) |\n| [0021-merge-two-sorted-lists](https://github.com/letsmakecakes/DSA/tree/master/0021-merge-two-sorted-lists) |\n| [0025-reverse-nodes-in-k-group](https://github.com/letsmakecakes/DSA/tree/master/0025-reverse-nodes-in-k-group) |\n| [0143-reorder-list](https://github.com/letsmakecakes/DSA/tree/master/0143-reorder-list) |\n| [0203-remove-linked-list-elements](https://github.com/letsmakecakes/DSA/tree/master/0203-remove-linked-list-elements) |\n| [0233-number-of-digit-one](https://github.com/letsmakecakes/DSA/tree/master/0233-number-of-digit-one) |\n| [1013-fibonacci-number](https://github.com/letsmakecakes/DSA/tree/master/1013-fibonacci-number) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0004-median-of-two-sorted-arrays](https://github.com/letsmakecakes/DSA/tree/master/0004-median-of-two-sorted-arrays) |\n| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/letsmakecakes/DSA/tree/master/0109-convert-sorted-list-to-binary-search-tree) |\n| [0347-top-k-frequent-elements](https://github.com/letsmakecakes/DSA/tree/master/0347-top-k-frequent-elements) |\n## Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/letsmakecakes/DSA/tree/master/0094-binary-tree-inorder-traversal) |\n| [0096-unique-binary-search-trees](https://github.com/letsmakecakes/DSA/tree/master/0096-unique-binary-search-trees) |\n| [0098-validate-binary-search-tree](https://github.com/letsmakecakes/DSA/tree/master/0098-validate-binary-search-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/letsmakecakes/DSA/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/letsmakecakes/DSA/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0107-binary-tree-level-order-traversal-ii](https://github.com/letsmakecakes/DSA/tree/master/0107-binary-tree-level-order-traversal-ii) |\n| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/letsmakecakes/DSA/tree/master/0109-convert-sorted-list-to-binary-search-tree) |\n| [0144-binary-tree-preorder-traversal](https://github.com/letsmakecakes/DSA/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/letsmakecakes/DSA/tree/master/0145-binary-tree-postorder-traversal) |\n| [0199-binary-tree-right-side-view](https://github.com/letsmakecakes/DSA/tree/master/0199-binary-tree-right-side-view) |\n| [0226-invert-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/0226-invert-binary-tree) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/letsmakecakes/DSA/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0623-add-one-row-to-tree](https://github.com/letsmakecakes/DSA/tree/master/0623-add-one-row-to-tree) |\n| [0637-average-of-levels-in-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/0637-average-of-levels-in-binary-tree) |\n| [0764-n-ary-tree-level-order-traversal](https://github.com/letsmakecakes/DSA/tree/master/0764-n-ary-tree-level-order-traversal) |\n| [2493-reverse-odd-levels-of-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/2493-reverse-odd-levels-of-binary-tree) |\n## Binary Search Tree\n|  |\n| ------- |\n| [0004-median-of-two-sorted-arrays](https://github.com/letsmakecakes/DSA/tree/master/0004-median-of-two-sorted-arrays) |\n| [0096-unique-binary-search-trees](https://github.com/letsmakecakes/DSA/tree/master/0096-unique-binary-search-trees) |\n| [0098-validate-binary-search-tree](https://github.com/letsmakecakes/DSA/tree/master/0098-validate-binary-search-tree) |\n| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/letsmakecakes/DSA/tree/master/0109-convert-sorted-list-to-binary-search-tree) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/letsmakecakes/DSA/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/letsmakecakes/DSA/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0268-missing-number](https://github.com/letsmakecakes/DSA/tree/master/0268-missing-number) |\n| [0287-find-the-duplicate-number](https://github.com/letsmakecakes/DSA/tree/master/0287-find-the-duplicate-number) |\n## Binary Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/letsmakecakes/DSA/tree/master/0094-binary-tree-inorder-traversal) |\n| [0096-unique-binary-search-trees](https://github.com/letsmakecakes/DSA/tree/master/0096-unique-binary-search-trees) |\n| [0098-validate-binary-search-tree](https://github.com/letsmakecakes/DSA/tree/master/0098-validate-binary-search-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/letsmakecakes/DSA/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/letsmakecakes/DSA/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0107-binary-tree-level-order-traversal-ii](https://github.com/letsmakecakes/DSA/tree/master/0107-binary-tree-level-order-traversal-ii) |\n| [0109-convert-sorted-list-to-binary-search-tree](https://github.com/letsmakecakes/DSA/tree/master/0109-convert-sorted-list-to-binary-search-tree) |\n| [0144-binary-tree-preorder-traversal](https://github.com/letsmakecakes/DSA/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/letsmakecakes/DSA/tree/master/0145-binary-tree-postorder-traversal) |\n| [0199-binary-tree-right-side-view](https://github.com/letsmakecakes/DSA/tree/master/0199-binary-tree-right-side-view) |\n| [0226-invert-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/0226-invert-binary-tree) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/letsmakecakes/DSA/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0623-add-one-row-to-tree](https://github.com/letsmakecakes/DSA/tree/master/0623-add-one-row-to-tree) |\n| [0637-average-of-levels-in-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/0637-average-of-levels-in-binary-tree) |\n| [2493-reverse-odd-levels-of-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/2493-reverse-odd-levels-of-binary-tree) |\n## Depth-First Search\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/letsmakecakes/DSA/tree/master/0094-binary-tree-inorder-traversal) |\n| [0098-validate-binary-search-tree](https://github.com/letsmakecakes/DSA/tree/master/0098-validate-binary-search-tree) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0144-binary-tree-preorder-traversal](https://github.com/letsmakecakes/DSA/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/letsmakecakes/DSA/tree/master/0145-binary-tree-postorder-traversal) |\n| [0199-binary-tree-right-side-view](https://github.com/letsmakecakes/DSA/tree/master/0199-binary-tree-right-side-view) |\n| [0226-invert-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/0226-invert-binary-tree) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/letsmakecakes/DSA/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0623-add-one-row-to-tree](https://github.com/letsmakecakes/DSA/tree/master/0623-add-one-row-to-tree) |\n| [0637-average-of-levels-in-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/0637-average-of-levels-in-binary-tree) |\n| [2493-reverse-odd-levels-of-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/2493-reverse-odd-levels-of-binary-tree) |\n## Breadth-First Search\n|  |\n| ------- |\n| [0102-binary-tree-level-order-traversal](https://github.com/letsmakecakes/DSA/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/letsmakecakes/DSA/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0107-binary-tree-level-order-traversal-ii](https://github.com/letsmakecakes/DSA/tree/master/0107-binary-tree-level-order-traversal-ii) |\n| [0199-binary-tree-right-side-view](https://github.com/letsmakecakes/DSA/tree/master/0199-binary-tree-right-side-view) |\n| [0226-invert-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/0226-invert-binary-tree) |\n| [0623-add-one-row-to-tree](https://github.com/letsmakecakes/DSA/tree/master/0623-add-one-row-to-tree) |\n| [0637-average-of-levels-in-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/0637-average-of-levels-in-binary-tree) |\n| [0764-n-ary-tree-level-order-traversal](https://github.com/letsmakecakes/DSA/tree/master/0764-n-ary-tree-level-order-traversal) |\n| [2493-reverse-odd-levels-of-binary-tree](https://github.com/letsmakecakes/DSA/tree/master/2493-reverse-odd-levels-of-binary-tree) |\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/letsmakecakes/DSA/tree/master/0001-two-sum) |\n| [0004-median-of-two-sorted-arrays](https://github.com/letsmakecakes/DSA/tree/master/0004-median-of-two-sorted-arrays) |\n| [0015-3sum](https://github.com/letsmakecakes/DSA/tree/master/0015-3sum) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/letsmakecakes/DSA/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0056-merge-intervals](https://github.com/letsmakecakes/DSA/tree/master/0056-merge-intervals) |\n| [0066-plus-one](https://github.com/letsmakecakes/DSA/tree/master/0066-plus-one) |\n| [0075-sort-colors](https://github.com/letsmakecakes/DSA/tree/master/0075-sort-colors) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/letsmakecakes/DSA/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0150-evaluate-reverse-polish-notation](https://github.com/letsmakecakes/DSA/tree/master/0150-evaluate-reverse-polish-notation) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/letsmakecakes/DSA/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0179-largest-number](https://github.com/letsmakecakes/DSA/tree/master/0179-largest-number) |\n| [0217-contains-duplicate](https://github.com/letsmakecakes/DSA/tree/master/0217-contains-duplicate) |\n| [0268-missing-number](https://github.com/letsmakecakes/DSA/tree/master/0268-missing-number) |\n| [0283-move-zeroes](https://github.com/letsmakecakes/DSA/tree/master/0283-move-zeroes) |\n| [0287-find-the-duplicate-number](https://github.com/letsmakecakes/DSA/tree/master/0287-find-the-duplicate-number) |\n| [0347-top-k-frequent-elements](https://github.com/letsmakecakes/DSA/tree/master/0347-top-k-frequent-elements) |\n| [0496-next-greater-element-i](https://github.com/letsmakecakes/DSA/tree/master/0496-next-greater-element-i) |\n| [0932-monotonic-array](https://github.com/letsmakecakes/DSA/tree/master/0932-monotonic-array) |\n| [1552-build-an-array-with-stack-operations](https://github.com/letsmakecakes/DSA/tree/master/1552-build-an-array-with-stack-operations) |\n| [1626-can-make-arithmetic-progression-from-sequence](https://github.com/letsmakecakes/DSA/tree/master/1626-can-make-arithmetic-progression-from-sequence) |\n| [1950-sign-of-the-product-of-an-array](https://github.com/letsmakecakes/DSA/tree/master/1950-sign-of-the-product-of-an-array) |\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/letsmakecakes/DSA/tree/master/0001-two-sum) |\n| [0003-longest-substring-without-repeating-characters](https://github.com/letsmakecakes/DSA/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0013-roman-to-integer](https://github.com/letsmakecakes/DSA/tree/master/0013-roman-to-integer) |\n| [0141-linked-list-cycle](https://github.com/letsmakecakes/DSA/tree/master/0141-linked-list-cycle) |\n| [0217-contains-duplicate](https://github.com/letsmakecakes/DSA/tree/master/0217-contains-duplicate) |\n| [0268-missing-number](https://github.com/letsmakecakes/DSA/tree/master/0268-missing-number) |\n| [0347-top-k-frequent-elements](https://github.com/letsmakecakes/DSA/tree/master/0347-top-k-frequent-elements) |\n| [0389-find-the-difference](https://github.com/letsmakecakes/DSA/tree/master/0389-find-the-difference) |\n| [0496-next-greater-element-i](https://github.com/letsmakecakes/DSA/tree/master/0496-next-greater-element-i) |\n| [1904-second-largest-digit-in-a-string](https://github.com/letsmakecakes/DSA/tree/master/1904-second-largest-digit-in-a-string) |\n## Math\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/letsmakecakes/DSA/tree/master/0002-add-two-numbers) |\n| [0007-reverse-integer](https://github.com/letsmakecakes/DSA/tree/master/0007-reverse-integer) |\n| [0009-palindrome-number](https://github.com/letsmakecakes/DSA/tree/master/0009-palindrome-number) |\n| [0013-roman-to-integer](https://github.com/letsmakecakes/DSA/tree/master/0013-roman-to-integer) |\n| [0066-plus-one](https://github.com/letsmakecakes/DSA/tree/master/0066-plus-one) |\n| [0096-unique-binary-search-trees](https://github.com/letsmakecakes/DSA/tree/master/0096-unique-binary-search-trees) |\n| [0150-evaluate-reverse-polish-notation](https://github.com/letsmakecakes/DSA/tree/master/0150-evaluate-reverse-polish-notation) |\n| [0233-number-of-digit-one](https://github.com/letsmakecakes/DSA/tree/master/0233-number-of-digit-one) |\n| [0268-missing-number](https://github.com/letsmakecakes/DSA/tree/master/0268-missing-number) |\n| [1013-fibonacci-number](https://github.com/letsmakecakes/DSA/tree/master/1013-fibonacci-number) |\n| [1950-sign-of-the-product-of-an-array](https://github.com/letsmakecakes/DSA/tree/master/1950-sign-of-the-product-of-an-array) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0268-missing-number](https://github.com/letsmakecakes/DSA/tree/master/0268-missing-number) |\n| [0287-find-the-duplicate-number](https://github.com/letsmakecakes/DSA/tree/master/0287-find-the-duplicate-number) |\n| [0389-find-the-difference](https://github.com/letsmakecakes/DSA/tree/master/0389-find-the-difference) |\n## Sorting\n|  |\n| ------- |\n| [0015-3sum](https://github.com/letsmakecakes/DSA/tree/master/0015-3sum) |\n| [0056-merge-intervals](https://github.com/letsmakecakes/DSA/tree/master/0056-merge-intervals) |\n| [0075-sort-colors](https://github.com/letsmakecakes/DSA/tree/master/0075-sort-colors) |\n| [0147-insertion-sort-list](https://github.com/letsmakecakes/DSA/tree/master/0147-insertion-sort-list) |\n| [0179-largest-number](https://github.com/letsmakecakes/DSA/tree/master/0179-largest-number) |\n| [0217-contains-duplicate](https://github.com/letsmakecakes/DSA/tree/master/0217-contains-duplicate) |\n| [0268-missing-number](https://github.com/letsmakecakes/DSA/tree/master/0268-missing-number) |\n| [0347-top-k-frequent-elements](https://github.com/letsmakecakes/DSA/tree/master/0347-top-k-frequent-elements) |\n| [0389-find-the-difference](https://github.com/letsmakecakes/DSA/tree/master/0389-find-the-difference) |\n| [1626-can-make-arithmetic-progression-from-sequence](https://github.com/letsmakecakes/DSA/tree/master/1626-can-make-arithmetic-progression-from-sequence) |\n## String\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/letsmakecakes/DSA/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0005-longest-palindromic-substring](https://github.com/letsmakecakes/DSA/tree/master/0005-longest-palindromic-substring) |\n| [0013-roman-to-integer](https://github.com/letsmakecakes/DSA/tree/master/0013-roman-to-integer) |\n| [0020-valid-parentheses](https://github.com/letsmakecakes/DSA/tree/master/0020-valid-parentheses) |\n| [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) |\n| [0032-longest-valid-parentheses](https://github.com/letsmakecakes/DSA/tree/master/0032-longest-valid-parentheses) |\n| [0038-count-and-say](https://github.com/letsmakecakes/DSA/tree/master/0038-count-and-say) |\n| [0125-valid-palindrome](https://github.com/letsmakecakes/DSA/tree/master/0125-valid-palindrome) |\n| [0179-largest-number](https://github.com/letsmakecakes/DSA/tree/master/0179-largest-number) |\n| [0316-remove-duplicate-letters](https://github.com/letsmakecakes/DSA/tree/master/0316-remove-duplicate-letters) |\n| [0389-find-the-difference](https://github.com/letsmakecakes/DSA/tree/master/0389-find-the-difference) |\n| [0459-repeated-substring-pattern](https://github.com/letsmakecakes/DSA/tree/master/0459-repeated-substring-pattern) |\n| [1894-merge-strings-alternately](https://github.com/letsmakecakes/DSA/tree/master/1894-merge-strings-alternately) |\n| [1904-second-largest-digit-in-a-string](https://github.com/letsmakecakes/DSA/tree/master/1904-second-largest-digit-in-a-string) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0005-longest-palindromic-substring](https://github.com/letsmakecakes/DSA/tree/master/0005-longest-palindromic-substring) |\n| [0032-longest-valid-parentheses](https://github.com/letsmakecakes/DSA/tree/master/0032-longest-valid-parentheses) |\n| [0096-unique-binary-search-trees](https://github.com/letsmakecakes/DSA/tree/master/0096-unique-binary-search-trees) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/letsmakecakes/DSA/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0233-number-of-digit-one](https://github.com/letsmakecakes/DSA/tree/master/0233-number-of-digit-one) |\n| [1013-fibonacci-number](https://github.com/letsmakecakes/DSA/tree/master/1013-fibonacci-number) |\n## String Matching\n|  |\n| ------- |\n| [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) |\n| [0459-repeated-substring-pattern](https://github.com/letsmakecakes/DSA/tree/master/0459-repeated-substring-pattern) |\n## Design\n|  |\n| ------- |\n| [0155-min-stack](https://github.com/letsmakecakes/DSA/tree/master/0155-min-stack) |\n| [0225-implement-stack-using-queues](https://github.com/letsmakecakes/DSA/tree/master/0225-implement-stack-using-queues) |\n| [0838-design-linked-list](https://github.com/letsmakecakes/DSA/tree/master/0838-design-linked-list) |\n## Monotonic Stack\n|  |\n| ------- |\n| [0316-remove-duplicate-letters](https://github.com/letsmakecakes/DSA/tree/master/0316-remove-duplicate-letters) |\n| [0496-next-greater-element-i](https://github.com/letsmakecakes/DSA/tree/master/0496-next-greater-element-i) |\n## Queue\n|  |\n| ------- |\n| [0225-implement-stack-using-queues](https://github.com/letsmakecakes/DSA/tree/master/0225-implement-stack-using-queues) |\n## Greedy\n|  |\n| ------- |\n| [0179-largest-number](https://github.com/letsmakecakes/DSA/tree/master/0179-largest-number) |\n| [0316-remove-duplicate-letters](https://github.com/letsmakecakes/DSA/tree/master/0316-remove-duplicate-letters) |\n## Simulation\n|  |\n| ------- |\n| [1552-build-an-array-with-stack-operations](https://github.com/letsmakecakes/DSA/tree/master/1552-build-an-array-with-stack-operations) |\n## Memoization\n|  |\n| ------- |\n| [1013-fibonacci-number](https://github.com/letsmakecakes/DSA/tree/master/1013-fibonacci-number) |\n## Sliding Window\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/letsmakecakes/DSA/tree/master/0003-longest-substring-without-repeating-characters) |\n## Heap (Priority Queue)\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/letsmakecakes/DSA/tree/master/0347-top-k-frequent-elements) |\n## Bucket Sort\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/letsmakecakes/DSA/tree/master/0347-top-k-frequent-elements) |\n## Counting\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/letsmakecakes/DSA/tree/master/0347-top-k-frequent-elements) |\n## Quickselect\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/letsmakecakes/DSA/tree/master/0347-top-k-frequent-elements) |\n\u003c!---LeetCode Topics End--\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fletsmakecakes%2Fproblem-solving-odyssey","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fletsmakecakes%2Fproblem-solving-odyssey","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fletsmakecakes%2Fproblem-solving-odyssey/lists"}