Datastructures

sky

Dec 31

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

#datastructures #greedy #leetcode #beginners

3 min read

Shahrouz Nikseresht

Dec 29

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

#challenge #python #algorithms #datastructures

3 min read

Shahrouz Nikseresht

Dec 28

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

#challenge #python #algorithms #datastructures

2 min read

Shahrouz Nikseresht

Dec 30

Day 80: Python Search in Rotated Sorted rArray - Final Challenge O(log n) Binary Search Mastery (LeetCode #33 Vibes)

#challenge #python #algorithms #datastructures

3 min read

Pavitha P

Dec 24

That One Python List Bug That Wasted My Time 😅

#programming #datastructures #coding #bug

2 min read

Shahrouz Nikseresht

Dec 25

Day 75: Python Counting Sort by Zeros – Stable O(n) Custom Key Sort for Digit Counts (Algo Mastery)

#challenge #python #algorithms #datastructures

2 min read

Shahrouz Nikseresht

Dec 22

Day 72: Python Sliding Window Maximum - Deque O(n) Solution for Efficient Max Tracking (LeetCode #239 Guide)

#challenge #python #algorithms #datastructures

2 min read

Brendon O'Neill

Dec 22

Linked Lists Joins the Fray! (JavaScript)

#javascript #datastructures #programming #tutorial

9 min read

Alex Hunter

Dec 26

Sliding Window Maximum: The Monotonic Queue Trick Explained

#slidingwindow #datastructures #interviewprep #arrays

4 min read

Alex Hunter

Dec 20

How to Know When to Use a Hash Map in Coding Interviews: A Pattern Recognition Guide

#hashmaps #datastructures #patternrecognition #leetcode

10 min read

murage kibicho

Dec 20

Using CuCollections Nvidia Data Structures Library

#cuda #gpu #datastructures

1 min read

David Kershaw

Dec 14

Is CsvPath an easy or hard language?

#datascience #dataengineering #datastructures #programming

16 min read

Shivam Ranjan Pandey

Dec 17

How We Made Our Canvas Application 30x Faster: A Deep Dive into Performance Engineering

#performance #react #typescript #datastructures

6 min read

Shahrouz Nikseresht

Dec 17

Day 67: Python Shortest Path in Unweighted Graph - BFS Queue Magic for O(V+E) Routing Mastery (LeetCode Vibes)

#challenge #python #algorithms #datastructures

1

3 min read

kingyou

Dec 11

Stack and Queue — Kids' Toy Box Adventure!

#datastructures #beginners #tutorial

2 min read

kingyou

Dec 11

Trees and Binary Trees — Kids' Family Tree Fun!

#datastructures #beginners #tutorial

2 min read

kingyou

Dec 11

A two-dimensional array is like a big grid of boxes

#discuss #basic #datastructures

1 min read

Alex Hunter

Dec 8

Why People Say “F*** LeetCode”: Difficulty, Fairness, Real-World Value — and a Better Way

#fuckleetcode #leetcode #algorithms #datastructures

7 min read

Shahrouz Nikseresht

Dec 9

Day 59: Python Reverse Singly Linked List, Master the Iterative Pointer Flip Technique for O(n) Reversal

#challenge #python #datastructures #algorithms

3 min read

Shahrouz Nikseresht

Dec 16

Day 66: Python Invert Binary Tree, Recursive Mirror Swap for Perfect Tree Symmetry (LeetCode #226 Style)

#challenge #python #algorithms #datastructures

1

2 min read

SolTap

Dec 1

Is Solana Really Running Out of Memory?

#solana #web3 #datastructures #development

1

4 min read

Cristian Sifuentes

Dec 8

C# Lists & Dictionaries Mental Model — From `names.Add("Ana")` to LLM‑Ready Collections

#dotnet #csharp #performance #datastructures

1

14 min read

Arvind SundaraRajan

Nov 25

Kinship Code: How Family Trees Explain Data Structures

#algorithms #datastructures #softwareengineering #programming

1

2 min read

Shahrouz Nikseresht

Dec 15

Day 65: Python Breadth-First Search (BFS) on Tree, Queue-Based Level-Order Traversal for Shortest Path and Layer Exploration

#challenge #python #algorithms #datastructures

1

2 min read

Shahrouz Nikseresht

Dec 14

Day 64: Python Depth-First Search (DFS) on Tree, Stack-Based Iterative Traversal for Deep Exploration Without Recursion

#challenge #python #algorithms #datastructures

1

2 min read

DEV Community

# datastructures

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

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

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

Day 80: Python Search in Rotated Sorted rArray - Final Challenge O(log n) Binary Search Mastery (LeetCode #33 Vibes)

That One Python List Bug That Wasted My Time 😅

Day 75: Python Counting Sort by Zeros – Stable O(n) Custom Key Sort for Digit Counts (Algo Mastery)

Day 72: Python Sliding Window Maximum - Deque O(n) Solution for Efficient Max Tracking (LeetCode #239 Guide)

Linked Lists Joins the Fray! (JavaScript)

Sliding Window Maximum: The Monotonic Queue Trick Explained

How to Know When to Use a Hash Map in Coding Interviews: A Pattern Recognition Guide

Using CuCollections Nvidia Data Structures Library

Is CsvPath an easy or hard language?

How We Made Our Canvas Application 30x Faster: A Deep Dive into Performance Engineering

Day 67: Python Shortest Path in Unweighted Graph - BFS Queue Magic for O(V+E) Routing Mastery (LeetCode Vibes)

Stack and Queue — Kids' Toy Box Adventure!

Trees and Binary Trees — Kids' Family Tree Fun!

A two-dimensional array is like a big grid of boxes

Why People Say “F*** LeetCode”: Difficulty, Fairness, Real-World Value — and a Better Way

Day 59: Python Reverse Singly Linked List, Master the Iterative Pointer Flip Technique for O(n) Reversal

Day 66: Python Invert Binary Tree, Recursive Mirror Swap for Perfect Tree Symmetry (LeetCode #226 Style)

Is Solana Really Running Out of Memory?

C# Lists & Dictionaries Mental Model — From `names.Add("Ana")` to LLM‑Ready Collections

Kinship Code: How Family Trees Explain Data Structures

Day 65: Python Breadth-First Search (BFS) on Tree, Queue-Based Level-Order Traversal for Shortest Path and Layer Exploration

Day 64: Python Depth-First Search (DFS) on Tree, Stack-Based Iterative Traversal for Deep Exploration Without Recursion