DS & AL Study List

현재까지 공부한 자료구조 및 알고리즘 등을 기록해두기 위한 공지사항 포스팅입니다.

-Basic Algorithm-

• Binary Search
• Brute-Force
• Back Tracking
• DFS (Depth First Search)
• BFS (Breath First Search)
• DP (Dynamic Programming)
• Divide and Conquer
• Sieve of Eratosthenes

-Data Structure-

• Stack
• Queue
• Priority Queue
• Heap
• Hashing
• Union-Find, Disjoint Set
• Segment Tree
• Lazy Propagation
• Merge Sort Tree

-Math-

• Number Theory
• Combinatorics
• Euclidean

 

-Discrete Math-

• 2-SAT

 

-Geometry-

• CCW (Counter Clockwise)
• Convex Hull (Graham Scan)
• Convex Hull (Monotone Chain)

-Shortest Path-

• Dijkstra
• Floyd-Warshall
• Bellman-Ford

-Minimun Spanning Tree-

• Kruskal's Algorithm

-Sort Algorithm-

• Merge Sort
• Topological Sort

-DP Algorithm-

• LIS O(N^2)
• LCS

-Useful Technique-

• Two Pointers
• Monotonic Stack
• Sliding Window
• Sparse Table

-Max Flow-

• Edmonds-Karp
• Bipartite Matching (using DFS, O(VE))
• Bipartite Matching (using Edmonds-Karp)
• Min Cost Max Flow

-Tree Algortihm-

• LCA
• LCA (using Sparse Table)

-Strongly Connected Component-

• Korosaju's Algorithm
• Tarjan Algorithm