Latest Articles
Discover our latest posts and insights from the Kode$word journey
LeetCode 144: Binary Tree Preorder Traversal – Java Recursive & Iterative Solution Explained
Learn how to solve LeetCode 144 Binary Tree Preorder Traversal using Recursive and Iterative approaches in Java. Includes traversal intuition, stack-based solution, dry run, complexity analysis, interview explanation, and common mistakes.
LeetCode 145: Binary Tree Postorder Traversal – Java Recursive & Iterative Solution Explained
Learn how to solve LeetCode 145 Binary Tree Postorder Traversal using Recursive and Iterative approaches in Java. Includes traversal intuition, stack-based solution, dry run, complexity analysis, interview explanation, and common mistakes.
LeetCode 94: Binary Tree Inorder Traversal – Java Recursive & Iterative Solution Explained
Learn how to solve LeetCode 94 Binary Tree Inorder Traversal using Recursive and Iterative approaches in Java. Includes tree traversal intuition, dry run, stack-based solution, complexity analysis, interview tips, and common mistakes.
LeetCode 154: Find Minimum in Rotated Sorted Array II – Java Binary Search Solution Explained
Learn how to solve LeetCode 154 Find Minimum in Rotated Sorted Array II using Binary Search in Java. Includes brute force approach, optimized solution, duplicates handling, dry run, intuition, complexity analysis, and interview explanation.
LeetCode 1665: Minimum Initial Energy to Finish Tasks – Java Greedy Solution Explained
Learn how to solve LeetCode 1665 Minimum Initial Energy to Finish Tasks using Greedy and Sorting in Java. Includes brute force intuition, optimal approach, dry run, time complexity, interview explanation, and common mistakes.
LeetCode 2553: Separate the Digits in an Array – Java Solution Explained (2 Easy Approaches)
Learn how to solve LeetCode 2553 Separate the Digits in an Array using Java with 2 easy approaches. Includes intuition, dry run, time complexity, interview tips, common mistakes, and optimized mathematical solution.
LeetCode 88 Merge Sorted Array Explained: Brute Force to Optimal Java Solution (3 Pointer Approach)
Complete Interview Guide with Intuition, Dry Run, Multiple Approaches & Complexity Analysis
LeetCode 258 — Add Digits | Brute Force to O(1) Digital Root Trick Explained in Java
Learn how to solve LeetCode 258 Add Digits in Java. We cover the simulation loop approach and the O(1) digital root math trick with full intuition, dry run, and annotated code.
LeetCode 61 Rotate List Java Solution | Brute Force + Optimal Approach Explained (Linked List Rotation)
Learn how to solve LeetCode 61 Rotate List using brute force and optimized linked list approaches. Includes dry runs, edge cases, complexity analysis, and common mistakes.