Skip to content

chjung99/Algorithm_Problems

Repository files navigation

Algorithm_Problems

순번 Tag 태그 문제집 추천 문제 수 총 문제 수 상태
00 Data Structure 자료구조 바로가기 16 25 ![status][Doing]
01 Data Structure 2 자료구조 2 바로가기 11 21 ![status][Doing]
02 Tree 트리 바로가기 15 44 ![status][Doing]
03 Math 수학 바로가기 18 29 ![status][Doing]
04 Greedy 탐욕법 바로가기 27 62 ![status][Doing]
05 Dynamic Programming 1 동적계획법 1 바로가기 27 80 ![status][Doing]
06 Dynamic Programming 2 동적계획법 2 바로가기 28 81 ![status][Doing]
07 Two Pointer 투 포인터 바로가기 13 36 ![status][Doing]
08 Implementation 구현 바로가기 30 51 ![status][Doing]
09 Graph Traversal 그래프 탐색 바로가기 31 96 ![status][Doing]
10 Brute Force 완전탐색 바로가기 33 94 ![status][Doing]
11 Simulation 시뮬레이션 바로가기 30 48 ![status][Doing]
12 Binary Search 이분탐색 바로가기 20 66 ![status][Doing]
13 Backtracking 백트래킹 바로가기 28 75 ![status][Doing]
14 Divide and conquer 분할정복 바로가기 08 18 ![status][Doing]
15 Prefix Sum 누적 합 바로가기 11 32 ![status][Doing]
16 String 문자열 바로가기 19 63 ![status][Doing]
17 Shortest Path 최단거리 바로가기 18 53 ![status][Doing]
18 Topological Sorting 위상정렬 바로가기 05 14 ![status][Doing]
19 Disjoint Set 분리 집합 바로가기 06 20 ![status][Doing]
20 Minimum Spanning Tree(MST) 최소 스패닝 트리 바로가기 08 24 ![status][Doing]
21 Trie 트라이 바로가기 05 09 ![status][Doing]
22 Dynamic Programming On Trees 트리디피 바로가기 04 08 ![status][Doing]

LeetCode Topics

Array

Problem Name Difficulty
0108-convert-sorted-array-to-binary-search-tree Easy
0219-contains-duplicate-ii Easy

Divide and Conquer

Problem Name Difficulty
0108-convert-sorted-array-to-binary-search-tree Easy

Tree

Problem Name Difficulty
0108-convert-sorted-array-to-binary-search-tree Easy
0110-balanced-binary-tree Easy
0111-minimum-depth-of-binary-tree Easy
0112-path-sum Easy
0257-binary-tree-paths Easy

Binary Search Tree

Problem Name Difficulty
0108-convert-sorted-array-to-binary-search-tree Easy
0374-guess-number-higher-or-lower Easy

Binary Tree

Problem Name Difficulty
0108-convert-sorted-array-to-binary-search-tree Easy
0110-balanced-binary-tree Easy
0111-minimum-depth-of-binary-tree Easy
0112-path-sum Easy
0257-binary-tree-paths Easy

Depth-First Search

Problem Name Difficulty
0110-balanced-binary-tree Easy
0111-minimum-depth-of-binary-tree Easy
0112-path-sum Easy
0257-binary-tree-paths Easy

Breadth-First Search

Problem Name Difficulty
0111-minimum-depth-of-binary-tree Easy
0112-path-sum Easy

Hash Table

Problem Name Difficulty
0160-intersection-of-two-linked-lists Easy
0202-happy-number Easy
0219-contains-duplicate-ii Easy
0290-word-pattern Easy

Linked List

Problem Name Difficulty
0160-intersection-of-two-linked-lists Easy

Two Pointers

Problem Name Difficulty
0160-intersection-of-two-linked-lists Easy
0202-happy-number Easy

Math

Problem Name Difficulty
0168-excel-sheet-column-title Easy
0202-happy-number Easy
0263-ugly-number Easy
0292-nim-game Easy

String

Problem Name Difficulty
0168-excel-sheet-column-title Easy
0257-binary-tree-paths Easy
0290-word-pattern Easy

Sliding Window

Problem Name Difficulty
0219-contains-duplicate-ii Easy

Interactive

Problem Name Difficulty
0374-guess-number-higher-or-lower Easy

Brainteaser

Problem Name Difficulty
0292-nim-game Easy

Game Theory

Problem Name Difficulty
0292-nim-game Easy

Backtracking

Problem Name Difficulty
0257-binary-tree-paths Easy

Stack

Problem Name Difficulty
0225-implement-stack-using-queues Easy

Design

Problem Name Difficulty
0225-implement-stack-using-queues Easy

Queue

Problem Name Difficulty
0225-implement-stack-using-queues Easy

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors