Skip to content

minsukim-29cm/baekjoon

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1,152 Commits
0001-two-sum
0001-two-sum
 
 
0002-add-two-numbers
0002-add-two-numbers
 
 
0012-integer-to-roman
0012-integer-to-roman
 
 
0013-roman-to-integer
0013-roman-to-integer
 
 
0014-longest-common-prefix
0014-longest-common-prefix
 
 
0019-remove-nth-node-from-end-of-list
0019-remove-nth-node-from-end-of-list
 
 
0020-valid-parentheses
0020-valid-parentheses
 
 
0021-merge-two-sorted-lists
0021-merge-two-sorted-lists
 
 
0025-reverse-nodes-in-k-group
0025-reverse-nodes-in-k-group
 
 
0026-remove-duplicates-from-sorted-array
0026-remove-duplicates-from-sorted-array
 
 
0027-remove-element
0027-remove-element
 
 
0028-find-the-index-of-the-first-occurrence-in-a-string
0028-find-the-index-of-the-first-occurrence-in-a-string
 
 
0030-substring-with-concatenation-of-all-words
0030-substring-with-concatenation-of-all-words
 
 
0036-valid-sudoku
0036-valid-sudoku
 
 
0042-trapping-rain-water
0042-trapping-rain-water
 
 
0045-jump-game-ii
0045-jump-game-ii
 
 
0048-rotate-image
0048-rotate-image
 
 
0049-group-anagrams
0049-group-anagrams
 
 
0054-spiral-matrix
0054-spiral-matrix
 
 
0055-jump-game
0055-jump-game
 
 
0056-merge-intervals
0056-merge-intervals
 
 
0057-insert-interval
0057-insert-interval
 
 
0058-length-of-last-word
0058-length-of-last-word
 
 
0061-rotate-list
0061-rotate-list
 
 
0068-text-justification
0068-text-justification
 
 
0071-simplify-path
0071-simplify-path
 
 
0073-set-matrix-zeroes
0073-set-matrix-zeroes
 
 
0076-minimum-window-substring
0076-minimum-window-substring
 
 
0080-remove-duplicates-from-sorted-array-ii
0080-remove-duplicates-from-sorted-array-ii
 
 
0082-remove-duplicates-from-sorted-list-ii
0082-remove-duplicates-from-sorted-list-ii
 
 
0086-partition-list
0086-partition-list
 
 
0088-merge-sorted-array
0088-merge-sorted-array
 
 
0092-reverse-linked-list-ii
0092-reverse-linked-list-ii
 
 
0098-validate-binary-search-tree
0098-validate-binary-search-tree
 
 
0100-same-tree
0100-same-tree
 
 
0101-symmetric-tree
0101-symmetric-tree
 
 
0102-binary-tree-level-order-traversal
0102-binary-tree-level-order-traversal
 
 
0104-maximum-depth-of-binary-tree
0104-maximum-depth-of-binary-tree
 
 
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0105-construct-binary-tree-from-preorder-and-inorder-traversal
 
 
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
 
 
0112-path-sum
0112-path-sum
 
 
0114-flatten-binary-tree-to-linked-list
0114-flatten-binary-tree-to-linked-list
 
 
0117-populating-next-right-pointers-in-each-node-ii
0117-populating-next-right-pointers-in-each-node-ii
 
 
0121-best-time-to-buy-and-sell-stock
0121-best-time-to-buy-and-sell-stock
 
 
0122-best-time-to-buy-and-sell-stock-ii
0122-best-time-to-buy-and-sell-stock-ii
 
 
0124-binary-tree-maximum-path-sum
0124-binary-tree-maximum-path-sum
 
 
0125-valid-palindrome
0125-valid-palindrome
 
 
0128-longest-consecutive-sequence
0128-longest-consecutive-sequence
 
 
0129-sum-root-to-leaf-numbers
0129-sum-root-to-leaf-numbers
 
 
0130-surrounded-regions
0130-surrounded-regions
 
 
0134-gas-station
0134-gas-station
 
 
0135-candy
0135-candy
 
 
0138-copy-list-with-random-pointer
0138-copy-list-with-random-pointer
 
 
0141-linked-list-cycle
0141-linked-list-cycle
 
 
0146-lru-cache
0146-lru-cache
 
 
0150-evaluate-reverse-polish-notation
0150-evaluate-reverse-polish-notation
 
 
0151-reverse-words-in-a-string
0151-reverse-words-in-a-string
 
 
0155-min-stack
0155-min-stack
 
 
0167-two-sum-ii-input-array-is-sorted
0167-two-sum-ii-input-array-is-sorted
 
 
0169-majority-element
0169-majority-element
 
 
0173-binary-search-tree-iterator
0173-binary-search-tree-iterator
 
 
0189-rotate-array
0189-rotate-array
 
 
0199-binary-tree-right-side-view
0199-binary-tree-right-side-view
 
 
0200-number-of-islands
0200-number-of-islands
 
 
0202-happy-number
0202-happy-number
 
 
0205-isomorphic-strings
0205-isomorphic-strings
 
 
0207-course-schedule
0207-course-schedule
 
 
0208-implement-trie-prefix-tree
0208-implement-trie-prefix-tree
 
 
0210-course-schedule-ii
0210-course-schedule-ii
 
 
0211-design-add-and-search-words-data-structure
0211-design-add-and-search-words-data-structure
 
 
0219-contains-duplicate-ii
0219-contains-duplicate-ii
 
 
0222-count-complete-tree-nodes
0222-count-complete-tree-nodes
 
 
0224-basic-calculator
0224-basic-calculator
 
 
0226-invert-binary-tree
0226-invert-binary-tree
 
 
0228-summary-ranges
0228-summary-ranges
 
 
0230-kth-smallest-element-in-a-bst
0230-kth-smallest-element-in-a-bst
 
 
0236-lowest-common-ancestor-of-a-binary-tree
0236-lowest-common-ancestor-of-a-binary-tree
 
 
0242-valid-anagram
0242-valid-anagram
 
 
0274-h-index
0274-h-index
 
 
0289-game-of-life
0289-game-of-life
 
 
0290-word-pattern
0290-word-pattern
 
 
0380-insert-delete-getrandom-o1
0380-insert-delete-getrandom-o1
 
 
0383-ransom-note
0383-ransom-note
 
 
0399-evaluate-division
0399-evaluate-division
 
 
0452-minimum-number-of-arrows-to-burst-balloons
0452-minimum-number-of-arrows-to-burst-balloons
 
 
0530-minimum-absolute-difference-in-bst
0530-minimum-absolute-difference-in-bst
 
 
0637-average-of-levels-in-binary-tree
0637-average-of-levels-in-binary-tree
 
 
백준
백준
 
 
프로그래머스
프로그래머스
 
 
1000.cpp
1000.cpp
 
 
1001.cpp
1001.cpp
 
 
10026.cpp
10026.cpp
 
 
1003.cpp
1003.cpp
 
 
10039.cpp
10039.cpp
 
 
1005.cpp
1005.cpp
 
 
1007.cpp
1007.cpp
 
 
1008.cpp
1008.cpp
 
 
1009.cpp
1009.cpp
 
 
1010.cpp
1010.cpp
 
 
10101.cpp
10101.cpp
 
 

Repository files navigation

baekjoon

BOJ + Programmers

LeetCode Topics

Depth-First Search

Problem Name Difficulty
0207-course-schedule Medium
0211-design-add-and-search-words-data-structure Medium

Breadth-First Search

Problem Name Difficulty
0207-course-schedule Medium

Graph Theory

Problem Name Difficulty
0207-course-schedule Medium

Topological Sort

Problem Name Difficulty
0207-course-schedule Medium

Hash Table

Problem Name Difficulty
0208-implement-trie-prefix-tree Medium

String

Problem Name Difficulty
0208-implement-trie-prefix-tree Medium
0211-design-add-and-search-words-data-structure Medium

Design

Problem Name Difficulty
0208-implement-trie-prefix-tree Medium
0211-design-add-and-search-words-data-structure Medium

Trie

Problem Name Difficulty
0208-implement-trie-prefix-tree Medium
0211-design-add-and-search-words-data-structure Medium

About

백준문제

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages