{"id":19112407,"url":"https://github.com/beki78/leetcode","last_synced_at":"2025-08-18T17:06:22.915Z","repository":{"id":251490146,"uuid":"822407404","full_name":"Beki78/LeetCode","owner":"Beki78","description":"My leetcode solutions","archived":false,"fork":false,"pushed_at":"2024-11-18T17:57:27.000Z","size":184,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-22T11:32:39.420Z","etag":null,"topics":[],"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/Beki78.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-07-01T05:17:08.000Z","updated_at":"2025-01-19T11:31:18.000Z","dependencies_parsed_at":"2024-08-03T12:44:21.576Z","dependency_job_id":"e988160b-76c4-4ef1-aba6-668c570c374f","html_url":"https://github.com/Beki78/LeetCode","commit_stats":null,"previous_names":["beki78/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Beki78/LeetCode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Beki78%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Beki78%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Beki78%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Beki78%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Beki78","download_url":"https://codeload.github.com/Beki78/LeetCode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Beki78%2FLeetCode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":271027687,"owners_count":24687082,"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-18T02:00:08.743Z","response_time":89,"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-09T04:33:02.010Z","updated_at":"2025-08-18T17:06:22.841Z","avatar_url":"https://github.com/Beki78.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/Beki78/LeetCode/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0027-remove-element](https://github.com/Beki78/LeetCode/tree/master/0027-remove-element) |\n| [0035-search-insert-position](https://github.com/Beki78/LeetCode/tree/master/0035-search-insert-position) |\n| [0066-plus-one](https://github.com/Beki78/LeetCode/tree/master/0066-plus-one) |\n| [0078-subsets](https://github.com/Beki78/LeetCode/tree/master/0078-subsets) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Beki78/LeetCode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0119-pascals-triangle-ii](https://github.com/Beki78/LeetCode/tree/master/0119-pascals-triangle-ii) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/Beki78/LeetCode/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0169-majority-element](https://github.com/Beki78/LeetCode/tree/master/0169-majority-element) |\n| [0228-summary-ranges](https://github.com/Beki78/LeetCode/tree/master/0228-summary-ranges) |\n| [0643-maximum-average-subarray-i](https://github.com/Beki78/LeetCode/tree/master/0643-maximum-average-subarray-i) |\n| [0682-baseball-game](https://github.com/Beki78/LeetCode/tree/master/0682-baseball-game) |\n| [0739-daily-temperatures](https://github.com/Beki78/LeetCode/tree/master/0739-daily-temperatures) |\n| [1019-squares-of-a-sorted-array](https://github.com/Beki78/LeetCode/tree/master/1019-squares-of-a-sorted-array) |\n| [1044-find-common-characters](https://github.com/Beki78/LeetCode/tree/master/1044-find-common-characters) |\n| [1421-find-numbers-with-even-number-of-digits](https://github.com/Beki78/LeetCode/tree/master/1421-find-numbers-with-even-number-of-digits) |\n| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/Beki78/LeetCode/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |\n| [1603-running-sum-of-1d-array](https://github.com/Beki78/LeetCode/tree/master/1603-running-sum-of-1d-array) |\n| [1635-number-of-good-pairs](https://github.com/Beki78/LeetCode/tree/master/1635-number-of-good-pairs) |\n| [2350-find-closest-number-to-zero](https://github.com/Beki78/LeetCode/tree/master/2350-find-closest-number-to-zero) |\n| [2442-number-of-arithmetic-triplets](https://github.com/Beki78/LeetCode/tree/master/2442-number-of-arithmetic-triplets) |\n| [2714-left-and-right-sum-differences](https://github.com/Beki78/LeetCode/tree/master/2714-left-and-right-sum-differences) |\n| [3515-find-if-digit-game-can-be-won](https://github.com/Beki78/LeetCode/tree/master/3515-find-if-digit-game-can-be-won) |\n## Hash Table\n|  |\n| ------- |\n| [0013-roman-to-integer](https://github.com/Beki78/LeetCode/tree/master/0013-roman-to-integer) |\n| [0169-majority-element](https://github.com/Beki78/LeetCode/tree/master/0169-majority-element) |\n| [0202-happy-number](https://github.com/Beki78/LeetCode/tree/master/0202-happy-number) |\n| [0383-ransom-note](https://github.com/Beki78/LeetCode/tree/master/0383-ransom-note) |\n| [0782-jewels-and-stones](https://github.com/Beki78/LeetCode/tree/master/0782-jewels-and-stones) |\n| [1044-find-common-characters](https://github.com/Beki78/LeetCode/tree/master/1044-find-common-characters) |\n| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/Beki78/LeetCode/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |\n| [1635-number-of-good-pairs](https://github.com/Beki78/LeetCode/tree/master/1635-number-of-good-pairs) |\n| [2427-first-letter-to-appear-twice](https://github.com/Beki78/LeetCode/tree/master/2427-first-letter-to-appear-twice) |\n| [2442-number-of-arithmetic-triplets](https://github.com/Beki78/LeetCode/tree/master/2442-number-of-arithmetic-triplets) |\n## Math\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/Beki78/LeetCode/tree/master/0002-add-two-numbers) |\n| [0013-roman-to-integer](https://github.com/Beki78/LeetCode/tree/master/0013-roman-to-integer) |\n| [0029-divide-two-integers](https://github.com/Beki78/LeetCode/tree/master/0029-divide-two-integers) |\n| [0066-plus-one](https://github.com/Beki78/LeetCode/tree/master/0066-plus-one) |\n| [0067-add-binary](https://github.com/Beki78/LeetCode/tree/master/0067-add-binary) |\n| [0070-climbing-stairs](https://github.com/Beki78/LeetCode/tree/master/0070-climbing-stairs) |\n| [0202-happy-number](https://github.com/Beki78/LeetCode/tree/master/0202-happy-number) |\n| [1635-number-of-good-pairs](https://github.com/Beki78/LeetCode/tree/master/1635-number-of-good-pairs) |\n| [3515-find-if-digit-game-can-be-won](https://github.com/Beki78/LeetCode/tree/master/3515-find-if-digit-game-can-be-won) |\n## Counting\n|  |\n| ------- |\n| [0169-majority-element](https://github.com/Beki78/LeetCode/tree/master/0169-majority-element) |\n| [0383-ransom-note](https://github.com/Beki78/LeetCode/tree/master/0383-ransom-note) |\n| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/Beki78/LeetCode/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |\n| [1635-number-of-good-pairs](https://github.com/Beki78/LeetCode/tree/master/1635-number-of-good-pairs) |\n| [2427-first-letter-to-appear-twice](https://github.com/Beki78/LeetCode/tree/master/2427-first-letter-to-appear-twice) |\n## Two Pointers\n|  |\n| ------- |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/Beki78/LeetCode/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0027-remove-element](https://github.com/Beki78/LeetCode/tree/master/0027-remove-element) |\n| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/Beki78/LeetCode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |\n| [0125-valid-palindrome](https://github.com/Beki78/LeetCode/tree/master/0125-valid-palindrome) |\n| [0202-happy-number](https://github.com/Beki78/LeetCode/tree/master/0202-happy-number) |\n| [0344-reverse-string](https://github.com/Beki78/LeetCode/tree/master/0344-reverse-string) |\n| [0392-is-subsequence](https://github.com/Beki78/LeetCode/tree/master/0392-is-subsequence) |\n| [0874-backspace-string-compare](https://github.com/Beki78/LeetCode/tree/master/0874-backspace-string-compare) |\n| [1019-squares-of-a-sorted-array](https://github.com/Beki78/LeetCode/tree/master/1019-squares-of-a-sorted-array) |\n| [1894-merge-strings-alternately](https://github.com/Beki78/LeetCode/tree/master/1894-merge-strings-alternately) |\n| [2442-number-of-arithmetic-triplets](https://github.com/Beki78/LeetCode/tree/master/2442-number-of-arithmetic-triplets) |\n## Enumeration\n|  |\n| ------- |\n| [2442-number-of-arithmetic-triplets](https://github.com/Beki78/LeetCode/tree/master/2442-number-of-arithmetic-triplets) |\n## Sorting\n|  |\n| ------- |\n| [0169-majority-element](https://github.com/Beki78/LeetCode/tree/master/0169-majority-element) |\n| [1019-squares-of-a-sorted-array](https://github.com/Beki78/LeetCode/tree/master/1019-squares-of-a-sorted-array) |\n| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/Beki78/LeetCode/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |\n## String\n|  |\n| ------- |\n| [0006-zigzag-conversion](https://github.com/Beki78/LeetCode/tree/master/0006-zigzag-conversion) |\n| [0013-roman-to-integer](https://github.com/Beki78/LeetCode/tree/master/0013-roman-to-integer) |\n| [0014-longest-common-prefix](https://github.com/Beki78/LeetCode/tree/master/0014-longest-common-prefix) |\n| [0020-valid-parentheses](https://github.com/Beki78/LeetCode/tree/master/0020-valid-parentheses) |\n| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/Beki78/LeetCode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |\n| [0058-length-of-last-word](https://github.com/Beki78/LeetCode/tree/master/0058-length-of-last-word) |\n| [0067-add-binary](https://github.com/Beki78/LeetCode/tree/master/0067-add-binary) |\n| [0125-valid-palindrome](https://github.com/Beki78/LeetCode/tree/master/0125-valid-palindrome) |\n| [0344-reverse-string](https://github.com/Beki78/LeetCode/tree/master/0344-reverse-string) |\n| [0383-ransom-note](https://github.com/Beki78/LeetCode/tree/master/0383-ransom-note) |\n| [0392-is-subsequence](https://github.com/Beki78/LeetCode/tree/master/0392-is-subsequence) |\n| [0782-jewels-and-stones](https://github.com/Beki78/LeetCode/tree/master/0782-jewels-and-stones) |\n| [0874-backspace-string-compare](https://github.com/Beki78/LeetCode/tree/master/0874-backspace-string-compare) |\n| [1044-find-common-characters](https://github.com/Beki78/LeetCode/tree/master/1044-find-common-characters) |\n| [1128-remove-all-adjacent-duplicates-in-string](https://github.com/Beki78/LeetCode/tree/master/1128-remove-all-adjacent-duplicates-in-string) |\n| [1894-merge-strings-alternately](https://github.com/Beki78/LeetCode/tree/master/1894-merge-strings-alternately) |\n| [2427-first-letter-to-appear-twice](https://github.com/Beki78/LeetCode/tree/master/2427-first-letter-to-appear-twice) |\n## Stack\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/Beki78/LeetCode/tree/master/0020-valid-parentheses) |\n| [0094-binary-tree-inorder-traversal](https://github.com/Beki78/LeetCode/tree/master/0094-binary-tree-inorder-traversal) |\n| [0682-baseball-game](https://github.com/Beki78/LeetCode/tree/master/0682-baseball-game) |\n| [0739-daily-temperatures](https://github.com/Beki78/LeetCode/tree/master/0739-daily-temperatures) |\n| [0874-backspace-string-compare](https://github.com/Beki78/LeetCode/tree/master/0874-backspace-string-compare) |\n| [1128-remove-all-adjacent-duplicates-in-string](https://github.com/Beki78/LeetCode/tree/master/1128-remove-all-adjacent-duplicates-in-string) |\n## Simulation\n|  |\n| ------- |\n| [0067-add-binary](https://github.com/Beki78/LeetCode/tree/master/0067-add-binary) |\n| [0682-baseball-game](https://github.com/Beki78/LeetCode/tree/master/0682-baseball-game) |\n| [0874-backspace-string-compare](https://github.com/Beki78/LeetCode/tree/master/0874-backspace-string-compare) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Beki78/LeetCode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0169-majority-element](https://github.com/Beki78/LeetCode/tree/master/0169-majority-element) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0029-divide-two-integers](https://github.com/Beki78/LeetCode/tree/master/0029-divide-two-integers) |\n| [0067-add-binary](https://github.com/Beki78/LeetCode/tree/master/0067-add-binary) |\n| [0078-subsets](https://github.com/Beki78/LeetCode/tree/master/0078-subsets) |\n| [2427-first-letter-to-appear-twice](https://github.com/Beki78/LeetCode/tree/master/2427-first-letter-to-appear-twice) |\n## Monotonic Stack\n|  |\n| ------- |\n| [0739-daily-temperatures](https://github.com/Beki78/LeetCode/tree/master/0739-daily-temperatures) |\n## Prefix Sum\n|  |\n| ------- |\n| [1603-running-sum-of-1d-array](https://github.com/Beki78/LeetCode/tree/master/1603-running-sum-of-1d-array) |\n| [2714-left-and-right-sum-differences](https://github.com/Beki78/LeetCode/tree/master/2714-left-and-right-sum-differences) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0070-climbing-stairs](https://github.com/Beki78/LeetCode/tree/master/0070-climbing-stairs) |\n| [0119-pascals-triangle-ii](https://github.com/Beki78/LeetCode/tree/master/0119-pascals-triangle-ii) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/Beki78/LeetCode/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0392-is-subsequence](https://github.com/Beki78/LeetCode/tree/master/0392-is-subsequence) |\n## Sliding Window\n|  |\n| ------- |\n| [0643-maximum-average-subarray-i](https://github.com/Beki78/LeetCode/tree/master/0643-maximum-average-subarray-i) |\n## Linked List\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/Beki78/LeetCode/tree/master/0002-add-two-numbers) |\n| [0021-merge-two-sorted-lists](https://github.com/Beki78/LeetCode/tree/master/0021-merge-two-sorted-lists) |\n| [0083-remove-duplicates-from-sorted-list](https://github.com/Beki78/LeetCode/tree/master/0083-remove-duplicates-from-sorted-list) |\n## Recursion\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/Beki78/LeetCode/tree/master/0002-add-two-numbers) |\n| [0021-merge-two-sorted-lists](https://github.com/Beki78/LeetCode/tree/master/0021-merge-two-sorted-lists) |\n## Binary Search\n|  |\n| ------- |\n| [0035-search-insert-position](https://github.com/Beki78/LeetCode/tree/master/0035-search-insert-position) |\n## String Matching\n|  |\n| ------- |\n| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/Beki78/LeetCode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |\n## Memoization\n|  |\n| ------- |\n| [0070-climbing-stairs](https://github.com/Beki78/LeetCode/tree/master/0070-climbing-stairs) |\n## Trie\n|  |\n| ------- |\n| [0014-longest-common-prefix](https://github.com/Beki78/LeetCode/tree/master/0014-longest-common-prefix) |\n## Backtracking\n|  |\n| ------- |\n| [0078-subsets](https://github.com/Beki78/LeetCode/tree/master/0078-subsets) |\n## Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/Beki78/LeetCode/tree/master/0094-binary-tree-inorder-traversal) |\n| [0100-same-tree](https://github.com/Beki78/LeetCode/tree/master/0100-same-tree) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Beki78/LeetCode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0110-balanced-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0110-balanced-binary-tree) |\n| [0111-minimum-depth-of-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0111-minimum-depth-of-binary-tree) |\n## Depth-First Search\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/Beki78/LeetCode/tree/master/0094-binary-tree-inorder-traversal) |\n| [0100-same-tree](https://github.com/Beki78/LeetCode/tree/master/0100-same-tree) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0110-balanced-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0110-balanced-binary-tree) |\n| [0111-minimum-depth-of-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0111-minimum-depth-of-binary-tree) |\n## Binary Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/Beki78/LeetCode/tree/master/0094-binary-tree-inorder-traversal) |\n| [0100-same-tree](https://github.com/Beki78/LeetCode/tree/master/0100-same-tree) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Beki78/LeetCode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0110-balanced-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0110-balanced-binary-tree) |\n| [0111-minimum-depth-of-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0111-minimum-depth-of-binary-tree) |\n## Breadth-First Search\n|  |\n| ------- |\n| [0100-same-tree](https://github.com/Beki78/LeetCode/tree/master/0100-same-tree) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0111-minimum-depth-of-binary-tree](https://github.com/Beki78/LeetCode/tree/master/0111-minimum-depth-of-binary-tree) |\n## Binary Search Tree\n|  |\n| ------- |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/Beki78/LeetCode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbeki78%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbeki78%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbeki78%2Fleetcode/lists"}