DEV Community

Algorithms

Heap, Binary Tree, Data Structure it doesn't matter. This tag should be used for anything Algorithm & Data Structure focused.

Posts

👋 Sign in for the ability to sort posts by relevant, latest, or top.
Quickselect: find the k-th smallest element in O(n), no sorting required

Quickselect: find the k-th smallest element in O(n), no sorting required

Comments
5 min read
Fast and Slow Pointer Pattern: Cycles, Duplicates, Symmetry

Fast and Slow Pointer Pattern: Cycles, Duplicates, Symmetry

Comments
11 min read
Construindo um explorador de rede societária com grafos em Python

Construindo um explorador de rede societária com grafos em Python

Comments
6 min read
Building a Saju Engine: Case Study with Karina's Birth Chart Algorithm

Building a Saju Engine: Case Study with Karina's Birth Chart Algorithm

Comments
5 min read
Guía Definitiva de Merge Sort: El Algoritmo de Divide y Vencerás

Guía Definitiva de Merge Sort: El Algoritmo de Divide y Vencerás

Comments
4 min read
2078. Two Furthest Houses With Different Colors

2078. Two Furthest Houses With Different Colors

Comments
4 min read
What Developers Can Learn from Meta's Algorithm

What Developers Can Learn from Meta's Algorithm

Comments
3 min read
I built a sorting playground to visualize real, weird, and absurd algorithms

I built a sorting playground to visualize real, weird, and absurd algorithms

Comments
1 min read
CrowdOS — Autonomous Event Intelligence System for Smart Crowd Management

CrowdOS — Autonomous Event Intelligence System for Smart Crowd Management

Comments
3 min read
Designing a practical sorting benchmark across Python, Rust, and C

Designing a practical sorting benchmark across Python, Rust, and C

Comments
2 min read
Koko Eating Banana

Koko Eating Banana

Comments
3 min read
What if a rope data structure used p-adic geometry?

What if a rope data structure used p-adic geometry?

Comments
7 min read
Bayan Flow 0.4.0: From Algorithm Visualization to Real Understanding

Bayan Flow 0.4.0: From Algorithm Visualization to Real Understanding

Comments
3 min read
Concurrency in Python: Solving the Dining Philosophers Problem

Concurrency in Python: Solving the Dining Philosophers Problem

Comments
2 min read
How to Find the Minimum Mirror Pair Distance in an Array

How to Find the Minimum Mirror Pair Distance in an Array

5
Comments
3 min read
👋 Sign in for the ability to sort posts by relevant, latest, or top.