DEV Community

# datastructures

Posts

đź‘‹ Sign in for the ability to sort posts by relevant, latest, or top.
Las 5 Estructuras de Datos que Dominarán tu Próxima Entrevista Técnica

Las 5 Estructuras de Datos que Dominarán tu Próxima Entrevista Técnica

Comments
5 min read
LeetCode DSA Series #5: 242. Valid Anagram

LeetCode DSA Series #5: 242. Valid Anagram

Comments
1 min read
Boyer–Moore Majority Voting: Why It Works, Why It Fails, and Where It Actually Belongs

Boyer–Moore Majority Voting: Why It Works, Why It Fails, and Where It Actually Belongs

Comments
4 min read
LeetCode DSA Series #4: 217. Contains Duplicate

LeetCode DSA Series #4: 217. Contains Duplicate

Comments
1 min read
LeetCode DSA Series #3: 202. Happy Number

LeetCode DSA Series #3: 202. Happy Number

Comments
1 min read
Heapify Down: How to Trace Each Swap Without Getting Lost

Heapify Down: How to Trace Each Swap Without Getting Lost

Comments
4 min read
LeetCode DSA Series #2: 125. Valid Palindrome

LeetCode DSA Series #2: 125. Valid Palindrome

Comments
1 min read
Minimum Rounds to Complete All Tasks

Minimum Rounds to Complete All Tasks

2
Comments
2 min read
Delete a Node in a Binary Search Tree (BST)

Delete a Node in a Binary Search Tree (BST)

Comments
3 min read
Why Greedy Can Feel Unintuitive (and How I’m Making Sense of It)

Why Greedy Can Feel Unintuitive (and How I’m Making Sense of It)

Comments
3 min read
Day 6: Structs in C: Organizing Data without Classes

Day 6: Structs in C: Organizing Data without Classes

Comments 1
1 min read
Python Tuples: Not Just Immutable Lists – They're Design Contracts

Python Tuples: Not Just Immutable Lists – They're Design Contracts

Comments
3 min read
Day 79: Python Deep Copy Graph – HashMap-Based Cloning for Cycles and Shared Nodes (LeetCode #133 Style)

Day 79: Python Deep Copy Graph – HashMap-Based Cloning for Cycles and Shared Nodes (LeetCode #133 Style)

Comments
3 min read
Revisiting DSA Through Mini Projects #1: Optimizing a Phonebook with HashMap

Revisiting DSA Through Mini Projects #1: Optimizing a Phonebook with HashMap

7
Comments
2 min read
Day 78: Python Move Zeros to End – O(n) In-Place Two-Pointer Technique for Array Reordering (LeetCode #283 Guide)

Day 78: Python Move Zeros to End – O(n) In-Place Two-Pointer Technique for Array Reordering (LeetCode #283 Guide)

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