AntInLoop Community — Algorithms & Programming Articles
Engineering notes, competitive programming editorials, and algorithmic deep dives.
- Thank's for this helpful website by Abo_ Fathi — Thank's admin ^^
- Persistent Segment Tree by antinloop — Persistent Segment Tree Persistent segment trees let you keep every historical version of a segment tree after updates, while sharing unchanged parts between versions. They are usually implemented...
- Convex Hull Trick by antinloop — Convex Hull Trick: A Geometric Speedup for Dynamic Programming Dynamic Programming DP is a powerful technique for solving optimization problems. However, a standard DP solution can sometimes be too...
- Persistent 2D Segment Tree by antinloop — Problem: Tracking Points on a Massive 2D Grid Over Time Imagine you’re building a geospatial tracking system. You want to monitor events on a grid that’s humongous—say, coordinates can go up to 10^9...
- Fast Fourier Transform by antinloop — The Fast Fourier Transform FFT: A Digital Superpower The Fast Fourier Transform FFT is one of the most important algorithms in computer science and engineering. It's a remarkably efficient method...