Song Hayoung
Follow Me
Articles
11101
Tags
196
Categories
62
VISITED
Seoul Korea
Jeju Korea
British Columbia Canada
Boracay Philippines
三重 日本
大阪 日本
名古屋 日本
静岡 日本
札幌 日本
京都 日本
Bangkok Thailand
SUMFIのBlog
Home
Archives
Tags
Categories
About
Search
SUMFIのBlog
Do it for FUN
Tag -
196
0/1 Knapsack
2-SAT
2D Knapsack
Ad-hoc
Aho-Corasick Algorithm
Algorithm
Amazon
Array
Assignment Problem
BFS
Back Tracking
Base K
Bellman Ford Algorithm
Biconnected Component
Binary Search
Bipartite Graph Algorithm
Bipartited Matching
Bit Manipulation
Boruvka Algorithm
Bucket Sort
C
CCW
CS
CSharp
Catalan Number
Centroid Decomposition
Character Encoding
Clean Code
Collatz Conjecture
Combination with Repetition
Combinatorics
Common Sense
Conference
Convex Function
Convex Hull
Coupon Collector Problem
Cplusplus
Cycle Detection Algorithm
DB
DFS
Data Structure
De Bruijn Sequence
Deque
Design
Design Pattern
Dijkstra
Dinic Algorithm
Diophantine Equation
Divide and Conquer
Docker
Duval Algorithm
Dynamic Programming
Edge Disjoint Path
Edit Distance
Edmonds-Karp Algorithm
Elastic Search
Euclidean Algorithm
Euler Circuit
Euler Path
Euler Phi Function
Euler Tour Technique
Euler Tour Tree
Euler's Totient Function
Fast Fourier Transform
Fenwick Tree
Fermat's Little Theorem
Fisher–Yates shuffle
Flood Fill
Floyd Cycle Detection Algorithm
Floyd Warshall Algorithm
Ford-Fulkerson Algorithm
Game Theory
Geometric Median
Geometric Sum Formula
Geometry
Google
Graph Theory
GraphQL
Gray Code
Greedy
Hamiltonian Path
Hash Table
Heap
Heavy Light Decomposition
Huffman Encoding
Hungarian Algorithm
Inclusion-Exclusion Principle
Iterator
JAVA
JPA
JavaScript
KMP
Kadane Algorithm
Kafka
Knapsack
Kosaraju Algorithm
Kruskal Algorithm
Lazy Evaluation Technique
Lazy Propagation Segment Tree
Levenshtein Distance
Li Chao Tree
Line Sweeping
Liner Diophantine Equation
Link Cut Tree
Linked List
Longest Common Prefix Array
Longest Common Subsequence
Longest Increasing Subsequence
Longest Palindromic Subsequence
Lowest Common Ancestor
Lucas Number
Lucas' theorem
Manacher Algorithm
Math
Mathematics
Matrix
Maximum Flow
Maximum XOR Subsequence
Meet In The Middle
Merge Interval
Merge Sort
Miller-Rabin Primality Test
Min Max
Minimum Cut
Minimum Cyclic Shift
Minimum Spanning Tree
Minimum Stack Minimum Queue
Mo's Algorithm
Modern Cplusplus
Modular Multiplicative Inverse
Monotonic Deque
Monotonic Queue
Monotonic Stack
Möbius function
NP Problem
NP-Complete
Network
Node Disjoint Path
Numeric Theory
OOP
OS
Offline Query Technique
Ordered Set
Permutation
Pillai's Arithmetical Function
Prefix Matrix
Prefix Sum
Prefix Sum Tree
Prefix Xor
Probability and Statistics
Problem Solving
Queue
Rabin Karp Algorithm
Radix Sort
Random
Range Minimum Query
Recursion
Redis
Reservoir Sampling
Rolling Hash
Rotating Calipers
SUMFIの一日
Security
Segment Tree
Server
Sieve of Eratosthenes
Simulation
Skip List
Sliding Window
Smallest Enclosing Circle
Sorting
Sorting Greedy
Splay Tree
Sprague-Grundy Theorem
Spring
Spring Boot
Stack
String
Strongly Connected Components
Submask Enumeration
Suffix Array
Suffix Automation
System Design
Ternary Search
Top K Sorting
Topological Sort
Travelling Salesman Problem
Tree
Trie
Tripartite Graph
Two Pointer
Union Find
Weiszfeld's Algorithm
Z Function Algorithm
foobar
k8s
Algolia