Skip to content
Navigation menu
Search
Powered by Algolia
Search
Log in
Create account
DEV Community
Close
80 Days Of Challenges Series' Articles
Back to Shahrouz Nikseresht's Series
Day 59: Python Reverse Singly Linked List, Master the Iterative Pointer Flip Technique for O(n) Reversal
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 9 '25
Day 59: Python Reverse Singly Linked List, Master the Iterative Pointer Flip Technique for O(n) Reversal
#
challenge
#
python
#
datastructures
#
algorithms
Comments
Add Comment
3 min read
Day 60: Python Remove Nth Node From End of Linked List, Two-Pointer Magic to Delete in One Pass (LeetCode #19 Style)
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 10 '25
Day 60: Python Remove Nth Node From End of Linked List, Two-Pointer Magic to Delete in One Pass (LeetCode #19 Style)
#
challenge
#
python
#
datastructures
#
leetcode
1
reaction
Comments
Add Comment
3 min read
Day 61: Python Queue Using Two Stacks, Amortized O(1) Unbiased FIFO with Brilliant Double-Stack Flip Trick (No Deque Cheats!)
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 11 '25
Day 61: Python Queue Using Two Stacks, Amortized O(1) Unbiased FIFO with Brilliant Double-Stack Flip Trick (No Deque Cheats!)
#
challenge
#
python
#
algorithms
#
datastructures
7
reactions
Comments
2
comments
3 min read
Day 62: Python Longest Subarray with Target Sum - O(n) Prefix Sum & HashMap Guide (LeetCode Vibes)
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 12 '25
Day 62: Python Longest Subarray with Target Sum - O(n) Prefix Sum & HashMap Guide (LeetCode Vibes)
#
challenge
#
python
#
algorithms
#
datastructures
1
reaction
Comments
Add Comment
3 min read
Day 63: Python Merge K Sorted Lists - O(n log k) Min-Heap Guide (LeetCode #23 Vibes)
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 13 '25
Day 63: Python Merge K Sorted Lists - O(n log k) Min-Heap Guide (LeetCode #23 Vibes)
#
challenge
#
python
#
algorithms
#
datastructures
1
reaction
Comments
Add Comment
3 min read
Day 64: Python Depth-First Search (DFS) on Tree, Stack-Based Iterative Traversal for Deep Exploration Without Recursion
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 14 '25
Day 64: Python Depth-First Search (DFS) on Tree, Stack-Based Iterative Traversal for Deep Exploration Without Recursion
#
challenge
#
python
#
algorithms
#
datastructures
1
reaction
Comments
Add Comment
2 min read
Day 65: Python Breadth-First Search (BFS) on Tree, Queue-Based Level-Order Traversal for Shortest Path and Layer Exploration
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 15 '25
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
reaction
Comments
Add Comment
2 min read
Day 66: Python Invert Binary Tree, Recursive Mirror Swap for Perfect Tree Symmetry (LeetCode #226 Style)
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 16 '25
Day 66: Python Invert Binary Tree, Recursive Mirror Swap for Perfect Tree Symmetry (LeetCode #226 Style)
#
challenge
#
python
#
algorithms
#
datastructures
1
reaction
Comments
Add Comment
2 min read
Day 67: Python Shortest Path in Unweighted Graph - BFS Queue Magic for O(V+E) Routing Mastery (LeetCode Vibes)
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 17 '25
Day 67: Python Shortest Path in Unweighted Graph - BFS Queue Magic for O(V+E) Routing Mastery (LeetCode Vibes)
#
challenge
#
python
#
algorithms
#
datastructures
1
reaction
Comments
Add Comment
3 min read
Day 68: Python Unique Paths in Grid - O(m*n) DP Solution for Robot Paths (LeetCode #62 Vibes)
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 18 '25
Day 68: Python Unique Paths in Grid - O(m*n) DP Solution for Robot Paths (LeetCode #62 Vibes)
#
challenge
#
python
#
algorithms
#
programming
1
reaction
Comments
Add Comment
3 min read
Day 69: Python Conway's Game of Life - Simulate One Step of Cellular Automata with Neighbor Scanning Magic
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 19 '25
Day 69: Python Conway's Game of Life - Simulate One Step of Cellular Automata with Neighbor Scanning Magic
#
challenge
#
python
#
algorithms
#
programming
1
reaction
Comments
Add Comment
3 min read
Day 70: Python Wildcard Matching – DP Solution for '?' and '*' Patterns in O(n*m) (LeetCode #44 Mastery)
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 20 '25
Day 70: Python Wildcard Matching – DP Solution for '?' and '*' Patterns in O(n*m) (LeetCode #44 Mastery)
#
challenge
#
python
#
algorithms
#
programming
1
reaction
Comments
Add Comment
2 min read
Day 71: Python Three Sum – Two-Pointer O(n^2) Solution for Unique Zero-Sum Triplets (LeetCode #15 Vibes)
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 21 '25
Day 71: Python Three Sum – Two-Pointer O(n^2) Solution for Unique Zero-Sum Triplets (LeetCode #15 Vibes)
#
challenge
#
python
#
algorithms
#
programming
Comments
Add Comment
3 min read
Day 72: Python Sliding Window Maximum - Deque O(n) Solution for Efficient Max Tracking (LeetCode #239 Guide)
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 22 '25
Day 72: Python Sliding Window Maximum - Deque O(n) Solution for Efficient Max Tracking (LeetCode #239 Guide)
#
challenge
#
python
#
algorithms
#
datastructures
Comments
Add Comment
2 min read
Day 73: Python Longest Palindromic Substring – Expand-Around-Center O(n^2) Technique for Max Palindrome (LeetCode #5 Guide)
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 23 '25
Day 73: Python Longest Palindromic Substring – Expand-Around-Center O(n^2) Technique for Max Palindrome (LeetCode #5 Guide)
#
challenge
#
python
#
algorithms
#
programming
Comments
Add Comment
2 min read
Day 74: Python Validate IPv4 Address – String Parsing Mastery for Perfect IP Check (No Libraries Needed)
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 24 '25
Day 74: Python Validate IPv4 Address – String Parsing Mastery for Perfect IP Check (No Libraries Needed)
#
challenge
#
python
#
algorithms
#
programming
Comments
2
comments
2 min read
Day 75: Python Counting Sort by Zeros – Stable O(n) Custom Key Sort for Digit Counts (Algo Mastery)
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 25 '25
Day 75: Python Counting Sort by Zeros – Stable O(n) Custom Key Sort for Digit Counts (Algo Mastery)
#
challenge
#
python
#
algorithms
#
datastructures
Comments
Add Comment
2 min read
Day 76: Python Binary Exponentiation – O(log n) Fast Power Calculation Without Built-Ins
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 26 '25
Day 76: Python Binary Exponentiation – O(log n) Fast Power Calculation Without Built-Ins
#
challenge
#
python
#
algorithms
#
programming
Comments
Add Comment
2 min read
Day 77: Python Trailing Zeros in Factorial – Genius Number Theory Trick to Count Zeros in n! Without Computing the Huge Number
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 27 '25
Day 77: Python Trailing Zeros in Factorial – Genius Number Theory Trick to Count Zeros in n! Without Computing the Huge Number
#
challenge
#
python
#
algorithms
#
programming
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
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
Day 80: Python Search in Rotated Sorted rArray - Final Challenge O(log n) Binary Search Mastery (LeetCode #33 Vibes)
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 30 '25
Day 80: Python Search in Rotated Sorted rArray - Final Challenge O(log n) Binary Search Mastery (LeetCode #33 Vibes)
#
challenge
#
python
#
algorithms
#
datastructures
Comments
Add Comment
3 min read
80 Days of Python Challenges: An Honest Wrap-Up
Shahrouz Nikseresht
Shahrouz Nikseresht
Shahrouz Nikseresht
Follow
Dec 30 '25
80 Days of Python Challenges: An Honest Wrap-Up
#
showdev
#
learning
#
python
#
challenge
6
reactions
Comments
Add Comment
2 min read
« First
‹ Prev
1
2
3
We're a place where coders share, stay up-to-date and grow their careers.
Log in
Create account