Shahrouz Nikseresht

Shahrouz Nikseresht @shahrouzlogs

About: Python beginner | Learning out loud & building in public | Exploring Git, clean code, and real-world projects | Sharing my journey on YouTube & Twitter

Shahrouz Nikseresht @shahrouzlogs

Shahrouz Nikseresht articles - 78 total

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

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

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

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

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

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

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

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

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

Day 58: Python Run-Length Encoding (RLE) – Compress Strings Like a Pro with This Ultra-Simple O(n) Trick

Day 57: Python GCD & LCM with Euclidean Algorithm, Lightning-Fast Divisor Math That's 2000+ Years Old (And Still Unbeatable)

Day 56: Python Fibonacci nth Term – Blazing Fast O(n) Iterative Solution with O(1) Space (No Recursion!)

Day 55: Python Calculate Mean & Median Manually – No Statistics Module, Just Pure Python Power

Day 54: Python Summary Ranges – Compress Sorted Unique Integers into Minimal "a->b" Strings Like LeetCode Pros

Day 53: Python Count Overlapping Substrings – The Hidden Limitation of str.count() and the Perfect Sliding Window Fix

Day 52: Python Longest Continuous Increasing Subarray – Find the Maximum Length of Strictly Increasing Adjacent Elements in O(n)

Day 51: Python First Unique Character – Find the First Non-Repeating Char in String with Hash Map Magic

Day 50: Python Group Anagrams – The Cleanest O(n * m log m) Way to Cluster Words by Letter Signature

Day 49: Python Playlist Shuffler – True Unbiased Random Shuffle with Fisher-Yates Algorithm

Day 48: Python Merge Two Sorted Lists - Master the Two-Pointer Technique in Pure O(n)

Day 47: Python Rotate Array to Right by K Steps – Master the Elegant Slicing Trick in One Line

Day 46: Python Moving Average Calculator, Optimized Sliding Window for Simple Moving Average Computation

Day 45: Python Majority Element Finder, Boyer-Moore Voting Algorithm for Efficient Detection in Arrays

Day 44: Python Longest Substring Finder, Sliding Window Technique for Non-Repeating Characters Length

Day 43: Python Valid Parentheses Checker, Stack-Based Bracket Validation with Mapping and Loop Scanning

Day 42: Python Roman Numeral Converter, Bidirectional Conversion Between Roman and Integers with Mapping and Loops

Day 41: Python Happy Number Checker, Detect Numbers Leading to 1 Through Digit Square Sums with Cycle Detection

Day 40: Python Armstrong Numbers Finder, Detect Narcissistic Numbers in a Range with Digit Power Sum

Day 39: Python Word Counter, Count Words in Text with Whitespace Handling

Shahrouz Nikseresht
articles - 78 total