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

The Z-algorithm is an efficient algorithm (\(O(N)\)) that calculates the length of the longest substring starting from the each position for a given string. 1. Description The Z-array for ...

The SCC algorithm can be performed in O(N+M) time complexity, and there are two main methods to achieve this: Tarjan’s algorithm and Kosaraju’s algorithm. Referenced from 『Programming Co...

The KMP (Knuth-Morris-Pratt) algorithm is a fast string search algorithm. Referenced from 『프로그래밍 대회에서 배우는 알고리즘 문제 해결 전략 세트2』 p.657 1. Overview Let’s suppose there are two strings,...

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...