DEV Community

#datastructures

Posts

đź‘‹ Sign in for the ability to sort posts by relevant, latest, or top.
How Many Introductions Away Are You From Pedro Pascal? A Practical Introduction to Graph Search

Explains BFS using celebrity social networks

How Many Introductions Away Are You From Pedro Pascal? A Practical Introduction to Graph Search

33
Comments 28
4 min read
How to Solve Two-Pointer Problems (A Beginner-Friendly Guide)

How to Solve Two-Pointer Problems (A Beginner-Friendly Guide)

1
Comments
3 min read
The Two‑Pointer Technique: My Quest Like a Jedi Mastering the Force

The Two‑Pointer Technique: My Quest Like a Jedi Mastering the Force

Comments
5 min read
The Union‑Find Fellowship: Finding Your Tribe in Code

The Union‑Find Fellowship: Finding Your Tribe in Code

Comments
6 min read
The circular_buffer trap: how a 'faster' data structure spiked my CPU from 2% to 25%

The circular_buffer trap: how a 'faster' data structure spiked my CPU from 2% to 25%

2
Comments 3
6 min read
The Binary Search Strikes Back: A Jedi's Guide to Finding Things Fast

The Binary Search Strikes Back: A Jedi's Guide to Finding Things Fast

Comments
5 min read
Segment Trees: The Matrix of Range Queries

Segment Trees: The Matrix of Range Queries

Comments
5 min read
The Algorithm That Refuses to Give a Straight Answer (Just Like My Ex)

The Algorithm That Refuses to Give a Straight Answer (Just Like My Ex)

Comments
4 min read
What I Learned in Week 8 of Python — Stacks, Queues & Linked Lists

What I Learned in Week 8 of Python — Stacks, Queues & Linked Lists

2
Comments 1
11 min read
Patrones embebidos comunes: bĂşfer circular

Patrones embebidos comunes: bĂşfer circular

Comments
15 min read
Common Embedded Patterns: Ring Buffer

Common Embedded Patterns: Ring Buffer

Comments
13 min read
The Bitwise Jedi: Mastering the XOR Trick Like a Lightsaber

The Bitwise Jedi: Mastering the XOR Trick Like a Lightsaber

Comments
4 min read
Why Repeatedly Halving an Array is O(log n), Not Linear

Why Repeatedly Halving an Array is O(log n), Not Linear

Comments
3 min read
The Fellowship of the Graph: Why BFS Beats the Maze

The Fellowship of the Graph: Why BFS Beats the Maze

1
Comments
4 min read
Recursion in C++ Explained Simply: Base Case, Call Stack, LIFO and Stack Overflow

Recursion in C++ Explained Simply: Base Case, Call Stack, LIFO and Stack Overflow

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