• 👋 Hi, I’m @DAYHARIKA
• 👀 I’m interested in CODING
• 🌱 I’m currently learning PROBLEM SOLVING SKILLS
• 📫 You can reach me through email kunamdayharika@gmail.com

LeetCode Topics

Two Pointers

0011-container-with-most-water
0015-3sum
0018-4sum
0019-remove-nth-node-from-end-of-list
0026-remove-duplicates-from-sorted-array
0042-trapping-rain-water
0061-rotate-list
0075-sort-colors
0142-linked-list-cycle-ii
0148-sort-list
0151-reverse-words-in-a-string
0160-intersection-of-two-linked-lists
0234-palindrome-linked-list
0295-find-median-from-data-stream
0455-assign-cookies
0653-two-sum-iv-input-is-a-bst
0908-middle-of-the-linked-list
1048-longest-string-chain
2216-delete-the-middle-node-of-a-linked-list

String

0003-longest-substring-without-repeating-characters
0008-string-to-integer-atoi
0013-roman-to-integer
0014-longest-common-prefix
0017-letter-combinations-of-a-phone-number
0020-valid-parentheses
0022-generate-parentheses
0030-substring-with-concatenation-of-all-words
0044-wildcard-matching
0072-edit-distance
0076-minimum-window-substring
0079-word-search
0115-distinct-subsequences
0127-word-ladder
0131-palindrome-partitioning
0151-reverse-words-in-a-string
0205-isomorphic-strings
0242-valid-anagram
0257-binary-tree-paths
0282-expression-add-operators
0297-serialize-and-deserialize-binary-tree
0402-remove-k-digits
0424-longest-repeating-character-replacement
0451-sort-characters-by-frequency
0516-longest-palindromic-subsequence
0583-delete-operation-for-two-strings
0678-valid-parenthesis-string
0721-accounts-merge
0812-rotate-string
1048-longest-string-chain
1078-remove-outermost-parentheses
1170-shortest-common-supersequence
1250-longest-common-subsequence
1437-minimum-insertion-steps-to-make-a-string-palindrome
1460-number-of-substrings-containing-all-three-characters
1737-maximum-nesting-depth-of-the-parentheses
1890-sum-of-beauty-of-all-substrings
2032-largest-odd-number-in-string

Math

0002-add-two-numbers
0013-roman-to-integer
0050-powx-n
0060-permutation-sequence
0062-unique-paths
0069-sqrtx
0070-climbing-stairs
0282-expression-add-operators
0368-largest-divisible-subset
1370-count-number-of-nice-subarrays
2032-largest-odd-number-in-string
2050-count-good-numbers
3227-find-missing-and-repeated-values

Greedy

0011-container-with-most-water
0044-wildcard-matching
0045-jump-game-ii
0055-jump-game
0122-best-time-to-buy-and-sell-stock-ii
0134-gas-station
0135-candy
0402-remove-k-digits
0410-split-array-largest-sum
0435-non-overlapping-intervals
0455-assign-cookies
0621-task-scheduler
0678-valid-parenthesis-string
0714-best-time-to-buy-and-sell-stock-with-transaction-fee
0876-hand-of-straights
0890-lemonade-change
2032-largest-odd-number-in-string
3691-maximum-total-subarray-value-ii

Trie

0014-longest-common-prefix

Hash Table

0001-two-sum
0003-longest-substring-without-repeating-characters
0013-roman-to-integer
0017-letter-combinations-of-a-phone-number
0030-substring-with-concatenation-of-all-words
0037-sudoku-solver
0076-minimum-window-substring
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0127-word-ladder
0128-longest-consecutive-sequence
0142-linked-list-cycle-ii
0146-lru-cache
0160-intersection-of-two-linked-lists
0169-majority-element
0205-isomorphic-strings
0229-majority-element-ii
0242-valid-anagram
0347-top-k-frequent-elements
0355-design-twitter
0424-longest-repeating-character-replacement
0451-sort-characters-by-frequency
0460-lfu-cache
0496-next-greater-element-i
0621-task-scheduler
0653-two-sum-iv-input-is-a-bst
0721-accounts-merge
0876-hand-of-straights
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
1034-subarrays-with-k-different-integers
1048-longest-string-chain
1370-count-number-of-nice-subarrays
1460-number-of-substrings-containing-all-three-characters
1482-how-many-numbers-are-smaller-than-the-current-number
1890-sum-of-beauty-of-all-substrings
3227-find-missing-and-repeated-values

String Matching

0812-rotate-string

Sorting

0015-3sum
0018-4sum
0056-merge-intervals
0075-sort-colors
0148-sort-list
0169-majority-element
0215-kth-largest-element-in-an-array
0229-majority-element-ii
0242-valid-anagram
0295-find-median-from-data-stream
0347-top-k-frequent-elements
0368-largest-divisible-subset
0435-non-overlapping-intervals
0451-sort-characters-by-frequency
0455-assign-cookies
0621-task-scheduler
0721-accounts-merge
0876-hand-of-straights
1029-vertical-order-traversal-of-a-binary-tree
1048-longest-string-chain
1482-how-many-numbers-are-smaller-than-the-current-number
1547-minimum-cost-to-cut-a-stick

Heap (Priority Queue)

0023-merge-k-sorted-lists
0215-kth-largest-element-in-an-array
0239-sliding-window-maximum
0295-find-median-from-data-stream
0347-top-k-frequent-elements
0355-design-twitter
0451-sort-characters-by-frequency
0621-task-scheduler
0743-network-delay-time
0744-network-delay-time
0787-cheapest-flights-within-k-stops
0789-kth-largest-element-in-a-stream
0803-cheapest-flights-within-k-stops
1753-path-with-minimum-effort
3691-maximum-total-subarray-value-ii

Bucket Sort

0347-top-k-frequent-elements
0451-sort-characters-by-frequency

Counting

0169-majority-element
0229-majority-element-ii
0347-top-k-frequent-elements
0451-sort-characters-by-frequency
0621-task-scheduler
1034-subarrays-with-k-different-integers
1890-sum-of-beauty-of-all-substrings

Stack

0020-valid-parentheses
0042-trapping-rain-water
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
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
0402-remove-k-digits
0496-next-greater-element-i
0503-next-greater-element-ii
0678-valid-parenthesis-string
0735-asteroid-collision
0937-online-stock-span
0943-sum-of-subarray-minimums
1050-construct-binary-search-tree-from-preorder-traversal
1078-remove-outermost-parentheses
1737-maximum-nesting-depth-of-the-parentheses
2227-sum-of-subarray-ranges

Linked List

0002-add-two-numbers
0019-remove-nth-node-from-end-of-list
0023-merge-k-sorted-lists
0025-reverse-nodes-in-k-group
0061-rotate-list
0114-flatten-binary-tree-to-linked-list
0142-linked-list-cycle-ii
0146-lru-cache
0148-sort-list
0160-intersection-of-two-linked-lists
0234-palindrome-linked-list
0237-delete-node-in-a-linked-list
0328-odd-even-linked-list
0355-design-twitter
0460-lfu-cache
0908-middle-of-the-linked-list
2216-delete-the-middle-node-of-a-linked-list

Recursion

0002-add-two-numbers
0025-reverse-nodes-in-k-group
0044-wildcard-matching
0050-powx-n
0060-permutation-sequence
0234-palindrome-linked-list
2050-count-good-numbers

Divide and Conquer

0023-merge-k-sorted-lists
0053-maximum-subarray
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0148-sort-list
0169-majority-element
0215-kth-largest-element-in-an-array
0315-count-of-smaller-numbers-after-self
0347-top-k-frequent-elements
0493-reverse-pairs

Merge Sort

0023-merge-k-sorted-lists
0148-sort-list
0315-count-of-smaller-numbers-after-self
0493-reverse-pairs

Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0100-same-tree
0101-symmetric-tree
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0106-construct-binary-tree-from-inorder-and-postorder-traversal
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
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
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
0662-maximum-width-of-binary-tree
0784-insert-into-a-binary-search-tree
0789-kth-largest-element-in-a-stream
0893-all-nodes-distance-k-in-binary-tree
0998-check-completeness-of-a-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
1050-construct-binary-search-tree-from-preorder-traversal

Depth-First Search

0079-word-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
0114-flatten-binary-tree-to-linked-list
0124-binary-tree-maximum-path-sum
0130-surrounded-regions
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0297-serialize-and-deserialize-binary-tree
0543-diameter-of-binary-tree
0547-number-of-provinces
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0721-accounts-merge
0733-flood-fill
0743-network-delay-time
0744-network-delay-time
0785-is-graph-bipartite
0787-cheapest-flights-within-k-stops
0801-is-graph-bipartite
0802-find-eventual-safe-states
0803-cheapest-flights-within-k-stops
0820-find-eventual-safe-states
0893-all-nodes-distance-k-in-binary-tree
1020-number-of-enclaves
1029-vertical-order-traversal-of-a-binary-tree
1073-number-of-enclaves
1319-number-of-operations-to-make-network-connected
1753-path-with-minimum-effort

Breadth-First Search

0100-same-tree
0101-symmetric-tree
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0127-word-ladder
0130-surrounded-regions
0199-binary-tree-right-side-view
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0297-serialize-and-deserialize-binary-tree
0322-coin-change
0542-01-matrix
0547-number-of-provinces
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0721-accounts-merge
0733-flood-fill
0743-network-delay-time
0744-network-delay-time
0785-is-graph-bipartite
0787-cheapest-flights-within-k-stops
0801-is-graph-bipartite
0802-find-eventual-safe-states
0803-cheapest-flights-within-k-stops
0820-find-eventual-safe-states
0893-all-nodes-distance-k-in-binary-tree
0994-rotting-oranges
0998-check-completeness-of-a-binary-tree
1020-number-of-enclaves
1029-vertical-order-traversal-of-a-binary-tree
1036-rotting-oranges
1073-number-of-enclaves
1091-shortest-path-in-binary-matrix
1171-shortest-path-in-binary-matrix
1319-number-of-operations-to-make-network-connected
1753-path-with-minimum-effort

Binary Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0099-recover-binary-search-tree
0100-same-tree
0101-symmetric-tree
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0106-construct-binary-tree-from-inorder-and-postorder-traversal
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
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
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
0662-maximum-width-of-binary-tree
0784-insert-into-a-binary-search-tree
0789-kth-largest-element-in-a-stream
0893-all-nodes-distance-k-in-binary-tree
0998-check-completeness-of-a-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
1050-construct-binary-search-tree-from-preorder-traversal

Dynamic Programming

0022-generate-parentheses
0042-trapping-rain-water
0044-wildcard-matching
0045-jump-game-ii
0053-maximum-subarray
0055-jump-game
0062-unique-paths
0063-unique-paths-ii
0064-minimum-path-sum
0070-climbing-stairs
0072-edit-distance
0085-maximal-rectangle
0115-distinct-subsequences
0118-pascals-triangle
0120-triangle
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0123-best-time-to-buy-and-sell-stock-iii
0124-binary-tree-maximum-path-sum
0131-palindrome-partitioning
0152-maximum-product-subarray
0188-best-time-to-buy-and-sell-stock-iv
0198-house-robber
0213-house-robber-ii
0300-longest-increasing-subsequence
0309-best-time-to-buy-and-sell-stock-with-cooldown
0312-burst-balloons
0322-coin-change
0368-largest-divisible-subset
0410-split-array-largest-sum
0416-partition-equal-subset-sum
0435-non-overlapping-intervals
0494-target-sum
0516-longest-palindromic-subsequence
0518-coin-change-ii
0542-01-matrix
0583-delete-operation-for-two-strings
0673-number-of-longest-increasing-subsequence
0678-valid-parenthesis-string
0714-best-time-to-buy-and-sell-stock-with-transaction-fee
0787-cheapest-flights-within-k-stops
0803-cheapest-flights-within-k-stops
0943-sum-of-subarray-minimums
0967-minimum-falling-path-sum
1048-longest-string-chain
1170-shortest-common-supersequence
1250-longest-common-subsequence
1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1437-minimum-insertion-steps-to-make-a-string-palindrome
1547-minimum-cost-to-cut-a-stick
1976-number-of-ways-to-arrive-at-destination
2090-number-of-ways-to-arrive-at-destination

Backtracking

0017-letter-combinations-of-a-phone-number
0022-generate-parentheses
0037-sudoku-solver
0039-combination-sum
0040-combination-sum-ii
0046-permutations
0051-n-queens
0078-subsets
0079-word-search
0090-subsets-ii
0131-palindrome-partitioning
0216-combination-sum-iii
0257-binary-tree-paths
0282-expression-add-operators
0494-target-sum

Array

0001-two-sum
0011-container-with-most-water
0015-3sum
0018-4sum
0026-remove-duplicates-from-sorted-array
0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0037-sudoku-solver
0039-combination-sum
0040-combination-sum-ii
0042-trapping-rain-water
0045-jump-game-ii
0046-permutations
0051-n-queens
0053-maximum-subarray
0054-spiral-matrix
0055-jump-game
0056-merge-intervals
0057-insert-interval
0063-unique-paths-ii
0064-minimum-path-sum
0075-sort-colors
0078-subsets
0079-word-search
0081-search-in-rotated-sorted-array-ii
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0090-subsets-ii
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0118-pascals-triangle
0120-triangle
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0123-best-time-to-buy-and-sell-stock-iii
0128-longest-consecutive-sequence
0130-surrounded-regions
0134-gas-station
0135-candy
0152-maximum-product-subarray
0169-majority-element
0188-best-time-to-buy-and-sell-stock-iv
0198-house-robber
0200-number-of-islands
0213-house-robber-ii
0215-kth-largest-element-in-an-array
0216-combination-sum-iii
0229-majority-element-ii
0239-sliding-window-maximum
0300-longest-increasing-subsequence
0309-best-time-to-buy-and-sell-stock-with-cooldown
0312-burst-balloons
0315-count-of-smaller-numbers-after-self
0322-coin-change
0347-top-k-frequent-elements
0368-largest-divisible-subset
0410-split-array-largest-sum
0416-partition-equal-subset-sum
0435-non-overlapping-intervals
0455-assign-cookies
0493-reverse-pairs
0494-target-sum
0496-next-greater-element-i
0503-next-greater-element-ii
0518-coin-change-ii
0540-single-element-in-a-sorted-array
0542-01-matrix
0621-task-scheduler
0673-number-of-longest-increasing-subsequence
0714-best-time-to-buy-and-sell-stock-with-transaction-fee
0721-accounts-merge
0733-flood-fill
0735-asteroid-collision
0876-hand-of-straights
0890-lemonade-change
0940-fruit-into-baskets
0943-sum-of-subarray-minimums
0966-binary-subarrays-with-sum
0967-minimum-falling-path-sum
0994-rotting-oranges
1020-number-of-enclaves
1034-subarrays-with-k-different-integers
1036-rotting-oranges
1046-max-consecutive-ones-iii
1048-longest-string-chain
1050-construct-binary-search-tree-from-preorder-traversal
1056-capacity-to-ship-packages-within-d-days
1073-number-of-enclaves
1091-shortest-path-in-binary-matrix
1171-shortest-path-in-binary-matrix
1370-count-number-of-nice-subarrays
1482-how-many-numbers-are-smaller-than-the-current-number
1538-maximum-points-you-can-obtain-from-cards
1547-minimum-cost-to-cut-a-stick
1605-minimum-number-of-days-to-make-m-bouquets
1753-path-with-minimum-effort
2227-sum-of-subarray-ranges
3227-find-missing-and-repeated-values
3691-maximum-total-subarray-value-ii

Bit Manipulation

0078-subsets
0090-subsets-ii
0222-count-complete-tree-nodes

Matrix

0037-sudoku-solver
0054-spiral-matrix
0063-unique-paths-ii
0064-minimum-path-sum
0079-word-search
0085-maximal-rectangle
0130-surrounded-regions
0200-number-of-islands
0542-01-matrix
0733-flood-fill
0967-minimum-falling-path-sum
0994-rotting-oranges
1020-number-of-enclaves
1036-rotting-oranges
1073-number-of-enclaves
1091-shortest-path-in-binary-matrix
1171-shortest-path-in-binary-matrix
1753-path-with-minimum-effort
3227-find-missing-and-repeated-values

Design

0146-lru-cache
0155-min-stack
0173-binary-search-tree-iterator
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0295-find-median-from-data-stream
0297-serialize-and-deserialize-binary-tree
0355-design-twitter
0460-lfu-cache
0789-kth-largest-element-in-a-stream
0937-online-stock-span

Queue

0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0239-sliding-window-maximum

Union Find

0128-longest-consecutive-sequence
0130-surrounded-regions
0200-number-of-islands
0547-number-of-provinces
0785-is-graph-bipartite
0801-is-graph-bipartite
1020-number-of-enclaves
1073-number-of-enclaves
1753-path-with-minimum-effort

Monotonic Stack

0042-trapping-rain-water
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0402-remove-k-digits
0496-next-greater-element-i
0503-next-greater-element-ii
0937-online-stock-span
0943-sum-of-subarray-minimums
1050-construct-binary-search-tree-from-preorder-traversal
2227-sum-of-subarray-ranges

Counting Sort

1482-how-many-numbers-are-smaller-than-the-current-number

Binary Search

0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0069-sqrtx
0081-search-in-rotated-sorted-array-ii
0222-count-complete-tree-nodes
0300-longest-increasing-subsequence
0315-count-of-smaller-numbers-after-self
0410-split-array-largest-sum
0493-reverse-pairs
0540-single-element-in-a-sorted-array
1046-max-consecutive-ones-iii
1056-capacity-to-ship-packages-within-d-days
1605-minimum-number-of-days-to-make-m-bouquets
1753-path-with-minimum-effort

Binary Indexed Tree

0315-count-of-smaller-numbers-after-self
0493-reverse-pairs
0673-number-of-longest-increasing-subsequence

Segment Tree

0315-count-of-smaller-numbers-after-self
0493-reverse-pairs
0673-number-of-longest-increasing-subsequence
3691-maximum-total-subarray-value-ii

Ordered Set

0315-count-of-smaller-numbers-after-self
0493-reverse-pairs

Simulation

0054-spiral-matrix
0735-asteroid-collision

Data Stream

0295-find-median-from-data-stream
0789-kth-largest-element-in-a-stream
0937-online-stock-span

Sliding Window

0003-longest-substring-without-repeating-characters
0030-substring-with-concatenation-of-all-words
0076-minimum-window-substring
0239-sliding-window-maximum
0424-longest-repeating-character-replacement
0940-fruit-into-baskets
0966-binary-subarrays-with-sum
1034-subarrays-with-k-different-integers
1046-max-consecutive-ones-iii
1370-count-number-of-nice-subarrays
1460-number-of-substrings-containing-all-three-characters
1538-maximum-points-you-can-obtain-from-cards

Monotonic Queue

0239-sliding-window-maximum

Doubly-Linked List

0146-lru-cache
0460-lfu-cache

Prefix Sum

0410-split-array-largest-sum
0966-binary-subarrays-with-sum
1046-max-consecutive-ones-iii
1370-count-number-of-nice-subarrays
1538-maximum-points-you-can-obtain-from-cards

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
0784-insert-into-a-binary-search-tree
0789-kth-largest-element-in-a-stream
1050-construct-binary-search-tree-from-preorder-traversal

Iterator

0173-binary-search-tree-iterator

Quickselect

0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements

Graph

0207-course-schedule
0210-course-schedule-ii
0547-number-of-provinces
0744-network-delay-time
0785-is-graph-bipartite
0801-is-graph-bipartite
0802-find-eventual-safe-states
0803-cheapest-flights-within-k-stops
0820-find-eventual-safe-states
1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
2090-number-of-ways-to-arrive-at-destination

Topological Sort

0207-course-schedule
0210-course-schedule-ii
0802-find-eventual-safe-states
0820-find-eventual-safe-states
1976-number-of-ways-to-arrive-at-destination
2090-number-of-ways-to-arrive-at-destination

Shortest Path

0743-network-delay-time
0744-network-delay-time
0787-cheapest-flights-within-k-stops
0803-cheapest-flights-within-k-stops
1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1976-number-of-ways-to-arrive-at-destination
2090-number-of-ways-to-arrive-at-destination

Memoization

0070-climbing-stairs

Combinatorics

0062-unique-paths

Graph Theory

0743-network-delay-time
0787-cheapest-flights-within-k-stops
1319-number-of-operations-to-make-network-connected
1976-number-of-ways-to-arrive-at-destination

Union-Find

0721-accounts-merge
1319-number-of-operations-to-make-network-connected