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.
I read the X (Twitter) algorithm source for 4 days and built a Claude Code sub-agent that scores drafts before posting

I read the X (Twitter) algorithm source for 4 days and built a Claude Code sub-agent that scores drafts before posting

1
Comments 1
6 min read
Thoughts on Codingame 2026 Spring challenge

Thoughts on Codingame 2026 Spring challenge

Comments
4 min read
Solving a Logistics Problem Using Genetic Algorithms

Solving a Logistics Problem Using Genetic Algorithms

Comments
5 min read
Visualizing 4 Sorting Algorithms with JavaScript Generators — O(n ) vs O(n log n) in Real Time

Visualizing 4 Sorting Algorithms with JavaScript Generators — O(n ) vs O(n log n) in Real Time

Comments
5 min read
How a photo-blind dating engine actually ranks people (the TypeScript)

How a photo-blind dating engine actually ranks people (the TypeScript)

1
Comments
9 min read
The Recursive Mindset: Unlocking the Code You Already Know

The Recursive Mindset: Unlocking the Code You Already Know

Comments
6 min read
Building a Smart LRU Cache in Java: When Machines Mimic Human Memory đź§ đź’»

Building a Smart LRU Cache in Java: When Machines Mimic Human Memory đź§ đź’»

Comments
3 min read
ECDSA - The Math That Only Goes One Way

ECDSA - The Math That Only Goes One Way

Comments
3 min read
Why brute-force counterexample search fails (and what to do instead)

Why brute-force counterexample search fails (and what to do instead)

Comments
5 min read
✍️ How Multiple Devices Edit One Google Doc

✍️ How Multiple Devices Edit One Google Doc

Comments
1 min read
String Union in Go: Merging Two Strings Without Duplicates

String Union in Go: Merging Two Strings Without Duplicates

Comments
4 min read
Subsequence Matching in Go: The Two-Pointer Scan

Subsequence Matching in Go: The Two-Pointer Scan

Comments
4 min read
AVL Trees Explained: How Rotations Keep BST Operations O(log n)

AVL Trees Explained: How Rotations Keep BST Operations O(log n)

Comments
8 min read
Architecting a Multi-Chain Arbitrage Engine: Handling Latency and MEV in 2026

Architecting a Multi-Chain Arbitrage Engine: Handling Latency and MEV in 2026

2
Comments
2 min read
Go Garbage Collection: Tri-Color Mark & Sweep, Write Barriers & STW Optimization

Go Garbage Collection: Tri-Color Mark & Sweep, Write Barriers & STW Optimization

Comments
5 min read
đź‘‹ Sign in for the ability to sort posts by relevant, latest, or top.