DEV Community

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

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

Comments
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)

Day 60: Python Remove Nth Node From End of Linked List, Two-Pointer Magic to Delete in One Pass (LeetCode #19 Style)

1
Comments
3 min read
Day 61: Python Queue Using Two Stacks, Amortized O(1) Unbiased FIFO with Brilliant Double-Stack Flip Trick (No Deque Cheats!)

Day 61: Python Queue Using Two Stacks, Amortized O(1) Unbiased FIFO with Brilliant Double-Stack Flip Trick (No Deque Cheats!)

7
Comments 2
3 min read
Day 62: Python Longest Subarray with Target Sum - O(n) Prefix Sum & HashMap Guide (LeetCode Vibes)

Day 62: Python Longest Subarray with Target Sum - O(n) Prefix Sum & HashMap Guide (LeetCode Vibes)

1
Comments
3 min read
Day 63: Python Merge K Sorted Lists - O(n log k) Min-Heap Guide (LeetCode #23 Vibes)

Day 63: Python Merge K Sorted Lists - O(n log k) Min-Heap Guide (LeetCode #23 Vibes)

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

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

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

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

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

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

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

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

1
Comments
3 min read
Day 68: Python Unique Paths in Grid - O(m*n) DP Solution for Robot Paths (LeetCode #62 Vibes)

Day 68: Python Unique Paths in Grid - O(m*n) DP Solution for Robot Paths (LeetCode #62 Vibes)

1
Comments
3 min read
Day 69: Python Conway's Game of Life - Simulate One Step of Cellular Automata with Neighbor Scanning Magic

Day 69: Python Conway's Game of Life - Simulate One Step of Cellular Automata with Neighbor Scanning Magic

1
Comments
3 min read
Day 70: Python Wildcard Matching – DP Solution for '?' and '*' Patterns in O(n*m) (LeetCode #44 Mastery)

Day 70: Python Wildcard Matching – DP Solution for '?' and '*' Patterns in O(n*m) (LeetCode #44 Mastery)

1
Comments
2 min read
Day 71: Python Three Sum – Two-Pointer O(n^2) Solution for Unique Zero-Sum Triplets (LeetCode #15 Vibes)

Day 71: Python Three Sum – Two-Pointer O(n^2) Solution for Unique Zero-Sum Triplets (LeetCode #15 Vibes)

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

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

Comments
2 min read
Day 73: Python Longest Palindromic Substring – Expand-Around-Center O(n^2) Technique for Max Palindrome (LeetCode #5 Guide)

Day 73: Python Longest Palindromic Substring – Expand-Around-Center O(n^2) Technique for Max Palindrome (LeetCode #5 Guide)

Comments
2 min read
Day 74: Python Validate IPv4 Address – String Parsing Mastery for Perfect IP Check (No Libraries Needed)

Day 74: Python Validate IPv4 Address – String Parsing Mastery for Perfect IP Check (No Libraries Needed)

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

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

Comments
2 min read
Day 76: Python Binary Exponentiation – O(log n) Fast Power Calculation Without Built-Ins

Day 76: Python Binary Exponentiation – O(log n) Fast Power Calculation Without Built-Ins

Comments
2 min read
Day 77: Python Trailing Zeros in Factorial – Genius Number Theory Trick to Count Zeros in n! Without Computing the Huge Number

Day 77: Python Trailing Zeros in Factorial – Genius Number Theory Trick to Count Zeros in n! Without Computing the Huge Number

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
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
Day 80: Python Search in Rotated Sorted rArray - Final Challenge O(log n) Binary Search Mastery (LeetCode #33 Vibes)

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

Comments
3 min read
80 Days of Python Challenges: An Honest Wrap-Up

80 Days of Python Challenges: An Honest Wrap-Up

6
Comments
2 min read