{"id":20524898,"url":"https://github.com/gobinath-b/leetcode-solutions","last_synced_at":"2025-08-14T08:11:50.362Z","repository":{"id":256770728,"uuid":"856340273","full_name":"Gobinath-B/LeetCode-Solutions","owner":"Gobinath-B","description":"Here i shared my leetcode solutions and notes","archived":false,"fork":false,"pushed_at":"2025-04-06T08:31:55.000Z","size":202,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-06T09:19:08.627Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"https://leetcode.com/u/Gobinath-Boopathiraj/","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/Gobinath-B.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":"2024-09-12T12:18:17.000Z","updated_at":"2025-04-06T08:31:57.000Z","dependencies_parsed_at":"2025-01-07T06:26:02.745Z","dependency_job_id":"95eecd04-46bb-47fe-babb-c47efd13ec16","html_url":"https://github.com/Gobinath-B/LeetCode-Solutions","commit_stats":null,"previous_names":["gobinath-b/leetcode-solutions"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Gobinath-B/LeetCode-Solutions","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gobinath-B%2FLeetCode-Solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gobinath-B%2FLeetCode-Solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gobinath-B%2FLeetCode-Solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gobinath-B%2FLeetCode-Solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Gobinath-B","download_url":"https://codeload.github.com/Gobinath-B/LeetCode-Solutions/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gobinath-B%2FLeetCode-Solutions/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":270385467,"owners_count":24574556,"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","status":"online","status_checked_at":"2025-08-14T02:00:10.309Z","response_time":75,"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":[],"created_at":"2024-11-15T22:53:38.255Z","updated_at":"2025-08-14T08:11:50.335Z","avatar_url":"https://github.com/Gobinath-B.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# https-github.com-Gobinath-B-LeetCode-Solutions\n\n\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Math\n|  |\n| ------- |\n| [0066-plus-one](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0066-plus-one) |\n| [0189-rotate-array](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0189-rotate-array) |\n| [0241-different-ways-to-add-parentheses](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0241-different-ways-to-add-parentheses) |\n| [0273-integer-to-english-words](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0273-integer-to-english-words) |\n| [0398-random-pick-index](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0398-random-pick-index) |\n| [0405-convert-a-number-to-hexadecimal](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0405-convert-a-number-to-hexadecimal) |\n| [0539-minimum-time-difference](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0539-minimum-time-difference) |\n| [2871-double-a-number-represented-as-a-linked-list](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2871-double-a-number-represented-as-a-linked-list) |\n| [3553-check-if-two-chessboard-squares-have-the-same-color](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/3553-check-if-two-chessboard-squares-have-the-same-color) |\n## String\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0020-valid-parentheses) |\n| [0179-largest-number](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0179-largest-number) |\n| [0214-shortest-palindrome](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0214-shortest-palindrome) |\n| [0241-different-ways-to-add-parentheses](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0241-different-ways-to-add-parentheses) |\n| [0273-integer-to-english-words](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0273-integer-to-english-words) |\n| [0539-minimum-time-difference](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0539-minimum-time-difference) |\n| [0696-count-binary-substrings](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0696-count-binary-substrings) |\n| [0920-uncommon-words-from-two-sentences](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0920-uncommon-words-from-two-sentences) |\n| [0953-reverse-only-letters](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0953-reverse-only-letters) |\n| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |\n| [2494-sum-of-prefix-scores-of-strings](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2494-sum-of-prefix-scores-of-strings) |\n| [2755-extra-characters-in-a-string](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2755-extra-characters-in-a-string) |\n| [2886-faulty-keyboard](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2886-faulty-keyboard) |\n| [3329-find-the-length-of-the-longest-common-prefix](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/3329-find-the-length-of-the-longest-common-prefix) |\n| [3553-check-if-two-chessboard-squares-have-the-same-color](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/3553-check-if-two-chessboard-squares-have-the-same-color) |\n## Array\n|  |\n| ------- |\n| [0039-combination-sum](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0039-combination-sum) |\n| [0046-permutations](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0046-permutations) |\n| [0066-plus-one](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0066-plus-one) |\n| [0074-search-a-2d-matrix](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0074-search-a-2d-matrix) |\n| [0078-subsets](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0078-subsets) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0134-gas-station](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0134-gas-station) |\n| [0162-find-peak-element](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0162-find-peak-element) |\n| [0179-largest-number](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0179-largest-number) |\n| [0189-rotate-array](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0189-rotate-array) |\n| [0539-minimum-time-difference](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0539-minimum-time-difference) |\n| [0729-my-calendar-i](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0729-my-calendar-i) |\n| [0731-my-calendar-ii](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0731-my-calendar-ii) |\n| [0859-design-circular-deque](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0859-design-circular-deque) |\n| [1039-find-the-town-judge](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/1039-find-the-town-judge) |\n| [1435-xor-queries-of-a-subarray](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/1435-xor-queries-of-a-subarray) |\n| [1675-magnetic-force-between-two-balls](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/1675-magnetic-force-between-two-balls) |\n| [2494-sum-of-prefix-scores-of-strings](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2494-sum-of-prefix-scores-of-strings) |\n| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |\n| [2755-extra-characters-in-a-string](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2755-extra-characters-in-a-string) |\n| [3221-find-the-peaks](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/3221-find-the-peaks) |\n| [3329-find-the-length-of-the-longest-common-prefix](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/3329-find-the-length-of-the-longest-common-prefix) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0241-different-ways-to-add-parentheses](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0241-different-ways-to-add-parentheses) |\n| [2755-extra-characters-in-a-string](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2755-extra-characters-in-a-string) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0078-subsets](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0078-subsets) |\n| [0405-convert-a-number-to-hexadecimal](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0405-convert-a-number-to-hexadecimal) |\n| [1435-xor-queries-of-a-subarray](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/1435-xor-queries-of-a-subarray) |\n| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |\n| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |\n## Prefix Sum\n|  |\n| ------- |\n| [0731-my-calendar-ii](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0731-my-calendar-ii) |\n| [1435-xor-queries-of-a-subarray](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/1435-xor-queries-of-a-subarray) |\n| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |\n## Brainteaser\n|  |\n| ------- |\n| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |\n## Hash Table\n|  |\n| ------- |\n| [0142-linked-list-cycle-ii](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0142-linked-list-cycle-ii) |\n| [0160-intersection-of-two-linked-lists](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0160-intersection-of-two-linked-lists) |\n| [0398-random-pick-index](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0398-random-pick-index) |\n| [0432-all-oone-data-structure](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0432-all-oone-data-structure) |\n| [0920-uncommon-words-from-two-sentences](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0920-uncommon-words-from-two-sentences) |\n| [1039-find-the-town-judge](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/1039-find-the-town-judge) |\n| [1473-find-the-longest-substring-containing-vowels-in-even-counts](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/1473-find-the-longest-substring-containing-vowels-in-even-counts) |\n| [2755-extra-characters-in-a-string](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2755-extra-characters-in-a-string) |\n| [3329-find-the-length-of-the-longest-common-prefix](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/3329-find-the-length-of-the-longest-common-prefix) |\n## Sorting\n|  |\n| ------- |\n| [0179-largest-number](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0179-largest-number) |\n| [0539-minimum-time-difference](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0539-minimum-time-difference) |\n| [1675-magnetic-force-between-two-balls](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/1675-magnetic-force-between-two-balls) |\n## Counting\n|  |\n| ------- |\n| [0920-uncommon-words-from-two-sentences](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0920-uncommon-words-from-two-sentences) |\n| [2494-sum-of-prefix-scores-of-strings](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2494-sum-of-prefix-scores-of-strings) |\n## Greedy\n|  |\n| ------- |\n| [0134-gas-station](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0134-gas-station) |\n| [0179-largest-number](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0179-largest-number) |\n## Recursion\n|  |\n| ------- |\n| [0021-merge-two-sorted-lists](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0021-merge-two-sorted-lists) |\n| [0241-different-ways-to-add-parentheses](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0241-different-ways-to-add-parentheses) |\n| [0273-integer-to-english-words](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0273-integer-to-english-words) |\n## Memoization\n|  |\n| ------- |\n| [0241-different-ways-to-add-parentheses](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0241-different-ways-to-add-parentheses) |\n## Rolling Hash\n|  |\n| ------- |\n| [0214-shortest-palindrome](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0214-shortest-palindrome) |\n## String Matching\n|  |\n| ------- |\n| [0214-shortest-palindrome](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0214-shortest-palindrome) |\n## Hash Function\n|  |\n| ------- |\n| [0214-shortest-palindrome](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0214-shortest-palindrome) |\n## Depth-First Search\n|  |\n| ------- |\n| [0386-lexicographical-numbers](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0386-lexicographical-numbers) |\n| [2121-find-if-path-exists-in-graph](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2121-find-if-path-exists-in-graph) |\n## Trie\n|  |\n| ------- |\n| [0386-lexicographical-numbers](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0386-lexicographical-numbers) |\n| [0440-k-th-smallest-in-lexicographical-order](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0440-k-th-smallest-in-lexicographical-order) |\n| [2494-sum-of-prefix-scores-of-strings](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2494-sum-of-prefix-scores-of-strings) |\n| [2755-extra-characters-in-a-string](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2755-extra-characters-in-a-string) |\n| [3329-find-the-length-of-the-longest-common-prefix](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/3329-find-the-length-of-the-longest-common-prefix) |\n## Reservoir Sampling\n|  |\n| ------- |\n| [0398-random-pick-index](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0398-random-pick-index) |\n## Randomized\n|  |\n| ------- |\n| [0398-random-pick-index](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0398-random-pick-index) |\n## Binary Search\n|  |\n| ------- |\n| [0074-search-a-2d-matrix](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0074-search-a-2d-matrix) |\n| [0162-find-peak-element](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0162-find-peak-element) |\n| [0729-my-calendar-i](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0729-my-calendar-i) |\n| [0731-my-calendar-ii](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0731-my-calendar-ii) |\n| [1675-magnetic-force-between-two-balls](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/1675-magnetic-force-between-two-balls) |\n## Matrix\n|  |\n| ------- |\n| [0074-search-a-2d-matrix](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0074-search-a-2d-matrix) |\n## Design\n|  |\n| ------- |\n| [0432-all-oone-data-structure](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0432-all-oone-data-structure) |\n| [0729-my-calendar-i](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0729-my-calendar-i) |\n| [0731-my-calendar-ii](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0731-my-calendar-ii) |\n| [0859-design-circular-deque](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0859-design-circular-deque) |\n## Segment Tree\n|  |\n| ------- |\n| [0729-my-calendar-i](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0729-my-calendar-i) |\n| [0731-my-calendar-ii](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0731-my-calendar-ii) |\n## Ordered Set\n|  |\n| ------- |\n| [0729-my-calendar-i](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0729-my-calendar-i) |\n| [0731-my-calendar-ii](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0731-my-calendar-ii) |\n## Two Pointers\n|  |\n| ------- |\n| [0142-linked-list-cycle-ii](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0142-linked-list-cycle-ii) |\n| [0160-intersection-of-two-linked-lists](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0160-intersection-of-two-linked-lists) |\n| [0189-rotate-array](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0189-rotate-array) |\n| [0696-count-binary-substrings](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0696-count-binary-substrings) |\n| [0953-reverse-only-letters](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0953-reverse-only-letters) |\n| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2216-delete-the-middle-node-of-a-linked-list) |\n## Linked List\n|  |\n| ------- |\n| [0021-merge-two-sorted-lists](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0021-merge-two-sorted-lists) |\n| [0142-linked-list-cycle-ii](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0142-linked-list-cycle-ii) |\n| [0160-intersection-of-two-linked-lists](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0160-intersection-of-two-linked-lists) |\n| [0328-odd-even-linked-list](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0328-odd-even-linked-list) |\n| [0432-all-oone-data-structure](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0432-all-oone-data-structure) |\n| [0859-design-circular-deque](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0859-design-circular-deque) |\n| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2216-delete-the-middle-node-of-a-linked-list) |\n| [2871-double-a-number-represented-as-a-linked-list](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2871-double-a-number-represented-as-a-linked-list) |\n## Doubly-Linked List\n|  |\n| ------- |\n| [0432-all-oone-data-structure](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0432-all-oone-data-structure) |\n## Queue\n|  |\n| ------- |\n| [0859-design-circular-deque](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0859-design-circular-deque) |\n## Stack\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0020-valid-parentheses) |\n| [2871-double-a-number-represented-as-a-linked-list](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2871-double-a-number-represented-as-a-linked-list) |\n## Breadth-First Search\n|  |\n| ------- |\n| [2121-find-if-path-exists-in-graph](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2121-find-if-path-exists-in-graph) |\n## Union Find\n|  |\n| ------- |\n| [2121-find-if-path-exists-in-graph](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2121-find-if-path-exists-in-graph) |\n## Graph\n|  |\n| ------- |\n| [1039-find-the-town-judge](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/1039-find-the-town-judge) |\n| [2121-find-if-path-exists-in-graph](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2121-find-if-path-exists-in-graph) |\n## Backtracking\n|  |\n| ------- |\n| [0039-combination-sum](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0039-combination-sum) |\n| [0046-permutations](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0046-permutations) |\n| [0078-subsets](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/0078-subsets) |\n## Enumeration\n|  |\n| ------- |\n| [3221-find-the-peaks](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/3221-find-the-peaks) |\n## Simulation\n|  |\n| ------- |\n| [2886-faulty-keyboard](https://github.com/Gobinath-B/https-github.com-Gobinath-B-LeetCode-Solutions/tree/master/2886-faulty-keyboard) |\n\u003c!---LeetCode Topics End--\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgobinath-b%2Fleetcode-solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgobinath-b%2Fleetcode-solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgobinath-b%2Fleetcode-solutions/lists"}