{"id":51854226,"url":"https://github.com/karthikrshet/karthik-leetcode-solutions","last_synced_at":"2026-07-23T23:02:53.901Z","repository":{"id":368660416,"uuid":"1286234439","full_name":"karthikrshet/Karthik-LeetCode-Solutions","owner":"karthikrshet","description":"Solutions to LeetCode coding challenges solved during Software Engineering interview preparation. Includes Java implementations with optimized approaches and problem explanations.","archived":false,"fork":false,"pushed_at":"2026-07-16T20:56:54.000Z","size":196,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2026-07-16T21:11:04.617Z","etag":null,"topics":["dsa-algorithm","dsa-learning-series","dsa-practice","leetcode","leetcode-java","leetcode-javascript","leetcode-python","leetcode-python3","leetcode-questions","leetcode-solutions"],"latest_commit_sha":null,"homepage":"https://karthik-rajesh-shet.vercel.app/","language":"Java","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/karthikrshet.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,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2026-07-01T15:16:09.000Z","updated_at":"2026-07-16T20:56:58.000Z","dependencies_parsed_at":null,"dependency_job_id":null,"html_url":"https://github.com/karthikrshet/Karthik-LeetCode-Solutions","commit_stats":null,"previous_names":["karthikrshet/karthik-leetcode-solutions"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/karthikrshet/Karthik-LeetCode-Solutions","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/karthikrshet%2FKarthik-LeetCode-Solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/karthikrshet%2FKarthik-LeetCode-Solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/karthikrshet%2FKarthik-LeetCode-Solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/karthikrshet%2FKarthik-LeetCode-Solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/karthikrshet","download_url":"https://codeload.github.com/karthikrshet/Karthik-LeetCode-Solutions/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/karthikrshet%2FKarthik-LeetCode-Solutions/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":35819442,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-07-20T02:08:10.276Z","status":"online","status_checked_at":"2026-07-23T02:00:06.683Z","response_time":57,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["dsa-algorithm","dsa-learning-series","dsa-practice","leetcode","leetcode-java","leetcode-javascript","leetcode-python","leetcode-python3","leetcode-questions","leetcode-solutions"],"created_at":"2026-07-23T23:02:52.934Z","updated_at":"2026-07-23T23:02:53.876Z","avatar_url":"https://github.com/karthikrshet.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode Solutions 🚀\n\nWelcome to my LeetCode solutions repository!\n\nThis repository contains my solutions to LeetCode problems solved as part of my Data Structures \u0026 Algorithms (DSA) practice and Software Engineering interview preparation. The solutions are primarily implemented in **Java** and cover a wide range of topics including arrays, strings, linked lists, trees, graphs, dynamic programming, greedy algorithms, and more.\n\n## 🎯 Objectives\n\n* Strengthen problem-solving and analytical thinking skills\n* Master Data Structures and Algorithms\n* Prepare for Software Development Engineer (SDE) interviews\n* Build consistency through daily coding practice\n* Track learning progress over time\n\n## 🛠️ Tech Stack\n\n* Java\n* Data Structures \u0026 Algorithms\n* LeetCode Platform\n* Git \u0026 GitHub\n* LeetHub v2 (Automatic Solution Sync)\n\n## 📚 Topics Covered\n\n* Arrays \u0026 Strings\n* Linked Lists\n* Stacks \u0026 Queues\n* Hash Tables\n* Trees \u0026 Binary Trees\n* Binary Search Trees\n* Heaps \u0026 Priority Queues\n* Graphs\n* Recursion \u0026 Backtracking\n* Dynamic Programming\n* Greedy Algorithms\n* Sliding Window\n* Two Pointers\n* Binary Search\n* Bit Manipulation\n* Sorting \u0026 Searching\n\n## 📈 Progress\n\nI continuously update this repository as I solve new problems and improve my understanding of algorithms and data structures.\n\n## 🔗 Profiles\n\n* GitHub: https://github.com/karthikrshet\n* LinkedIn: https://www.linkedin.com/in/karthik-rajesh-shet\n* Portfolio: https://karthik-rajesh-shet.vercel.app\n\n## ⭐ Note\n\nThis repository serves as a personal learning archive and interview preparation resource. Solutions may include multiple approaches with varying time and space complexities where applicable.\n\nHappy Coding! 🚀\n\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0001-two-sum) |\n| [0004-median-of-two-sorted-arrays](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0004-median-of-two-sorted-arrays) |\n| [0011-container-with-most-water](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0011-container-with-most-water) |\n| [0014-longest-common-prefix](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0014-longest-common-prefix) |\n| [0015-3sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0015-3sum) |\n| [0016-3sum-closest](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0016-3sum-closest) |\n| [0018-4sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0018-4sum) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0027-remove-element](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0027-remove-element) |\n| [0031-next-permutation](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0031-next-permutation) |\n| [0033-search-in-rotated-sorted-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0033-search-in-rotated-sorted-array) |\n| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |\n| [0035-search-insert-position](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0035-search-insert-position) |\n| [0036-valid-sudoku](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0036-valid-sudoku) |\n| [0037-sudoku-solver](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0037-sudoku-solver) |\n| [0039-combination-sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0039-combination-sum) |\n| [0040-combination-sum-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0040-combination-sum-ii) |\n| [0041-first-missing-positive](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0041-first-missing-positive) |\n| [0042-trapping-rain-water](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0042-trapping-rain-water) |\n| [0045-jump-game-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0045-jump-game-ii) |\n| [0047-permutations-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0047-permutations-ii) |\n| [0048-rotate-image](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0048-rotate-image) |\n| [0049-group-anagrams](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0049-group-anagrams) |\n| [0051-n-queens](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0051-n-queens) |\n| [0053-maximum-subarray](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0053-maximum-subarray) |\n| [0054-spiral-matrix](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0054-spiral-matrix) |\n| [0055-jump-game](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0055-jump-game) |\n| [0056-merge-intervals](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0056-merge-intervals) |\n| [0057-insert-interval](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0057-insert-interval) |\n| [0059-spiral-matrix-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0059-spiral-matrix-ii) |\n| [0063-unique-paths-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0063-unique-paths-ii) |\n| [0064-minimum-path-sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0064-minimum-path-sum) |\n| [0066-plus-one](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0066-plus-one) |\n| [0068-text-justification](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0068-text-justification) |\n| [0073-set-matrix-zeroes](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0073-set-matrix-zeroes) |\n| [0074-search-a-2d-matrix](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0074-search-a-2d-matrix) |\n| [0075-sort-colors](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0075-sort-colors) |\n| [0078-subsets](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0078-subsets) |\n| [0079-word-search](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0079-word-search) |\n| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0080-remove-duplicates-from-sorted-array-ii) |\n| [0081-search-in-rotated-sorted-array-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0081-search-in-rotated-sorted-array-ii) |\n| [0084-largest-rectangle-in-histogram](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0084-largest-rectangle-in-histogram) |\n| [0085-maximal-rectangle](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0085-maximal-rectangle) |\n| [0088-merge-sorted-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0088-merge-sorted-array) |\n| [0090-subsets-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0090-subsets-ii) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |\n| [0200-number-of-islands](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0200-number-of-islands) |\n| [1260-shift-2d-grid](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1260-shift-2d-grid) |\n| [1288-remove-covered-intervals](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1288-remove-covered-intervals) |\n| [1301-number-of-paths-with-max-score](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1301-number-of-paths-with-max-score) |\n| [1979-find-greatest-common-divisor-of-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1979-find-greatest-common-divisor-of-array) |\n| [2126-destroying-asteroids](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2126-destroying-asteroids) |\n| [3312-sorted-gcd-pair-queries](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3312-sorted-gcd-pair-queries) |\n| [3336-find-the-number-of-subsequences-with-equal-gcd](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3336-find-the-number-of-subsequences-with-equal-gcd) |\n| [3501-maximize-active-section-with-trade-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3501-maximize-active-section-with-trade-ii) |\n| [3532-path-existence-queries-in-a-graph-i](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3532-path-existence-queries-in-a-graph-i) |\n| [3534-path-existence-queries-in-a-graph-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3534-path-existence-queries-in-a-graph-ii) |\n| [3867-sum-of-gcd-of-formed-pairs](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3867-sum-of-gcd-of-formed-pairs) |\n## Binary Search\n|  |\n| ------- |\n| [0004-median-of-two-sorted-arrays](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0004-median-of-two-sorted-arrays) |\n| [0033-search-in-rotated-sorted-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0033-search-in-rotated-sorted-array) |\n| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |\n| [0035-search-insert-position](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0035-search-insert-position) |\n| [0069-sqrtx](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0069-sqrtx) |\n| [0074-search-a-2d-matrix](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0074-search-a-2d-matrix) |\n| [0081-search-in-rotated-sorted-array-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0081-search-in-rotated-sorted-array-ii) |\n| [3312-sorted-gcd-pair-queries](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3312-sorted-gcd-pair-queries) |\n| [3501-maximize-active-section-with-trade-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3501-maximize-active-section-with-trade-ii) |\n| [3532-path-existence-queries-in-a-graph-i](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3532-path-existence-queries-in-a-graph-i) |\n| [3534-path-existence-queries-in-a-graph-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3534-path-existence-queries-in-a-graph-ii) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0004-median-of-two-sorted-arrays](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0004-median-of-two-sorted-arrays) |\n| [0023-merge-k-sorted-lists](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0023-merge-k-sorted-lists) |\n| [0053-maximum-subarray](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0053-maximum-subarray) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |\n| [0190-reverse-bits](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0190-reverse-bits) |\n## Two Pointers\n|  |\n| ------- |\n| [0005-longest-palindromic-substring](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0005-longest-palindromic-substring) |\n| [0011-container-with-most-water](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0011-container-with-most-water) |\n| [0015-3sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0015-3sum) |\n| [0016-3sum-closest](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0016-3sum-closest) |\n| [0018-4sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0018-4sum) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0027-remove-element](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0027-remove-element) |\n| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |\n| [0031-next-permutation](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0031-next-permutation) |\n| [0042-trapping-rain-water](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0042-trapping-rain-water) |\n| [0061-rotate-list](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0061-rotate-list) |\n| [0075-sort-colors](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0075-sort-colors) |\n| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0080-remove-duplicates-from-sorted-array-ii) |\n| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0082-remove-duplicates-from-sorted-list-ii) |\n| [0086-partition-list](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0086-partition-list) |\n| [0088-merge-sorted-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0088-merge-sorted-array) |\n| [3534-path-existence-queries-in-a-graph-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3534-path-existence-queries-in-a-graph-ii) |\n| [3867-sum-of-gcd-of-formed-pairs](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3867-sum-of-gcd-of-formed-pairs) |\n## String\n|  |\n| ------- |\n| [0005-longest-palindromic-substring](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0005-longest-palindromic-substring) |\n| [0006-zigzag-conversion](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0006-zigzag-conversion) |\n| [0008-string-to-integer-atoi](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0008-string-to-integer-atoi) |\n| [0010-regular-expression-matching](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0010-regular-expression-matching) |\n| [0012-integer-to-roman](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0012-integer-to-roman) |\n| [0013-roman-to-integer](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0013-roman-to-integer) |\n| [0014-longest-common-prefix](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0014-longest-common-prefix) |\n| [0017-letter-combinations-of-a-phone-number](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0017-letter-combinations-of-a-phone-number) |\n| [0020-valid-parentheses](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0020-valid-parentheses) |\n| [0022-generate-parentheses](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0022-generate-parentheses) |\n| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |\n| [0030-substring-with-concatenation-of-all-words](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0030-substring-with-concatenation-of-all-words) |\n| [0032-longest-valid-parentheses](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0032-longest-valid-parentheses) |\n| [0038-count-and-say](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0038-count-and-say) |\n| [0043-multiply-strings](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0043-multiply-strings) |\n| [0044-wildcard-matching](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0044-wildcard-matching) |\n| [0049-group-anagrams](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0049-group-anagrams) |\n| [0058-length-of-last-word](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0058-length-of-last-word) |\n| [0065-valid-number](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0065-valid-number) |\n| [0067-add-binary](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0067-add-binary) |\n| [0068-text-justification](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0068-text-justification) |\n| [0071-simplify-path](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0071-simplify-path) |\n| [0072-edit-distance](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0072-edit-distance) |\n| [0076-minimum-window-substring](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0076-minimum-window-substring) |\n| [0079-word-search](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0079-word-search) |\n| [0087-scramble-string](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0087-scramble-string) |\n| [0091-decode-ways](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0091-decode-ways) |\n| [0093-restore-ip-addresses](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0093-restore-ip-addresses) |\n| [0097-interleaving-string](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0097-interleaving-string) |\n| [0168-excel-sheet-column-title](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0168-excel-sheet-column-title) |\n| [0227-basic-calculator-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0227-basic-calculator-ii) |\n| [3499-maximize-active-section-with-trade-i](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3499-maximize-active-section-with-trade-i) |\n| [3501-maximize-active-section-with-trade-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3501-maximize-active-section-with-trade-ii) |\n| [3756-concatenate-non-zero-digits-and-multiply-by-sum-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3756-concatenate-non-zero-digits-and-multiply-by-sum-ii) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0005-longest-palindromic-substring](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0005-longest-palindromic-substring) |\n| [0010-regular-expression-matching](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0010-regular-expression-matching) |\n| [0022-generate-parentheses](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0022-generate-parentheses) |\n| [0032-longest-valid-parentheses](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0032-longest-valid-parentheses) |\n| [0042-trapping-rain-water](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0042-trapping-rain-water) |\n| [0044-wildcard-matching](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0044-wildcard-matching) |\n| [0045-jump-game-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0045-jump-game-ii) |\n| [0053-maximum-subarray](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0053-maximum-subarray) |\n| [0055-jump-game](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0055-jump-game) |\n| [0062-unique-paths](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0062-unique-paths) |\n| [0063-unique-paths-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0063-unique-paths-ii) |\n| [0064-minimum-path-sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0064-minimum-path-sum) |\n| [0070-climbing-stairs](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0070-climbing-stairs) |\n| [0072-edit-distance](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0072-edit-distance) |\n| [0085-maximal-rectangle](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0085-maximal-rectangle) |\n| [0087-scramble-string](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0087-scramble-string) |\n| [0091-decode-ways](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0091-decode-ways) |\n| [0095-unique-binary-search-trees-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0095-unique-binary-search-trees-ii) |\n| [0096-unique-binary-search-trees](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0096-unique-binary-search-trees) |\n| [0097-interleaving-string](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0097-interleaving-string) |\n| [1301-number-of-paths-with-max-score](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1301-number-of-paths-with-max-score) |\n| [3336-find-the-number-of-subsequences-with-equal-gcd](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3336-find-the-number-of-subsequences-with-equal-gcd) |\n| [3534-path-existence-queries-in-a-graph-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3534-path-existence-queries-in-a-graph-ii) |\n## Math\n|  |\n| ------- |\n| [0007-reverse-integer](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0007-reverse-integer) |\n| [0009-palindrome-number](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0009-palindrome-number) |\n| [0012-integer-to-roman](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0012-integer-to-roman) |\n| [0013-roman-to-integer](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0013-roman-to-integer) |\n| [0029-divide-two-integers](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0029-divide-two-integers) |\n| [0043-multiply-strings](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0043-multiply-strings) |\n| [0048-rotate-image](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0048-rotate-image) |\n| [0050-powx-n](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0050-powx-n) |\n| [0060-permutation-sequence](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0060-permutation-sequence) |\n| [0062-unique-paths](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0062-unique-paths) |\n| [0066-plus-one](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0066-plus-one) |\n| [0067-add-binary](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0067-add-binary) |\n| [0069-sqrtx](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0069-sqrtx) |\n| [0070-climbing-stairs](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0070-climbing-stairs) |\n| [0089-gray-code](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0089-gray-code) |\n| [0096-unique-binary-search-trees](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0096-unique-binary-search-trees) |\n| [0168-excel-sheet-column-title](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0168-excel-sheet-column-title) |\n| [0227-basic-calculator-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0227-basic-calculator-ii) |\n| [1979-find-greatest-common-divisor-of-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1979-find-greatest-common-divisor-of-array) |\n| [3312-sorted-gcd-pair-queries](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3312-sorted-gcd-pair-queries) |\n| [3336-find-the-number-of-subsequences-with-equal-gcd](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3336-find-the-number-of-subsequences-with-equal-gcd) |\n| [3658-gcd-of-odd-and-even-sums](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3658-gcd-of-odd-and-even-sums) |\n| [3754-concatenate-non-zero-digits-and-multiply-by-sum-i](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3754-concatenate-non-zero-digits-and-multiply-by-sum-i) |\n| [3756-concatenate-non-zero-digits-and-multiply-by-sum-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3756-concatenate-non-zero-digits-and-multiply-by-sum-ii) |\n| [3867-sum-of-gcd-of-formed-pairs](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3867-sum-of-gcd-of-formed-pairs) |\n## Recursion\n|  |\n| ------- |\n| [0010-regular-expression-matching](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0010-regular-expression-matching) |\n| [0021-merge-two-sorted-lists](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0021-merge-two-sorted-lists) |\n| [0025-reverse-nodes-in-k-group](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0025-reverse-nodes-in-k-group) |\n| [0044-wildcard-matching](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0044-wildcard-matching) |\n| [0050-powx-n](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0050-powx-n) |\n| [0060-permutation-sequence](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0060-permutation-sequence) |\n## Greedy\n|  |\n| ------- |\n| [0011-container-with-most-water](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0011-container-with-most-water) |\n| [0044-wildcard-matching](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0044-wildcard-matching) |\n| [0045-jump-game-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0045-jump-game-ii) |\n| [0055-jump-game](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0055-jump-game) |\n| [2126-destroying-asteroids](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2126-destroying-asteroids) |\n| [3534-path-existence-queries-in-a-graph-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3534-path-existence-queries-in-a-graph-ii) |\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0001-two-sum) |\n| [0012-integer-to-roman](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0012-integer-to-roman) |\n| [0013-roman-to-integer](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0013-roman-to-integer) |\n| [0017-letter-combinations-of-a-phone-number](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0017-letter-combinations-of-a-phone-number) |\n| [0030-substring-with-concatenation-of-all-words](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0030-substring-with-concatenation-of-all-words) |\n| [0036-valid-sudoku](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0036-valid-sudoku) |\n| [0037-sudoku-solver](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0037-sudoku-solver) |\n| [0041-first-missing-positive](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0041-first-missing-positive) |\n| [0049-group-anagrams](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0049-group-anagrams) |\n| [0073-set-matrix-zeroes](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0073-set-matrix-zeroes) |\n| [0076-minimum-window-substring](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0076-minimum-window-substring) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |\n| [0146-lru-cache](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0146-lru-cache) |\n| [3312-sorted-gcd-pair-queries](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3312-sorted-gcd-pair-queries) |\n| [3532-path-existence-queries-in-a-graph-i](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3532-path-existence-queries-in-a-graph-i) |\n## Trie\n|  |\n| ------- |\n| [0014-longest-common-prefix](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0014-longest-common-prefix) |\n## Sorting\n|  |\n| ------- |\n| [0015-3sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0015-3sum) |\n| [0016-3sum-closest](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0016-3sum-closest) |\n| [0018-4sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0018-4sum) |\n| [0047-permutations-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0047-permutations-ii) |\n| [0049-group-anagrams](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0049-group-anagrams) |\n| [0056-merge-intervals](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0056-merge-intervals) |\n| [0075-sort-colors](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0075-sort-colors) |\n| [0088-merge-sorted-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0088-merge-sorted-array) |\n| [1288-remove-covered-intervals](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1288-remove-covered-intervals) |\n| [2126-destroying-asteroids](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2126-destroying-asteroids) |\n| [3534-path-existence-queries-in-a-graph-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3534-path-existence-queries-in-a-graph-ii) |\n| [3867-sum-of-gcd-of-formed-pairs](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3867-sum-of-gcd-of-formed-pairs) |\n## Backtracking\n|  |\n| ------- |\n| [0017-letter-combinations-of-a-phone-number](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0017-letter-combinations-of-a-phone-number) |\n| [0022-generate-parentheses](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0022-generate-parentheses) |\n| [0037-sudoku-solver](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0037-sudoku-solver) |\n| [0039-combination-sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0039-combination-sum) |\n| [0040-combination-sum-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0040-combination-sum-ii) |\n| [0047-permutations-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0047-permutations-ii) |\n| [0051-n-queens](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0051-n-queens) |\n| [0052-n-queens-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0052-n-queens-ii) |\n| [0077-combinations](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0077-combinations) |\n| [0078-subsets](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0078-subsets) |\n| [0079-word-search](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0079-word-search) |\n| [0089-gray-code](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0089-gray-code) |\n| [0090-subsets-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0090-subsets-ii) |\n| [0093-restore-ip-addresses](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0093-restore-ip-addresses) |\n| [0095-unique-binary-search-trees-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0095-unique-binary-search-trees-ii) |\n## Linked List\n|  |\n| ------- |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0021-merge-two-sorted-lists](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0021-merge-two-sorted-lists) |\n| [0023-merge-k-sorted-lists](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0023-merge-k-sorted-lists) |\n| [0025-reverse-nodes-in-k-group](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0025-reverse-nodes-in-k-group) |\n| [0061-rotate-list](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0061-rotate-list) |\n| [0082-remove-duplicates-from-sorted-list-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0082-remove-duplicates-from-sorted-list-ii) |\n| [0083-remove-duplicates-from-sorted-list](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0083-remove-duplicates-from-sorted-list) |\n| [0086-partition-list](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0086-partition-list) |\n| [0092-reverse-linked-list-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0092-reverse-linked-list-ii) |\n| [0146-lru-cache](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0146-lru-cache) |\n## Heap (Priority Queue)\n|  |\n| ------- |\n| [0023-merge-k-sorted-lists](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0023-merge-k-sorted-lists) |\n## Merge Sort\n|  |\n| ------- |\n| [0023-merge-k-sorted-lists](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0023-merge-k-sorted-lists) |\n## Depth-First Search\n|  |\n| ------- |\n| [0079-word-search](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0079-word-search) |\n| [0094-binary-tree-inorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0094-binary-tree-inorder-traversal) |\n| [0098-validate-binary-search-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0098-validate-binary-search-tree) |\n| [0099-recover-binary-search-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0099-recover-binary-search-tree) |\n| [0100-same-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0101-symmetric-tree) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0129-sum-root-to-leaf-numbers](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0129-sum-root-to-leaf-numbers) |\n| [0200-number-of-islands](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0200-number-of-islands) |\n| [2492-minimum-score-of-a-path-between-two-cities](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2492-minimum-score-of-a-path-between-two-cities) |\n| [2685-count-the-number-of-complete-components](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2685-count-the-number-of-complete-components) |\n## Breadth-First Search\n|  |\n| ------- |\n| [0100-same-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0101-symmetric-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0107-binary-tree-level-order-traversal-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0107-binary-tree-level-order-traversal-ii) |\n| [0200-number-of-islands](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0200-number-of-islands) |\n| [2492-minimum-score-of-a-path-between-two-cities](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2492-minimum-score-of-a-path-between-two-cities) |\n| [2685-count-the-number-of-complete-components](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2685-count-the-number-of-complete-components) |\n## Union-Find\n|  |\n| ------- |\n| [0200-number-of-islands](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0200-number-of-islands) |\n| [2492-minimum-score-of-a-path-between-two-cities](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2492-minimum-score-of-a-path-between-two-cities) |\n| [2685-count-the-number-of-complete-components](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2685-count-the-number-of-complete-components) |\n| [3532-path-existence-queries-in-a-graph-i](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3532-path-existence-queries-in-a-graph-i) |\n## Matrix\n|  |\n| ------- |\n| [0036-valid-sudoku](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0036-valid-sudoku) |\n| [0037-sudoku-solver](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0037-sudoku-solver) |\n| [0048-rotate-image](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0048-rotate-image) |\n| [0054-spiral-matrix](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0054-spiral-matrix) |\n| [0059-spiral-matrix-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0059-spiral-matrix-ii) |\n| [0063-unique-paths-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0063-unique-paths-ii) |\n| [0064-minimum-path-sum](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0064-minimum-path-sum) |\n| [0073-set-matrix-zeroes](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0073-set-matrix-zeroes) |\n| [0074-search-a-2d-matrix](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0074-search-a-2d-matrix) |\n| [0079-word-search](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0079-word-search) |\n| [0085-maximal-rectangle](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0085-maximal-rectangle) |\n| [0200-number-of-islands](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0200-number-of-islands) |\n| [1260-shift-2d-grid](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1260-shift-2d-grid) |\n| [1301-number-of-paths-with-max-score](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1301-number-of-paths-with-max-score) |\n## Design\n|  |\n| ------- |\n| [0146-lru-cache](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0146-lru-cache) |\n## Doubly-Linked List\n|  |\n| ------- |\n| [0146-lru-cache](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0146-lru-cache) |\n## Prefix Sum\n|  |\n| ------- |\n| [3312-sorted-gcd-pair-queries](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3312-sorted-gcd-pair-queries) |\n| [3756-concatenate-non-zero-digits-and-multiply-by-sum-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3756-concatenate-non-zero-digits-and-multiply-by-sum-ii) |\n## Graph Theory\n|  |\n| ------- |\n| [2492-minimum-score-of-a-path-between-two-cities](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2492-minimum-score-of-a-path-between-two-cities) |\n| [2685-count-the-number-of-complete-components](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/2685-count-the-number-of-complete-components) |\n| [3532-path-existence-queries-in-a-graph-i](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3532-path-existence-queries-in-a-graph-i) |\n| [3534-path-existence-queries-in-a-graph-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3534-path-existence-queries-in-a-graph-ii) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0029-divide-two-integers](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0029-divide-two-integers) |\n| [0067-add-binary](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0067-add-binary) |\n| [0078-subsets](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0078-subsets) |\n| [0089-gray-code](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0089-gray-code) |\n| [0090-subsets-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0090-subsets-ii) |\n| [0190-reverse-bits](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0190-reverse-bits) |\n| [3534-path-existence-queries-in-a-graph-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3534-path-existence-queries-in-a-graph-ii) |\n## Stack\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0020-valid-parentheses) |\n| [0032-longest-valid-parentheses](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0032-longest-valid-parentheses) |\n| [0042-trapping-rain-water](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0042-trapping-rain-water) |\n| [0071-simplify-path](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0071-simplify-path) |\n| [0084-largest-rectangle-in-histogram](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0084-largest-rectangle-in-histogram) |\n| [0085-maximal-rectangle](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0085-maximal-rectangle) |\n| [0094-binary-tree-inorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0094-binary-tree-inorder-traversal) |\n| [0227-basic-calculator-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0227-basic-calculator-ii) |\n## Enumeration\n|  |\n| ------- |\n| [1291-sequential-digits](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1291-sequential-digits) |\n| [3499-maximize-active-section-with-trade-i](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3499-maximize-active-section-with-trade-i) |\n## Number Theory\n|  |\n| ------- |\n| [1979-find-greatest-common-divisor-of-array](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1979-find-greatest-common-divisor-of-array) |\n| [3312-sorted-gcd-pair-queries](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3312-sorted-gcd-pair-queries) |\n| [3336-find-the-number-of-subsequences-with-equal-gcd](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3336-find-the-number-of-subsequences-with-equal-gcd) |\n| [3658-gcd-of-odd-and-even-sums](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3658-gcd-of-odd-and-even-sums) |\n| [3867-sum-of-gcd-of-formed-pairs](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3867-sum-of-gcd-of-formed-pairs) |\n## Simulation\n|  |\n| ------- |\n| [0043-multiply-strings](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0043-multiply-strings) |\n| [0054-spiral-matrix](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0054-spiral-matrix) |\n| [0059-spiral-matrix-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0059-spiral-matrix-ii) |\n| [0067-add-binary](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0067-add-binary) |\n| [0068-text-justification](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0068-text-justification) |\n| [1260-shift-2d-grid](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/1260-shift-2d-grid) |\n| [3867-sum-of-gcd-of-formed-pairs](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3867-sum-of-gcd-of-formed-pairs) |\n## Combinatorics\n|  |\n| ------- |\n| [0062-unique-paths](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0062-unique-paths) |\n| [3312-sorted-gcd-pair-queries](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3312-sorted-gcd-pair-queries) |\n## Counting\n|  |\n| ------- |\n| [3312-sorted-gcd-pair-queries](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3312-sorted-gcd-pair-queries) |\n## Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0094-binary-tree-inorder-traversal) |\n| [0095-unique-binary-search-trees-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0095-unique-binary-search-trees-ii) |\n| [0096-unique-binary-search-trees](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0096-unique-binary-search-trees) |\n| [0098-validate-binary-search-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0098-validate-binary-search-tree) |\n| [0099-recover-binary-search-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0099-recover-binary-search-tree) |\n| [0100-same-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0101-symmetric-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |\n| [0107-binary-tree-level-order-traversal-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0107-binary-tree-level-order-traversal-ii) |\n| [0129-sum-root-to-leaf-numbers](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0129-sum-root-to-leaf-numbers) |\n## Binary Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0094-binary-tree-inorder-traversal) |\n| [0095-unique-binary-search-trees-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0095-unique-binary-search-trees-ii) |\n| [0096-unique-binary-search-trees](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0096-unique-binary-search-trees) |\n| [0098-validate-binary-search-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0098-validate-binary-search-tree) |\n| [0099-recover-binary-search-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0099-recover-binary-search-tree) |\n| [0100-same-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0101-symmetric-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0106-construct-binary-tree-from-inorder-and-postorder-traversal](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0106-construct-binary-tree-from-inorder-and-postorder-traversal) |\n| [0107-binary-tree-level-order-traversal-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0107-binary-tree-level-order-traversal-ii) |\n| [0129-sum-root-to-leaf-numbers](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0129-sum-root-to-leaf-numbers) |\n## Memoization\n|  |\n| ------- |\n| [0070-climbing-stairs](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0070-climbing-stairs) |\n## Segment Tree\n|  |\n| ------- |\n| [3501-maximize-active-section-with-trade-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/3501-maximize-active-section-with-trade-ii) |\n## String Matching\n|  |\n| ------- |\n| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |\n## Sliding Window\n|  |\n| ------- |\n| [0030-substring-with-concatenation-of-all-words](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0030-substring-with-concatenation-of-all-words) |\n| [0076-minimum-window-substring](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0076-minimum-window-substring) |\n## Binary Search Tree\n|  |\n| ------- |\n| [0095-unique-binary-search-trees-ii](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0095-unique-binary-search-trees-ii) |\n| [0096-unique-binary-search-trees](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0096-unique-binary-search-trees) |\n| [0098-validate-binary-search-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0098-validate-binary-search-tree) |\n| [0099-recover-binary-search-tree](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0099-recover-binary-search-tree) |\n## Monotonic Stack\n|  |\n| ------- |\n| [0042-trapping-rain-water](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0042-trapping-rain-water) |\n| [0084-largest-rectangle-in-histogram](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0084-largest-rectangle-in-histogram) |\n| [0085-maximal-rectangle](https://github.com/karthikrshet/Karthik-LeetCode-Solutions/tree/master/0085-maximal-rectangle) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkarthikrshet%2Fkarthik-leetcode-solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkarthikrshet%2Fkarthik-leetcode-solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkarthikrshet%2Fkarthik-leetcode-solutions/lists"}