Skip to content

shkimjune/Algorithm-Practice

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

400 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Algorithm-Practice

LeetCode Topics

Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
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
0111-minimum-depth-of-binary-tree
0112-path-sum
0144-binary-tree-preorder-traversal
0199-binary-tree-right-side-view
0226-invert-binary-tree
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0404-sum-of-left-leaves
0543-diameter-of-binary-tree
0572-subtree-of-another-tree

Depth-First Search

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
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
0133-clone-graph
0144-binary-tree-preorder-traversal
0199-binary-tree-right-side-view
0200-number-of-islands
0207-course-schedule
0226-invert-binary-tree
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0404-sum-of-left-leaves
0543-diameter-of-binary-tree
0572-subtree-of-another-tree
0721-accounts-merge
0733-flood-fill

Breadth-First Search

0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0133-clone-graph
0199-binary-tree-right-side-view
0200-number-of-islands
0207-course-schedule
0226-invert-binary-tree
0322-coin-change
0404-sum-of-left-leaves
0542-01-matrix
0721-accounts-merge
0733-flood-fill
1036-rotting-oranges

Binary Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
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
0111-minimum-depth-of-binary-tree
0112-path-sum
0144-binary-tree-preorder-traversal
0199-binary-tree-right-side-view
0226-invert-binary-tree
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0404-sum-of-left-leaves
0543-diameter-of-binary-tree
0572-subtree-of-another-tree

Hash Table

0003-longest-substring-without-repeating-characters
0013-roman-to-integer
0017-letter-combinations-of-a-phone-number
0049-group-anagrams
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0133-clone-graph
0139-word-break
0141-linked-list-cycle
0146-lru-cache
0169-majority-element
0208-implement-trie-prefix-tree
0217-contains-duplicate
0242-valid-anagram
0268-missing-number
0383-ransom-note
0409-longest-palindrome
0721-accounts-merge
1023-time-based-key-value-store

String

0003-longest-substring-without-repeating-characters
0005-longest-palindromic-substring
0008-string-to-integer-atoi
0013-roman-to-integer
0014-longest-common-prefix
0017-letter-combinations-of-a-phone-number
0022-generate-parentheses
0049-group-anagrams
0067-add-binary
0139-word-break
0208-implement-trie-prefix-tree
0242-valid-anagram
0257-binary-tree-paths
0383-ransom-note
0409-longest-palindrome
0721-accounts-merge
0874-backspace-string-compare
1023-time-based-key-value-store
1720-crawler-log-folder

Sorting

0015-3sum
0049-group-anagrams
0056-merge-intervals
0075-sort-colors
0169-majority-element
0217-contains-duplicate
0242-valid-anagram
0268-missing-number
0721-accounts-merge
1014-k-closest-points-to-origin
1019-squares-of-a-sorted-array

Array

0004-median-of-two-sorted-arrays
0011-container-with-most-water
0015-3sum
0026-remove-duplicates-from-sorted-array
0031-next-permutation
0033-search-in-rotated-sorted-array
0039-combination-sum
0046-permutations
0049-group-anagrams
0053-maximum-subarray
0054-spiral-matrix
0056-merge-intervals
0057-insert-interval
0075-sort-colors
0078-subsets
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0118-pascals-triangle
0121-best-time-to-buy-and-sell-stock
0134-gas-station
0136-single-number
0139-word-break
0150-evaluate-reverse-polish-notation
0169-majority-element
0200-number-of-islands
0217-contains-duplicate
0238-product-of-array-except-self
0268-missing-number
0283-move-zeroes
0322-coin-change
0416-partition-equal-subset-sum
0542-01-matrix
0721-accounts-merge
0733-flood-fill
0739-daily-temperatures
0792-binary-search
0968-beautiful-array
1014-k-closest-points-to-origin
1019-squares-of-a-sorted-array
1036-rotting-oranges
1720-crawler-log-folder

Binary Search

0004-median-of-two-sorted-arrays
0033-search-in-rotated-sorted-array
0268-missing-number
0278-first-bad-version
0792-binary-search
1023-time-based-key-value-store

Matrix

0054-spiral-matrix
0200-number-of-islands
0542-01-matrix
0733-flood-fill
1036-rotting-oranges

Binary Search Tree

0098-validate-binary-search-tree
0108-convert-sorted-array-to-binary-search-tree
0235-lowest-common-ancestor-of-a-binary-search-tree

Linked List

0021-merge-two-sorted-lists
0061-rotate-list
0083-remove-duplicates-from-sorted-list
0141-linked-list-cycle
0146-lru-cache
0206-reverse-linked-list
0234-palindrome-linked-list
0908-middle-of-the-linked-list

Two Pointers

0005-longest-palindromic-substring
0011-container-with-most-water
0015-3sum
0026-remove-duplicates-from-sorted-array
0031-next-permutation
0061-rotate-list
0075-sort-colors
0141-linked-list-cycle
0234-palindrome-linked-list
0283-move-zeroes
0874-backspace-string-compare
0908-middle-of-the-linked-list
1019-squares-of-a-sorted-array

Stack

0094-binary-tree-inorder-traversal
0144-binary-tree-preorder-traversal
0150-evaluate-reverse-polish-notation
0155-min-stack
0232-implement-queue-using-stacks
0234-palindrome-linked-list
0739-daily-temperatures
0874-backspace-string-compare
1720-crawler-log-folder

Design

0146-lru-cache
0155-min-stack
0208-implement-trie-prefix-tree
0232-implement-queue-using-stacks
1023-time-based-key-value-store

Queue

0232-implement-queue-using-stacks

Interactive

0278-first-bad-version

Counting

0169-majority-element
0383-ransom-note

Math

0009-palindrome-number
0013-roman-to-integer
0062-unique-paths
0067-add-binary
0070-climbing-stairs
0150-evaluate-reverse-polish-notation
0268-missing-number
0968-beautiful-array
1014-k-closest-points-to-origin

Dynamic Programming

0005-longest-palindromic-substring
0022-generate-parentheses
0053-maximum-subarray
0062-unique-paths
0070-climbing-stairs
0118-pascals-triangle
0121-best-time-to-buy-and-sell-stock
0139-word-break
0322-coin-change
0338-counting-bits
0416-partition-equal-subset-sum
0542-01-matrix

Memoization

0070-climbing-stairs
0139-word-break

Greedy

0011-container-with-most-water
0134-gas-station
0409-longest-palindrome

Recursion

0021-merge-two-sorted-lists
0206-reverse-linked-list
0234-palindrome-linked-list

Divide and Conquer

0004-median-of-two-sorted-arrays
0053-maximum-subarray
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0169-majority-element
0190-reverse-bits
0191-number-of-1-bits
0968-beautiful-array
1014-k-closest-points-to-origin

Bit Manipulation

0067-add-binary
0078-subsets
0136-single-number
0190-reverse-bits
0191-number-of-1-bits
0268-missing-number
0338-counting-bits

Simulation

0054-spiral-matrix
0067-add-binary
0874-backspace-string-compare

Trie

0014-longest-common-prefix
0139-word-break
0208-implement-trie-prefix-tree

String Matching

0572-subtree-of-another-tree

Hash Function

0572-subtree-of-another-tree

Geometry

1014-k-closest-points-to-origin

Heap (Priority Queue)

1014-k-closest-points-to-origin

Quickselect

1014-k-closest-points-to-origin

Sliding Window

0003-longest-substring-without-repeating-characters

Graph

0133-clone-graph
0207-course-schedule
1916-find-center-of-star-graph

Topological Sort

0207-course-schedule

Union Find

0200-number-of-islands
0721-accounts-merge

Backtracking

0017-letter-combinations-of-a-phone-number
0022-generate-parentheses
0039-combination-sum
0046-permutations
0078-subsets
0257-binary-tree-paths

Prefix Sum

0238-product-of-array-except-self

Combinatorics

0062-unique-paths

Monotonic Stack

0739-daily-temperatures

Doubly-Linked List

0146-lru-cache

About

LeetCode 문제풀이 기록

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors