Latest Articles

Discover our latest posts and insights from the Kode$word journey

LeetCode 2657: Find the Prefix Common Array of Two Arrays – Java Hashing Solution Explained

LeetCode 2657: Find the Prefix Common Array of Two Arrays – Java Hashing Solution Explained

Solve LeetCode 2657 (Prefix Common Array) in Java. Learn Brute Force, HashMap, HashSet, and frequency counting techniques. Includes optimized code, dry run, and interview tips.

Krishna Shrivastava
May 20, 2026
LeetCodePrefix Common ArrayJavaHashMapHashSetArrayPrefixArrayMedium
Read More
LeetCode 2784: Check if Array is Good – Java HashMap Solution Explained

LeetCode 2784: Check if Array is Good – Java HashMap Solution Explained

Learn how to solve LeetCode 2784 Check if Array is Good using HashMap and counting techniques in Java. Includes brute force intuition, optimized approach, dry run, complexity analysis, interview explanation, and common mistakes.

Krishna Shrivastava
May 19, 2026
LeetCodeJavaHashMapArrayFrequency CountEasy
Read More
LeetCode 102: Binary Tree Level Order Traversal – Java BFS Solution Explained

LeetCode 102: Binary Tree Level Order Traversal – Java BFS Solution Explained

Learn how to solve LeetCode 102 Binary Tree Level Order Traversal using BFS and Queue in Java. Includes brute force intuition, optimized level order traversal, dry run, complexity analysis, interview explanation, and common mistakes.

Krishna Shrivastava
May 17, 2026
LeetCodeBinary Tree Level Order TraversalBFSQueueBinary TreeJavaTree TraversalMedium
Read More
LeetCode 1306: Jump Game III – Java DFS & Graph Traversal Solution Explained

LeetCode 1306: Jump Game III – Java DFS & Graph Traversal Solution Explained

Learn how to solve LeetCode 1306 Jump Game III using DFS and graph traversal in Java. Includes brute force intuition, optimized recursive solution, BFS approach, dry run, complexity analysis, interview explanation, and common mistakes.

Krishna Shrivastava
May 17, 2026
LeetCodeMediumDFSBFSGraph TraversalJavaRecursion
Read More
LeetCode 144: Binary Tree Preorder Traversal – Java Recursive & Iterative Solution Explained

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.

Krishna Shrivastava
May 17, 2026
LeetCodeBinary Tree Preorder TraversalBinary TreeTree TraversalJavaDFSStackRecursionEasy
Read More
LeetCode 145: Binary Tree Postorder Traversal – Java Recursive & Iterative Solution Explained

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.

Krishna Shrivastava
May 17, 2026
LeetCodeBinary Tree Postorder TraversalBinary TreeTree TraversalJavaDFSStackRecursionEasy
Read More
LeetCode 94: Binary Tree Inorder Traversal – Java Recursive & Iterative Solution Explained

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.

Krishna Shrivastava
May 16, 2026
LeetCodeBinary Tree Inorder TraversalBinary TreeTree TraversalJavaDFSStackRecursionEasy
Read More
LeetCode 154: Find Minimum in Rotated Sorted Array II – Java Binary Search Solution Explained

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.

Krishna Shrivastava
May 16, 2026
HardBinary SearchRotated Sorted ArrayJavaLeetCode
Read More
LeetCode 1665: Minimum Initial Energy to Finish Tasks – Java Greedy Solution Explained

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.

Krishna Shrivastava
May 12, 2026
LeetCodeGreedy AlgorithmJavaSortingHardArray
Read More
Page 7 of 20 • 179 articles total
Ai Assistant Kas