5m ago · 6 min read · Introduction When solving array or string problems in Data Structures and Algorithms, you often need to examine contiguous parts — subarrays or substrings. A beginner solution uses nested loops to che
Join discussion
20h ago · 4 min read · Sliding Window Technique When solving array or string problems in competitive programming, we often deal with subarrays or substrings. A naive solution usually checks every possible subarray, which le
Join discussion
1d ago · 10 min read · Every API you've ever used has a rate limiter sitting somewhere between you and the server. Hit it too many times and you get the dreaded 429 Too Many Requests. But have you ever wondered what's actua
Join discussion
5d ago · 5 min read · TL;DR: Array-based queues are often dismissed due to O(n) shifting costs, but the ring buffer circumvents this by using wrapping head and tail pointers. This design provides O(1) access and superior c
Join discussion
