https://github.com/erfanrez/leetcode
Here are problems I solved on LeetCode
https://github.com/erfanrez/leetcode
dsa-algorithm java leetcode
Last synced: about 1 month ago
JSON representation
Here are problems I solved on LeetCode
- Host: GitHub
- URL: https://github.com/erfanrez/leetcode
- Owner: ErfanRez
- Created: 2024-06-04T17:54:31.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2025-07-24T22:17:52.000Z (4 months ago)
- Last Synced: 2025-07-25T04:30:29.559Z (4 months ago)
- Topics: dsa-algorithm, java, leetcode
- Language: Java
- Homepage:
- Size: 459 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)
# LeetCode Topics
## Math
| |
| ------- |
| [1086-divisor-game](https://github.com/ErfanRez/LeetCode/tree/master/1086-divisor-game) |
| [1236-n-th-tribonacci-number](https://github.com/ErfanRez/LeetCode/tree/master/1236-n-th-tribonacci-number) |
## Dynamic Programming
| |
| ------- |
| [1086-divisor-game](https://github.com/ErfanRez/LeetCode/tree/master/1086-divisor-game) |
| [1236-n-th-tribonacci-number](https://github.com/ErfanRez/LeetCode/tree/master/1236-n-th-tribonacci-number) |
| [1764-maximum-repeating-substring](https://github.com/ErfanRez/LeetCode/tree/master/1764-maximum-repeating-substring) |
| [3143-longest-unequal-adjacent-groups-subsequence-i](https://github.com/ErfanRez/LeetCode/tree/master/3143-longest-unequal-adjacent-groups-subsequence-i) |
## Brainteaser
| |
| ------- |
| [1086-divisor-game](https://github.com/ErfanRez/LeetCode/tree/master/1086-divisor-game) |
## Game Theory
| |
| ------- |
| [1086-divisor-game](https://github.com/ErfanRez/LeetCode/tree/master/1086-divisor-game) |
## Array
| |
| ------- |
| [0088-merge-sorted-array](https://github.com/ErfanRez/LeetCode/tree/master/0088-merge-sorted-array) |
| [0219-contains-duplicate-ii](https://github.com/ErfanRez/LeetCode/tree/master/0219-contains-duplicate-ii) |
| [0228-summary-ranges](https://github.com/ErfanRez/LeetCode/tree/master/0228-summary-ranges) |
| [0287-find-the-duplicate-number](https://github.com/ErfanRez/LeetCode/tree/master/0287-find-the-duplicate-number) |
| [0303-range-sum-query-immutable](https://github.com/ErfanRez/LeetCode/tree/master/0303-range-sum-query-immutable) |
| [0414-third-maximum-number](https://github.com/ErfanRez/LeetCode/tree/master/0414-third-maximum-number) |
| [0448-find-all-numbers-disappeared-in-an-array](https://github.com/ErfanRez/LeetCode/tree/master/0448-find-all-numbers-disappeared-in-an-array) |
| [0455-assign-cookies](https://github.com/ErfanRez/LeetCode/tree/master/0455-assign-cookies) |
| [0561-array-partition](https://github.com/ErfanRez/LeetCode/tree/master/0561-array-partition) |
| [0594-longest-harmonious-subsequence](https://github.com/ErfanRez/LeetCode/tree/master/0594-longest-harmonious-subsequence) |
| [0599-minimum-index-sum-of-two-lists](https://github.com/ErfanRez/LeetCode/tree/master/0599-minimum-index-sum-of-two-lists) |
| [0643-maximum-average-subarray-i](https://github.com/ErfanRez/LeetCode/tree/master/0643-maximum-average-subarray-i) |
| [0674-longest-continuous-increasing-subsequence](https://github.com/ErfanRez/LeetCode/tree/master/0674-longest-continuous-increasing-subsequence) |
| [0724-find-pivot-index](https://github.com/ErfanRez/LeetCode/tree/master/0724-find-pivot-index) |
| [0792-binary-search](https://github.com/ErfanRez/LeetCode/tree/master/0792-binary-search) |
| [0841-shortest-distance-to-a-character](https://github.com/ErfanRez/LeetCode/tree/master/0841-shortest-distance-to-a-character) |
| [0941-sort-array-by-parity](https://github.com/ErfanRez/LeetCode/tree/master/0941-sort-array-by-parity) |
| [2077-largest-number-after-mutating-substring](https://github.com/ErfanRez/LeetCode/tree/master/2077-largest-number-after-mutating-substring) |
| [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) |
| [3000-minimum-absolute-difference-between-elements-with-constraint](https://github.com/ErfanRez/LeetCode/tree/master/3000-minimum-absolute-difference-between-elements-with-constraint) |
| [3143-longest-unequal-adjacent-groups-subsequence-i](https://github.com/ErfanRez/LeetCode/tree/master/3143-longest-unequal-adjacent-groups-subsequence-i) |
## String
| |
| ------- |
| [0409-longest-palindrome](https://github.com/ErfanRez/LeetCode/tree/master/0409-longest-palindrome) |
| [0459-repeated-substring-pattern](https://github.com/ErfanRez/LeetCode/tree/master/0459-repeated-substring-pattern) |
| [0520-detect-capital](https://github.com/ErfanRez/LeetCode/tree/master/0520-detect-capital) |
| [0521-longest-uncommon-subsequence-i](https://github.com/ErfanRez/LeetCode/tree/master/0521-longest-uncommon-subsequence-i) |
| [0599-minimum-index-sum-of-two-lists](https://github.com/ErfanRez/LeetCode/tree/master/0599-minimum-index-sum-of-two-lists) |
| [0680-valid-palindrome-ii](https://github.com/ErfanRez/LeetCode/tree/master/0680-valid-palindrome-ii) |
| [0841-shortest-distance-to-a-character](https://github.com/ErfanRez/LeetCode/tree/master/0841-shortest-distance-to-a-character) |
| [1746-largest-substring-between-two-equal-characters](https://github.com/ErfanRez/LeetCode/tree/master/1746-largest-substring-between-two-equal-characters) |
| [1764-maximum-repeating-substring](https://github.com/ErfanRez/LeetCode/tree/master/1764-maximum-repeating-substring) |
| [1987-substrings-of-size-three-with-distinct-characters](https://github.com/ErfanRez/LeetCode/tree/master/1987-substrings-of-size-three-with-distinct-characters) |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/ErfanRez/LeetCode/tree/master/2059-unique-length-3-palindromic-subsequences) |
| [2077-largest-number-after-mutating-substring](https://github.com/ErfanRez/LeetCode/tree/master/2077-largest-number-after-mutating-substring) |
| [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) |
| [2128-reverse-prefix-of-word](https://github.com/ErfanRez/LeetCode/tree/master/2128-reverse-prefix-of-word) |
| [2154-minimum-moves-to-convert-string](https://github.com/ErfanRez/LeetCode/tree/master/2154-minimum-moves-to-convert-string) |
| [3143-longest-unequal-adjacent-groups-subsequence-i](https://github.com/ErfanRez/LeetCode/tree/master/3143-longest-unequal-adjacent-groups-subsequence-i) |
## Greedy
| |
| ------- |
| [0409-longest-palindrome](https://github.com/ErfanRez/LeetCode/tree/master/0409-longest-palindrome) |
| [0455-assign-cookies](https://github.com/ErfanRez/LeetCode/tree/master/0455-assign-cookies) |
| [0561-array-partition](https://github.com/ErfanRez/LeetCode/tree/master/0561-array-partition) |
| [0680-valid-palindrome-ii](https://github.com/ErfanRez/LeetCode/tree/master/0680-valid-palindrome-ii) |
| [2077-largest-number-after-mutating-substring](https://github.com/ErfanRez/LeetCode/tree/master/2077-largest-number-after-mutating-substring) |
| [2154-minimum-moves-to-convert-string](https://github.com/ErfanRez/LeetCode/tree/master/2154-minimum-moves-to-convert-string) |
| [3143-longest-unequal-adjacent-groups-subsequence-i](https://github.com/ErfanRez/LeetCode/tree/master/3143-longest-unequal-adjacent-groups-subsequence-i) |
## Memoization
| |
| ------- |
| [1236-n-th-tribonacci-number](https://github.com/ErfanRez/LeetCode/tree/master/1236-n-th-tribonacci-number) |
## String Matching
| |
| ------- |
| [0459-repeated-substring-pattern](https://github.com/ErfanRez/LeetCode/tree/master/0459-repeated-substring-pattern) |
| [1764-maximum-repeating-substring](https://github.com/ErfanRez/LeetCode/tree/master/1764-maximum-repeating-substring) |
## Two Pointers
| |
| ------- |
| [0088-merge-sorted-array](https://github.com/ErfanRez/LeetCode/tree/master/0088-merge-sorted-array) |
| [0287-find-the-duplicate-number](https://github.com/ErfanRez/LeetCode/tree/master/0287-find-the-duplicate-number) |
| [0455-assign-cookies](https://github.com/ErfanRez/LeetCode/tree/master/0455-assign-cookies) |
| [0680-valid-palindrome-ii](https://github.com/ErfanRez/LeetCode/tree/master/0680-valid-palindrome-ii) |
| [0841-shortest-distance-to-a-character](https://github.com/ErfanRez/LeetCode/tree/master/0841-shortest-distance-to-a-character) |
| [0941-sort-array-by-parity](https://github.com/ErfanRez/LeetCode/tree/master/0941-sort-array-by-parity) |
| [2128-reverse-prefix-of-word](https://github.com/ErfanRez/LeetCode/tree/master/2128-reverse-prefix-of-word) |
## Sorting
| |
| ------- |
| [0088-merge-sorted-array](https://github.com/ErfanRez/LeetCode/tree/master/0088-merge-sorted-array) |
| [0414-third-maximum-number](https://github.com/ErfanRez/LeetCode/tree/master/0414-third-maximum-number) |
| [0455-assign-cookies](https://github.com/ErfanRez/LeetCode/tree/master/0455-assign-cookies) |
| [0561-array-partition](https://github.com/ErfanRez/LeetCode/tree/master/0561-array-partition) |
| [0594-longest-harmonious-subsequence](https://github.com/ErfanRez/LeetCode/tree/master/0594-longest-harmonious-subsequence) |
| [0941-sort-array-by-parity](https://github.com/ErfanRez/LeetCode/tree/master/0941-sort-array-by-parity) |
## Hash Table
| |
| ------- |
| [0219-contains-duplicate-ii](https://github.com/ErfanRez/LeetCode/tree/master/0219-contains-duplicate-ii) |
| [0409-longest-palindrome](https://github.com/ErfanRez/LeetCode/tree/master/0409-longest-palindrome) |
| [0448-find-all-numbers-disappeared-in-an-array](https://github.com/ErfanRez/LeetCode/tree/master/0448-find-all-numbers-disappeared-in-an-array) |
| [0594-longest-harmonious-subsequence](https://github.com/ErfanRez/LeetCode/tree/master/0594-longest-harmonious-subsequence) |
| [0599-minimum-index-sum-of-two-lists](https://github.com/ErfanRez/LeetCode/tree/master/0599-minimum-index-sum-of-two-lists) |
| [1746-largest-substring-between-two-equal-characters](https://github.com/ErfanRez/LeetCode/tree/master/1746-largest-substring-between-two-equal-characters) |
| [1987-substrings-of-size-three-with-distinct-characters](https://github.com/ErfanRez/LeetCode/tree/master/1987-substrings-of-size-three-with-distinct-characters) |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/ErfanRez/LeetCode/tree/master/2059-unique-length-3-palindromic-subsequences) |
## Sliding Window
| |
| ------- |
| [0219-contains-duplicate-ii](https://github.com/ErfanRez/LeetCode/tree/master/0219-contains-duplicate-ii) |
| [0594-longest-harmonious-subsequence](https://github.com/ErfanRez/LeetCode/tree/master/0594-longest-harmonious-subsequence) |
| [0643-maximum-average-subarray-i](https://github.com/ErfanRez/LeetCode/tree/master/0643-maximum-average-subarray-i) |
| [1987-substrings-of-size-three-with-distinct-characters](https://github.com/ErfanRez/LeetCode/tree/master/1987-substrings-of-size-three-with-distinct-characters) |
## Counting
| |
| ------- |
| [0594-longest-harmonious-subsequence](https://github.com/ErfanRez/LeetCode/tree/master/0594-longest-harmonious-subsequence) |
| [1987-substrings-of-size-three-with-distinct-characters](https://github.com/ErfanRez/LeetCode/tree/master/1987-substrings-of-size-three-with-distinct-characters) |
## Binary Search
| |
| ------- |
| [0287-find-the-duplicate-number](https://github.com/ErfanRez/LeetCode/tree/master/0287-find-the-duplicate-number) |
| [0792-binary-search](https://github.com/ErfanRez/LeetCode/tree/master/0792-binary-search) |
| [3000-minimum-absolute-difference-between-elements-with-constraint](https://github.com/ErfanRez/LeetCode/tree/master/3000-minimum-absolute-difference-between-elements-with-constraint) |
## Ordered Set
| |
| ------- |
| [3000-minimum-absolute-difference-between-elements-with-constraint](https://github.com/ErfanRez/LeetCode/tree/master/3000-minimum-absolute-difference-between-elements-with-constraint) |
## Database
| |
| ------- |
| [0176-second-highest-salary](https://github.com/ErfanRez/LeetCode/tree/master/0176-second-highest-salary) |
| [0177-nth-highest-salary](https://github.com/ErfanRez/LeetCode/tree/master/0177-nth-highest-salary) |
| [0184-department-highest-salary](https://github.com/ErfanRez/LeetCode/tree/master/0184-department-highest-salary) |
| [1908-recyclable-and-low-fat-products](https://github.com/ErfanRez/LeetCode/tree/master/1908-recyclable-and-low-fat-products) |
| [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) |
| [3816-dna-pattern-recognition](https://github.com/ErfanRez/LeetCode/tree/master/3816-dna-pattern-recognition) |
| [3848-analyze-subscription-conversion](https://github.com/ErfanRez/LeetCode/tree/master/3848-analyze-subscription-conversion) |
## Bit Manipulation
| |
| ------- |
| [0287-find-the-duplicate-number](https://github.com/ErfanRez/LeetCode/tree/master/0287-find-the-duplicate-number) |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/ErfanRez/LeetCode/tree/master/2059-unique-length-3-palindromic-subsequences) |
## Prefix Sum
| |
| ------- |
| [0303-range-sum-query-immutable](https://github.com/ErfanRez/LeetCode/tree/master/0303-range-sum-query-immutable) |
| [0724-find-pivot-index](https://github.com/ErfanRez/LeetCode/tree/master/0724-find-pivot-index) |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/ErfanRez/LeetCode/tree/master/2059-unique-length-3-palindromic-subsequences) |
## Linked List
| |
| ------- |
| [0328-odd-even-linked-list](https://github.com/ErfanRez/LeetCode/tree/master/0328-odd-even-linked-list) |
## Counting Sort
| |
| ------- |
| [0561-array-partition](https://github.com/ErfanRez/LeetCode/tree/master/0561-array-partition) |
## Stack
| |
| ------- |
| [2128-reverse-prefix-of-word](https://github.com/ErfanRez/LeetCode/tree/master/2128-reverse-prefix-of-word) |
## Design
| |
| ------- |
| [0303-range-sum-query-immutable](https://github.com/ErfanRez/LeetCode/tree/master/0303-range-sum-query-immutable) |