{"id":18335746,"url":"https://github.com/erfanrez/leetcode","last_synced_at":"2025-10-03T17:07:26.586Z","repository":{"id":242744122,"uuid":"810443673","full_name":"ErfanRez/LeetCode","owner":"ErfanRez","description":"Here are problems I solved on LeetCode","archived":false,"fork":false,"pushed_at":"2025-07-24T22:17:52.000Z","size":470,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-07-25T04:30:29.559Z","etag":null,"topics":["dsa-algorithm","java","leetcode"],"latest_commit_sha":null,"homepage":"","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/ErfanRez.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}},"created_at":"2024-06-04T17:54:31.000Z","updated_at":"2025-07-24T22:17:56.000Z","dependencies_parsed_at":"2024-08-19T22:49:01.779Z","dependency_job_id":"fa8719cc-b991-4270-9c4a-a43032e03e1a","html_url":"https://github.com/ErfanRez/LeetCode","commit_stats":null,"previous_names":["erfanrez/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ErfanRez/LeetCode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ErfanRez%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ErfanRez%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ErfanRez%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ErfanRez%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ErfanRez","download_url":"https://codeload.github.com/ErfanRez/LeetCode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ErfanRez%2FLeetCode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":272793018,"owners_count":24993830,"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-30T02:00:09.474Z","response_time":77,"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","java","leetcode"],"created_at":"2024-11-05T20:04:30.883Z","updated_at":"2025-10-03T17:07:26.579Z","avatar_url":"https://github.com/ErfanRez.png","language":"Java","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## Math\n|  |\n| ------- |\n| [1086-divisor-game](https://github.com/ErfanRez/LeetCode/tree/master/1086-divisor-game) |\n| [1236-n-th-tribonacci-number](https://github.com/ErfanRez/LeetCode/tree/master/1236-n-th-tribonacci-number) |\n## Dynamic Programming\n|  |\n| ------- |\n| [1086-divisor-game](https://github.com/ErfanRez/LeetCode/tree/master/1086-divisor-game) |\n| [1236-n-th-tribonacci-number](https://github.com/ErfanRez/LeetCode/tree/master/1236-n-th-tribonacci-number) |\n| [1764-maximum-repeating-substring](https://github.com/ErfanRez/LeetCode/tree/master/1764-maximum-repeating-substring) |\n| [3143-longest-unequal-adjacent-groups-subsequence-i](https://github.com/ErfanRez/LeetCode/tree/master/3143-longest-unequal-adjacent-groups-subsequence-i) |\n## Brainteaser\n|  |\n| ------- |\n| [1086-divisor-game](https://github.com/ErfanRez/LeetCode/tree/master/1086-divisor-game) |\n## Game Theory\n|  |\n| ------- |\n| [1086-divisor-game](https://github.com/ErfanRez/LeetCode/tree/master/1086-divisor-game) |\n## Array\n|  |\n| ------- |\n| [0088-merge-sorted-array](https://github.com/ErfanRez/LeetCode/tree/master/0088-merge-sorted-array) |\n| [0219-contains-duplicate-ii](https://github.com/ErfanRez/LeetCode/tree/master/0219-contains-duplicate-ii) |\n| [0228-summary-ranges](https://github.com/ErfanRez/LeetCode/tree/master/0228-summary-ranges) |\n| [0287-find-the-duplicate-number](https://github.com/ErfanRez/LeetCode/tree/master/0287-find-the-duplicate-number) |\n| [0303-range-sum-query-immutable](https://github.com/ErfanRez/LeetCode/tree/master/0303-range-sum-query-immutable) |\n| [0414-third-maximum-number](https://github.com/ErfanRez/LeetCode/tree/master/0414-third-maximum-number) |\n| [0448-find-all-numbers-disappeared-in-an-array](https://github.com/ErfanRez/LeetCode/tree/master/0448-find-all-numbers-disappeared-in-an-array) |\n| [0455-assign-cookies](https://github.com/ErfanRez/LeetCode/tree/master/0455-assign-cookies) |\n| [0561-array-partition](https://github.com/ErfanRez/LeetCode/tree/master/0561-array-partition) |\n| [0594-longest-harmonious-subsequence](https://github.com/ErfanRez/LeetCode/tree/master/0594-longest-harmonious-subsequence) |\n| [0599-minimum-index-sum-of-two-lists](https://github.com/ErfanRez/LeetCode/tree/master/0599-minimum-index-sum-of-two-lists) |\n| [0643-maximum-average-subarray-i](https://github.com/ErfanRez/LeetCode/tree/master/0643-maximum-average-subarray-i) |\n| [0674-longest-continuous-increasing-subsequence](https://github.com/ErfanRez/LeetCode/tree/master/0674-longest-continuous-increasing-subsequence) |\n| [0724-find-pivot-index](https://github.com/ErfanRez/LeetCode/tree/master/0724-find-pivot-index) |\n| [0792-binary-search](https://github.com/ErfanRez/LeetCode/tree/master/0792-binary-search) |\n| [0841-shortest-distance-to-a-character](https://github.com/ErfanRez/LeetCode/tree/master/0841-shortest-distance-to-a-character) |\n| [0941-sort-array-by-parity](https://github.com/ErfanRez/LeetCode/tree/master/0941-sort-array-by-parity) |\n| [2077-largest-number-after-mutating-substring](https://github.com/ErfanRez/LeetCode/tree/master/2077-largest-number-after-mutating-substring) |\n| [2099-number-of-strings-that-appear-as-substrings-in-word](https://github.com/ErfanRez/LeetCode/tree/master/2099-number-of-strings-that-appear-as-substrings-in-word) |\n| [3000-minimum-absolute-difference-between-elements-with-constraint](https://github.com/ErfanRez/LeetCode/tree/master/3000-minimum-absolute-difference-between-elements-with-constraint) |\n| [3143-longest-unequal-adjacent-groups-subsequence-i](https://github.com/ErfanRez/LeetCode/tree/master/3143-longest-unequal-adjacent-groups-subsequence-i) |\n## String\n|  |\n| ------- |\n| [0409-longest-palindrome](https://github.com/ErfanRez/LeetCode/tree/master/0409-longest-palindrome) |\n| [0459-repeated-substring-pattern](https://github.com/ErfanRez/LeetCode/tree/master/0459-repeated-substring-pattern) |\n| [0520-detect-capital](https://github.com/ErfanRez/LeetCode/tree/master/0520-detect-capital) |\n| [0521-longest-uncommon-subsequence-i](https://github.com/ErfanRez/LeetCode/tree/master/0521-longest-uncommon-subsequence-i) |\n| [0599-minimum-index-sum-of-two-lists](https://github.com/ErfanRez/LeetCode/tree/master/0599-minimum-index-sum-of-two-lists) |\n| [0680-valid-palindrome-ii](https://github.com/ErfanRez/LeetCode/tree/master/0680-valid-palindrome-ii) |\n| [0841-shortest-distance-to-a-character](https://github.com/ErfanRez/LeetCode/tree/master/0841-shortest-distance-to-a-character) |\n| [1746-largest-substring-between-two-equal-characters](https://github.com/ErfanRez/LeetCode/tree/master/1746-largest-substring-between-two-equal-characters) |\n| [1764-maximum-repeating-substring](https://github.com/ErfanRez/LeetCode/tree/master/1764-maximum-repeating-substring) |\n| [1987-substrings-of-size-three-with-distinct-characters](https://github.com/ErfanRez/LeetCode/tree/master/1987-substrings-of-size-three-with-distinct-characters) |\n| [2059-unique-length-3-palindromic-subsequences](https://github.com/ErfanRez/LeetCode/tree/master/2059-unique-length-3-palindromic-subsequences) |\n| [2077-largest-number-after-mutating-substring](https://github.com/ErfanRez/LeetCode/tree/master/2077-largest-number-after-mutating-substring) |\n| [2099-number-of-strings-that-appear-as-substrings-in-word](https://github.com/ErfanRez/LeetCode/tree/master/2099-number-of-strings-that-appear-as-substrings-in-word) |\n| [2128-reverse-prefix-of-word](https://github.com/ErfanRez/LeetCode/tree/master/2128-reverse-prefix-of-word) |\n| [2154-minimum-moves-to-convert-string](https://github.com/ErfanRez/LeetCode/tree/master/2154-minimum-moves-to-convert-string) |\n| [3143-longest-unequal-adjacent-groups-subsequence-i](https://github.com/ErfanRez/LeetCode/tree/master/3143-longest-unequal-adjacent-groups-subsequence-i) |\n## Greedy\n|  |\n| ------- |\n| [0409-longest-palindrome](https://github.com/ErfanRez/LeetCode/tree/master/0409-longest-palindrome) |\n| [0455-assign-cookies](https://github.com/ErfanRez/LeetCode/tree/master/0455-assign-cookies) |\n| [0561-array-partition](https://github.com/ErfanRez/LeetCode/tree/master/0561-array-partition) |\n| [0680-valid-palindrome-ii](https://github.com/ErfanRez/LeetCode/tree/master/0680-valid-palindrome-ii) |\n| [2077-largest-number-after-mutating-substring](https://github.com/ErfanRez/LeetCode/tree/master/2077-largest-number-after-mutating-substring) |\n| [2154-minimum-moves-to-convert-string](https://github.com/ErfanRez/LeetCode/tree/master/2154-minimum-moves-to-convert-string) |\n| [3143-longest-unequal-adjacent-groups-subsequence-i](https://github.com/ErfanRez/LeetCode/tree/master/3143-longest-unequal-adjacent-groups-subsequence-i) |\n## Memoization\n|  |\n| ------- |\n| [1236-n-th-tribonacci-number](https://github.com/ErfanRez/LeetCode/tree/master/1236-n-th-tribonacci-number) |\n## String Matching\n|  |\n| ------- |\n| [0459-repeated-substring-pattern](https://github.com/ErfanRez/LeetCode/tree/master/0459-repeated-substring-pattern) |\n| [1764-maximum-repeating-substring](https://github.com/ErfanRez/LeetCode/tree/master/1764-maximum-repeating-substring) |\n## Two Pointers\n|  |\n| ------- |\n| [0088-merge-sorted-array](https://github.com/ErfanRez/LeetCode/tree/master/0088-merge-sorted-array) |\n| [0287-find-the-duplicate-number](https://github.com/ErfanRez/LeetCode/tree/master/0287-find-the-duplicate-number) |\n| [0455-assign-cookies](https://github.com/ErfanRez/LeetCode/tree/master/0455-assign-cookies) |\n| [0680-valid-palindrome-ii](https://github.com/ErfanRez/LeetCode/tree/master/0680-valid-palindrome-ii) |\n| [0841-shortest-distance-to-a-character](https://github.com/ErfanRez/LeetCode/tree/master/0841-shortest-distance-to-a-character) |\n| [0941-sort-array-by-parity](https://github.com/ErfanRez/LeetCode/tree/master/0941-sort-array-by-parity) |\n| [2128-reverse-prefix-of-word](https://github.com/ErfanRez/LeetCode/tree/master/2128-reverse-prefix-of-word) |\n## Sorting\n|  |\n| ------- |\n| [0088-merge-sorted-array](https://github.com/ErfanRez/LeetCode/tree/master/0088-merge-sorted-array) |\n| [0414-third-maximum-number](https://github.com/ErfanRez/LeetCode/tree/master/0414-third-maximum-number) |\n| [0455-assign-cookies](https://github.com/ErfanRez/LeetCode/tree/master/0455-assign-cookies) |\n| [0561-array-partition](https://github.com/ErfanRez/LeetCode/tree/master/0561-array-partition) |\n| [0594-longest-harmonious-subsequence](https://github.com/ErfanRez/LeetCode/tree/master/0594-longest-harmonious-subsequence) |\n| [0941-sort-array-by-parity](https://github.com/ErfanRez/LeetCode/tree/master/0941-sort-array-by-parity) |\n## Hash Table\n|  |\n| ------- |\n| [0219-contains-duplicate-ii](https://github.com/ErfanRez/LeetCode/tree/master/0219-contains-duplicate-ii) |\n| [0409-longest-palindrome](https://github.com/ErfanRez/LeetCode/tree/master/0409-longest-palindrome) |\n| [0448-find-all-numbers-disappeared-in-an-array](https://github.com/ErfanRez/LeetCode/tree/master/0448-find-all-numbers-disappeared-in-an-array) |\n| [0594-longest-harmonious-subsequence](https://github.com/ErfanRez/LeetCode/tree/master/0594-longest-harmonious-subsequence) |\n| [0599-minimum-index-sum-of-two-lists](https://github.com/ErfanRez/LeetCode/tree/master/0599-minimum-index-sum-of-two-lists) |\n| [1746-largest-substring-between-two-equal-characters](https://github.com/ErfanRez/LeetCode/tree/master/1746-largest-substring-between-two-equal-characters) |\n| [1987-substrings-of-size-three-with-distinct-characters](https://github.com/ErfanRez/LeetCode/tree/master/1987-substrings-of-size-three-with-distinct-characters) |\n| [2059-unique-length-3-palindromic-subsequences](https://github.com/ErfanRez/LeetCode/tree/master/2059-unique-length-3-palindromic-subsequences) |\n## Sliding Window\n|  |\n| ------- |\n| [0219-contains-duplicate-ii](https://github.com/ErfanRez/LeetCode/tree/master/0219-contains-duplicate-ii) |\n| [0594-longest-harmonious-subsequence](https://github.com/ErfanRez/LeetCode/tree/master/0594-longest-harmonious-subsequence) |\n| [0643-maximum-average-subarray-i](https://github.com/ErfanRez/LeetCode/tree/master/0643-maximum-average-subarray-i) |\n| [1987-substrings-of-size-three-with-distinct-characters](https://github.com/ErfanRez/LeetCode/tree/master/1987-substrings-of-size-three-with-distinct-characters) |\n## Counting\n|  |\n| ------- |\n| [0594-longest-harmonious-subsequence](https://github.com/ErfanRez/LeetCode/tree/master/0594-longest-harmonious-subsequence) |\n| [1987-substrings-of-size-three-with-distinct-characters](https://github.com/ErfanRez/LeetCode/tree/master/1987-substrings-of-size-three-with-distinct-characters) |\n## Binary Search\n|  |\n| ------- |\n| [0287-find-the-duplicate-number](https://github.com/ErfanRez/LeetCode/tree/master/0287-find-the-duplicate-number) |\n| [0792-binary-search](https://github.com/ErfanRez/LeetCode/tree/master/0792-binary-search) |\n| [3000-minimum-absolute-difference-between-elements-with-constraint](https://github.com/ErfanRez/LeetCode/tree/master/3000-minimum-absolute-difference-between-elements-with-constraint) |\n## Ordered Set\n|  |\n| ------- |\n| [3000-minimum-absolute-difference-between-elements-with-constraint](https://github.com/ErfanRez/LeetCode/tree/master/3000-minimum-absolute-difference-between-elements-with-constraint) |\n## Database\n|  |\n| ------- |\n| [0176-second-highest-salary](https://github.com/ErfanRez/LeetCode/tree/master/0176-second-highest-salary) |\n| [0177-nth-highest-salary](https://github.com/ErfanRez/LeetCode/tree/master/0177-nth-highest-salary) |\n| [0184-department-highest-salary](https://github.com/ErfanRez/LeetCode/tree/master/0184-department-highest-salary) |\n| [1908-recyclable-and-low-fat-products](https://github.com/ErfanRez/LeetCode/tree/master/1908-recyclable-and-low-fat-products) |\n| [2495-number-of-unique-subjects-taught-by-each-teacher](https://github.com/ErfanRez/LeetCode/tree/master/2495-number-of-unique-subjects-taught-by-each-teacher) |\n| [3816-dna-pattern-recognition](https://github.com/ErfanRez/LeetCode/tree/master/3816-dna-pattern-recognition) |\n| [3848-analyze-subscription-conversion](https://github.com/ErfanRez/LeetCode/tree/master/3848-analyze-subscription-conversion) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0287-find-the-duplicate-number](https://github.com/ErfanRez/LeetCode/tree/master/0287-find-the-duplicate-number) |\n| [2059-unique-length-3-palindromic-subsequences](https://github.com/ErfanRez/LeetCode/tree/master/2059-unique-length-3-palindromic-subsequences) |\n## Prefix Sum\n|  |\n| ------- |\n| [0303-range-sum-query-immutable](https://github.com/ErfanRez/LeetCode/tree/master/0303-range-sum-query-immutable) |\n| [0724-find-pivot-index](https://github.com/ErfanRez/LeetCode/tree/master/0724-find-pivot-index) |\n| [2059-unique-length-3-palindromic-subsequences](https://github.com/ErfanRez/LeetCode/tree/master/2059-unique-length-3-palindromic-subsequences) |\n## Linked List\n|  |\n| ------- |\n| [0328-odd-even-linked-list](https://github.com/ErfanRez/LeetCode/tree/master/0328-odd-even-linked-list) |\n## Counting Sort\n|  |\n| ------- |\n| [0561-array-partition](https://github.com/ErfanRez/LeetCode/tree/master/0561-array-partition) |\n## Stack\n|  |\n| ------- |\n| [2128-reverse-prefix-of-word](https://github.com/ErfanRez/LeetCode/tree/master/2128-reverse-prefix-of-word) |\n## Design\n|  |\n| ------- |\n| [0303-range-sum-query-immutable](https://github.com/ErfanRez/LeetCode/tree/master/0303-range-sum-query-immutable) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ferfanrez%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ferfanrez%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ferfanrez%2Fleetcode/lists"}