Finding the length of unique paths using sets in a coordinate system

Using BFS to label islands and then building MST by bridges

본 글에서는 DAG(Directed Acyclic Graph)에 대해서 다룬다. DAG는 방향성을 가진 채로 싸이클이 없는 그래프이다. 위상정렬(Topological Sort)로 순서를 구하고, 최장 경로와 임계경로(Critical Path)를 찾는 것이 코딩테스트에서 중요하게 다뤄지므로, DAG 문제 풀이 핵심은 “위상정렬 → 최장 경로 구하기 → 역추적” 흐름을 익혀본다.

Finding the longest path using topological sorting

MySQL을 활용한 코딩테스트에 필요한 개념에 대해 다룹니다. SQL을 처음 배우는 분부터 실무에서 활용하는 개발자까지, JOIN 개념을 명확하게 정리하고 싶은 분들에게 유용한 가이드체계가 되도록 작성했습니다 🚀

Creating the best album using sorting & hash

Finding prime numbers using permutations

Efficiently processing user reports using hash

Optimizing joystick movements for minimum cost

Checking prefix existence using sorting and trie

Finding minimum hotel rooms using priority queue

Finding order in a vowel dictionary using math & DFS

Understanding process scheduling using Queue

Finding minimum power grid difference using BFS

Finding carpet dimensions using brute force & math

Understanding H-Index using Sorting & Search

Explaining the Lifeboat problem using Greedy Algorithm & Two Pointers

Explanation of the Truck Bridge Crossing problem using Queue

Explaining the combination approach using a HashMap for solving the "Clothes" problem on Programmers

This paper introduces "ns-O-RAN," a framework that integrates a simulated RAN Intelligent Controller for optimizing 5G traffic management. Using Deep Reinforcement Learning, it improves base station allocation, increasing transmission speed and spectrum efficiency by 50%.

Refactoring the Training Manager's database layer to use SQLAlchemy ORM instead of raw SQL and pg8000.

Let's load the sitemap dynamically

Let's try useMutation and see how it handles real asynchronous state.

Learn GraphQL 🙄

Let's understand the principle and apply ga to next.js 😎

Briefly learn about the open source license, and apply the license to your source code uploaded on github 🙂