Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/decodewithdeepak/leetcode
Leetcode Solutions to the the problems i solved
https://github.com/decodewithdeepak/leetcode
Last synced: about 2 months ago
JSON representation
Leetcode Solutions to the the problems i solved
- Host: GitHub
- URL: https://github.com/decodewithdeepak/leetcode
- Owner: decodewithdeepak
- Created: 2024-02-19T13:50:05.000Z (12 months ago)
- Default Branch: main
- Last Pushed: 2024-11-07T20:08:43.000Z (3 months ago)
- Last Synced: 2024-11-07T20:26:32.019Z (3 months ago)
- Language: Java
- Size: 710 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# leetcode
Leetcode Solutions to the the problems i solved
# LeetCode Topics
## Backtracking
| |
| ------- |
| [0078-subsets](https://github.com/decodewithdeepak/leetcode/tree/master/0078-subsets) |
| [0813-all-paths-from-source-to-target](https://github.com/decodewithdeepak/leetcode/tree/master/0813-all-paths-from-source-to-target) |
## Depth-First Search
| |
| ------- |
| [0104-maximum-depth-of-binary-tree](https://github.com/decodewithdeepak/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/decodewithdeepak/leetcode/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0813-all-paths-from-source-to-target](https://github.com/decodewithdeepak/leetcode/tree/master/0813-all-paths-from-source-to-target) |
| [2461-amount-of-time-for-binary-tree-to-be-infected](https://github.com/decodewithdeepak/leetcode/tree/master/2461-amount-of-time-for-binary-tree-to-be-infected) |
## Breadth-First Search
| |
| ------- |
| [0104-maximum-depth-of-binary-tree](https://github.com/decodewithdeepak/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |
| [0813-all-paths-from-source-to-target](https://github.com/decodewithdeepak/leetcode/tree/master/0813-all-paths-from-source-to-target) |
| [2461-amount-of-time-for-binary-tree-to-be-infected](https://github.com/decodewithdeepak/leetcode/tree/master/2461-amount-of-time-for-binary-tree-to-be-infected) |
## Graph
| |
| ------- |
| [0813-all-paths-from-source-to-target](https://github.com/decodewithdeepak/leetcode/tree/master/0813-all-paths-from-source-to-target) |
## Math
| |
| ------- |
| [0002-add-two-numbers](https://github.com/decodewithdeepak/leetcode/tree/master/0002-add-two-numbers) |
| [0007-reverse-integer](https://github.com/decodewithdeepak/leetcode/tree/master/0007-reverse-integer) |
| [0009-palindrome-number](https://github.com/decodewithdeepak/leetcode/tree/master/0009-palindrome-number) |
| [0012-integer-to-roman](https://github.com/decodewithdeepak/leetcode/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/decodewithdeepak/leetcode/tree/master/0013-roman-to-integer) |
| [0029-divide-two-integers](https://github.com/decodewithdeepak/leetcode/tree/master/0029-divide-two-integers) |
| [0048-rotate-image](https://github.com/decodewithdeepak/leetcode/tree/master/0048-rotate-image) |
| [0050-powx-n](https://github.com/decodewithdeepak/leetcode/tree/master/0050-powx-n) |
| [0066-plus-one](https://github.com/decodewithdeepak/leetcode/tree/master/0066-plus-one) |
| [0069-sqrtx](https://github.com/decodewithdeepak/leetcode/tree/master/0069-sqrtx) |
| [0168-excel-sheet-column-title](https://github.com/decodewithdeepak/leetcode/tree/master/0168-excel-sheet-column-title) |
| [0171-excel-sheet-column-number](https://github.com/decodewithdeepak/leetcode/tree/master/0171-excel-sheet-column-number) |
| [0172-factorial-trailing-zeroes](https://github.com/decodewithdeepak/leetcode/tree/master/0172-factorial-trailing-zeroes) |
| [0189-rotate-array](https://github.com/decodewithdeepak/leetcode/tree/master/0189-rotate-array) |
| [0231-power-of-two](https://github.com/decodewithdeepak/leetcode/tree/master/0231-power-of-two) |
| [0268-missing-number](https://github.com/decodewithdeepak/leetcode/tree/master/0268-missing-number) |
| [0273-integer-to-english-words](https://github.com/decodewithdeepak/leetcode/tree/master/0273-integer-to-english-words) |
| [0412-fizz-buzz](https://github.com/decodewithdeepak/leetcode/tree/master/0412-fizz-buzz) |
| [0628-maximum-product-of-three-numbers](https://github.com/decodewithdeepak/leetcode/tree/master/0628-maximum-product-of-three-numbers) |
| [1013-fibonacci-number](https://github.com/decodewithdeepak/leetcode/tree/master/1013-fibonacci-number) |
| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/decodewithdeepak/leetcode/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |
| [1635-number-of-good-pairs](https://github.com/decodewithdeepak/leetcode/tree/master/1635-number-of-good-pairs) |
| [2032-largest-odd-number-in-string](https://github.com/decodewithdeepak/leetcode/tree/master/2032-largest-odd-number-in-string) |
| [2383-add-two-integers](https://github.com/decodewithdeepak/leetcode/tree/master/2383-add-two-integers) |
| [2556-convert-the-temperature](https://github.com/decodewithdeepak/leetcode/tree/master/2556-convert-the-temperature) |
## Two Pointers
| |
| ------- |
| [0011-container-with-most-water](https://github.com/decodewithdeepak/leetcode/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/decodewithdeepak/leetcode/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/decodewithdeepak/leetcode/tree/master/0016-3sum-closest) |
| [0018-4sum](https://github.com/decodewithdeepak/leetcode/tree/master/0018-4sum) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/decodewithdeepak/leetcode/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/decodewithdeepak/leetcode/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/decodewithdeepak/leetcode/tree/master/0027-remove-element) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/decodewithdeepak/leetcode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0031-next-permutation](https://github.com/decodewithdeepak/leetcode/tree/master/0031-next-permutation) |
| [0042-trapping-rain-water](https://github.com/decodewithdeepak/leetcode/tree/master/0042-trapping-rain-water) |
| [0075-sort-colors](https://github.com/decodewithdeepak/leetcode/tree/master/0075-sort-colors) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0088-merge-sorted-array](https://github.com/decodewithdeepak/leetcode/tree/master/0088-merge-sorted-array) |
| [0125-valid-palindrome](https://github.com/decodewithdeepak/leetcode/tree/master/0125-valid-palindrome) |
| [0141-linked-list-cycle](https://github.com/decodewithdeepak/leetcode/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0142-linked-list-cycle-ii) |
| [0148-sort-list](https://github.com/decodewithdeepak/leetcode/tree/master/0148-sort-list) |
| [0151-reverse-words-in-a-string](https://github.com/decodewithdeepak/leetcode/tree/master/0151-reverse-words-in-a-string) |
| [0160-intersection-of-two-linked-lists](https://github.com/decodewithdeepak/leetcode/tree/master/0160-intersection-of-two-linked-lists) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/decodewithdeepak/leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0189-rotate-array](https://github.com/decodewithdeepak/leetcode/tree/master/0189-rotate-array) |
| [0234-palindrome-linked-list](https://github.com/decodewithdeepak/leetcode/tree/master/0234-palindrome-linked-list) |
| [0283-move-zeroes](https://github.com/decodewithdeepak/leetcode/tree/master/0283-move-zeroes) |
| [0349-intersection-of-two-arrays](https://github.com/decodewithdeepak/leetcode/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0350-intersection-of-two-arrays-ii) |
| [0392-is-subsequence](https://github.com/decodewithdeepak/leetcode/tree/master/0392-is-subsequence) |
| [0908-middle-of-the-linked-list](https://github.com/decodewithdeepak/leetcode/tree/master/0908-middle-of-the-linked-list) |
| [1019-squares-of-a-sorted-array](https://github.com/decodewithdeepak/leetcode/tree/master/1019-squares-of-a-sorted-array) |
| [2271-rearrange-array-elements-by-sign](https://github.com/decodewithdeepak/leetcode/tree/master/2271-rearrange-array-elements-by-sign) |
## String
| |
| ------- |
| [0012-integer-to-roman](https://github.com/decodewithdeepak/leetcode/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/decodewithdeepak/leetcode/tree/master/0013-roman-to-integer) |
| [0014-longest-common-prefix](https://github.com/decodewithdeepak/leetcode/tree/master/0014-longest-common-prefix) |
| [0020-valid-parentheses](https://github.com/decodewithdeepak/leetcode/tree/master/0020-valid-parentheses) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/decodewithdeepak/leetcode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0049-group-anagrams](https://github.com/decodewithdeepak/leetcode/tree/master/0049-group-anagrams) |
| [0058-length-of-last-word](https://github.com/decodewithdeepak/leetcode/tree/master/0058-length-of-last-word) |
| [0125-valid-palindrome](https://github.com/decodewithdeepak/leetcode/tree/master/0125-valid-palindrome) |
| [0151-reverse-words-in-a-string](https://github.com/decodewithdeepak/leetcode/tree/master/0151-reverse-words-in-a-string) |
| [0168-excel-sheet-column-title](https://github.com/decodewithdeepak/leetcode/tree/master/0168-excel-sheet-column-title) |
| [0171-excel-sheet-column-number](https://github.com/decodewithdeepak/leetcode/tree/master/0171-excel-sheet-column-number) |
| [0205-isomorphic-strings](https://github.com/decodewithdeepak/leetcode/tree/master/0205-isomorphic-strings) |
| [0242-valid-anagram](https://github.com/decodewithdeepak/leetcode/tree/master/0242-valid-anagram) |
| [0273-integer-to-english-words](https://github.com/decodewithdeepak/leetcode/tree/master/0273-integer-to-english-words) |
| [0392-is-subsequence](https://github.com/decodewithdeepak/leetcode/tree/master/0392-is-subsequence) |
| [0394-decode-string](https://github.com/decodewithdeepak/leetcode/tree/master/0394-decode-string) |
| [0402-remove-k-digits](https://github.com/decodewithdeepak/leetcode/tree/master/0402-remove-k-digits) |
| [0412-fizz-buzz](https://github.com/decodewithdeepak/leetcode/tree/master/0412-fizz-buzz) |
| [0742-to-lower-case](https://github.com/decodewithdeepak/leetcode/tree/master/0742-to-lower-case) |
| [0782-jewels-and-stones](https://github.com/decodewithdeepak/leetcode/tree/master/0782-jewels-and-stones) |
| [0812-rotate-string](https://github.com/decodewithdeepak/leetcode/tree/master/0812-rotate-string) |
| [1078-remove-outermost-parentheses](https://github.com/decodewithdeepak/leetcode/tree/master/1078-remove-outermost-parentheses) |
| [1737-maximum-nesting-depth-of-the-parentheses](https://github.com/decodewithdeepak/leetcode/tree/master/1737-maximum-nesting-depth-of-the-parentheses) |
| [1786-count-the-number-of-consistent-strings](https://github.com/decodewithdeepak/leetcode/tree/master/1786-count-the-number-of-consistent-strings) |
| [2032-largest-odd-number-in-string](https://github.com/decodewithdeepak/leetcode/tree/master/2032-largest-odd-number-in-string) |
| [2470-removing-stars-from-a-string](https://github.com/decodewithdeepak/leetcode/tree/master/2470-removing-stars-from-a-string) |
## Dynamic Programming
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/decodewithdeepak/leetcode/tree/master/0042-trapping-rain-water) |
| [0053-maximum-subarray](https://github.com/decodewithdeepak/leetcode/tree/master/0053-maximum-subarray) |
| [0085-maximal-rectangle](https://github.com/decodewithdeepak/leetcode/tree/master/0085-maximal-rectangle) |
| [0118-pascals-triangle](https://github.com/decodewithdeepak/leetcode/tree/master/0118-pascals-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/decodewithdeepak/leetcode/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0152-maximum-product-subarray](https://github.com/decodewithdeepak/leetcode/tree/master/0152-maximum-product-subarray) |
| [0392-is-subsequence](https://github.com/decodewithdeepak/leetcode/tree/master/0392-is-subsequence) |
| [0943-sum-of-subarray-minimums](https://github.com/decodewithdeepak/leetcode/tree/master/0943-sum-of-subarray-minimums) |
| [1013-fibonacci-number](https://github.com/decodewithdeepak/leetcode/tree/master/1013-fibonacci-number) |
## Recursion
| |
| ------- |
| [0002-add-two-numbers](https://github.com/decodewithdeepak/leetcode/tree/master/0002-add-two-numbers) |
| [0050-powx-n](https://github.com/decodewithdeepak/leetcode/tree/master/0050-powx-n) |
| [0206-reverse-linked-list](https://github.com/decodewithdeepak/leetcode/tree/master/0206-reverse-linked-list) |
| [0231-power-of-two](https://github.com/decodewithdeepak/leetcode/tree/master/0231-power-of-two) |
| [0234-palindrome-linked-list](https://github.com/decodewithdeepak/leetcode/tree/master/0234-palindrome-linked-list) |
| [0273-integer-to-english-words](https://github.com/decodewithdeepak/leetcode/tree/master/0273-integer-to-english-words) |
| [0394-decode-string](https://github.com/decodewithdeepak/leetcode/tree/master/0394-decode-string) |
| [1013-fibonacci-number](https://github.com/decodewithdeepak/leetcode/tree/master/1013-fibonacci-number) |
## Memoization
| |
| ------- |
| [1013-fibonacci-number](https://github.com/decodewithdeepak/leetcode/tree/master/1013-fibonacci-number) |
## Array
| |
| ------- |
| [0001-two-sum](https://github.com/decodewithdeepak/leetcode/tree/master/0001-two-sum) |
| [0011-container-with-most-water](https://github.com/decodewithdeepak/leetcode/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/decodewithdeepak/leetcode/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/decodewithdeepak/leetcode/tree/master/0016-3sum-closest) |
| [0018-4sum](https://github.com/decodewithdeepak/leetcode/tree/master/0018-4sum) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/decodewithdeepak/leetcode/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/decodewithdeepak/leetcode/tree/master/0027-remove-element) |
| [0031-next-permutation](https://github.com/decodewithdeepak/leetcode/tree/master/0031-next-permutation) |
| [0033-search-in-rotated-sorted-array](https://github.com/decodewithdeepak/leetcode/tree/master/0033-search-in-rotated-sorted-array) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/decodewithdeepak/leetcode/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0035-search-insert-position](https://github.com/decodewithdeepak/leetcode/tree/master/0035-search-insert-position) |
| [0042-trapping-rain-water](https://github.com/decodewithdeepak/leetcode/tree/master/0042-trapping-rain-water) |
| [0048-rotate-image](https://github.com/decodewithdeepak/leetcode/tree/master/0048-rotate-image) |
| [0049-group-anagrams](https://github.com/decodewithdeepak/leetcode/tree/master/0049-group-anagrams) |
| [0053-maximum-subarray](https://github.com/decodewithdeepak/leetcode/tree/master/0053-maximum-subarray) |
| [0054-spiral-matrix](https://github.com/decodewithdeepak/leetcode/tree/master/0054-spiral-matrix) |
| [0056-merge-intervals](https://github.com/decodewithdeepak/leetcode/tree/master/0056-merge-intervals) |
| [0059-spiral-matrix-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0059-spiral-matrix-ii) |
| [0066-plus-one](https://github.com/decodewithdeepak/leetcode/tree/master/0066-plus-one) |
| [0073-set-matrix-zeroes](https://github.com/decodewithdeepak/leetcode/tree/master/0073-set-matrix-zeroes) |
| [0075-sort-colors](https://github.com/decodewithdeepak/leetcode/tree/master/0075-sort-colors) |
| [0078-subsets](https://github.com/decodewithdeepak/leetcode/tree/master/0078-subsets) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0081-search-in-rotated-sorted-array-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0081-search-in-rotated-sorted-array-ii) |
| [0084-largest-rectangle-in-histogram](https://github.com/decodewithdeepak/leetcode/tree/master/0084-largest-rectangle-in-histogram) |
| [0085-maximal-rectangle](https://github.com/decodewithdeepak/leetcode/tree/master/0085-maximal-rectangle) |
| [0088-merge-sorted-array](https://github.com/decodewithdeepak/leetcode/tree/master/0088-merge-sorted-array) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/decodewithdeepak/leetcode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0118-pascals-triangle](https://github.com/decodewithdeepak/leetcode/tree/master/0118-pascals-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/decodewithdeepak/leetcode/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0128-longest-consecutive-sequence](https://github.com/decodewithdeepak/leetcode/tree/master/0128-longest-consecutive-sequence) |
| [0136-single-number](https://github.com/decodewithdeepak/leetcode/tree/master/0136-single-number) |
| [0152-maximum-product-subarray](https://github.com/decodewithdeepak/leetcode/tree/master/0152-maximum-product-subarray) |
| [0153-find-minimum-in-rotated-sorted-array](https://github.com/decodewithdeepak/leetcode/tree/master/0153-find-minimum-in-rotated-sorted-array) |
| [0162-find-peak-element](https://github.com/decodewithdeepak/leetcode/tree/master/0162-find-peak-element) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/decodewithdeepak/leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0169-majority-element](https://github.com/decodewithdeepak/leetcode/tree/master/0169-majority-element) |
| [0189-rotate-array](https://github.com/decodewithdeepak/leetcode/tree/master/0189-rotate-array) |
| [0217-contains-duplicate](https://github.com/decodewithdeepak/leetcode/tree/master/0217-contains-duplicate) |
| [0229-majority-element-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0229-majority-element-ii) |
| [0238-product-of-array-except-self](https://github.com/decodewithdeepak/leetcode/tree/master/0238-product-of-array-except-self) |
| [0239-sliding-window-maximum](https://github.com/decodewithdeepak/leetcode/tree/master/0239-sliding-window-maximum) |
| [0268-missing-number](https://github.com/decodewithdeepak/leetcode/tree/master/0268-missing-number) |
| [0283-move-zeroes](https://github.com/decodewithdeepak/leetcode/tree/master/0283-move-zeroes) |
| [0349-intersection-of-two-arrays](https://github.com/decodewithdeepak/leetcode/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0350-intersection-of-two-arrays-ii) |
| [0442-find-all-duplicates-in-an-array](https://github.com/decodewithdeepak/leetcode/tree/master/0442-find-all-duplicates-in-an-array) |
| [0485-max-consecutive-ones](https://github.com/decodewithdeepak/leetcode/tree/master/0485-max-consecutive-ones) |
| [0493-reverse-pairs](https://github.com/decodewithdeepak/leetcode/tree/master/0493-reverse-pairs) |
| [0496-next-greater-element-i](https://github.com/decodewithdeepak/leetcode/tree/master/0496-next-greater-element-i) |
| [0503-next-greater-element-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0503-next-greater-element-ii) |
| [0540-single-element-in-a-sorted-array](https://github.com/decodewithdeepak/leetcode/tree/master/0540-single-element-in-a-sorted-array) |
| [0560-subarray-sum-equals-k](https://github.com/decodewithdeepak/leetcode/tree/master/0560-subarray-sum-equals-k) |
| [0561-array-partition](https://github.com/decodewithdeepak/leetcode/tree/master/0561-array-partition) |
| [0628-maximum-product-of-three-numbers](https://github.com/decodewithdeepak/leetcode/tree/master/0628-maximum-product-of-three-numbers) |
| [0735-asteroid-collision](https://github.com/decodewithdeepak/leetcode/tree/master/0735-asteroid-collision) |
| [0792-binary-search](https://github.com/decodewithdeepak/leetcode/tree/master/0792-binary-search) |
| [0882-peak-index-in-a-mountain-array](https://github.com/decodewithdeepak/leetcode/tree/master/0882-peak-index-in-a-mountain-array) |
| [0907-koko-eating-bananas](https://github.com/decodewithdeepak/leetcode/tree/master/0907-koko-eating-bananas) |
| [0943-sum-of-subarray-minimums](https://github.com/decodewithdeepak/leetcode/tree/master/0943-sum-of-subarray-minimums) |
| [1019-squares-of-a-sorted-array](https://github.com/decodewithdeepak/leetcode/tree/master/1019-squares-of-a-sorted-array) |
| [1635-number-of-good-pairs](https://github.com/decodewithdeepak/leetcode/tree/master/1635-number-of-good-pairs) |
| [1786-count-the-number-of-consistent-strings](https://github.com/decodewithdeepak/leetcode/tree/master/1786-count-the-number-of-consistent-strings) |
| [1878-check-if-array-is-sorted-and-rotated](https://github.com/decodewithdeepak/leetcode/tree/master/1878-check-if-array-is-sorted-and-rotated) |
| [2015-determine-whether-matrix-can-be-obtained-by-rotation](https://github.com/decodewithdeepak/leetcode/tree/master/2015-determine-whether-matrix-can-be-obtained-by-rotation) |
| [2058-concatenation-of-array](https://github.com/decodewithdeepak/leetcode/tree/master/2058-concatenation-of-array) |
| [2132-convert-1d-array-into-2d-array](https://github.com/decodewithdeepak/leetcode/tree/master/2132-convert-1d-array-into-2d-array) |
| [2227-sum-of-subarray-ranges](https://github.com/decodewithdeepak/leetcode/tree/master/2227-sum-of-subarray-ranges) |
| [2271-rearrange-array-elements-by-sign](https://github.com/decodewithdeepak/leetcode/tree/master/2271-rearrange-array-elements-by-sign) |
## Sorting
| |
| ------- |
| [0015-3sum](https://github.com/decodewithdeepak/leetcode/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/decodewithdeepak/leetcode/tree/master/0016-3sum-closest) |
| [0018-4sum](https://github.com/decodewithdeepak/leetcode/tree/master/0018-4sum) |
| [0049-group-anagrams](https://github.com/decodewithdeepak/leetcode/tree/master/0049-group-anagrams) |
| [0056-merge-intervals](https://github.com/decodewithdeepak/leetcode/tree/master/0056-merge-intervals) |
| [0075-sort-colors](https://github.com/decodewithdeepak/leetcode/tree/master/0075-sort-colors) |
| [0088-merge-sorted-array](https://github.com/decodewithdeepak/leetcode/tree/master/0088-merge-sorted-array) |
| [0148-sort-list](https://github.com/decodewithdeepak/leetcode/tree/master/0148-sort-list) |
| [0169-majority-element](https://github.com/decodewithdeepak/leetcode/tree/master/0169-majority-element) |
| [0217-contains-duplicate](https://github.com/decodewithdeepak/leetcode/tree/master/0217-contains-duplicate) |
| [0229-majority-element-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0229-majority-element-ii) |
| [0242-valid-anagram](https://github.com/decodewithdeepak/leetcode/tree/master/0242-valid-anagram) |
| [0268-missing-number](https://github.com/decodewithdeepak/leetcode/tree/master/0268-missing-number) |
| [0349-intersection-of-two-arrays](https://github.com/decodewithdeepak/leetcode/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0350-intersection-of-two-arrays-ii) |
| [0561-array-partition](https://github.com/decodewithdeepak/leetcode/tree/master/0561-array-partition) |
| [0628-maximum-product-of-three-numbers](https://github.com/decodewithdeepak/leetcode/tree/master/0628-maximum-product-of-three-numbers) |
| [1019-squares-of-a-sorted-array](https://github.com/decodewithdeepak/leetcode/tree/master/1019-squares-of-a-sorted-array) |
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/decodewithdeepak/leetcode/tree/master/0001-two-sum) |
| [0012-integer-to-roman](https://github.com/decodewithdeepak/leetcode/tree/master/0012-integer-to-roman) |
| [0013-roman-to-integer](https://github.com/decodewithdeepak/leetcode/tree/master/0013-roman-to-integer) |
| [0049-group-anagrams](https://github.com/decodewithdeepak/leetcode/tree/master/0049-group-anagrams) |
| [0073-set-matrix-zeroes](https://github.com/decodewithdeepak/leetcode/tree/master/0073-set-matrix-zeroes) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/decodewithdeepak/leetcode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0128-longest-consecutive-sequence](https://github.com/decodewithdeepak/leetcode/tree/master/0128-longest-consecutive-sequence) |
| [0141-linked-list-cycle](https://github.com/decodewithdeepak/leetcode/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0142-linked-list-cycle-ii) |
| [0160-intersection-of-two-linked-lists](https://github.com/decodewithdeepak/leetcode/tree/master/0160-intersection-of-two-linked-lists) |
| [0169-majority-element](https://github.com/decodewithdeepak/leetcode/tree/master/0169-majority-element) |
| [0205-isomorphic-strings](https://github.com/decodewithdeepak/leetcode/tree/master/0205-isomorphic-strings) |
| [0217-contains-duplicate](https://github.com/decodewithdeepak/leetcode/tree/master/0217-contains-duplicate) |
| [0229-majority-element-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0229-majority-element-ii) |
| [0242-valid-anagram](https://github.com/decodewithdeepak/leetcode/tree/master/0242-valid-anagram) |
| [0268-missing-number](https://github.com/decodewithdeepak/leetcode/tree/master/0268-missing-number) |
| [0349-intersection-of-two-arrays](https://github.com/decodewithdeepak/leetcode/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0350-intersection-of-two-arrays-ii) |
| [0442-find-all-duplicates-in-an-array](https://github.com/decodewithdeepak/leetcode/tree/master/0442-find-all-duplicates-in-an-array) |
| [0496-next-greater-element-i](https://github.com/decodewithdeepak/leetcode/tree/master/0496-next-greater-element-i) |
| [0560-subarray-sum-equals-k](https://github.com/decodewithdeepak/leetcode/tree/master/0560-subarray-sum-equals-k) |
| [0782-jewels-and-stones](https://github.com/decodewithdeepak/leetcode/tree/master/0782-jewels-and-stones) |
| [1635-number-of-good-pairs](https://github.com/decodewithdeepak/leetcode/tree/master/1635-number-of-good-pairs) |
| [1786-count-the-number-of-consistent-strings](https://github.com/decodewithdeepak/leetcode/tree/master/1786-count-the-number-of-consistent-strings) |
| [2461-amount-of-time-for-binary-tree-to-be-infected](https://github.com/decodewithdeepak/leetcode/tree/master/2461-amount-of-time-for-binary-tree-to-be-infected) |
## Binary Search
| |
| ------- |
| [0033-search-in-rotated-sorted-array](https://github.com/decodewithdeepak/leetcode/tree/master/0033-search-in-rotated-sorted-array) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/decodewithdeepak/leetcode/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0035-search-insert-position](https://github.com/decodewithdeepak/leetcode/tree/master/0035-search-insert-position) |
| [0069-sqrtx](https://github.com/decodewithdeepak/leetcode/tree/master/0069-sqrtx) |
| [0081-search-in-rotated-sorted-array-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0081-search-in-rotated-sorted-array-ii) |
| [0153-find-minimum-in-rotated-sorted-array](https://github.com/decodewithdeepak/leetcode/tree/master/0153-find-minimum-in-rotated-sorted-array) |
| [0162-find-peak-element](https://github.com/decodewithdeepak/leetcode/tree/master/0162-find-peak-element) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/decodewithdeepak/leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0222-count-complete-tree-nodes](https://github.com/decodewithdeepak/leetcode/tree/master/0222-count-complete-tree-nodes) |
| [0268-missing-number](https://github.com/decodewithdeepak/leetcode/tree/master/0268-missing-number) |
| [0349-intersection-of-two-arrays](https://github.com/decodewithdeepak/leetcode/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0350-intersection-of-two-arrays-ii) |
| [0493-reverse-pairs](https://github.com/decodewithdeepak/leetcode/tree/master/0493-reverse-pairs) |
| [0540-single-element-in-a-sorted-array](https://github.com/decodewithdeepak/leetcode/tree/master/0540-single-element-in-a-sorted-array) |
| [0792-binary-search](https://github.com/decodewithdeepak/leetcode/tree/master/0792-binary-search) |
| [0882-peak-index-in-a-mountain-array](https://github.com/decodewithdeepak/leetcode/tree/master/0882-peak-index-in-a-mountain-array) |
| [0907-koko-eating-bananas](https://github.com/decodewithdeepak/leetcode/tree/master/0907-koko-eating-bananas) |
## Bit Manipulation
| |
| ------- |
| [0029-divide-two-integers](https://github.com/decodewithdeepak/leetcode/tree/master/0029-divide-two-integers) |
| [0078-subsets](https://github.com/decodewithdeepak/leetcode/tree/master/0078-subsets) |
| [0136-single-number](https://github.com/decodewithdeepak/leetcode/tree/master/0136-single-number) |
| [0222-count-complete-tree-nodes](https://github.com/decodewithdeepak/leetcode/tree/master/0222-count-complete-tree-nodes) |
| [0231-power-of-two](https://github.com/decodewithdeepak/leetcode/tree/master/0231-power-of-two) |
| [0268-missing-number](https://github.com/decodewithdeepak/leetcode/tree/master/0268-missing-number) |
| [1786-count-the-number-of-consistent-strings](https://github.com/decodewithdeepak/leetcode/tree/master/1786-count-the-number-of-consistent-strings) |
## Divide and Conquer
| |
| ------- |
| [0053-maximum-subarray](https://github.com/decodewithdeepak/leetcode/tree/master/0053-maximum-subarray) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/decodewithdeepak/leetcode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0148-sort-list](https://github.com/decodewithdeepak/leetcode/tree/master/0148-sort-list) |
| [0169-majority-element](https://github.com/decodewithdeepak/leetcode/tree/master/0169-majority-element) |
| [0493-reverse-pairs](https://github.com/decodewithdeepak/leetcode/tree/master/0493-reverse-pairs) |
## Counting
| |
| ------- |
| [0169-majority-element](https://github.com/decodewithdeepak/leetcode/tree/master/0169-majority-element) |
| [0229-majority-element-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0229-majority-element-ii) |
| [1635-number-of-good-pairs](https://github.com/decodewithdeepak/leetcode/tree/master/1635-number-of-good-pairs) |
| [1786-count-the-number-of-consistent-strings](https://github.com/decodewithdeepak/leetcode/tree/master/1786-count-the-number-of-consistent-strings) |
## Simulation
| |
| ------- |
| [0054-spiral-matrix](https://github.com/decodewithdeepak/leetcode/tree/master/0054-spiral-matrix) |
| [0059-spiral-matrix-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0059-spiral-matrix-ii) |
| [0412-fizz-buzz](https://github.com/decodewithdeepak/leetcode/tree/master/0412-fizz-buzz) |
| [0735-asteroid-collision](https://github.com/decodewithdeepak/leetcode/tree/master/0735-asteroid-collision) |
| [2058-concatenation-of-array](https://github.com/decodewithdeepak/leetcode/tree/master/2058-concatenation-of-array) |
| [2132-convert-1d-array-into-2d-array](https://github.com/decodewithdeepak/leetcode/tree/master/2132-convert-1d-array-into-2d-array) |
| [2271-rearrange-array-elements-by-sign](https://github.com/decodewithdeepak/leetcode/tree/master/2271-rearrange-array-elements-by-sign) |
| [2470-removing-stars-from-a-string](https://github.com/decodewithdeepak/leetcode/tree/master/2470-removing-stars-from-a-string) |
## Matrix
| |
| ------- |
| [0048-rotate-image](https://github.com/decodewithdeepak/leetcode/tree/master/0048-rotate-image) |
| [0054-spiral-matrix](https://github.com/decodewithdeepak/leetcode/tree/master/0054-spiral-matrix) |
| [0059-spiral-matrix-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0059-spiral-matrix-ii) |
| [0073-set-matrix-zeroes](https://github.com/decodewithdeepak/leetcode/tree/master/0073-set-matrix-zeroes) |
| [0085-maximal-rectangle](https://github.com/decodewithdeepak/leetcode/tree/master/0085-maximal-rectangle) |
| [2015-determine-whether-matrix-can-be-obtained-by-rotation](https://github.com/decodewithdeepak/leetcode/tree/master/2015-determine-whether-matrix-can-be-obtained-by-rotation) |
| [2132-convert-1d-array-into-2d-array](https://github.com/decodewithdeepak/leetcode/tree/master/2132-convert-1d-array-into-2d-array) |
## Union Find
| |
| ------- |
| [0128-longest-consecutive-sequence](https://github.com/decodewithdeepak/leetcode/tree/master/0128-longest-consecutive-sequence) |
## Prefix Sum
| |
| ------- |
| [0238-product-of-array-except-self](https://github.com/decodewithdeepak/leetcode/tree/master/0238-product-of-array-except-self) |
| [0560-subarray-sum-equals-k](https://github.com/decodewithdeepak/leetcode/tree/master/0560-subarray-sum-equals-k) |
## Stack
| |
| ------- |
| [0020-valid-parentheses](https://github.com/decodewithdeepak/leetcode/tree/master/0020-valid-parentheses) |
| [0042-trapping-rain-water](https://github.com/decodewithdeepak/leetcode/tree/master/0042-trapping-rain-water) |
| [0084-largest-rectangle-in-histogram](https://github.com/decodewithdeepak/leetcode/tree/master/0084-largest-rectangle-in-histogram) |
| [0085-maximal-rectangle](https://github.com/decodewithdeepak/leetcode/tree/master/0085-maximal-rectangle) |
| [0155-min-stack](https://github.com/decodewithdeepak/leetcode/tree/master/0155-min-stack) |
| [0225-implement-stack-using-queues](https://github.com/decodewithdeepak/leetcode/tree/master/0225-implement-stack-using-queues) |
| [0232-implement-queue-using-stacks](https://github.com/decodewithdeepak/leetcode/tree/master/0232-implement-queue-using-stacks) |
| [0234-palindrome-linked-list](https://github.com/decodewithdeepak/leetcode/tree/master/0234-palindrome-linked-list) |
| [0394-decode-string](https://github.com/decodewithdeepak/leetcode/tree/master/0394-decode-string) |
| [0402-remove-k-digits](https://github.com/decodewithdeepak/leetcode/tree/master/0402-remove-k-digits) |
| [0496-next-greater-element-i](https://github.com/decodewithdeepak/leetcode/tree/master/0496-next-greater-element-i) |
| [0503-next-greater-element-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0503-next-greater-element-ii) |
| [0735-asteroid-collision](https://github.com/decodewithdeepak/leetcode/tree/master/0735-asteroid-collision) |
| [0943-sum-of-subarray-minimums](https://github.com/decodewithdeepak/leetcode/tree/master/0943-sum-of-subarray-minimums) |
| [1078-remove-outermost-parentheses](https://github.com/decodewithdeepak/leetcode/tree/master/1078-remove-outermost-parentheses) |
| [1737-maximum-nesting-depth-of-the-parentheses](https://github.com/decodewithdeepak/leetcode/tree/master/1737-maximum-nesting-depth-of-the-parentheses) |
| [2227-sum-of-subarray-ranges](https://github.com/decodewithdeepak/leetcode/tree/master/2227-sum-of-subarray-ranges) |
| [2470-removing-stars-from-a-string](https://github.com/decodewithdeepak/leetcode/tree/master/2470-removing-stars-from-a-string) |
## Greedy
| |
| ------- |
| [0011-container-with-most-water](https://github.com/decodewithdeepak/leetcode/tree/master/0011-container-with-most-water) |
| [0402-remove-k-digits](https://github.com/decodewithdeepak/leetcode/tree/master/0402-remove-k-digits) |
| [0561-array-partition](https://github.com/decodewithdeepak/leetcode/tree/master/0561-array-partition) |
| [2032-largest-odd-number-in-string](https://github.com/decodewithdeepak/leetcode/tree/master/2032-largest-odd-number-in-string) |
## Trie
| |
| ------- |
| [0014-longest-common-prefix](https://github.com/decodewithdeepak/leetcode/tree/master/0014-longest-common-prefix) |
## String Matching
| |
| ------- |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/decodewithdeepak/leetcode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0812-rotate-string](https://github.com/decodewithdeepak/leetcode/tree/master/0812-rotate-string) |
## Linked List
| |
| ------- |
| [0002-add-two-numbers](https://github.com/decodewithdeepak/leetcode/tree/master/0002-add-two-numbers) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/decodewithdeepak/leetcode/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0083-remove-duplicates-from-sorted-list](https://github.com/decodewithdeepak/leetcode/tree/master/0083-remove-duplicates-from-sorted-list) |
| [0092-reverse-linked-list-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0092-reverse-linked-list-ii) |
| [0141-linked-list-cycle](https://github.com/decodewithdeepak/leetcode/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0142-linked-list-cycle-ii) |
| [0148-sort-list](https://github.com/decodewithdeepak/leetcode/tree/master/0148-sort-list) |
| [0160-intersection-of-two-linked-lists](https://github.com/decodewithdeepak/leetcode/tree/master/0160-intersection-of-two-linked-lists) |
| [0206-reverse-linked-list](https://github.com/decodewithdeepak/leetcode/tree/master/0206-reverse-linked-list) |
| [0234-palindrome-linked-list](https://github.com/decodewithdeepak/leetcode/tree/master/0234-palindrome-linked-list) |
| [0237-delete-node-in-a-linked-list](https://github.com/decodewithdeepak/leetcode/tree/master/0237-delete-node-in-a-linked-list) |
| [0328-odd-even-linked-list](https://github.com/decodewithdeepak/leetcode/tree/master/0328-odd-even-linked-list) |
| [0908-middle-of-the-linked-list](https://github.com/decodewithdeepak/leetcode/tree/master/0908-middle-of-the-linked-list) |
| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/decodewithdeepak/leetcode/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |
## Design
| |
| ------- |
| [0155-min-stack](https://github.com/decodewithdeepak/leetcode/tree/master/0155-min-stack) |
| [0225-implement-stack-using-queues](https://github.com/decodewithdeepak/leetcode/tree/master/0225-implement-stack-using-queues) |
| [0232-implement-queue-using-stacks](https://github.com/decodewithdeepak/leetcode/tree/master/0232-implement-queue-using-stacks) |
## Queue
| |
| ------- |
| [0225-implement-stack-using-queues](https://github.com/decodewithdeepak/leetcode/tree/master/0225-implement-stack-using-queues) |
| [0232-implement-queue-using-stacks](https://github.com/decodewithdeepak/leetcode/tree/master/0232-implement-queue-using-stacks) |
| [0239-sliding-window-maximum](https://github.com/decodewithdeepak/leetcode/tree/master/0239-sliding-window-maximum) |
## Monotonic Stack
| |
| ------- |
| [0042-trapping-rain-water](https://github.com/decodewithdeepak/leetcode/tree/master/0042-trapping-rain-water) |
| [0084-largest-rectangle-in-histogram](https://github.com/decodewithdeepak/leetcode/tree/master/0084-largest-rectangle-in-histogram) |
| [0085-maximal-rectangle](https://github.com/decodewithdeepak/leetcode/tree/master/0085-maximal-rectangle) |
| [0402-remove-k-digits](https://github.com/decodewithdeepak/leetcode/tree/master/0402-remove-k-digits) |
| [0496-next-greater-element-i](https://github.com/decodewithdeepak/leetcode/tree/master/0496-next-greater-element-i) |
| [0503-next-greater-element-ii](https://github.com/decodewithdeepak/leetcode/tree/master/0503-next-greater-element-ii) |
| [0943-sum-of-subarray-minimums](https://github.com/decodewithdeepak/leetcode/tree/master/0943-sum-of-subarray-minimums) |
| [2227-sum-of-subarray-ranges](https://github.com/decodewithdeepak/leetcode/tree/master/2227-sum-of-subarray-ranges) |
## Tree
| |
| ------- |
| [0104-maximum-depth-of-binary-tree](https://github.com/decodewithdeepak/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/decodewithdeepak/leetcode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0222-count-complete-tree-nodes](https://github.com/decodewithdeepak/leetcode/tree/master/0222-count-complete-tree-nodes) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/decodewithdeepak/leetcode/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0784-insert-into-a-binary-search-tree](https://github.com/decodewithdeepak/leetcode/tree/master/0784-insert-into-a-binary-search-tree) |
| [2461-amount-of-time-for-binary-tree-to-be-infected](https://github.com/decodewithdeepak/leetcode/tree/master/2461-amount-of-time-for-binary-tree-to-be-infected) |
## Binary Tree
| |
| ------- |
| [0104-maximum-depth-of-binary-tree](https://github.com/decodewithdeepak/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |
| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/decodewithdeepak/leetcode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |
| [0222-count-complete-tree-nodes](https://github.com/decodewithdeepak/leetcode/tree/master/0222-count-complete-tree-nodes) |
| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/decodewithdeepak/leetcode/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |
| [0784-insert-into-a-binary-search-tree](https://github.com/decodewithdeepak/leetcode/tree/master/0784-insert-into-a-binary-search-tree) |
| [2461-amount-of-time-for-binary-tree-to-be-infected](https://github.com/decodewithdeepak/leetcode/tree/master/2461-amount-of-time-for-binary-tree-to-be-infected) |
## Merge Sort
| |
| ------- |
| [0148-sort-list](https://github.com/decodewithdeepak/leetcode/tree/master/0148-sort-list) |
| [0493-reverse-pairs](https://github.com/decodewithdeepak/leetcode/tree/master/0493-reverse-pairs) |
## Binary Search Tree
| |
| ------- |
| [0784-insert-into-a-binary-search-tree](https://github.com/decodewithdeepak/leetcode/tree/master/0784-insert-into-a-binary-search-tree) |
## Sliding Window
| |
| ------- |
| [0239-sliding-window-maximum](https://github.com/decodewithdeepak/leetcode/tree/master/0239-sliding-window-maximum) |
## Heap (Priority Queue)
| |
| ------- |
| [0239-sliding-window-maximum](https://github.com/decodewithdeepak/leetcode/tree/master/0239-sliding-window-maximum) |
## Monotonic Queue
| |
| ------- |
| [0239-sliding-window-maximum](https://github.com/decodewithdeepak/leetcode/tree/master/0239-sliding-window-maximum) |
## Counting Sort
| |
| ------- |
| [0561-array-partition](https://github.com/decodewithdeepak/leetcode/tree/master/0561-array-partition) |
## Binary Indexed Tree
| |
| ------- |
| [0493-reverse-pairs](https://github.com/decodewithdeepak/leetcode/tree/master/0493-reverse-pairs) |
## Segment Tree
| |
| ------- |
| [0493-reverse-pairs](https://github.com/decodewithdeepak/leetcode/tree/master/0493-reverse-pairs) |
## Ordered Set
| |
| ------- |
| [0493-reverse-pairs](https://github.com/decodewithdeepak/leetcode/tree/master/0493-reverse-pairs) |
## Database
| |
| ------- |
| [0197-rising-temperature](https://github.com/decodewithdeepak/leetcode/tree/master/0197-rising-temperature) |
| [0584-find-customer-referee](https://github.com/decodewithdeepak/leetcode/tree/master/0584-find-customer-referee) |
| [1258-article-views-i](https://github.com/decodewithdeepak/leetcode/tree/master/1258-article-views-i) |
| [1827-invalid-tweets](https://github.com/decodewithdeepak/leetcode/tree/master/1827-invalid-tweets) |
| [1908-recyclable-and-low-fat-products](https://github.com/decodewithdeepak/leetcode/tree/master/1908-recyclable-and-low-fat-products) |