AnkitHazra/Leetcode

Leetcode

VISIT MY PROFILE: https://leetcode.com/u/Ankit_Hazra/

Array

0004-median-of-two-sorted-arrays
0015-3sum
0018-4sum
0027-remove-element
0056-merge-intervals
0074-search-a-2d-matrix
0075-sort-colors
0080-remove-duplicates-from-sorted-array-ii
0088-merge-sorted-array
0153-find-minimum-in-rotated-sorted-array
0162-find-peak-element
0215-kth-largest-element-in-an-array
0217-contains-duplicate
0238-product-of-array-except-self
0240-search-a-2d-matrix-ii
0287-find-the-duplicate-number
0410-split-array-largest-sum
0414-third-maximum-number
0540-single-element-in-a-sorted-array
0748-largest-number-at-least-twice-of-others
0907-koko-eating-bananas
1056-capacity-to-ship-packages-within-d-days
1137-height-checker
1217-relative-sort-array
1408-find-the-smallest-divisor-given-a-threshold
1584-average-salary-excluding-the-minimum-and-maximum-salary
1605-minimum-number-of-days-to-make-m-bouquets
1646-kth-missing-positive-number
1675-magnetic-force-between-two-balls
1927-maximum-ascending-subarray-sum
2614-maximum-count-of-positive-integer-and-negative-integer

Two Pointers

0015-3sum
0018-4sum
0027-remove-element
0075-sort-colors
0080-remove-duplicates-from-sorted-array-ii
0088-merge-sorted-array
0287-find-the-duplicate-number
0633-sum-of-square-numbers

Sorting

0015-3sum
0018-4sum
0056-merge-intervals
0075-sort-colors
0088-merge-sorted-array
0215-kth-largest-element-in-an-array
0217-contains-duplicate
0414-third-maximum-number
0748-largest-number-at-least-twice-of-others
1137-height-checker
1217-relative-sort-array
1584-average-salary-excluding-the-minimum-and-maximum-salary
1675-magnetic-force-between-two-balls

Binary Search

0004-median-of-two-sorted-arrays
0074-search-a-2d-matrix
0153-find-minimum-in-rotated-sorted-array
0162-find-peak-element
0240-search-a-2d-matrix-ii
0287-find-the-duplicate-number
0410-split-array-largest-sum
0540-single-element-in-a-sorted-array
0633-sum-of-square-numbers
0907-koko-eating-bananas
1056-capacity-to-ship-packages-within-d-days
1408-find-the-smallest-divisor-given-a-threshold
1605-minimum-number-of-days-to-make-m-bouquets
1646-kth-missing-positive-number
1675-magnetic-force-between-two-balls
2614-maximum-count-of-positive-integer-and-negative-integer

Prefix Sum

0238-product-of-array-except-self
0410-split-array-largest-sum

Math

0319-bulb-switcher
0633-sum-of-square-numbers

Brainteaser

0319-bulb-switcher

Counting Sort

1137-height-checker
1217-relative-sort-array
2614-maximum-count-of-positive-integer-and-negative-integer

Hash Table

0217-contains-duplicate
1217-relative-sort-array

Divide and Conquer

0004-median-of-two-sorted-arrays
0215-kth-largest-element-in-an-array
0240-search-a-2d-matrix-ii

Heap (Priority Queue)

0215-kth-largest-element-in-an-array

Quickselect

0215-kth-largest-element-in-an-array

Bit Manipulation

0287-find-the-duplicate-number

String

0058-length-of-last-word

Stack

0155-min-stack

Design

0155-min-stack

Dynamic Programming

0410-split-array-largest-sum

Greedy

0410-split-array-largest-sum

Matrix

0074-search-a-2d-matrix
0240-search-a-2d-matrix-ii

LeetCode Topics

Array

0042-trapping-rain-water
0078-subsets
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0204-count-primes
0350-intersection-of-two-arrays-ii
0410-split-array-largest-sum
0940-fruit-into-baskets
0966-binary-subarrays-with-sum
1046-max-consecutive-ones-iii
1293-three-consecutive-odds
1370-count-number-of-nice-subarrays
2047-find-a-peak-element-ii
2227-sum-of-subarray-ranges

Binary Search

0222-count-complete-tree-nodes
0350-intersection-of-two-arrays-ii
0410-split-array-largest-sum
1046-max-consecutive-ones-iii
2047-find-a-peak-element-ii

Matrix

2047-find-a-peak-element-ii

Dynamic Programming

0042-trapping-rain-water
0124-binary-tree-maximum-path-sum
0410-split-array-largest-sum

Greedy

0410-split-array-largest-sum

Prefix Sum

0410-split-array-largest-sum
0966-binary-subarrays-with-sum
1046-max-consecutive-ones-iii

Hash Table

0003-longest-substring-without-repeating-characters
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0138-copy-list-with-random-pointer
0141-linked-list-cycle
0142-linked-list-cycle-ii
0160-intersection-of-two-linked-lists
0350-intersection-of-two-arrays-ii
0424-longest-repeating-character-replacement
0653-two-sum-iv-input-is-a-bst
0893-all-nodes-distance-k-in-binary-tree
0940-fruit-into-baskets
0966-binary-subarrays-with-sum
1029-vertical-order-traversal-of-a-binary-tree
1370-count-number-of-nice-subarrays

Two Pointers

0019-remove-nth-node-from-end-of-list
0042-trapping-rain-water
0061-rotate-list
0141-linked-list-cycle
0142-linked-list-cycle-ii
0148-sort-list
0160-intersection-of-two-linked-lists
0234-palindrome-linked-list
0350-intersection-of-two-arrays-ii
0653-two-sum-iv-input-is-a-bst
0908-middle-of-the-linked-list

Sorting

0148-sort-list
0350-intersection-of-two-arrays-ii
1029-vertical-order-traversal-of-a-binary-tree

Linked List

0002-add-two-numbers
0019-remove-nth-node-from-end-of-list
0021-merge-two-sorted-lists
0025-reverse-nodes-in-k-group
0061-rotate-list
0114-flatten-binary-tree-to-linked-list
0138-copy-list-with-random-pointer
0141-linked-list-cycle
0142-linked-list-cycle-ii
0148-sort-list
0160-intersection-of-two-linked-lists
0206-reverse-linked-list
0234-palindrome-linked-list
0328-odd-even-linked-list
0908-middle-of-the-linked-list

Recursion

0002-add-two-numbers
0021-merge-two-sorted-lists
0025-reverse-nodes-in-k-group
0050-powx-n
0206-reverse-linked-list
0231-power-of-two
0234-palindrome-linked-list

Stack

0020-valid-parentheses
0042-trapping-rain-water
0094-binary-tree-inorder-traversal
0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0155-min-stack
0173-binary-search-tree-iterator
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0234-palindrome-linked-list
2227-sum-of-subarray-ranges

Math

0002-add-two-numbers
0029-divide-two-integers
0050-powx-n
0204-count-primes
0231-power-of-two
1370-count-number-of-nice-subarrays
2645-pass-the-pillow

Divide and Conquer

0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0148-sort-list

Merge Sort

0148-sort-list

Simulation

2645-pass-the-pillow

Bit Manipulation

0029-divide-two-integers
0078-subsets
0222-count-complete-tree-nodes
0231-power-of-two
2323-minimum-bit-flips-to-convert-number

Backtracking

0078-subsets

Enumeration

0204-count-primes

Number Theory

0204-count-primes

String

0003-longest-substring-without-repeating-characters
0020-valid-parentheses
0297-serialize-and-deserialize-binary-tree
0424-longest-repeating-character-replacement

Sliding Window

0003-longest-substring-without-repeating-characters
0424-longest-repeating-character-replacement
0940-fruit-into-baskets
0966-binary-subarrays-with-sum
1046-max-consecutive-ones-iii
1370-count-number-of-nice-subarrays

Design

0155-min-stack
0173-binary-search-tree-iterator
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0297-serialize-and-deserialize-binary-tree

Queue

0225-implement-stack-using-queues
0232-implement-queue-using-stacks

Monotonic Stack

0042-trapping-rain-water
2227-sum-of-subarray-ranges

Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0110-balanced-binary-tree
0114-flatten-binary-tree-to-linked-list
0124-binary-tree-maximum-path-sum
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0173-binary-search-tree-iterator
0222-count-complete-tree-nodes
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0297-serialize-and-deserialize-binary-tree
0450-delete-node-in-a-bst
0543-diameter-of-binary-tree
0653-two-sum-iv-input-is-a-bst
0783-search-in-a-binary-search-tree
0893-all-nodes-distance-k-in-binary-tree
1029-vertical-order-traversal-of-a-binary-tree

Depth-First Search

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0114-flatten-binary-tree-to-linked-list
0124-binary-tree-maximum-path-sum
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0297-serialize-and-deserialize-binary-tree
0543-diameter-of-binary-tree
0653-two-sum-iv-input-is-a-bst
0893-all-nodes-distance-k-in-binary-tree
1029-vertical-order-traversal-of-a-binary-tree

Binary Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0110-balanced-binary-tree
0114-flatten-binary-tree-to-linked-list
0124-binary-tree-maximum-path-sum
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0173-binary-search-tree-iterator
0222-count-complete-tree-nodes
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0297-serialize-and-deserialize-binary-tree
0450-delete-node-in-a-bst
0543-diameter-of-binary-tree
0653-two-sum-iv-input-is-a-bst
0783-search-in-a-binary-search-tree
0893-all-nodes-distance-k-in-binary-tree
1029-vertical-order-traversal-of-a-binary-tree

Breadth-First Search

0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0297-serialize-and-deserialize-binary-tree
0653-two-sum-iv-input-is-a-bst
0893-all-nodes-distance-k-in-binary-tree
1029-vertical-order-traversal-of-a-binary-tree

Binary Search Tree

0098-validate-binary-search-tree
0099-recover-binary-search-tree
0173-binary-search-tree-iterator
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
0653-two-sum-iv-input-is-a-bst
0783-search-in-a-binary-search-tree

Iterator

0173-binary-search-tree-iterator