Learning set, unordered_set, and priority_queue in C++
set Overview - Unique + Sorted data - Stores unique elements - Maintains sorted order - Implemented using a self‑balancing BST Red‑Black Tree Example cpp inclu...
set Overview - Unique + Sorted data - Stores unique elements - Maintains sorted order - Implemented using a self‑balancing BST Red‑Black Tree Example cpp inclu...
Introduction While studying C++ and OSS in my spare time outside of work, I've always had one challenge: 'I want to record what I learn, but I don't have time...
markdown !Татьяна Кузнецоваhttps://media2.dev.to/dynamic/image/width=50,height=50,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.c...
Why Do Arrays in C/C++ Start at Index 0? To understand this properly, we need to look at how arrays are stored in memory and how the compiler computes element...
!Cover image for 🍀 Beginner-Friendly Guide 'Four Divisors' – LeetCode 1390 C++, Python, JavaScripthttps://media2.dev.to/dynamic/image/width=1000,height=420,fit...
The Mysterious Bug I was building a conference room booking system in Blazor when I encountered a bizarre bug. My timeline component showed time slots from 6 A...
🧩 Problem Statement Given an array and an integer k, find the k‑th largest element. Example - Input: 3, 2, 1, 5, 6, 4, k = 2 - Output: 5 🧠 My First Thought:...
2026.01.03일자 입니다. 수학 1 풀어보았습니다. 진법 변환 문제 링크 cpp include include using namespace std; int main { string N; int B; cin >> N >> B; int res = 0; for int i = 0; i in...
!Cover image for 🎨 Beginner‑Friendly Guide ‘Number of Ways to Paint N 3 Grid’ – LeetCode 1411 C++, Python, JavaScripthttps://media2.dev.to/dynamic/image/width=...
Handling Breaking Changes in Evolving APIs: Lessons from the Trenches When you ship APIs in the real world, change is inevitable. But breaking changes? That’s...
'2026‑01‑02 일자 정리 문자열부터 2차원 배열까지 여러 문제를 풀어보았습니다. 아래에 각 문제별 풀이와 핵심 포인트를 정리했습니다.
Problem Description You are given an array nums of length 2N. The array contains N + 1 unique elements, and exactly one of those elements appears N times. Goal...