TIL

today i learned

DB

Network

OOP(JAVA)

SPTWEBDEV

COMPUTER ARCHITECTURE + OS

ALGORITHM

LeetCode Topics

Array

0033-search-in-rotated-sorted-array
0039-combination-sum
0046-permutations
0056-merge-intervals
0078-subsets
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0136-single-number
0167-two-sum-ii-input-array-is-sorted
0169-majority-element
0198-house-robber
0200-number-of-islands
0215-kth-largest-element-in-an-array
0238-product-of-array-except-self
0239-sliding-window-maximum
0240-search-a-2d-matrix-ii
0347-top-k-frequent-elements
0349-intersection-of-two-arrays
0406-queue-reconstruction-by-height
0455-assign-cookies
0621-task-scheduler
0739-daily-temperatures
0792-binary-search
0817-design-hashmap
0859-design-circular-deque
0860-design-circular-queue

Prefix Sum

0238-product-of-array-except-self

Dynamic Programming

0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0198-house-robber
0241-different-ways-to-add-parentheses
0803-cheapest-flights-within-k-stops
1013-fibonacci-number

Linked List

0002-add-two-numbers
0021-merge-two-sorted-lists
0023-merge-k-sorted-lists
0024-swap-nodes-in-pairs
0092-reverse-linked-list-ii
0148-sort-list
0206-reverse-linked-list
0234-palindrome-linked-list
0328-odd-even-linked-list
0817-design-hashmap
0859-design-circular-deque
0860-design-circular-queue

Two Pointers

0148-sort-list
0167-two-sum-ii-input-array-is-sorted
0234-palindrome-linked-list
0349-intersection-of-two-arrays
0455-assign-cookies

Stack

0020-valid-parentheses
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0234-palindrome-linked-list
0316-remove-duplicate-letters
0739-daily-temperatures

Recursion

0002-add-two-numbers
0021-merge-two-sorted-lists
0024-swap-nodes-in-pairs
0206-reverse-linked-list
0234-palindrome-linked-list
0241-different-ways-to-add-parentheses
1013-fibonacci-number

Math

0002-add-two-numbers
0241-different-ways-to-add-parentheses
0371-sum-of-two-integers
1013-fibonacci-number

String

0003-longest-substring-without-repeating-characters
0017-letter-combinations-of-a-phone-number
0020-valid-parentheses
0076-minimum-window-substring
0208-implement-trie-prefix-tree
0241-different-ways-to-add-parentheses
0242-valid-anagram
0297-serialize-and-deserialize-binary-tree
0316-remove-duplicate-letters
0782-jewels-and-stones

Greedy

0122-best-time-to-buy-and-sell-stock-ii
0316-remove-duplicate-letters
0455-assign-cookies
0621-task-scheduler

Monotonic Stack

0316-remove-duplicate-letters
0739-daily-temperatures

Design

0208-implement-trie-prefix-tree
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0297-serialize-and-deserialize-binary-tree
0817-design-hashmap
0859-design-circular-deque
0860-design-circular-queue

Queue

0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0239-sliding-window-maximum
0859-design-circular-deque
0860-design-circular-queue

Divide and Conquer

0023-merge-k-sorted-lists
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0148-sort-list
0169-majority-element
0215-kth-largest-element-in-an-array
0240-search-a-2d-matrix-ii
0347-top-k-frequent-elements

Heap (Priority Queue)

0023-merge-k-sorted-lists
0215-kth-largest-element-in-an-array
0239-sliding-window-maximum
0347-top-k-frequent-elements
0621-task-scheduler
0744-network-delay-time
0803-cheapest-flights-within-k-stops

Merge Sort

0023-merge-k-sorted-lists
0148-sort-list

Hash Table

0003-longest-substring-without-repeating-characters
0017-letter-combinations-of-a-phone-number
0076-minimum-window-substring
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0169-majority-element
0208-implement-trie-prefix-tree
0242-valid-anagram
0347-top-k-frequent-elements
0349-intersection-of-two-arrays
0621-task-scheduler
0782-jewels-and-stones
0817-design-hashmap

Hash Function

0817-design-hashmap

Sliding Window

0003-longest-substring-without-repeating-characters
0076-minimum-window-substring
0239-sliding-window-maximum

Sorting

0056-merge-intervals
0148-sort-list
0169-majority-element
0215-kth-largest-element-in-an-array
0242-valid-anagram
0347-top-k-frequent-elements
0349-intersection-of-two-arrays
0406-queue-reconstruction-by-height
0455-assign-cookies
0621-task-scheduler

Bucket Sort

0347-top-k-frequent-elements

Counting

0169-majority-element
0347-top-k-frequent-elements
0621-task-scheduler

Quickselect

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

Depth-First Search

0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0200-number-of-islands
0207-course-schedule
0226-invert-binary-tree
0297-serialize-and-deserialize-binary-tree
0310-minimum-height-trees
0332-reconstruct-itinerary
0543-diameter-of-binary-tree
0617-merge-two-binary-trees
0687-longest-univalue-path
0744-network-delay-time
0799-minimum-distance-between-bst-nodes
0803-cheapest-flights-within-k-stops
0975-range-sum-of-bst
1114-binary-search-tree-to-greater-sum-tree

Breadth-First Search

0104-maximum-depth-of-binary-tree
0200-number-of-islands
0207-course-schedule
0226-invert-binary-tree
0297-serialize-and-deserialize-binary-tree
0310-minimum-height-trees
0617-merge-two-binary-trees
0744-network-delay-time
0799-minimum-distance-between-bst-nodes
0803-cheapest-flights-within-k-stops

Union Find

0200-number-of-islands

Matrix

0200-number-of-islands
0240-search-a-2d-matrix-ii

Backtracking

0017-letter-combinations-of-a-phone-number
0039-combination-sum
0046-permutations
0077-combinations
0078-subsets

Bit Manipulation

0078-subsets
0136-single-number
0371-sum-of-two-integers
0461-hamming-distance

Graph

0207-course-schedule
0310-minimum-height-trees
0332-reconstruct-itinerary
0744-network-delay-time
0803-cheapest-flights-within-k-stops

Eulerian Circuit

0332-reconstruct-itinerary

Topological Sort

0207-course-schedule
0310-minimum-height-trees

Shortest Path

0744-network-delay-time
0803-cheapest-flights-within-k-stops

Tree

0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0110-balanced-binary-tree
0226-invert-binary-tree
0297-serialize-and-deserialize-binary-tree
0543-diameter-of-binary-tree
0617-merge-two-binary-trees
0687-longest-univalue-path
0799-minimum-distance-between-bst-nodes
0975-range-sum-of-bst
1114-binary-search-tree-to-greater-sum-tree

Binary Tree

0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0110-balanced-binary-tree
0226-invert-binary-tree
0297-serialize-and-deserialize-binary-tree
0543-diameter-of-binary-tree
0617-merge-two-binary-trees
0687-longest-univalue-path
0799-minimum-distance-between-bst-nodes
0975-range-sum-of-bst
1114-binary-search-tree-to-greater-sum-tree

Binary Search Tree

0033-search-in-rotated-sorted-array
0108-convert-sorted-array-to-binary-search-tree
0167-two-sum-ii-input-array-is-sorted
0240-search-a-2d-matrix-ii
0349-intersection-of-two-arrays
0792-binary-search
0799-minimum-distance-between-bst-nodes
0975-range-sum-of-bst
1114-binary-search-tree-to-greater-sum-tree

Trie

0208-implement-trie-prefix-tree

Monotonic Queue

0239-sliding-window-maximum

Memoization

0241-different-ways-to-add-parentheses
1013-fibonacci-number

Binary Indexed Tree

0406-queue-reconstruction-by-height

Segment Tree

0406-queue-reconstruction-by-height