-
-
Notifications
You must be signed in to change notification settings - Fork 245
전체 문제 목록
Dale Seo edited this page Aug 9, 2024
·
2 revisions
Note
주차 별 풀이 스케줄은 별도 테이블을 참고 바랍니다.
- 난이도: Easy
- 분류: Array & Hashing
- 문제: https://leetcode.com/problems/contains-duplicate/
- 해설: https://www.algodale.com/problems/contains-duplicate/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/contains-duplicate
- 난이도: Easy
- 분류: Array & Hashing
- 문제: https://leetcode.com/problems/valid-anagram/
- 해설: https://www.algodale.com/problems/valid-anagram/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/valid-anagram
- 난이도: Easy
- 분류: Array & Hashing
- 문제: https://leetcode.com/problems/two-sum/
- 해설: https://www.algodale.com/problems/two-sum/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/two-sum
- 난이도: Easy
- 분류: Two Pointers
- 문제: https://leetcode.com/problems/valid-palindrome/
- 해설: https://www.algodale.com/problems/valid-palindrome/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/valid-palindrome
- 난이도: Easy
- 분류: Sliding Window
- 문제: https://leetcode.com/problems/best-time-to-buy-and-sell-stock/
- 해설: https://www.algodale.com/problems/best-time-to-buy-and-sell-stock/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/best-time-to-buy-and-sell-stock
- 난이도: Easy
- 분류: Stack
- 문제: https://leetcode.com/problems/valid-parentheses/
- 풀이: https://www.algodale.com/problems/valid-parentheses/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/valid-parentheses
- 난이도: Easy
- 분류: Linked List
- 문제: https://leetcode.com/problems/reverse-linked-list/
- 풀이: https://www.algodale.com/problems/reverse-linked-list/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/reverse-linked-list
- 난이도: Easy
- 분류: Linked List
- 문제: https://leetcode.com/problems/merge-two-sorted-lists/
- 풀이: https://www.algodale.com/problems/merge-two-sorted-lists/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/merge-two-sorted-lists
- 난이도: Easy
- 분류: Linked List
- 문제: https://leetcode.com/problems/linked-list-cycle/
- 풀이: https://www.algodale.com/problems/linked-list-cycle/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/linked-list-cycle
- 난이도: Easy
- 분류: Tree
- 문제: https://leetcode.com/problems/invert-binary-tree/
- 풀이: https://www.algodale.com/problems/invert-binary-tree/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/invert-binary-tree
- 난이도: Easy
- 분류: Tree
- 문제: https://leetcode.com/problems/maximum-depth-of-binary-tree/
- 풀이: https://www.algodale.com/problems/maximum-depth-of-binary-tree/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/maximum-depth-of-binary-tree
- 난이도: Easy
- 분류: Tree
- 문제: https://leetcode.com/problems/same-tree/
- 풀이: https://www.algodale.com/problems/same-tree/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/same-tree
- 난이도: Easy
- 분류: Tree
- 문제: https://leetcode.com/problems/subtree-of-another-tree/
- 풀이: https://www.algodale.com/problems/subtree-of-another-tree/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/subtree-of-another-tree
- 난이도: Easy
- 분류: 1-D DP
- 문제: https://leetcode.com/problems/climbing-stairs/
- 풀이: https://www.algodale.com/problems/climbing-stairs/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/climbing-stairs
- 난이도: Easy
- 분류: Interval
- 문제
- 풀이: https://www.algodale.com/problems/meeting-rooms/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/meeting-rooms
- 난이도: Easy
- 분류: Bit Manipulation
- 문제: https://leetcode.com/problems/number-of-1-bits/
- 풀이: https://www.algodale.com/problems/number-of-1-bits/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/number-of-1-bits
- 난이도: Easy
- 분류: Bit Manipulation
- 문제: https://leetcode.com/problems/counting-bits/
- 풀이: https://www.algodale.com/problems/counting-bits/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/counting-bits
- 난이도: Easy
- 분류: Bit Manipulation
- 문제: https://leetcode.com/problems/reverse-bits/
- 풀이: https://www.algodale.com/problems/reverse-bits/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/reverse-bits
- 난이도: Easy
- 분류: Bit Manipulation
- 문제: https://leetcode.com/problems/missing-number/
- 풀이: https://www.algodale.com/problems/missing-number/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/missing-number
- 난이도: Medium
- 분류: Array & Hashing
- 문제: https://leetcode.com/problems/group-anagrams/
- 풀이: https://www.algodale.com/problems/group-anagrams/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/group-anagrams
- 난이도: Medium
- 분류: Array & Hashing
- 문제: https://leetcode.com/problems/top-k-frequent-elements/
- 풀이: https://www.algodale.com/problems/top-k-frequent-elements/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/top-k-frequent-elements
- 난이도: Medium
- 분류: Array & Hashing
- 문제
- 풀이: https://www.algodale.com/problems/encode-and-decode-strings/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/encode-and-decode-strings
- 난이도: Medium
- 분류: Array & Hashing
- 문제: https://leetcode.com/problems/product-of-array-except-self/
- 풀이: https://www.algodale.com/problems/product-of-array-except-self/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/product-of-array-except-self
- 난이도: Medium
- 분류: Array & Hashing
- 문제: https://leetcode.com/problems/longest-consecutive-sequence/
- 풀이: https://www.algodale.com/problems/longest-consecutive-sequence/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/longest-consecutive-sequence
- 난이도: Medium
- 분류: Two Pointers
- 문제: https://leetcode.com/problems/3sum/
- 풀이: https://www.algodale.com/problems/3sum/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/3sum
- 난이도: Medium
- 분류: Two Pointers
- 문제: https://leetcode.com/problems/container-with-most-water/
- 풀이: https://www.algodale.com/problems/container-with-most-water/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/container-with-most-water
- 난이도: Medium
- 분류: Slidnig Window
- 문제: https://leetcode.com/problems/longest-substring-without-repeating-characters/
- 풀이: https://www.algodale.com/problems/longest-substring-without-repeating-characters/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/longest-substring-without-repeating-characters
- 난이도: Medium
- 분류: Slidnig Window
- 문제: https://leetcode.com/problems/longest-repeating-character-replacement/
- 풀이: https://www.algodale.com/problems/longest-repeating-character-replacement/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/longest-repeating-character-replacement
- 난이도: Medium
- 분류: Binary Search
- 문제: https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/
- 풀이: https://www.algodale.com/problems/find-minimum-in-rotated-sorted-array/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/find-minimum-in-rotated-sorted-array
- 난이도: Medium
- 분류: Binary Search
- 문제: https://leetcode.com/problems/search-in-rotated-sorted-array/
- 풀이: https://www.algodale.com/problems/search-in-rotated-sorted-array/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/search-in-rotated-sorted-array
- 난이도: Medium
- 분류: Linked List
- 문제: https://leetcode.com/problems/reorder-list/
- 풀이: https://www.algodale.com/problems/reorder-list/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/reorder-list
- 난이도: Medium
- 분류: Linked List
- 문제: https://leetcode.com/problems/remove-nth-node-from-end-of-list/
- 풀이: https://www.algodale.com/problems/remove-nth-node-from-end-of-list/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/remove-nth-node-from-end-of-list
- 난이도: Medium
- 분류: Tree
- 문제: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/
- 풀이: https://www.algodale.com/problems/lowest-common-ancestor-of-a-binary-search-tree/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/lowest-common-ancestor-of-a-binary-search-tree
- 난이도: Medium
- 분류: Tree
- 문제: https://leetcode.com/problems/binary-tree-level-order-traversal/
- 풀이: https://www.algodale.com/problems/binary-tree-level-order-traversal/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/binary-tree-level-order-traversal
- 난이도: Medium
- 분류: Tree
- 문제: https://leetcode.com/problems/validate-binary-search-tree/
- 풀이: https://www.algodale.com/problems/validate-binary-search-tree/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/validate-binary-search-tree
- 난이도: Medium
- 분류: Tree
- 문제: https://leetcode.com/problems/kth-smallest-element-in-a-bst/
- 풀이: https://www.algodale.com/problems/kth-smallest-element-in-a-bst/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/kth-smallest-element-in-a-bst
- 난이도: Medium
- 분류: Tree
- 문제: https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/
- 풀이: https://www.algodale.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/construct-binary-tree-from-preorder-and-inorder-traversal
- 난이도: Medium
- 분류: Backtracking
- 문제: https://leetcode.com/problems/combination-sum/
- 풀이: https://www.algodale.com/problems/combination-sum/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/combination-sum
- 난이도: Medium
- 분류: Backtracking
- 문제: https://leetcode.com/problems/word-search/
- 풀이: https://www.algodale.com/problems/word-search/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/word-search
- 난이도: Medium
- 분류: Trie
- 문제: https://leetcode.com/problems/implement-trie-prefix-tree/
- 풀이: https://www.algodale.com/problems/implement-trie-prefix-tree/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/implement-trie-prefix-tree
- 난이도: Medium
- 분류: Trie
- 문제: https://leetcode.com/problems/design-add-and-search-words-data-structure/
- 풀이: https://www.algodale.com/problems/design-add-and-search-words-data-structure/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/design-add-and-search-words-data-structure
- 난이도: Medium
- 분류: Graph
- 문제: https://leetcode.com/problems/number-of-islands/
- 풀이: https://www.algodale.com/problems/number-of-islands/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/number-of-islands
- 난이도: Medium
- 분류: Graph
- 문제: https://leetcode.com/problems/clone-graph/
- 풀이: https://www.algodale.com/problems/clone-graph/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/clone-graph
- 난이도: Medium
- 분류: Graph
- 문제: https://leetcode.com/problems/pacific-atlantic-water-flow/
- 풀이: https://www.algodale.com/problems/pacific-atlantic-water-flow/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/pacific-atlantic-water-flow
- 난이도: Medium
- 분류: Graph
- 문제: https://leetcode.com/problems/course-schedule/
- 풀이: https://www.algodale.com/problems/course-schedule/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/course-schedule
- 난이도: Medium
- 분류: Graph
- 문제
- 풀이: https://www.algodale.com/problems/graph-valid-tree/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/graph-valid-tree
- 난이도: Medium
- 분류: Graph
- 문제
- 풀이: https://www.algodale.com/problems/number-of-connected-components-in-an-undirected-graph/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/number-of-connected-components-in-an-undirected-graph
- 난이도: Medium
- 분류: 1-D DP
- 문제: https://leetcode.com/problems/house-robber/
- 풀이: https://www.algodale.com/problems/house-robber/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/house-robber
- 난이도: Medium
- 분류: 1-D DP
- 문제: https://leetcode.com/problems/house-robber-ii/
- 풀이: https://www.algodale.com/problems/house-robber-ii/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/house-robber-ii
- 난이도: Medium
- 분류: 1-D DP
- 문제: https://leetcode.com/problems/longest-palindromic-substring/
- 풀이: https://www.algodale.com/problems/longest-palindromic-substring/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/longest-palindromic-substring
- 난이도: Medium
- 분류: 1-D DP
- 문제: https://leetcode.com/problems/palindromic-substrings/
- 풀이: https://www.algodale.com/problems/palindromic-substrings/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/palindromic-substrings
- 난이도: Medium
- 분류: 1-D DP
- 문제: https://leetcode.com/problems/decode-ways/
- 풀이: https://www.algodale.com/problems/decode-ways/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/decode-ways
- 난이도: Medium
- 분류: 1-D DP
- 문제: https://leetcode.com/problems/coin-change/
- 풀이: https://www.algodale.com/problems/coin-change/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/coin-change
- 난이도: Medium
- 분류: 1-D DP
- 문제: https://leetcode.com/problems/maximum-product-subarray/
- 풀이: https://www.algodale.com/problems/maximum-product-subarray/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/maximum-product-subarray
- 난이도: Medium
- 분류: 1-D DP
- 문제: https://leetcode.com/problems/word-break/
- 풀이: https://www.algodale.com/problems/word-break/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/word-break
- 난이도: Medium
- 분류: 1-D DP
- 문제: https://leetcode.com/problems/longest-increasing-subsequence/
- 풀이: https://www.algodale.com/problems/longest-increasing-subsequence/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/longest-increasing-subsequence
- 난이도: Medium
- 분류: 2-D DP
- 문제: https://leetcode.com/problems/unique-paths/
- 풀이: https://www.algodale.com/problems/unique-paths/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/unique-paths
- 난이도: Medium
- 분류: 2-D DP
- 문제: https://leetcode.com/problems/longest-common-subsequence/
- 풀이: https://www.algodale.com/problems/longest-common-subsequence/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/longest-common-subsequence
- 난이도: Medium
- 분류: 2-D DP
- 문제: https://leetcode.com/problems/maximum-subarray/
- 풀이: https://www.algodale.com/problems/maximum-subarray/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/maximum-subarray
- 난이도: Medium
- 분류: 2-D DP
- 문제: https://leetcode.com/problems/jump-game/
- 풀이: https://www.algodale.com/problems/jump-game/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/jump-game
- 난이도: Medium
- 분류: Interval
- 문제: https://leetcode.com/problems/insert-interval/
- 풀이: https://www.algodale.com/problems/insert-interval/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/insert-interval
- 난이도: Medium
- 분류: Interval
- 문제: https://leetcode.com/problems/merge-intervals/
- 풀이: https://www.algodale.com/problems/merge-intervals/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/merge-intervals
- 난이도: Medium
- 분류: Interval
- 문제: https://leetcode.com/problems/non-overlapping-intervals/
- 풀이: https://www.algodale.com/problems/non-overlapping-intervals/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/non-overlapping-intervals
- 난이도: Medium
- 분류: Interval
- 문제:
- 풀이: https://www.algodale.com/problems/meeting-rooms-ii/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/meeting-rooms-ii
- 난이도: Medium
- 분류: Math & Geometry
- 문제: https://leetcode.com/problems/rotate-image/
- 풀이: https://www.algodale.com/problems/rotate-image/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/rotate-image
- 난이도: Medium
- 분류: Math & Geometry
- 문제: https://leetcode.com/problems/spiral-matrix/
- 풀이: https://www.algodale.com/problems/spiral-matrix/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/spiral-matrix
- 난이도: Medium
- 분류: Math & Geometry
- 문제: https://leetcode.com/problems/set-matrix-zeroes/
- 풀이: https://www.algodale.com/problems/set-matrix-zeroes/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/set-matrix-zeroes
- 난이도: Medium
- 분류: Bit Manipulation
- 문제: https://leetcode.com/problems/sum-of-two-integers/
- 풀이: https://www.algodale.com/problems/sum-of-two-integers/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/sum-of-two-integers
- 난이도: Hard
- 분류: Sliding Window
- 문제: https://leetcode.com/problems/minimum-window-substring/
- 풀이: https://www.algodale.com/problems/minimum-window-substring/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/minimum-window-substring
- 난이도: Hard
- 분류: Linked List
- 문제: https://leetcode.com/problems/merge-k-sorted-lists/
- 풀이: https://www.algodale.com/problems/merge-k-sorted-lists/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/merge-k-sorted-lists
- 난이도: Hard
- 분류: Tree
- 문제: https://leetcode.com/problems/binary-tree-maximum-path-sum/
- 풀이: https://www.algodale.com/problems/binary-tree-maximum-path-sum/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/binary-tree-maximum-path-sum
- 난이도: Hard
- 분류: Tree
- 문제: https://leetcode.com/problems/serialize-and-deserialize-binary-tree/
- 풀이: https://www.algodale.com/problems/serialize-and-deserialize-binary-tree/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/serialize-and-deserialize-binary-tree
- 난이도: Hard
- 분류: Heap
- 문제: https://leetcode.com/problems/find-median-from-data-stream/
- 풀이: https://www.algodale.com/problems/find-median-from-data-stream/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/find-median-from-data-stream
- 난이도: Hard
- 분류: Trie
- 문제: https://leetcode.com/problems/word-search-ii/
- 풀이: https://www.algodale.com/problems/word-search-ii/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/word-search-ii
- 난이도: Advanced Graph
- 분류: Sliding Window
- 문제
- 풀이: https://www.algodale.com/problems/alien-dictionary/
- 위치: https://github.com/DaleStudy/leetcode-study/tree/main/alien-dictionary