Solved Problem Category

Data structure

String

• [Easy] Unique Morse Code Words

Array

• [Easy] Can Place Flowers
• [Easy] Majority Element
• [Easy] Best Time to Buy and Sell Stock
• [Easy] Best Time to Buy and Sell Stock II
• [Easy] Maximum Subarray
• [Medium] My Calendar I
• [Medium] Find Peak Element
• [Medium] Search in Rotated Sorted Array
• [Medium] Single Element in a Sorted Array
• [Medium] Maximum Length of Repeated Subarray
• [Medium] Triangle
• [Hard] Find K-th Smallest Pair Distance

Hash Table

• [Easy] Employee Importance

• [Easy] Unique Morse Code Words

• [Medium] Brick Wall

• [Medium] Top K Frequent Elements

• [Medium] Top K Frequent Words

• [Medium] Maximum Length of Repeated Subarray

Linked List

• [Easy] JOSEPHUS
• [Easy] Reverse Linked List

Queue

Stack

• [Easy] Min Stack
• [Medium] FENCE

Heap

• [Medium] STRJOIN
• [Medium] Top K Frequent Elements
• [Medium] Top K Frequent Words
• [Hard] Find K-th Smallest Pair Distance
• [Hard] The Skyline Problem

Graph

• [Medium] Find Eventual Safe States

Tree

Binary Indexed Tree

• [Hard] The Skyline Problem

Segment Tree

• [Hard] The Skyline Problem

Trie

• [Medium] Top K Frequent Words

Search

Binary Search

• [None] Lower Bound
• [None] Upper Bound
• [Easy] ARCTIC
• [Easy] LIS (Longest Increasing Sequence)
• [Medium] DARPA
• [Medium] Find Peak Element
• [Medium] Search in Rotated Sorted Array
• [Medium] Single Element in a Sorted Array
• [Medium] Maximum Length of Repeated Subarray
• [Hard] Find K-th Smallest Pair Distance

Breadth First Search

• [Easy] Employee Importance
• [Medium] 01 Matrix
• [Medium] Pacific Atlantic Water Flow

Depth First Search

• [Easy] Employee Importance
• [Medium] 01 Matrix
• [Medium] All Paths From Source to Target
• [Medium] Find Eventual Safe States
• [Medium] Pacific Atlantic Water Flow
• [Hard] Freedom Trail

Combinatorial Search

• [Medium] ALLERGY
• [Medium] KAKURO2

Exhaustive Search

• [None] Sum Of Numbers
• [None] Traveling Salesman Problem1 (TSP1)
• [None] Traveling Salesman Problem2 (TSP2)
• [Easy] BOARDCOVER
• [Easy] BOGGLE
• [Easy] PICNIC
• [Easy] JUMPGAME
• [Medium] CLOCKSYNC
• [Medium] NUMB3RS
• [Medium] WILDCARD

Two Pointers

Dynamic Programming

Dynamic Programming

• [None] Traveling Salesman Problem1 (TSP1)
• [None] Traveling Salesman Problem2 (TSP2)
• [None] 미로 탐색
• [Easy] BOARDCOVER
• [Easy] BOGGLE
• [Easy] MATCHORDER
• [Easy] ASYMTILING
• [Easy] Best Time to Buy and Sell Stock
• [Easy] JLIS
• [Easy] JUMPGAME
• [Easy] LIS (Longest Increasing Sequence)
• [Easy] Maximum Subarray
• [Easy] NUMBERGAME
• [Easy] PI
• [Easy] SNAIL
• [Easy] TICTACTOE
• [Easy] TILING2
• [Easy] TRIANGLEPATH
• [Medium] ALLERGY
• [Medium] BLOCKGAME
• [Medium] Coin Change 2
• [Medium] DRAGON
• [Medium] GRADUATION
• [Medium] Knight Probability in Chessboard
• [Medium] Maximum Length of Repeated Subarray
• [Medium] Minimum Swaps To Make Sequences Increasing
• [Medium] MORSE
• [Medium] NUMB3RS
• [Medium] PACKING
• [Medium] Partition to K Equal Sum Subsets
• [Medium] POLY
• [Medium] RESTORE
• [Medium] SUSHI
• [Medium] Triangle
• [Medium] TRIPATHCNT
• [Medium] WILDCARD
• [Hard] Freedom Trail
• [Hard] ZIMBABWE

Bit Mask

• [None] 15 Puzzle
• [None] Traveling Salesman Problem2 (TSP2)
• [Medium] GRADUATION
• [Medium] RESTORE
• [Hard] ZIMBABWE

Recursion

• [Medium] Partition to K Equal Sum Subsets

Decision Problem

knapsack

• [Medium] PACKING

Algorithms

Divide And Conquer

• [None] Sum Of Numbers
• [Easy] Majority Element
• [Easy] QUADTREE
• [Easy] Maximum Subarray
• [Medium] FENCE
• [Hard] The Skyline Problem
• [Hard] Freedom Trail

Greedy

• [Easy] Best Time to Buy and Sell Stock II
• [Easy] MATCHORDER
• [Easy] LUNCHBOX
• [Medium] Gas Station
• [Medium] Max Increase to Keep City Skyline
• [Medium] STRJOIN

Design

• [Easy] Min Stack
• [Hard] LRU Cache

Minimax Algorithm

• [Easy] NUMBERGAME

Skill

Bucket Sort

• [Medium] Top K Frequent Elements

Sort

Etc

Math

Math

Number Theory

Partition Sum

Bit Manipulation

• [None] 15 Puzzle
• [Easy] Majority Element
• [Easy] Hamming Distance
• [Easy] Number of 1 Bits
• [Easy] Reverse Bits

TODO

• Combinatorial Search
  • [Easy] BOARDCOVER2 : 추후 C++로 바꿔 풀어볼 것
  • [Medium] ALLERGY : Main 클래스 wrong answer 원인 찾기
• Design
  • [Hard] LFU Cache
• Binary Indexed Tree / Segment Tree
• [Hard] The Skyline Problem : 위의 방식으로도 풀어보기
• Index Tree
  • [Easy] LIS (Longest Increasing Sequence) : 위의 방식으로도 풀어보기
• Greedy
  • [Hard] MINASTIRITH
• Dynamic Programming
  • [Medium] GENIUS
  • [Hard] K-th Longest Increasing Sequence(KLIS) : 런타임에러 상태
  • [Hard] OCR