/LeetCode_New

Primary LanguageC++

LeetCode_New

Array
0011-container-with-most-water
0042-trapping-rain-water
0085-maximal-rectangle
0581-shortest-unsorted-continuous-subarray
0682-baseball-game
0739-daily-temperatures
0883-car-fleet
0983-validate-stack-sequences
1072-next-greater-node-in-linked-list
1552-build-an-array-with-stack-operations
1902-car-fleet-ii

Linked List
1072-next-greater-node-in-linked-list

Stack
0042-trapping-rain-water
0071-simplify-path
0085-maximal-rectangle
0316-remove-duplicate-letters
0394-decode-string
0581-shortest-unsorted-continuous-subarray
0678-valid-parenthesis-string
0682-baseball-game
0739-daily-temperatures
0874-backspace-string-compare
0883-car-fleet
0886-score-of-parentheses
0937-online-stock-span
0957-minimum-add-to-make-parentheses-valid
0983-validate-stack-sequences
1045-check-if-word-is-valid-after-substitutions
1072-next-greater-node-in-linked-list
1159-smallest-subsequence-of-distinct-characters
1298-reverse-substrings-between-each-pair-of-parentheses
1320-remove-all-adjacent-duplicates-in-string-ii
1371-minimum-remove-to-make-valid-parentheses
1552-build-an-array-with-stack-operations
1902-car-fleet-ii
2800-minimum-string-length-after-removing-substrings

Monotonic Stack
0042-trapping-rain-water
0085-maximal-rectangle
0316-remove-duplicate-letters
0581-shortest-unsorted-continuous-subarray
0739-daily-temperatures
0883-car-fleet
0937-online-stock-span
1072-next-greater-node-in-linked-list
1159-smallest-subsequence-of-distinct-characters
1902-car-fleet-ii

String
0071-simplify-path
0316-remove-duplicate-letters
0387-first-unique-character-in-a-string
0394-decode-string
0678-valid-parenthesis-string
0874-backspace-string-compare
0886-score-of-parentheses
0957-minimum-add-to-make-parentheses-valid
1045-check-if-word-is-valid-after-substitutions
1159-smallest-subsequence-of-distinct-characters
1298-reverse-substrings-between-each-pair-of-parentheses
1320-remove-all-adjacent-duplicates-in-string-ii
1371-minimum-remove-to-make-valid-parentheses
2800-minimum-string-length-after-removing-substrings

Greedy
0011-container-with-most-water
0316-remove-duplicate-letters
0581-shortest-unsorted-continuous-subarray
0678-valid-parenthesis-string
0957-minimum-add-to-make-parentheses-valid
1159-smallest-subsequence-of-distinct-characters

Recursion
0394-decode-string

Two Pointers
0011-container-with-most-water
0042-trapping-rain-water
0581-shortest-unsorted-continuous-subarray
0874-backspace-string-compare

Sorting
0581-shortest-unsorted-continuous-subarray
0883-car-fleet

Dynamic Programming
0042-trapping-rain-water
0085-maximal-rectangle
0678-valid-parenthesis-string

Simulation
0682-baseball-game
0874-backspace-string-compare
0983-validate-stack-sequences
1552-build-an-array-with-stack-operations
2800-minimum-string-length-after-removing-substrings

Design
0937-online-stock-span

Data Stream
0937-online-stock-span

Matrix
0085-maximal-rectangle

Math
1902-car-fleet-ii

Heap (Priority Queue)
1902-car-fleet-ii

Hash Table
0387-first-unique-character-in-a-string

Queue
0387-first-unique-character-in-a-string

Counting
0387-first-unique-character-in-a-string

LeetCode Topics

Array
0026-remove-duplicates-from-sorted-array
0134-gas-station
0239-sliding-window-maximum
0287-find-the-duplicate-number
0907-koko-eating-bananas
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
1802-number-of-students-unable-to-eat-lunch

Stack
0094-binary-tree-inorder-traversal
0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
1802-number-of-students-unable-to-eat-lunch

Queue
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0239-sliding-window-maximum
1802-number-of-students-unable-to-eat-lunch

Simulation
1802-number-of-students-unable-to-eat-lunch

Sliding Window
0239-sliding-window-maximum

Heap (Priority Queue)
0239-sliding-window-maximum

Monotonic Queue
0239-sliding-window-maximum

Greedy
0134-gas-station
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
3055-maximum-odd-binary-number

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

Math
3055-maximum-odd-binary-number

String
0257-binary-tree-paths
3055-maximum-odd-binary-number

Sorting
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves

Two Pointers
0026-remove-duplicates-from-sorted-array
0287-find-the-duplicate-number

Binary Search
0287-find-the-duplicate-number
0907-koko-eating-bananas

Bit Manipulation
0287-find-the-duplicate-number

Tree
0094-binary-tree-inorder-traversal
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0226-invert-binary-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0404-sum-of-left-leaves
0437-path-sum-iii
0513-find-bottom-left-tree-value
0515-find-largest-value-in-each-tree-row
0543-diameter-of-binary-tree
0563-binary-tree-tilt
0572-subtree-of-another-tree
0617-merge-two-binary-trees
0623-add-one-row-to-tree
0671-second-minimum-node-in-a-binary-tree
0904-leaf-similar-trees
1005-univalued-binary-tree
1035-cousins-in-binary-tree
2416-evaluate-boolean-binary-tree

Depth-First Search
0094-binary-tree-inorder-traversal
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0226-invert-binary-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0404-sum-of-left-leaves
0437-path-sum-iii
0513-find-bottom-left-tree-value
0515-find-largest-value-in-each-tree-row
0543-diameter-of-binary-tree
0563-binary-tree-tilt
0572-subtree-of-another-tree
0617-merge-two-binary-trees
0623-add-one-row-to-tree
0671-second-minimum-node-in-a-binary-tree
0904-leaf-similar-trees
1005-univalued-binary-tree
1035-cousins-in-binary-tree
2416-evaluate-boolean-binary-tree

Breadth-First Search
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0199-binary-tree-right-side-view
0226-invert-binary-tree
0404-sum-of-left-leaves
0513-find-bottom-left-tree-value
0515-find-largest-value-in-each-tree-row
0617-merge-two-binary-trees
0623-add-one-row-to-tree
1005-univalued-binary-tree
1035-cousins-in-binary-tree

Binary Tree
0094-binary-tree-inorder-traversal
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0226-invert-binary-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0404-sum-of-left-leaves
0437-path-sum-iii
0513-find-bottom-left-tree-value
0515-find-largest-value-in-each-tree-row
0543-diameter-of-binary-tree
0563-binary-tree-tilt
0572-subtree-of-another-tree
0617-merge-two-binary-trees
0623-add-one-row-to-tree
0671-second-minimum-node-in-a-binary-tree
0904-leaf-similar-trees
1005-univalued-binary-tree
1035-cousins-in-binary-tree
2416-evaluate-boolean-binary-tree

Backtracking
0113-path-sum-ii
0257-binary-tree-paths

String Matching
0572-subtree-of-another-tree

Hash Function
0572-subtree-of-another-tree

Linked List
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii