Skip to content
Navigation menu
Search
Powered by Algolia
Search
Log in
Create account
DEV Community
Close
#
datastructures
Follow
Hide
Posts
Left menu
đź‘‹
Sign in
for the ability to sort posts by
relevant
,
latest
, or
top
.
Right menu
Las 5 Estructuras de Datos que Dominarán tu Próxima Entrevista Técnica
Grego
Grego
Grego
Follow
Jan 8
Las 5 Estructuras de Datos que Dominarán tu Próxima Entrevista Técnica
#
datastructures
#
interview
#
beginners
#
spanish
Comments
Add Comment
5 min read
LeetCode DSA Series #5: 242. Valid Anagram
David Babalola
David Babalola
David Babalola
Follow
Jan 5
LeetCode DSA Series #5: 242. Valid Anagram
#
leetcode
#
python
#
algorithms
#
datastructures
Comments
Add Comment
1 min read
Boyer–Moore Majority Voting: Why It Works, Why It Fails, and Where It Actually Belongs
Yash Patel
Yash Patel
Yash Patel
Follow
Jan 4
Boyer–Moore Majority Voting: Why It Works, Why It Fails, and Where It Actually Belongs
#
dsa
#
systemdesign
#
datastructures
#
algorithms
Comments
Add Comment
4 min read
LeetCode DSA Series #4: 217. Contains Duplicate
David Babalola
David Babalola
David Babalola
Follow
Jan 5
LeetCode DSA Series #4: 217. Contains Duplicate
#
leetcode
#
python
#
algorithms
#
datastructures
Comments
Add Comment
1 min read
LeetCode DSA Series #3: 202. Happy Number
David Babalola
David Babalola
David Babalola
Follow
Jan 4
LeetCode DSA Series #3: 202. Happy Number
#
leetcode
#
python
#
algorithms
#
datastructures
Comments
Add Comment
1 min read
Heapify Down: How to Trace Each Swap Without Getting Lost
Alex Hunter
Alex Hunter
Alex Hunter
Follow
Jan 2
Heapify Down: How to Trace Each Swap Without Getting Lost
#
heap
#
priorityqueue
#
datastructures
#
interviewprep
Comments
Add Comment
4 min read
LeetCode DSA Series #2: 125. Valid Palindrome
David Babalola
David Babalola
David Babalola
Follow
Jan 3
LeetCode DSA Series #2: 125. Valid Palindrome
#
leetcode
#
python
#
algorithms
#
datastructures
Comments
Add Comment
1 min read
Minimum Rounds to Complete All Tasks
we_are_broken_compilers
we_are_broken_compilers
we_are_broken_compilers
Follow
Jan 25
Minimum Rounds to Complete All Tasks
#
programming
#
learning
#
algorithms
#
datastructures
2
 reactions
Comments
Add Comment
2 min read
Delete a Node in a Binary Search Tree (BST)
we_are_broken_compilers
we_are_broken_compilers
we_are_broken_compilers
Follow
Dec 31 '25
Delete a Node in a Binary Search Tree (BST)
#
programming
#
datastructures
#
bst
#
algorithms
Comments
Add Comment
3 min read
Why Greedy Can Feel Unintuitive (and How I’m Making Sense of It)
sky
sky
sky
Follow
Dec 31 '25
Why Greedy Can Feel Unintuitive (and How I’m Making Sense of It)
#
datastructures
#
greedy
#
leetcode
#
beginners
Comments
Add Comment
3 min read
Day 6: Structs in C: Organizing Data without Classes
Ujjawal Chaudhary
Ujjawal Chaudhary
Ujjawal Chaudhary
Follow
Jan 13
Day 6: Structs in C: Organizing Data without Classes
#
c
#
datastructures
#
oop
#
design
Comments
1
 comment
1 min read
Python Tuples: Not Just Immutable Lists – They're Design Contracts
Emmimal P Alexander
Emmimal P Alexander
Emmimal P Alexander
Follow
Feb 3
Python Tuples: Not Just Immutable Lists – They're Design Contracts
#
python
#
coding
#
tutorial
#
datastructures
Comments
Add Comment
3 min read
Day 79: Python Deep Copy Graph – HashMap-Based Cloning for Cycles and Shared Nodes (LeetCode #133 Style)
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 29 '25
Day 79: Python Deep Copy Graph – HashMap-Based Cloning for Cycles and Shared Nodes (LeetCode #133 Style)
#
challenge
#
python
#
algorithms
#
datastructures
Comments
Add Comment
3 min read
Revisiting DSA Through Mini Projects #1: Optimizing a Phonebook with HashMap
Amelia Dutta
Amelia Dutta
Amelia Dutta
Follow
Feb 2
Revisiting DSA Through Mini Projects #1: Optimizing a Phonebook with HashMap
#
datastructures
#
programming
#
javascript
#
webdev
7
 reactions
Comments
Add Comment
2 min read
Day 78: Python Move Zeros to End – O(n) In-Place Two-Pointer Technique for Array Reordering (LeetCode #283 Guide)
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 28 '25
Day 78: Python Move Zeros to End – O(n) In-Place Two-Pointer Technique for Array Reordering (LeetCode #283 Guide)
#
challenge
#
python
#
algorithms
#
datastructures
Comments
Add Comment
2 min read
đź‘‹
Sign in
for the ability to sort posts by
relevant
,
latest
, or
top
.
We're a place where coders share, stay up-to-date and grow their careers.
Log in
Create account