While debugging legacy TypeScript code, I encountered an odd issue—a field of a object not defined in the interface appeared unexpectedly.

1. What is a stable sort? Consider the list [ $a, b, c, d, e, f$ ], where $a = b > c > d > e = f$. If this list is sorted, the resulting order could be [ $f, e, d, c, b, a$ ], [ $f, e,...

When using Git to create multiple branches, you will eventually need to merge them. There are various methods available for merging branches. Let’s begin by assuming familiarity with concepts ...

I worked at Bagelcode as a backend developer and contributed to increasing the company's revenue.

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

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)