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 Built codezap.in: The Full-Stack Platform Reinventing How Developers Learn DSA & Compete

I Built codezap.in: The Full-Stack Platform Reinventing How Developers Learn DSA & Compete

6
Comments
6 min read
I Audited a C Graph Algorithm Project and Found 13 Bugs — Including an Auth Bypass That Was Hiding in Plain Sight

I Audited a C Graph Algorithm Project and Found 13 Bugs — Including an Auth Bypass That Was Hiding in Plain Sight

Comments
6 min read
UCRF: Exploring Version Provenance for Concurrency Control and Selective Recovery

UCRF: Exploring Version Provenance for Concurrency Control and Selective Recovery

1
Comments 1
10 min read
Matching Kalshi and Polymarket contracts is harder than it looks (and how I made it mostly work)

Matching Kalshi and Polymarket contracts is harder than it looks (and how I made it mostly work)

1
Comments 1
3 min read
How to Visualize Millions of Data Points Efficiently

How to Visualize Millions of Data Points Efficiently

Comments
9 min read
5 LeetCode Problems: Word Search, Implement Trie (Prefix Tree), Palindromic Substrings, Decode Ways | DSA Decoded

5 LeetCode Problems: Word Search, Implement Trie (Prefix Tree), Palindromic Substrings, Decode Ways | DSA Decoded

3
Comments
3 min read
Building a Wordle Solver: Letter Frequency Analysis in JavaScript

Building a Wordle Solver: Letter Frequency Analysis in JavaScript

Comments 1
2 min read
Trie Data Structure: Efficient Prefix Matching and Autocomplete Implementation

Trie Data Structure: Efficient Prefix Matching and Autocomplete Implementation

Comments
5 min read
Machine Learning From Scratch in Pure C: Module I — Supervised Learning & Foundations

Machine Learning From Scratch in Pure C: Module I — Supervised Learning & Foundations

Comments
11 min read
Implementing K-Means & Hierarchical Clustering in Pure C for Customer Segmentation

Implementing K-Means & Hierarchical Clustering in Pure C for Customer Segmentation

Comments
10 min read
Implementing A* Search on a Grid-Based Path-Finding Map with Obstacle Avoidance

Implementing A* Search on a Grid-Based Path-Finding Map with Obstacle Avoidance

Comments 1
3 min read
Dynamic Programming Demystified: From Memoization to Tabulation and Space Optimization

Dynamic Programming Demystified: From Memoization to Tabulation and Space Optimization

Comments
5 min read
Mastering Two Pointers: A Step-by-Step Guide to Solving Sequence Problems

Mastering Two Pointers: A Step-by-Step Guide to Solving Sequence Problems

Comments
5 min read
Union-Find (Disjoint Set Union): Path Compression and Union by Rank Explained

Union-Find (Disjoint Set Union): Path Compression and Union by Rank Explained

Comments
4 min read
From 4.5 Seconds to 6 Milliseconds: What Actually Made Our Star Battle Solver ~700 Faster

From 4.5 Seconds to 6 Milliseconds: What Actually Made Our Star Battle Solver ~700 Faster

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