Leetcode-GFG_solutions

KO | EN

gitlite — search

#javascript #python #llm #android #machine-learning #deep-learning #docker #nodejs #windows #awesome #pytorch #ios #openai #open-source

Leetcode-GFG_solutions

(★ 2)

Collection of LeetCode/GFG solutions

Leetcode-GFG_solutions Latest Version Download

Download Latest Version (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

Collection of LeetCode solutions

# LeetCode Topics
## Array
|  |
| ------- |
| [0031-next-permutation](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0031-next-permutation) |
| [0053-maximum-subarray](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0053-maximum-subarray) |
| [0055-jump-game](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0055-jump-game) |
| [0056-merge-intervals](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0056-merge-intervals) |
| [0074-search-a-2d-matrix](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0074-search-a-2d-matrix) |
| [0135-candy](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0135-candy) |
| [0169-majority-element](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0169-majority-element) |
| [0189-rotate-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0189-rotate-array) |
| [0209-minimum-size-subarray-sum](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0209-minimum-size-subarray-sum) |
| [0215-kth-largest-element-in-an-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0215-kth-largest-element-in-an-array) |
| [0229-majority-element-ii](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0229-majority-element-ii) |
| [0238-product-of-array-except-self](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0238-product-of-array-except-self) |
| [0287-find-the-duplicate-number](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0287-find-the-duplicate-number) |
| [0303-range-sum-query-immutable](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0303-range-sum-query-immutable) |
| [0347-top-k-frequent-elements](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0347-top-k-frequent-elements) |
| [0435-non-overlapping-intervals](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0435-non-overlapping-intervals) |
| [0455-assign-cookies](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0455-assign-cookies) |
| [0599-minimum-index-sum-of-two-lists](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0599-minimum-index-sum-of-two-lists) |
| [0724-find-pivot-index](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0724-find-pivot-index) |
| [0966-binary-subarrays-with-sum](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0966-binary-subarrays-with-sum) |
| [1603-running-sum-of-1d-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/1603-running-sum-of-1d-array) |
| [1786-count-the-number-of-consistent-strings](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/1786-count-the-number-of-consistent-strings) |
| [2163-kth-distinct-string-in-an-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/2163-kth-distinct-string-in-an-array) |
| [2231-find-first-palindromic-string-in-the-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/2231-find-first-palindromic-string-in-the-array) |
| [2232-adding-spaces-to-a-string](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/2232-adding-spaces-to-a-string) |
| [2292-counting-words-with-a-given-prefix](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/2292-counting-words-with-a-given-prefix) |
| [2502-sort-the-people](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/2502-sort-the-people) |
| [2714-left-and-right-sum-differences](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/2714-left-and-right-sum-differences) |
| [3427-special-array-ii](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/3427-special-array-ii) |
| [3429-special-array-i](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/3429-special-array-i) |
| [3594-identify-the-largest-outlier-in-an-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/3594-identify-the-largest-outlier-in-an-array) |
## Two Pointers
|  |
| ------- |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0031-next-permutation](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0031-next-permutation) |
| [0151-reverse-words-in-a-string](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0151-reverse-words-in-a-string) |
| [0165-compare-version-numbers](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0165-compare-version-numbers) |
| [0189-rotate-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0189-rotate-array) |
| [0287-find-the-duplicate-number](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0287-find-the-duplicate-number) |
| [0455-assign-cookies](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0455-assign-cookies) |
| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |
| [2231-find-first-palindromic-string-in-the-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/2231-find-first-palindromic-string-in-the-array) |
| [2232-adding-spaces-to-a-string](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/2232-adding-spaces-to-a-string) |
## Greedy
|  |
| ------- |
| [0055-jump-game](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0055-jump-game) |
| [0135-candy](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0135-candy) |
| [0435-non-overlapping-intervals](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0435-non-overlapping-intervals) |
| [0455-assign-cookies](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0455-assign-cookies) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0957-minimum-add-to-make-parentheses-valid) |
## Sorting
|  |
| ------- |
| [0056-merge-intervals](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0056-merge-intervals) |
| [0169-majority-element](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0169-majority-element) |
| [0215-kth-largest-element-in-an-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0215-kth-largest-element-in-an-array) |
| [0229-majority-element-ii](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0229-majority-element-ii) |
| [0242-valid-anagram](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0242-valid-anagram) |
| [0347-top-k-frequent-elements](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0347-top-k-frequent-elements) |
| [0435-non-overlapping-intervals](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0435-non-overlapping-intervals) |
| [0455-assign-cookies](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0455-assign-cookies) |
| [2502-sort-the-people](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/2502-sort-the-people) |
## Dynamic Programming
|  |
| ------- |
| [0053-maximum-subarray](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0053-maximum-subarray) |
| [0055-jump-game](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0055-jump-game) |
| [0435-non-overlapping-intervals](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0435-non-overlapping-intervals) |
## Prefix Sum
|  |
| ------- |
| [0209-minimum-size-subarray-sum](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0209-minimum-size-subarray-sum) |
| [0238-product-of-array-except-self](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0238-product-of-array-except-self) |
| [0303-range-sum-query-immutable](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0303-range-sum-query-immutable) |
| [0724-find-pivot-index](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0724-find-pivot-index) |
| [0966-binary-subarrays-with-sum](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0966-binary-subarrays-with-sum) |
| [1603-running-sum-of-1d-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/1603-running-sum-of-1d-array) |
| [2714-left-and-right-sum-differences](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/2714-left-and-right-sum-differences) |
| [3427-special-array-ii](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/3427-special-array-ii) |
## Design
|  |
| ------- |
| [0303-range-sum-query-immutable](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0303-range-sum-query-immutable) |
## Divide and Conquer
|  |
| ------- |
| [0053-maximum-subarray](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0053-maximum-subarray) |
| [0169-majority-element](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0169-majority-element) |
| [0215-kth-largest-element-in-an-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0215-kth-largest-element-in-an-array) |
| [0347-top-k-frequent-elements](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0347-top-k-frequent-elements) |
## Heap (Priority Queue)
|  |
| ------- |
| [0215-kth-largest-element-in-an-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0215-kth-largest-element-in-an-array) |
| [0347-top-k-frequent-elements](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0347-top-k-frequent-elements) |
## Quickselect
|  |
| ------- |
| [0215-kth-largest-element-in-an-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0215-kth-largest-element-in-an-array) |
| [0347-top-k-frequent-elements](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0347-top-k-frequent-elements) |
## Hash Table
|  |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0003-longest-substring-without-repeating-characters) |
| [0017-letter-combinations-of-a-phone-number](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0169-majority-element](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0169-majority-element) |
| [0229-majority-element-ii](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0229-majority-element-ii) |
| [0242-valid-anagram](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0242-valid-anagram) |
| [0347-top-k-frequent-elements](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0347-top-k-frequent-elements) |
| [0599-minimum-index-sum-of-two-lists](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0599-minimum-index-sum-of-two-lists) |
| [0966-binary-subarrays-with-sum](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0966-binary-subarrays-with-sum) |
| [1786-count-the-number-of-consistent-strings](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/1786-count-the-number-of-consistent-strings) |
| [1890-sum-of-beauty-of-all-substrings](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/1890-sum-of-beauty-of-all-substrings) |
| [2163-kth-distinct-string-in-an-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/2163-kth-distinct-string-in-an-array) |
| [2502-sort-the-people](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/2502-sort-the-people) |
| [3594-identify-the-largest-outlier-in-an-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/3594-identify-the-largest-outlier-in-an-array) |
## Bucket Sort
|  |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0347-top-k-frequent-elements) |
## Counting
|  |
| ------- |
| [0169-majority-element](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0169-majority-element) |
| [0229-majority-element-ii](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0229-majority-element-ii) |
| [0347-top-k-frequent-elements](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0347-top-k-frequent-elements) |
| [1786-count-the-number-of-consistent-strings](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/1786-count-the-number-of-consistent-strings) |
| [1890-sum-of-beauty-of-all-substrings](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/1890-sum-of-beauty-of-all-substrings) |
| [2163-kth-distinct-string-in-an-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/2163-kth-distinct-string-in-an-array) |
| [3594-identify-the-largest-outlier-in-an-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/3594-identify-the-largest-outlier-in-an-array) |
## Binary Search
|  |
| ------- |
| [0074-search-a-2d-matrix](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0074-search-a-2d-matrix) |
| [0209-minimum-size-subarray-sum](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0209-minimum-size-subarray-sum) |
| [0287-find-the-duplicate-number](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0287-find-the-duplicate-number) |
| [3427-special-array-ii](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/3427-special-array-ii) |
## Bit Manipulation
|  |
| ------- |
| [0287-find-the-duplicate-number](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0287-find-the-duplicate-number) |
| [1786-count-the-number-of-consistent-strings](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/1786-count-the-number-of-consistent-strings) |
## Matrix
|  |
| ------- |
| [0074-search-a-2d-matrix](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0074-search-a-2d-matrix) |
## String
|  |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0003-longest-substring-without-repeating-characters) |
| [0017-letter-combinations-of-a-phone-number](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0017-letter-combinations-of-a-phone-number) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0038-count-and-say](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0038-count-and-say) |
| [0151-reverse-words-in-a-string](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0151-reverse-words-in-a-string) |
| [0165-compare-version-numbers](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0165-compare-version-numbers) |
| [0242-valid-anagram](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0242-valid-anagram) |
| [0459-repeated-substring-pattern](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0459-repeated-substring-pattern) |
| [0599-minimum-index-sum-of-two-lists](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0599-minimum-index-sum-of-two-lists) |
| [0851-goat-latin](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0851-goat-latin) |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0957-minimum-add-to-make-parentheses-valid) |
| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |
| [1786-count-the-number-of-consistent-strings](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/1786-count-the-number-of-consistent-strings) |
| [1890-sum-of-beauty-of-all-substrings](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/1890-sum-of-beauty-of-all-substrings) |
| [2163-kth-distinct-string-in-an-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/2163-kth-distinct-string-in-an-array) |
| [2231-find-first-palindromic-string-in-the-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/2231-find-first-palindromic-string-in-the-array) |
| [2232-adding-spaces-to-a-string](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/2232-adding-spaces-to-a-string) |
| [2292-counting-words-with-a-given-prefix](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/2292-counting-words-with-a-given-prefix) |
| [2502-sort-the-people](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/2502-sort-the-people) |
## String Matching
|  |
| ------- |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0459-repeated-substring-pattern](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0459-repeated-substring-pattern) |
| [1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence) |
| [2292-counting-words-with-a-given-prefix](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/2292-counting-words-with-a-given-prefix) |
## Stack
|  |
| ------- |
| [0957-minimum-add-to-make-parentheses-valid](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0957-minimum-add-to-make-parentheses-valid) |
## Simulation
|  |
| ------- |
| [2232-adding-spaces-to-a-string](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/2232-adding-spaces-to-a-string) |
## Backtracking
|  |
| ------- |
| [0017-letter-combinations-of-a-phone-number](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0017-letter-combinations-of-a-phone-number) |
## Enumeration
|  |
| ------- |
| [3594-identify-the-largest-outlier-in-an-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/3594-identify-the-largest-outlier-in-an-array) |
## Math
|  |
| ------- |
| [0189-rotate-array](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0189-rotate-array) |
## Sliding Window
|  |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0003-longest-substring-without-repeating-characters) |
| [0209-minimum-size-subarray-sum](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0209-minimum-size-subarray-sum) |
| [0966-binary-subarrays-with-sum](https://github.com/Adi-070/Leetcode-GFG_solutions/tree/master/0966-binary-subarrays-with-sum) |

Leetcode-GFG_solutions

Leetcode-GFG_solutions Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

Leetcode-GFG_solutions

Leetcode-GFG_solutions Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

Download README