LeetCode 강의 + 알고리즘 개념

Array 관련 문제 기초

Array - Binary Search (leetcode 704)

Array - moveZeros (leetcode 283)

Array - Find Pivot Index (leetcode 724, 209)

Array - Sort Colors/Dutch Flag Problem (leetcode 75)

Array - Merge Sorted Array (leetcode 88)

Array - Find Peak Element (leetcode 162)

Array - Merge Intervals (leetcode 56)

Array - Shortest Unsorted Continuous Subarray (leetcode 581)

Array - Find a duplicate number (leetcode 287)

Array - 2sum, 3sum, 4sum, nsum (leetcode 1, 15, 16, 18, 259)

2D Array - Image

String - KMP, String Matching

String - Palindrome (leetcode 125, 680)

String - Add Strings (leetcode 415)

String - Group Anagrams (leetcode 49)

String - Longest substring Without Repeats (leetcode 3)

Sorting - Bubble Sorting (버블 정렬), Stability

Sorting - Insertion Sort (삽입 정렬)

Sorting - Selection Sort (선택 정렬)

Sorting - Merge Sort (병합 정렬) O(n logn)

Quick Select (leetcode 215)

Quick Sort

Sorting - Heap Sort (힙 정렬)

Sorting - Counting Sort (카운팅 정렬)

Sorting - Radix Sort (계수 정렬)

HashTable

HashMap - Example 1, 2 (leetcode 387, 205)

HashMap - Example 3, 4 (leetcode 242, 290)

Top K frequent element (leetcode 347, 692)

Random HashSet

Subarray Sum = K

Contiguous Array

Min Area Rectangle

Dynamic Programming - 동적 계획법

DP - Climbing Stairs, Min Cost Climbing Stairs (leetcode 70, 746)

DP - Min Sum Path

DP - 동전 바꾸기

DP - Decoding Ways

DP - Max SubArray Sum

DP - 최대 곱 subarray

DP - 최대 길이 Palindrome Substring

DP - 단어 자르기 (Word Break)

DP - knapsack problem

DP - 합이 같은 두 집합으로 나누기

DP - 무제한 동전바꾸기

DP - Longest Common Subsequence

Heap

Heapify (힙 만들기)

Top K Largest Elements (K개의 큰 숫자 찾기)

Top K Freq nums (자주 나오는 숫자들 찾기)

k 개의 정렬된 리스트 합치기

median in Stream (중간값, 중앙값 구하기)

Greedy

가장 많은 물건 채우기 (leetcode 1710)