A reference for GCC built-in bit manipulation functions including __builtin_clz, __builtin_ctz, __builtin_popcount, and __builtin_parity.

How to construct Suffix Array using Manber-Myers algorithm and LCP Array using Kasai's algorithm with implementation details.

A matching in a bipartite graph is a set of edges where no two edges share a common vertex, and a maximum matching is one that contains the largest possible number of edges.

SCPC ( Samsung Collegiate Programming Cup ) 2024 Round 1 모든 문제 풀이

Z Algorithm is an algorithm that quickly finds the length of the longest common prefix between each suffix of a string and the entire string in O(N)

A guide to finding Strongly Connected Components in directed graphs using Tarjan's and Kosaraju's algorithms.

An explanation of the KMP string matching algorithm with failure function construction and O(N+M) time complexity analysis.

This book describes the fundamental rules of design that designers generally know from experience. The book allows readers to learn about what constitutes efficient design and the business value of...