백엔드 개발을 혼자 공부하면서, 내가 올바른 방향으로 학습하고 있는지, 판단하기가 어려웠다. 이 글은 내가 백엔드 개발자로 성장하기 위해 사용한 학습 자료와 로드맵을 정리했다. 지금도 부족한 점이 많지만 지금까지 공부한 것들을 기록해 보려고 한다. 백엔드를 독학하는 사람들에게 도움이 되었으면 좋겠다. (난이도, 실용성, 최신성) 이...

GCC includes built-in bit functions. These functions can perform tasks such as counting the number of 1-bits in a number, and their time complexity is O(1). 6.63 Other Built-in Functions...

Suffix Array and LCP Array are known as the Swiss Army knife in string-related problem solving. 1. Description Suffix Array A suffix array for a string $s$ is an array of integers repres...

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)

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