Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/abhik-chakraborty/coding-
Welcome, Here you'll find a collection of my solutions to Data Structure and Algorithm questions from platforms like GeeksforGeeks and LeetCode. I love tackling these challenges and sharing my code with fellow developers. Feel free to explore, learn, and contribute to this growing library of solutions. Let's master the world of algorithms together
https://github.com/abhik-chakraborty/coding-
array-manipulations arrays binary-search bit bitmanipulation dynamic-programming hashing queue sorting-algorithms stack twopointers
Last synced: 10 days ago
JSON representation
Welcome, Here you'll find a collection of my solutions to Data Structure and Algorithm questions from platforms like GeeksforGeeks and LeetCode. I love tackling these challenges and sharing my code with fellow developers. Feel free to explore, learn, and contribute to this growing library of solutions. Let's master the world of algorithms together
- Host: GitHub
- URL: https://github.com/abhik-chakraborty/coding-
- Owner: Abhik-Chakraborty
- Created: 2023-03-25T05:36:47.000Z (almost 2 years ago)
- Default Branch: main
- Last Pushed: 2024-12-19T18:24:41.000Z (16 days ago)
- Last Synced: 2024-12-19T19:22:44.411Z (16 days ago)
- Topics: array-manipulations, arrays, binary-search, bit, bitmanipulation, dynamic-programming, hashing, queue, sorting-algorithms, stack, twopointers
- Language: C++
- Homepage:
- Size: 760 KB
- Stars: 3
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode Topics
## Array
| |
| ------- |
| [0001-two-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0001-two-sum) |
| [0004-median-of-two-sorted-arrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/0004-median-of-two-sorted-arrays) |
| [0011-container-with-most-water](https://github.com/Abhik-Chakraborty/coding-/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/Abhik-Chakraborty/coding-/tree/master/0016-3sum-closest) |
| [0018-4sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0018-4sum) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0031-next-permutation](https://github.com/Abhik-Chakraborty/coding-/tree/master/0031-next-permutation) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0035-search-insert-position](https://github.com/Abhik-Chakraborty/coding-/tree/master/0035-search-insert-position) |
| [0045-jump-game-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0045-jump-game-ii) |
| [0048-rotate-image](https://github.com/Abhik-Chakraborty/coding-/tree/master/0048-rotate-image) |
| [0053-maximum-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/0053-maximum-subarray) |
| [0054-spiral-matrix](https://github.com/Abhik-Chakraborty/coding-/tree/master/0054-spiral-matrix) |
| [0055-jump-game](https://github.com/Abhik-Chakraborty/coding-/tree/master/0055-jump-game) |
| [0056-merge-intervals](https://github.com/Abhik-Chakraborty/coding-/tree/master/0056-merge-intervals) |
| [0066-plus-one](https://github.com/Abhik-Chakraborty/coding-/tree/master/0066-plus-one) |
| [0073-set-matrix-zeroes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0073-set-matrix-zeroes) |
| [0074-search-a-2d-matrix](https://github.com/Abhik-Chakraborty/coding-/tree/master/0074-search-a-2d-matrix) |
| [0075-sort-colors](https://github.com/Abhik-Chakraborty/coding-/tree/master/0075-sort-colors) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0081-search-in-rotated-sorted-array-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0081-search-in-rotated-sorted-array-ii) |
| [0088-merge-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0088-merge-sorted-array) |
| [0118-pascals-triangle](https://github.com/Abhik-Chakraborty/coding-/tree/master/0118-pascals-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/Abhik-Chakraborty/coding-/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0123-best-time-to-buy-and-sell-stock-iii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0123-best-time-to-buy-and-sell-stock-iii) |
| [0128-longest-consecutive-sequence](https://github.com/Abhik-Chakraborty/coding-/tree/master/0128-longest-consecutive-sequence) |
| [0136-single-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0136-single-number) |
| [0152-maximum-product-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/0152-maximum-product-subarray) |
| [0153-find-minimum-in-rotated-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0153-find-minimum-in-rotated-sorted-array) |
| [0162-find-peak-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/0162-find-peak-element) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Abhik-Chakraborty/coding-/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0189-rotate-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0189-rotate-array) |
| [0209-minimum-size-subarray-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0209-minimum-size-subarray-sum) |
| [0215-kth-largest-element-in-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0215-kth-largest-element-in-an-array) |
| [0217-contains-duplicate](https://github.com/Abhik-Chakraborty/coding-/tree/master/0217-contains-duplicate) |
| [0219-contains-duplicate-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0219-contains-duplicate-ii) |
| [0229-majority-element-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0229-majority-element-ii) |
| [0238-product-of-array-except-self](https://github.com/Abhik-Chakraborty/coding-/tree/master/0238-product-of-array-except-self) |
| [0268-missing-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0268-missing-number) |
| [0274-h-index](https://github.com/Abhik-Chakraborty/coding-/tree/master/0274-h-index) |
| [0283-move-zeroes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0283-move-zeroes) |
| [0287-find-the-duplicate-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0287-find-the-duplicate-number) |
| [0347-top-k-frequent-elements](https://github.com/Abhik-Chakraborty/coding-/tree/master/0347-top-k-frequent-elements) |
| [0349-intersection-of-two-arrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0350-intersection-of-two-arrays-ii) |
| [0416-partition-equal-subset-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0416-partition-equal-subset-sum) |
| [0455-assign-cookies](https://github.com/Abhik-Chakraborty/coding-/tree/master/0455-assign-cookies) |
| [0457-circular-array-loop](https://github.com/Abhik-Chakraborty/coding-/tree/master/0457-circular-array-loop) |
| [0485-max-consecutive-ones](https://github.com/Abhik-Chakraborty/coding-/tree/master/0485-max-consecutive-ones) |
| [0500-keyboard-row](https://github.com/Abhik-Chakraborty/coding-/tree/master/0500-keyboard-row) |
| [0540-single-element-in-a-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0540-single-element-in-a-sorted-array) |
| [0560-subarray-sum-equals-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/0560-subarray-sum-equals-k) |
| [0724-find-pivot-index](https://github.com/Abhik-Chakraborty/coding-/tree/master/0724-find-pivot-index) |
| [0745-find-smallest-letter-greater-than-target](https://github.com/Abhik-Chakraborty/coding-/tree/master/0745-find-smallest-letter-greater-than-target) |
| [0890-lemonade-change](https://github.com/Abhik-Chakraborty/coding-/tree/master/0890-lemonade-change) |
| [0907-koko-eating-bananas](https://github.com/Abhik-Chakraborty/coding-/tree/master/0907-koko-eating-bananas) |
| [0966-binary-subarrays-with-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0966-binary-subarrays-with-sum) |
| [1046-max-consecutive-ones-iii](https://github.com/Abhik-Chakraborty/coding-/tree/master/1046-max-consecutive-ones-iii) |
| [1370-count-number-of-nice-subarrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/1370-count-number-of-nice-subarrays) |
| [1408-find-the-smallest-divisor-given-a-threshold](https://github.com/Abhik-Chakraborty/coding-/tree/master/1408-find-the-smallest-divisor-given-a-threshold) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/Abhik-Chakraborty/coding-/tree/master/1538-maximum-points-you-can-obtain-from-cards) |
| [1878-check-if-array-is-sorted-and-rotated](https://github.com/Abhik-Chakraborty/coding-/tree/master/1878-check-if-array-is-sorted-and-rotated) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/1966-frequency-of-the-most-frequent-element) |
| [2271-rearrange-array-elements-by-sign](https://github.com/Abhik-Chakraborty/coding-/tree/master/2271-rearrange-array-elements-by-sign) |
| [2350-find-closest-number-to-zero](https://github.com/Abhik-Chakraborty/coding-/tree/master/2350-find-closest-number-to-zero) |
| [2486-most-frequent-even-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/2486-most-frequent-even-element) |
| [3236-smallest-missing-integer-greater-than-sequential-prefix-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/3236-smallest-missing-integer-greater-than-sequential-prefix-sum) |
## Binary Search
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/0004-median-of-two-sorted-arrays) |
| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |
| [0035-search-insert-position](https://github.com/Abhik-Chakraborty/coding-/tree/master/0035-search-insert-position) |
| [0074-search-a-2d-matrix](https://github.com/Abhik-Chakraborty/coding-/tree/master/0074-search-a-2d-matrix) |
| [0081-search-in-rotated-sorted-array-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0081-search-in-rotated-sorted-array-ii) |
| [0153-find-minimum-in-rotated-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0153-find-minimum-in-rotated-sorted-array) |
| [0162-find-peak-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/0162-find-peak-element) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Abhik-Chakraborty/coding-/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0209-minimum-size-subarray-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0209-minimum-size-subarray-sum) |
| [0268-missing-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0268-missing-number) |
| [0287-find-the-duplicate-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0287-find-the-duplicate-number) |
| [0349-intersection-of-two-arrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0350-intersection-of-two-arrays-ii) |
| [0374-guess-number-higher-or-lower](https://github.com/Abhik-Chakraborty/coding-/tree/master/0374-guess-number-higher-or-lower) |
| [0540-single-element-in-a-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0540-single-element-in-a-sorted-array) |
| [0745-find-smallest-letter-greater-than-target](https://github.com/Abhik-Chakraborty/coding-/tree/master/0745-find-smallest-letter-greater-than-target) |
| [0907-koko-eating-bananas](https://github.com/Abhik-Chakraborty/coding-/tree/master/0907-koko-eating-bananas) |
| [1046-max-consecutive-ones-iii](https://github.com/Abhik-Chakraborty/coding-/tree/master/1046-max-consecutive-ones-iii) |
| [1408-find-the-smallest-divisor-given-a-threshold](https://github.com/Abhik-Chakraborty/coding-/tree/master/1408-find-the-smallest-divisor-given-a-threshold) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/1966-frequency-of-the-most-frequent-element) |
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0001-two-sum) |
| [0003-longest-substring-without-repeating-characters](https://github.com/Abhik-Chakraborty/coding-/tree/master/0003-longest-substring-without-repeating-characters) |
| [0012-integer-to-roman](https://github.com/Abhik-Chakraborty/coding-/tree/master/0012-integer-to-roman) |
| [0073-set-matrix-zeroes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0073-set-matrix-zeroes) |
| [0076-minimum-window-substring](https://github.com/Abhik-Chakraborty/coding-/tree/master/0076-minimum-window-substring) |
| [0128-longest-consecutive-sequence](https://github.com/Abhik-Chakraborty/coding-/tree/master/0128-longest-consecutive-sequence) |
| [0141-linked-list-cycle](https://github.com/Abhik-Chakraborty/coding-/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0142-linked-list-cycle-ii) |
| [0160-intersection-of-two-linked-lists](https://github.com/Abhik-Chakraborty/coding-/tree/master/0160-intersection-of-two-linked-lists) |
| [0202-happy-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0202-happy-number) |
| [0205-isomorphic-strings](https://github.com/Abhik-Chakraborty/coding-/tree/master/0205-isomorphic-strings) |
| [0217-contains-duplicate](https://github.com/Abhik-Chakraborty/coding-/tree/master/0217-contains-duplicate) |
| [0219-contains-duplicate-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0219-contains-duplicate-ii) |
| [0229-majority-element-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0229-majority-element-ii) |
| [0242-valid-anagram](https://github.com/Abhik-Chakraborty/coding-/tree/master/0242-valid-anagram) |
| [0268-missing-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0268-missing-number) |
| [0347-top-k-frequent-elements](https://github.com/Abhik-Chakraborty/coding-/tree/master/0347-top-k-frequent-elements) |
| [0349-intersection-of-two-arrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0350-intersection-of-two-arrays-ii) |
| [0383-ransom-note](https://github.com/Abhik-Chakraborty/coding-/tree/master/0383-ransom-note) |
| [0387-first-unique-character-in-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0387-first-unique-character-in-a-string) |
| [0424-longest-repeating-character-replacement](https://github.com/Abhik-Chakraborty/coding-/tree/master/0424-longest-repeating-character-replacement) |
| [0451-sort-characters-by-frequency](https://github.com/Abhik-Chakraborty/coding-/tree/master/0451-sort-characters-by-frequency) |
| [0457-circular-array-loop](https://github.com/Abhik-Chakraborty/coding-/tree/master/0457-circular-array-loop) |
| [0500-keyboard-row](https://github.com/Abhik-Chakraborty/coding-/tree/master/0500-keyboard-row) |
| [0560-subarray-sum-equals-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/0560-subarray-sum-equals-k) |
| [0966-binary-subarrays-with-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0966-binary-subarrays-with-sum) |
| [1370-count-number-of-nice-subarrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/1370-count-number-of-nice-subarrays) |
| [1460-number-of-substrings-containing-all-three-characters](https://github.com/Abhik-Chakraborty/coding-/tree/master/1460-number-of-substrings-containing-all-three-characters) |
| [1890-sum-of-beauty-of-all-substrings](https://github.com/Abhik-Chakraborty/coding-/tree/master/1890-sum-of-beauty-of-all-substrings) |
| [2427-first-letter-to-appear-twice](https://github.com/Abhik-Chakraborty/coding-/tree/master/2427-first-letter-to-appear-twice) |
| [2486-most-frequent-even-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/2486-most-frequent-even-element) |
| [3236-smallest-missing-integer-greater-than-sequential-prefix-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/3236-smallest-missing-integer-greater-than-sequential-prefix-sum) |
## Math
| |
| ------- |
| [0007-reverse-integer](https://github.com/Abhik-Chakraborty/coding-/tree/master/0007-reverse-integer) |
| [0012-integer-to-roman](https://github.com/Abhik-Chakraborty/coding-/tree/master/0012-integer-to-roman) |
| [0048-rotate-image](https://github.com/Abhik-Chakraborty/coding-/tree/master/0048-rotate-image) |
| [0066-plus-one](https://github.com/Abhik-Chakraborty/coding-/tree/master/0066-plus-one) |
| [0067-add-binary](https://github.com/Abhik-Chakraborty/coding-/tree/master/0067-add-binary) |
| [0189-rotate-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0189-rotate-array) |
| [0202-happy-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0202-happy-number) |
| [0231-power-of-two](https://github.com/Abhik-Chakraborty/coding-/tree/master/0231-power-of-two) |
| [0268-missing-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0268-missing-number) |
| [0412-fizz-buzz](https://github.com/Abhik-Chakraborty/coding-/tree/master/0412-fizz-buzz) |
| [1370-count-number-of-nice-subarrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/1370-count-number-of-nice-subarrays) |
| [2032-largest-odd-number-in-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/2032-largest-odd-number-in-string) |
## Bit Manipulation
| |
| ------- |
| [0067-add-binary](https://github.com/Abhik-Chakraborty/coding-/tree/master/0067-add-binary) |
| [0136-single-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0136-single-number) |
| [0231-power-of-two](https://github.com/Abhik-Chakraborty/coding-/tree/master/0231-power-of-two) |
| [0268-missing-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0268-missing-number) |
| [0287-find-the-duplicate-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0287-find-the-duplicate-number) |
| [2427-first-letter-to-appear-twice](https://github.com/Abhik-Chakraborty/coding-/tree/master/2427-first-letter-to-appear-twice) |
## Sorting
| |
| ------- |
| [0015-3sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/Abhik-Chakraborty/coding-/tree/master/0016-3sum-closest) |
| [0018-4sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0018-4sum) |
| [0056-merge-intervals](https://github.com/Abhik-Chakraborty/coding-/tree/master/0056-merge-intervals) |
| [0075-sort-colors](https://github.com/Abhik-Chakraborty/coding-/tree/master/0075-sort-colors) |
| [0088-merge-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0088-merge-sorted-array) |
| [0148-sort-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0148-sort-list) |
| [0215-kth-largest-element-in-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0215-kth-largest-element-in-an-array) |
| [0217-contains-duplicate](https://github.com/Abhik-Chakraborty/coding-/tree/master/0217-contains-duplicate) |
| [0229-majority-element-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0229-majority-element-ii) |
| [0242-valid-anagram](https://github.com/Abhik-Chakraborty/coding-/tree/master/0242-valid-anagram) |
| [0268-missing-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0268-missing-number) |
| [0274-h-index](https://github.com/Abhik-Chakraborty/coding-/tree/master/0274-h-index) |
| [0347-top-k-frequent-elements](https://github.com/Abhik-Chakraborty/coding-/tree/master/0347-top-k-frequent-elements) |
| [0349-intersection-of-two-arrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0350-intersection-of-two-arrays-ii) |
| [0451-sort-characters-by-frequency](https://github.com/Abhik-Chakraborty/coding-/tree/master/0451-sort-characters-by-frequency) |
| [0455-assign-cookies](https://github.com/Abhik-Chakraborty/coding-/tree/master/0455-assign-cookies) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/1966-frequency-of-the-most-frequent-element) |
| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/2646-kth-largest-sum-in-a-binary-tree) |
| [3236-smallest-missing-integer-greater-than-sequential-prefix-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/3236-smallest-missing-integer-greater-than-sequential-prefix-sum) |
## Two Pointers
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/Abhik-Chakraborty/coding-/tree/master/0005-longest-palindromic-substring) |
| [0011-container-with-most-water](https://github.com/Abhik-Chakraborty/coding-/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0015-3sum) |
| [0016-3sum-closest](https://github.com/Abhik-Chakraborty/coding-/tree/master/0016-3sum-closest) |
| [0018-4sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0018-4sum) |
| [0019-remove-nth-node-from-end-of-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0031-next-permutation](https://github.com/Abhik-Chakraborty/coding-/tree/master/0031-next-permutation) |
| [0075-sort-colors](https://github.com/Abhik-Chakraborty/coding-/tree/master/0075-sort-colors) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0088-merge-sorted-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0088-merge-sorted-array) |
| [0125-valid-palindrome](https://github.com/Abhik-Chakraborty/coding-/tree/master/0125-valid-palindrome) |
| [0141-linked-list-cycle](https://github.com/Abhik-Chakraborty/coding-/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0142-linked-list-cycle-ii) |
| [0148-sort-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0148-sort-list) |
| [0151-reverse-words-in-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0151-reverse-words-in-a-string) |
| [0160-intersection-of-two-linked-lists](https://github.com/Abhik-Chakraborty/coding-/tree/master/0160-intersection-of-two-linked-lists) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/Abhik-Chakraborty/coding-/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0189-rotate-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0189-rotate-array) |
| [0202-happy-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0202-happy-number) |
| [0234-palindrome-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0234-palindrome-linked-list) |
| [0283-move-zeroes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0283-move-zeroes) |
| [0287-find-the-duplicate-number](https://github.com/Abhik-Chakraborty/coding-/tree/master/0287-find-the-duplicate-number) |
| [0344-reverse-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0344-reverse-string) |
| [0349-intersection-of-two-arrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/0349-intersection-of-two-arrays) |
| [0350-intersection-of-two-arrays-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0350-intersection-of-two-arrays-ii) |
| [0392-is-subsequence](https://github.com/Abhik-Chakraborty/coding-/tree/master/0392-is-subsequence) |
| [0443-string-compression](https://github.com/Abhik-Chakraborty/coding-/tree/master/0443-string-compression) |
| [0455-assign-cookies](https://github.com/Abhik-Chakraborty/coding-/tree/master/0455-assign-cookies) |
| [0457-circular-array-loop](https://github.com/Abhik-Chakraborty/coding-/tree/master/0457-circular-array-loop) |
| [0647-palindromic-substrings](https://github.com/Abhik-Chakraborty/coding-/tree/master/0647-palindromic-substrings) |
| [0908-middle-of-the-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0908-middle-of-the-linked-list) |
| [1894-merge-strings-alternately](https://github.com/Abhik-Chakraborty/coding-/tree/master/1894-merge-strings-alternately) |
| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/2216-delete-the-middle-node-of-a-linked-list) |
| [2271-rearrange-array-elements-by-sign](https://github.com/Abhik-Chakraborty/coding-/tree/master/2271-rearrange-array-elements-by-sign) |
## String
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/Abhik-Chakraborty/coding-/tree/master/0003-longest-substring-without-repeating-characters) |
| [0005-longest-palindromic-substring](https://github.com/Abhik-Chakraborty/coding-/tree/master/0005-longest-palindromic-substring) |
| [0008-string-to-integer-atoi](https://github.com/Abhik-Chakraborty/coding-/tree/master/0008-string-to-integer-atoi) |
| [0012-integer-to-roman](https://github.com/Abhik-Chakraborty/coding-/tree/master/0012-integer-to-roman) |
| [0014-longest-common-prefix](https://github.com/Abhik-Chakraborty/coding-/tree/master/0014-longest-common-prefix) |
| [0020-valid-parentheses](https://github.com/Abhik-Chakraborty/coding-/tree/master/0020-valid-parentheses) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0058-length-of-last-word](https://github.com/Abhik-Chakraborty/coding-/tree/master/0058-length-of-last-word) |
| [0067-add-binary](https://github.com/Abhik-Chakraborty/coding-/tree/master/0067-add-binary) |
| [0076-minimum-window-substring](https://github.com/Abhik-Chakraborty/coding-/tree/master/0076-minimum-window-substring) |
| [0125-valid-palindrome](https://github.com/Abhik-Chakraborty/coding-/tree/master/0125-valid-palindrome) |
| [0151-reverse-words-in-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0151-reverse-words-in-a-string) |
| [0205-isomorphic-strings](https://github.com/Abhik-Chakraborty/coding-/tree/master/0205-isomorphic-strings) |
| [0242-valid-anagram](https://github.com/Abhik-Chakraborty/coding-/tree/master/0242-valid-anagram) |
| [0344-reverse-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0344-reverse-string) |
| [0383-ransom-note](https://github.com/Abhik-Chakraborty/coding-/tree/master/0383-ransom-note) |
| [0387-first-unique-character-in-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0387-first-unique-character-in-a-string) |
| [0392-is-subsequence](https://github.com/Abhik-Chakraborty/coding-/tree/master/0392-is-subsequence) |
| [0412-fizz-buzz](https://github.com/Abhik-Chakraborty/coding-/tree/master/0412-fizz-buzz) |
| [0424-longest-repeating-character-replacement](https://github.com/Abhik-Chakraborty/coding-/tree/master/0424-longest-repeating-character-replacement) |
| [0443-string-compression](https://github.com/Abhik-Chakraborty/coding-/tree/master/0443-string-compression) |
| [0451-sort-characters-by-frequency](https://github.com/Abhik-Chakraborty/coding-/tree/master/0451-sort-characters-by-frequency) |
| [0500-keyboard-row](https://github.com/Abhik-Chakraborty/coding-/tree/master/0500-keyboard-row) |
| [0647-palindromic-substrings](https://github.com/Abhik-Chakraborty/coding-/tree/master/0647-palindromic-substrings) |
| [0812-rotate-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0812-rotate-string) |
| [1078-remove-outermost-parentheses](https://github.com/Abhik-Chakraborty/coding-/tree/master/1078-remove-outermost-parentheses) |
| [1460-number-of-substrings-containing-all-three-characters](https://github.com/Abhik-Chakraborty/coding-/tree/master/1460-number-of-substrings-containing-all-three-characters) |
| [1737-maximum-nesting-depth-of-the-parentheses](https://github.com/Abhik-Chakraborty/coding-/tree/master/1737-maximum-nesting-depth-of-the-parentheses) |
| [1890-sum-of-beauty-of-all-substrings](https://github.com/Abhik-Chakraborty/coding-/tree/master/1890-sum-of-beauty-of-all-substrings) |
| [1894-merge-strings-alternately](https://github.com/Abhik-Chakraborty/coding-/tree/master/1894-merge-strings-alternately) |
| [2032-largest-odd-number-in-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/2032-largest-odd-number-in-string) |
| [2427-first-letter-to-appear-twice](https://github.com/Abhik-Chakraborty/coding-/tree/master/2427-first-letter-to-appear-twice) |
## String Matching
| |
| ------- |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0812-rotate-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0812-rotate-string) |
## Interactive
| |
| ------- |
| [0374-guess-number-higher-or-lower](https://github.com/Abhik-Chakraborty/coding-/tree/master/0374-guess-number-higher-or-lower) |
## Dynamic Programming
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/Abhik-Chakraborty/coding-/tree/master/0005-longest-palindromic-substring) |
| [0045-jump-game-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0045-jump-game-ii) |
| [0053-maximum-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/0053-maximum-subarray) |
| [0055-jump-game](https://github.com/Abhik-Chakraborty/coding-/tree/master/0055-jump-game) |
| [0118-pascals-triangle](https://github.com/Abhik-Chakraborty/coding-/tree/master/0118-pascals-triangle) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/Abhik-Chakraborty/coding-/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0123-best-time-to-buy-and-sell-stock-iii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0123-best-time-to-buy-and-sell-stock-iii) |
| [0152-maximum-product-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/0152-maximum-product-subarray) |
| [0392-is-subsequence](https://github.com/Abhik-Chakraborty/coding-/tree/master/0392-is-subsequence) |
| [0416-partition-equal-subset-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0416-partition-equal-subset-sum) |
| [0647-palindromic-substrings](https://github.com/Abhik-Chakraborty/coding-/tree/master/0647-palindromic-substrings) |
## Matrix
| |
| ------- |
| [0048-rotate-image](https://github.com/Abhik-Chakraborty/coding-/tree/master/0048-rotate-image) |
| [0054-spiral-matrix](https://github.com/Abhik-Chakraborty/coding-/tree/master/0054-spiral-matrix) |
| [0073-set-matrix-zeroes](https://github.com/Abhik-Chakraborty/coding-/tree/master/0073-set-matrix-zeroes) |
| [0074-search-a-2d-matrix](https://github.com/Abhik-Chakraborty/coding-/tree/master/0074-search-a-2d-matrix) |
## Prefix Sum
| |
| ------- |
| [0209-minimum-size-subarray-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0209-minimum-size-subarray-sum) |
| [0238-product-of-array-except-self](https://github.com/Abhik-Chakraborty/coding-/tree/master/0238-product-of-array-except-self) |
| [0560-subarray-sum-equals-k](https://github.com/Abhik-Chakraborty/coding-/tree/master/0560-subarray-sum-equals-k) |
| [0724-find-pivot-index](https://github.com/Abhik-Chakraborty/coding-/tree/master/0724-find-pivot-index) |
| [0966-binary-subarrays-with-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0966-binary-subarrays-with-sum) |
| [1046-max-consecutive-ones-iii](https://github.com/Abhik-Chakraborty/coding-/tree/master/1046-max-consecutive-ones-iii) |
| [1370-count-number-of-nice-subarrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/1370-count-number-of-nice-subarrays) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/Abhik-Chakraborty/coding-/tree/master/1538-maximum-points-you-can-obtain-from-cards) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/1966-frequency-of-the-most-frequent-element) |
## Divide and Conquer
| |
| ------- |
| [0004-median-of-two-sorted-arrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/0004-median-of-two-sorted-arrays) |
| [0053-maximum-subarray](https://github.com/Abhik-Chakraborty/coding-/tree/master/0053-maximum-subarray) |
| [0148-sort-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0148-sort-list) |
| [0215-kth-largest-element-in-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0215-kth-largest-element-in-an-array) |
| [0347-top-k-frequent-elements](https://github.com/Abhik-Chakraborty/coding-/tree/master/0347-top-k-frequent-elements) |
## Sliding Window
| |
| ------- |
| [0003-longest-substring-without-repeating-characters](https://github.com/Abhik-Chakraborty/coding-/tree/master/0003-longest-substring-without-repeating-characters) |
| [0076-minimum-window-substring](https://github.com/Abhik-Chakraborty/coding-/tree/master/0076-minimum-window-substring) |
| [0209-minimum-size-subarray-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0209-minimum-size-subarray-sum) |
| [0219-contains-duplicate-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0219-contains-duplicate-ii) |
| [0424-longest-repeating-character-replacement](https://github.com/Abhik-Chakraborty/coding-/tree/master/0424-longest-repeating-character-replacement) |
| [0966-binary-subarrays-with-sum](https://github.com/Abhik-Chakraborty/coding-/tree/master/0966-binary-subarrays-with-sum) |
| [1046-max-consecutive-ones-iii](https://github.com/Abhik-Chakraborty/coding-/tree/master/1046-max-consecutive-ones-iii) |
| [1370-count-number-of-nice-subarrays](https://github.com/Abhik-Chakraborty/coding-/tree/master/1370-count-number-of-nice-subarrays) |
| [1460-number-of-substrings-containing-all-three-characters](https://github.com/Abhik-Chakraborty/coding-/tree/master/1460-number-of-substrings-containing-all-three-characters) |
| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/Abhik-Chakraborty/coding-/tree/master/1538-maximum-points-you-can-obtain-from-cards) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/1966-frequency-of-the-most-frequent-element) |
## Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0094-binary-tree-inorder-traversal) |
| [0102-binary-tree-level-order-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0102-binary-tree-level-order-traversal) |
| [0144-binary-tree-preorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0145-binary-tree-postorder-traversal) |
| [0515-find-largest-value-in-each-tree-row](https://github.com/Abhik-Chakraborty/coding-/tree/master/0515-find-largest-value-in-each-tree-row) |
| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/2646-kth-largest-sum-in-a-binary-tree) |
## Breadth-First Search
| |
| ------- |
| [0102-binary-tree-level-order-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0102-binary-tree-level-order-traversal) |
| [0515-find-largest-value-in-each-tree-row](https://github.com/Abhik-Chakraborty/coding-/tree/master/0515-find-largest-value-in-each-tree-row) |
| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/2646-kth-largest-sum-in-a-binary-tree) |
## Binary Tree
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0094-binary-tree-inorder-traversal) |
| [0102-binary-tree-level-order-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0102-binary-tree-level-order-traversal) |
| [0144-binary-tree-preorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0145-binary-tree-postorder-traversal) |
| [0515-find-largest-value-in-each-tree-row](https://github.com/Abhik-Chakraborty/coding-/tree/master/0515-find-largest-value-in-each-tree-row) |
| [2646-kth-largest-sum-in-a-binary-tree](https://github.com/Abhik-Chakraborty/coding-/tree/master/2646-kth-largest-sum-in-a-binary-tree) |
## Simulation
| |
| ------- |
| [0054-spiral-matrix](https://github.com/Abhik-Chakraborty/coding-/tree/master/0054-spiral-matrix) |
| [0067-add-binary](https://github.com/Abhik-Chakraborty/coding-/tree/master/0067-add-binary) |
| [0412-fizz-buzz](https://github.com/Abhik-Chakraborty/coding-/tree/master/0412-fizz-buzz) |
| [2271-rearrange-array-elements-by-sign](https://github.com/Abhik-Chakraborty/coding-/tree/master/2271-rearrange-array-elements-by-sign) |
## Union Find
| |
| ------- |
| [0128-longest-consecutive-sequence](https://github.com/Abhik-Chakraborty/coding-/tree/master/0128-longest-consecutive-sequence) |
## Stack
| |
| ------- |
| [0020-valid-parentheses](https://github.com/Abhik-Chakraborty/coding-/tree/master/0020-valid-parentheses) |
| [0094-binary-tree-inorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0094-binary-tree-inorder-traversal) |
| [0144-binary-tree-preorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0145-binary-tree-postorder-traversal) |
| [0155-min-stack](https://github.com/Abhik-Chakraborty/coding-/tree/master/0155-min-stack) |
| [0225-implement-stack-using-queues](https://github.com/Abhik-Chakraborty/coding-/tree/master/0225-implement-stack-using-queues) |
| [0232-implement-queue-using-stacks](https://github.com/Abhik-Chakraborty/coding-/tree/master/0232-implement-queue-using-stacks) |
| [0234-palindrome-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0234-palindrome-linked-list) |
| [1078-remove-outermost-parentheses](https://github.com/Abhik-Chakraborty/coding-/tree/master/1078-remove-outermost-parentheses) |
| [1737-maximum-nesting-depth-of-the-parentheses](https://github.com/Abhik-Chakraborty/coding-/tree/master/1737-maximum-nesting-depth-of-the-parentheses) |
## Linked List
| |
| ------- |
| [0019-remove-nth-node-from-end-of-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0019-remove-nth-node-from-end-of-list) |
| [0083-remove-duplicates-from-sorted-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0083-remove-duplicates-from-sorted-list) |
| [0141-linked-list-cycle](https://github.com/Abhik-Chakraborty/coding-/tree/master/0141-linked-list-cycle) |
| [0142-linked-list-cycle-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0142-linked-list-cycle-ii) |
| [0148-sort-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0148-sort-list) |
| [0160-intersection-of-two-linked-lists](https://github.com/Abhik-Chakraborty/coding-/tree/master/0160-intersection-of-two-linked-lists) |
| [0206-reverse-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0206-reverse-linked-list) |
| [0234-palindrome-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0234-palindrome-linked-list) |
| [0237-delete-node-in-a-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0237-delete-node-in-a-linked-list) |
| [0328-odd-even-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0328-odd-even-linked-list) |
| [0908-middle-of-the-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0908-middle-of-the-linked-list) |
| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/2216-delete-the-middle-node-of-a-linked-list) |
## Greedy
| |
| ------- |
| [0011-container-with-most-water](https://github.com/Abhik-Chakraborty/coding-/tree/master/0011-container-with-most-water) |
| [0045-jump-game-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0045-jump-game-ii) |
| [0055-jump-game](https://github.com/Abhik-Chakraborty/coding-/tree/master/0055-jump-game) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0455-assign-cookies](https://github.com/Abhik-Chakraborty/coding-/tree/master/0455-assign-cookies) |
| [0890-lemonade-change](https://github.com/Abhik-Chakraborty/coding-/tree/master/0890-lemonade-change) |
| [1966-frequency-of-the-most-frequent-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/1966-frequency-of-the-most-frequent-element) |
| [2032-largest-odd-number-in-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/2032-largest-odd-number-in-string) |
## Trie
| |
| ------- |
| [0014-longest-common-prefix](https://github.com/Abhik-Chakraborty/coding-/tree/master/0014-longest-common-prefix) |
## Heap (Priority Queue)
| |
| ------- |
| [0215-kth-largest-element-in-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0215-kth-largest-element-in-an-array) |
| [0347-top-k-frequent-elements](https://github.com/Abhik-Chakraborty/coding-/tree/master/0347-top-k-frequent-elements) |
| [0451-sort-characters-by-frequency](https://github.com/Abhik-Chakraborty/coding-/tree/master/0451-sort-characters-by-frequency) |
## Bucket Sort
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/Abhik-Chakraborty/coding-/tree/master/0347-top-k-frequent-elements) |
| [0451-sort-characters-by-frequency](https://github.com/Abhik-Chakraborty/coding-/tree/master/0451-sort-characters-by-frequency) |
## Counting
| |
| ------- |
| [0229-majority-element-ii](https://github.com/Abhik-Chakraborty/coding-/tree/master/0229-majority-element-ii) |
| [0347-top-k-frequent-elements](https://github.com/Abhik-Chakraborty/coding-/tree/master/0347-top-k-frequent-elements) |
| [0383-ransom-note](https://github.com/Abhik-Chakraborty/coding-/tree/master/0383-ransom-note) |
| [0387-first-unique-character-in-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0387-first-unique-character-in-a-string) |
| [0451-sort-characters-by-frequency](https://github.com/Abhik-Chakraborty/coding-/tree/master/0451-sort-characters-by-frequency) |
| [1890-sum-of-beauty-of-all-substrings](https://github.com/Abhik-Chakraborty/coding-/tree/master/1890-sum-of-beauty-of-all-substrings) |
| [2427-first-letter-to-appear-twice](https://github.com/Abhik-Chakraborty/coding-/tree/master/2427-first-letter-to-appear-twice) |
| [2486-most-frequent-even-element](https://github.com/Abhik-Chakraborty/coding-/tree/master/2486-most-frequent-even-element) |
## Quickselect
| |
| ------- |
| [0215-kth-largest-element-in-an-array](https://github.com/Abhik-Chakraborty/coding-/tree/master/0215-kth-largest-element-in-an-array) |
| [0347-top-k-frequent-elements](https://github.com/Abhik-Chakraborty/coding-/tree/master/0347-top-k-frequent-elements) |
## Queue
| |
| ------- |
| [0225-implement-stack-using-queues](https://github.com/Abhik-Chakraborty/coding-/tree/master/0225-implement-stack-using-queues) |
| [0232-implement-queue-using-stacks](https://github.com/Abhik-Chakraborty/coding-/tree/master/0232-implement-queue-using-stacks) |
| [0387-first-unique-character-in-a-string](https://github.com/Abhik-Chakraborty/coding-/tree/master/0387-first-unique-character-in-a-string) |
## Recursion
| |
| ------- |
| [0206-reverse-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0206-reverse-linked-list) |
| [0231-power-of-two](https://github.com/Abhik-Chakraborty/coding-/tree/master/0231-power-of-two) |
| [0234-palindrome-linked-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0234-palindrome-linked-list) |
## Merge Sort
| |
| ------- |
| [0148-sort-list](https://github.com/Abhik-Chakraborty/coding-/tree/master/0148-sort-list) |
## Design
| |
| ------- |
| [0155-min-stack](https://github.com/Abhik-Chakraborty/coding-/tree/master/0155-min-stack) |
| [0225-implement-stack-using-queues](https://github.com/Abhik-Chakraborty/coding-/tree/master/0225-implement-stack-using-queues) |
| [0232-implement-queue-using-stacks](https://github.com/Abhik-Chakraborty/coding-/tree/master/0232-implement-queue-using-stacks) |
## Counting Sort
| |
| ------- |
| [0274-h-index](https://github.com/Abhik-Chakraborty/coding-/tree/master/0274-h-index) |
## Depth-First Search
| |
| ------- |
| [0094-binary-tree-inorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0094-binary-tree-inorder-traversal) |
| [0144-binary-tree-preorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0144-binary-tree-preorder-traversal) |
| [0145-binary-tree-postorder-traversal](https://github.com/Abhik-Chakraborty/coding-/tree/master/0145-binary-tree-postorder-traversal) |
| [0515-find-largest-value-in-each-tree-row](https://github.com/Abhik-Chakraborty/coding-/tree/master/0515-find-largest-value-in-each-tree-row) |