Welcome to the repository of LeetCode problem solutions. Each problem solution is detailed with performance metrics and implementation notes.
This repository contains solutions to various LeetCode problems. Each solution includes details on its performance in terms of time and space complexity.
The repository is organized to facilitate easy navigation and understanding:
- Problem Solutions: Each problem solution is located in its own directory.
- Implementation Details: Solutions are documented with performance metrics (time and space complexity).
To get started, clone this repository:
git clone https://github.com/dhiraj-birajdar/leetcode-solutions.git
<!---LeetCode Topics Start-->
# LeetCode Topics
## Linked List
| |
| ------- |
| [0019-remove-nth-node-from-end-of-list](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0061-rotate-list](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0061-rotate-list) |
| [0083-remove-duplicates-from-sorted-list](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0083-remove-duplicates-from-sorted-list) |
| [0141-linked-list-cycle](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0142-linked-list-cycle-ii) |
| [0146-lru-cache](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0146-lru-cache) |
| [0528-swapping-nodes-in-a-linked-list](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0528-swapping-nodes-in-a-linked-list) |
| [2871-double-a-number-represented-as-a-linked-list](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2871-double-a-number-represented-as-a-linked-list) |
## Math
| |
| ------- |
| [0048-rotate-image](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0048-rotate-image) |
| [0150-evaluate-reverse-polish-notation](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0150-evaluate-reverse-polish-notation) |
| [0189-rotate-array](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0189-rotate-array) |
| [0202-happy-number](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0202-happy-number) |
| [0258-add-digits](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0258-add-digits) |
| [0263-ugly-number](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0263-ugly-number) |
| [0633-sum-of-square-numbers](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0633-sum-of-square-numbers) |
| [1323-maximum-69-number](https://github.com/Dhiraj-birajdar/leetcode/tree/master/1323-maximum-69-number) |
| [1523-count-odd-numbers-in-an-interval-range](https://github.com/Dhiraj-birajdar/leetcode/tree/master/1523-count-odd-numbers-in-an-interval-range) |
| [2520-count-the-digits-that-divide-a-number](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2520-count-the-digits-that-divide-a-number) |
| [2871-double-a-number-represented-as-a-linked-list](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2871-double-a-number-represented-as-a-linked-list) |
| [3190-find-minimum-operations-to-make-all-elements-divisible-by-three](https://github.com/Dhiraj-birajdar/leetcode/tree/master/3190-find-minimum-operations-to-make-all-elements-divisible-by-three) |
| [3512-minimum-operations-to-make-array-sum-divisible-by-k](https://github.com/Dhiraj-birajdar/leetcode/tree/master/3512-minimum-operations-to-make-array-sum-divisible-by-k) |
## Stack
| |
| ------- |
| [0020-valid-parentheses](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0020-valid-parentheses) |
| [0042-trapping-rain-water](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0042-trapping-rain-water) |
| [0094-binary-tree-inorder-traversal](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0094-binary-tree-inorder-traversal) |
| [0150-evaluate-reverse-polish-notation](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0150-evaluate-reverse-polish-notation) |
| [0225-implement-stack-using-queues](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0225-implement-stack-using-queues) |
| [2871-double-a-number-represented-as-a-linked-list](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2871-double-a-number-represented-as-a-linked-list) |
## Array
| |
| ------- |
| [0011-container-with-most-water](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0015-3sum) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0027-remove-element) |
| [0042-trapping-rain-water](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0042-trapping-rain-water) |
| [0048-rotate-image](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0048-rotate-image) |
| [0049-group-anagrams](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0049-group-anagrams) |
| [0053-maximum-subarray](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0053-maximum-subarray) |
| [0074-search-a-2d-matrix](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0074-search-a-2d-matrix) |
| [0075-sort-colors](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0075-sort-colors) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0088-merge-sorted-array](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0088-merge-sorted-array) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0128-longest-consecutive-sequence](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0128-longest-consecutive-sequence) |
| [0150-evaluate-reverse-polish-notation](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0150-evaluate-reverse-polish-notation) |
| [0162-find-peak-element](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0162-find-peak-element) |
| [0169-majority-element](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0169-majority-element) |
| [0189-rotate-array](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0189-rotate-array) |
| [0217-contains-duplicate](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0217-contains-duplicate) |
| [0229-majority-element-ii](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0229-majority-element-ii) |
| [0238-product-of-array-except-self](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0238-product-of-array-except-self) |
| [0303-range-sum-query-immutable](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0303-range-sum-query-immutable) |
| [0347-top-k-frequent-elements](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0347-top-k-frequent-elements) |
| [0414-third-maximum-number](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0414-third-maximum-number) |
| [0643-maximum-average-subarray-i](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0643-maximum-average-subarray-i) |
| [0977-squares-of-a-sorted-array](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0977-squares-of-a-sorted-array) |
| [1752-check-if-array-is-sorted-and-rotated](https://github.com/Dhiraj-birajdar/leetcode/tree/master/1752-check-if-array-is-sorted-and-rotated) |
| [2149-rearrange-array-elements-by-sign](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2149-rearrange-array-elements-by-sign) |
| [2273-find-resultant-array-after-removing-anagrams](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2273-find-resultant-array-after-removing-anagrams) |
| [2727-number-of-senior-citizens](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2727-number-of-senior-citizens) |
| [2951-find-the-peaks](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2951-find-the-peaks) |
| [3010-divide-an-array-into-subarrays-with-minimum-cost-i](https://github.com/Dhiraj-birajdar/leetcode/tree/master/3010-divide-an-array-into-subarrays-with-minimum-cost-i) |
| [3074-apple-redistribution-into-boxes](https://github.com/Dhiraj-birajdar/leetcode/tree/master/3074-apple-redistribution-into-boxes) |
| [3190-find-minimum-operations-to-make-all-elements-divisible-by-three](https://github.com/Dhiraj-birajdar/leetcode/tree/master/3190-find-minimum-operations-to-make-all-elements-divisible-by-three) |
| [3314-construct-the-minimum-bitwise-array-i](https://github.com/Dhiraj-birajdar/leetcode/tree/master/3314-construct-the-minimum-bitwise-array-i) |
| [3334-apple-redistribution-into-boxes](https://github.com/Dhiraj-birajdar/leetcode/tree/master/3334-apple-redistribution-into-boxes) |
| [3512-minimum-operations-to-make-array-sum-divisible-by-k](https://github.com/Dhiraj-birajdar/leetcode/tree/master/3512-minimum-operations-to-make-array-sum-divisible-by-k) |
## String
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0003-longest-substring-without-repeating-characters) |
| [0014-longest-common-prefix](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0014-longest-common-prefix) |
| [0020-valid-parentheses](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0020-valid-parentheses) |
| [0049-group-anagrams](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0049-group-anagrams) |
| [0058-length-of-last-word](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0058-length-of-last-word) |
| [0125-valid-palindrome](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0125-valid-palindrome) |
| [0151-reverse-words-in-a-string](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0151-reverse-words-in-a-string) |
| [0205-isomorphic-strings](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0205-isomorphic-strings) |
| [0242-valid-anagram](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0242-valid-anagram) |
| [0290-word-pattern](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0290-word-pattern) |
| [0796-rotate-string](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0796-rotate-string) |
| [1567-maximum-number-of-vowels-in-a-substring-of-given-length](https://github.com/Dhiraj-birajdar/leetcode/tree/master/1567-maximum-number-of-vowels-in-a-substring-of-given-length) |
| [1668-maximum-repeating-substring](https://github.com/Dhiraj-birajdar/leetcode/tree/master/1668-maximum-repeating-substring) |
| [1832-check-if-the-sentence-is-pangram](https://github.com/Dhiraj-birajdar/leetcode/tree/master/1832-check-if-the-sentence-is-pangram) |
| [1945-sum-of-digits-of-string-after-convert](https://github.com/Dhiraj-birajdar/leetcode/tree/master/1945-sum-of-digits-of-string-after-convert) |
| [1960-check-if-the-sentence-is-pangram](https://github.com/Dhiraj-birajdar/leetcode/tree/master/1960-check-if-the-sentence-is-pangram) |
| [2273-find-resultant-array-after-removing-anagrams](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2273-find-resultant-array-after-removing-anagrams) |
| [2351-first-letter-to-appear-twice](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2351-first-letter-to-appear-twice) |
| [2727-number-of-senior-citizens](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2727-number-of-senior-citizens) |
## Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0094-binary-tree-inorder-traversal) |
| [0100-same-tree](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0101-symmetric-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |
| [0222-count-complete-tree-nodes](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0222-count-complete-tree-nodes) |
| [0783-search-in-a-binary-search-tree](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0783-search-in-a-binary-search-tree) |
| [0904-leaf-similar-trees](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0904-leaf-similar-trees) |
| [0975-range-sum-of-bst](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0975-range-sum-of-bst) |
| [2384-root-equals-sum-of-children](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2384-root-equals-sum-of-children) |
## Depth-First Search
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0094-binary-tree-inorder-traversal) |
| [0100-same-tree](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0101-symmetric-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |
| [0904-leaf-similar-trees](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0904-leaf-similar-trees) |
| [0975-range-sum-of-bst](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0975-range-sum-of-bst) |
## Binary Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0094-binary-tree-inorder-traversal) |
| [0100-same-tree](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0101-symmetric-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |
| [0222-count-complete-tree-nodes](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0222-count-complete-tree-nodes) |
| [0783-search-in-a-binary-search-tree](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0783-search-in-a-binary-search-tree) |
| [0904-leaf-similar-trees](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0904-leaf-similar-trees) |
| [0975-range-sum-of-bst](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0975-range-sum-of-bst) |
| [2384-root-equals-sum-of-children](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2384-root-equals-sum-of-children) |
## Binary Search Tree
| |
| ------- |
| [0074-search-a-2d-matrix](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0074-search-a-2d-matrix) |
| [0162-find-peak-element](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0162-find-peak-element) |
| [0222-count-complete-tree-nodes](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0222-count-complete-tree-nodes) |
| [0633-sum-of-square-numbers](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0633-sum-of-square-numbers) |
| [0783-search-in-a-binary-search-tree](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0783-search-in-a-binary-search-tree) |
| [0975-range-sum-of-bst](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0975-range-sum-of-bst) |
## Two Pointers
| |
| ------- |
| [0011-container-with-most-water](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0015-3sum) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0027-remove-element) |
| [0042-trapping-rain-water](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0042-trapping-rain-water) |
| [0061-rotate-list](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0061-rotate-list) |
| [0075-sort-colors](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0075-sort-colors) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0088-merge-sorted-array](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0088-merge-sorted-array) |
| [0125-valid-palindrome](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0125-valid-palindrome) |
| [0141-linked-list-cycle](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0142-linked-list-cycle-ii) |
| [0151-reverse-words-in-a-string](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0151-reverse-words-in-a-string) |
| [0189-rotate-array](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0189-rotate-array) |
| [0202-happy-number](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0202-happy-number) |
| [0528-swapping-nodes-in-a-linked-list](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0528-swapping-nodes-in-a-linked-list) |
| [0633-sum-of-square-numbers](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0633-sum-of-square-numbers) |
| [0977-squares-of-a-sorted-array](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0977-squares-of-a-sorted-array) |
| [2149-rearrange-array-elements-by-sign](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2149-rearrange-array-elements-by-sign) |
## Trie
| |
| ------- |
| [0014-longest-common-prefix](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0014-longest-common-prefix) |
## Hash Table
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0003-longest-substring-without-repeating-characters) |
| [0049-group-anagrams](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0049-group-anagrams) |
| [0128-longest-consecutive-sequence](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0128-longest-consecutive-sequence) |
| [0141-linked-list-cycle](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0142-linked-list-cycle-ii) |
| [0146-lru-cache](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0146-lru-cache) |
| [0169-majority-element](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0169-majority-element) |
| [0202-happy-number](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0202-happy-number) |
| [0205-isomorphic-strings](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0205-isomorphic-strings) |
| [0217-contains-duplicate](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0217-contains-duplicate) |
| [0229-majority-element-ii](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0229-majority-element-ii) |
| [0242-valid-anagram](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0242-valid-anagram) |
| [0290-word-pattern](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0290-word-pattern) |
| [0347-top-k-frequent-elements](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0347-top-k-frequent-elements) |
| [1832-check-if-the-sentence-is-pangram](https://github.com/Dhiraj-birajdar/leetcode/tree/master/1832-check-if-the-sentence-is-pangram) |
| [1960-check-if-the-sentence-is-pangram](https://github.com/Dhiraj-birajdar/leetcode/tree/master/1960-check-if-the-sentence-is-pangram) |
| [2273-find-resultant-array-after-removing-anagrams](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2273-find-resultant-array-after-removing-anagrams) |
| [2351-first-letter-to-appear-twice](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2351-first-letter-to-appear-twice) |
## Graph
| |
| ------- |
| [1916-find-center-of-star-graph](https://github.com/Dhiraj-birajdar/leetcode/tree/master/1916-find-center-of-star-graph) |
## Sliding Window
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0003-longest-substring-without-repeating-characters) |
| [0643-maximum-average-subarray-i](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0643-maximum-average-subarray-i) |
| [1567-maximum-number-of-vowels-in-a-substring-of-given-length](https://github.com/Dhiraj-birajdar/leetcode/tree/master/1567-maximum-number-of-vowels-in-a-substring-of-given-length) |
## Matrix
| |
| ------- |
| [0048-rotate-image](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0048-rotate-image) |
| [0074-search-a-2d-matrix](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0074-search-a-2d-matrix) |
## Greedy
| |
| ------- |
| [0011-container-with-most-water](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0011-container-with-most-water) |
| [1323-maximum-69-number](https://github.com/Dhiraj-birajdar/leetcode/tree/master/1323-maximum-69-number) |
| [3074-apple-redistribution-into-boxes](https://github.com/Dhiraj-birajdar/leetcode/tree/master/3074-apple-redistribution-into-boxes) |
| [3334-apple-redistribution-into-boxes](https://github.com/Dhiraj-birajdar/leetcode/tree/master/3334-apple-redistribution-into-boxes) |
## Sorting
| |
| ------- |
| [0015-3sum](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0015-3sum) |
| [0049-group-anagrams](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0049-group-anagrams) |
| [0075-sort-colors](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0075-sort-colors) |
| [0088-merge-sorted-array](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0088-merge-sorted-array) |
| [0169-majority-element](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0169-majority-element) |
| [0217-contains-duplicate](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0217-contains-duplicate) |
| [0229-majority-element-ii](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0229-majority-element-ii) |
| [0242-valid-anagram](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0242-valid-anagram) |
| [0347-top-k-frequent-elements](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0347-top-k-frequent-elements) |
| [0414-third-maximum-number](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0414-third-maximum-number) |
| [0977-squares-of-a-sorted-array](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0977-squares-of-a-sorted-array) |
| [2273-find-resultant-array-after-removing-anagrams](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2273-find-resultant-array-after-removing-anagrams) |
| [3010-divide-an-array-into-subarrays-with-minimum-cost-i](https://github.com/Dhiraj-birajdar/leetcode/tree/master/3010-divide-an-array-into-subarrays-with-minimum-cost-i) |
| [3074-apple-redistribution-into-boxes](https://github.com/Dhiraj-birajdar/leetcode/tree/master/3074-apple-redistribution-into-boxes) |
| [3334-apple-redistribution-into-boxes](https://github.com/Dhiraj-birajdar/leetcode/tree/master/3334-apple-redistribution-into-boxes) |
## Bit Manipulation
| |
| ------- |
| [0222-count-complete-tree-nodes](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0222-count-complete-tree-nodes) |
| [0476-number-complement](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0476-number-complement) |
| [1054-complement-of-base-10-integer](https://github.com/Dhiraj-birajdar/leetcode/tree/master/1054-complement-of-base-10-integer) |
| [2351-first-letter-to-appear-twice](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2351-first-letter-to-appear-twice) |
| [3314-construct-the-minimum-bitwise-array-i](https://github.com/Dhiraj-birajdar/leetcode/tree/master/3314-construct-the-minimum-bitwise-array-i) |
## Dynamic Programming
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0042-trapping-rain-water) |
| [0053-maximum-subarray](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0053-maximum-subarray) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [1668-maximum-repeating-substring](https://github.com/Dhiraj-birajdar/leetcode/tree/master/1668-maximum-repeating-substring) |
## Breadth-First Search
| |
| ------- |
| [0100-same-tree](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0100-same-tree) |
| [0101-symmetric-tree](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0101-symmetric-tree) |
| [0104-maximum-depth-of-binary-tree](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |
## Database
| |
| ------- |
| [0181-employees-earning-more-than-their-managers](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0181-employees-earning-more-than-their-managers) |
| [0577-employee-bonus](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0577-employee-bonus) |
| [0584-find-customer-referee](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0584-find-customer-referee) |
| [0586-customer-placing-the-largest-number-of-orders](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0586-customer-placing-the-largest-number-of-orders) |
| [0610-triangle-judgement](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0610-triangle-judgement) |
## Design
| |
| ------- |
| [0146-lru-cache](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0146-lru-cache) |
| [0225-implement-stack-using-queues](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0225-implement-stack-using-queues) |
| [0303-range-sum-query-immutable](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0303-range-sum-query-immutable) |
## Queue
| |
| ------- |
| [0225-implement-stack-using-queues](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0225-implement-stack-using-queues) |
## Union Find
| |
| ------- |
| [0128-longest-consecutive-sequence](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0128-longest-consecutive-sequence) |
## Divide and Conquer
| |
| ------- |
| [0053-maximum-subarray](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0053-maximum-subarray) |
| [0169-majority-element](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0169-majority-element) |
| [0347-top-k-frequent-elements](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0347-top-k-frequent-elements) |
## Counting
| |
| ------- |
| [0169-majority-element](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0169-majority-element) |
| [0229-majority-element-ii](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0229-majority-element-ii) |
| [0347-top-k-frequent-elements](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0347-top-k-frequent-elements) |
| [2351-first-letter-to-appear-twice](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2351-first-letter-to-appear-twice) |
## Heap (Priority Queue)
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0347-top-k-frequent-elements) |
## Bucket Sort
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0347-top-k-frequent-elements) |
## Quickselect
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0347-top-k-frequent-elements) |
## Prefix Sum
| |
| ------- |
| [0238-product-of-array-except-self](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0238-product-of-array-except-self) |
| [0303-range-sum-query-immutable](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0303-range-sum-query-immutable) |
## String Matching
| |
| ------- |
| [0796-rotate-string](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0796-rotate-string) |
| [1668-maximum-repeating-substring](https://github.com/Dhiraj-birajdar/leetcode/tree/master/1668-maximum-repeating-substring) |
## Simulation
| |
| ------- |
| [0258-add-digits](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0258-add-digits) |
| [1945-sum-of-digits-of-string-after-convert](https://github.com/Dhiraj-birajdar/leetcode/tree/master/1945-sum-of-digits-of-string-after-convert) |
| [2149-rearrange-array-elements-by-sign](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2149-rearrange-array-elements-by-sign) |
## Number Theory
| |
| ------- |
| [0258-add-digits](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0258-add-digits) |
## Enumeration
| |
| ------- |
| [2951-find-the-peaks](https://github.com/Dhiraj-birajdar/leetcode/tree/master/2951-find-the-peaks) |
| [3010-divide-an-array-into-subarrays-with-minimum-cost-i](https://github.com/Dhiraj-birajdar/leetcode/tree/master/3010-divide-an-array-into-subarrays-with-minimum-cost-i) |
## Monotonic Stack
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0042-trapping-rain-water) |
## Doubly-Linked List
| |
| ------- |
| [0146-lru-cache](https://github.com/Dhiraj-birajdar/leetcode/tree/master/0146-lru-cache) |
<!---LeetCode Topics End-->