전체 문제 목록

Note

주차 별 풀이 스케줄은 별도 테이블을 참고 바랍니다.

Contains Duplicate

• 난이도: 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

Valid Anagram

• 난이도: 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

Two Sum

• 난이도: 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

Valid Palindrome

• 난이도: 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

Best Time to Buy and Sell Stock

• 난이도: 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

Valid Parentheses

• 난이도: 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

Reverse Linked List

• 난이도: 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

Merge Two Sorted Lists

• 난이도: 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

Linked List Cycle

• 난이도: 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

Invert Binary Tree

• 난이도: 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

Maximum Depth of 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

Same 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

Subtree of Another 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

Climbing Stairs

• 난이도: 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

Meeting Rooms

• 난이도: Easy
• 분류: Interval
• 문제
  • 유료: https://leetcode.com/problems/meeting-rooms/
  • 무료: https://www.lintcode.com/problem/920/
• 풀이: https://www.algodale.com/problems/meeting-rooms/
• 위치: https://github.com/DaleStudy/leetcode-study/tree/main/meeting-rooms

Number of 1 Bits

• 난이도: 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

Counting 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

Reverse 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

Missing Number

• 난이도: 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

Group Anagrams

• 난이도: 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

Top K Frequent Elements

• 난이도: 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

Encode and Decode Strings

• 난이도: Medium
• 분류: Array & Hashing
• 문제
  • 유료: https://leetcode.com/problems/encode-and-decode-strings/
  • 무료: https://www.lintcode.com/problem/659/
• 풀이: https://www.algodale.com/problems/encode-and-decode-strings/
• 위치: https://github.com/DaleStudy/leetcode-study/tree/main/encode-and-decode-strings

Product of Array Except Self

• 난이도: 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

Longest Consecutive Sequence

• 난이도: 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

3Sum

• 난이도: Medium
• 분류: Two Pointers
• 문제: https://leetcode.com/problems/3sum/
• 풀이: https://www.algodale.com/problems/3sum/
• 위치: https://github.com/DaleStudy/leetcode-study/tree/main/3sum

Container With Most Water

• 난이도: 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

Longest Substring Without Repeating Characters

• 난이도: 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

Longest Repeating Character Replacement

• 난이도: 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

Find Minimum In Rotated Sorted Array

• 난이도: 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

Search 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

Reorder List

• 난이도: 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

Remove Nth Node From End of 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

Lowest Common Ancestor of a Binary Search Tree

• 난이도: 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

Binary Tree Level Order Traversal

• 난이도: 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

Validate Binary Search Tree

• 난이도: 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

Kth Smallest Element In a Bst

• 난이도: 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

Construct Binary Tree From Preorder And Inorder Traversal

• 난이도: 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

Combination Sum

• 난이도: 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

Word Search

• 난이도: 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

Implement Trie Prefix Tree

• 난이도: 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

Design Add And Search Words Data Structure

• 난이도: 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

Number of Islands

• 난이도: 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

Clone Graph

• 난이도: 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

Pacific Atlantic Water Flow

• 난이도: 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

Course Schedule

• 난이도: 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

Graph Valid Tree

• 난이도: Medium
• 분류: Graph
• 문제
  • 유료: https://leetcode.com/problems/graph-valid-tree/
  • 무료: https://www.lintcode.com/problem/178/
• 풀이: https://www.algodale.com/problems/graph-valid-tree/
• 위치: https://github.com/DaleStudy/leetcode-study/tree/main/graph-valid-tree

Number of Connected Components in an Undirected Graph

• 난이도: Medium
• 분류: Graph
• 문제
  • 유료: https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/
  • 무료: https://www.lintcode.com/problem/3651/
• 풀이: 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

House Robber

• 난이도: 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

House Robber II

• 난이도: 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

Longest Palindromic Substring

• 난이도: 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

Palindromic Substrings

• 난이도: 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

Decode Ways

• 난이도: 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

Coin Change

• 난이도: 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

Maximum Product Subarray

• 난이도: 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

Word Break

• 난이도: 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

Longest Increasing Subsequence

• 난이도: 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

Unique Paths

• 난이도: 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

Longest Common Subsequence

• 난이도: 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

Maximum Subarray

• 난이도: 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

Jump Game

• 난이도: 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

Insert Interval

• 난이도: 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

Merge Intervals

• 난이도: 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

Non Overlapping 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

Meeting Rooms II

• 난이도: Medium
• 분류: Interval
• 문제:
  • 유료: https://leetcode.com/problems/meeting-rooms-ii/
  • 무료: https://www.lintcode.com/problem/919/
• 풀이: https://www.algodale.com/problems/meeting-rooms-ii/
• 위치: https://github.com/DaleStudy/leetcode-study/tree/main/meeting-rooms-ii

Rotate Image

• 난이도: 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

Spiral Matrix

• 난이도: 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

Set Matrix Zeroes

• 난이도: 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

Sum of Two Integers

• 난이도: 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

Minimum Window Substring

• 난이도: 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

Merge K Sorted Lists

• 난이도: 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

Binary Tree Maximum Path Sum

• 난이도: 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

Serialize And Deserialize Binary Tree

• 난이도: 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

Find Median From Data Stream

• 난이도: 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

Word Search II

• 난이도: 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

Alien Dictionary

• 난이도: Advanced Graph
• 분류: Sliding Window
• 문제: https://leetcode.com/problems/alien-dictionary/
• 풀이: https://www.algodale.com/problems/alien-dictionary/
• 위치: https://github.com/DaleStudy/leetcode-study/tree/main/alien-dictionary