Latest Articles

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

LeetCode 2126: Destroying Asteroids – Java Greedy Algorithm Solution with Dry Run

LeetCode 2126: Destroying Asteroids – Java Greedy Algorithm Solution with Dry Run

Learn how to solve LeetCode 2126 Destroying Asteroids using a Greedy Algorithm in Java. Includes sorting intuition, brute force approach, optimized solution, dry run, complexity analysis, interview explanation, and common mistakes.

Krishna Shrivastava
May 31, 2026
LeetCodeGreedy AlgorithmJavaSortingArrayMedium
Read More
LeetCode 230: Kth Smallest Element in a BST – Java Recursive Inorder Traversal Solution

LeetCode 230: Kth Smallest Element in a BST – Java Recursive Inorder Traversal Solution

Learn how to solve LeetCode 230 Kth Smallest Element in a BST using inorder traversal in Java. Includes BST intuition, brute force approach, optimized recursive solution, dry run, complexity analysis, interview explanation, and common mistakes.

Krishna Shrivastava
May 30, 2026
LeetCodeKth Smallest Element in BSTBinary Search TreeJavaInorder TraversalBSTMedium
Read More
LeetCode 701: Insert into a Binary Search Tree – Java Recursive Solution with Dry Run

LeetCode 701: Insert into a Binary Search Tree – Java Recursive Solution with Dry Run

Learn how to solve LeetCode 701 Insert into a Binary Search Tree using recursion in Java. Includes BST intuition, brute force approach, optimized recursive solution, dry run, complexity analysis, interview explanation, and common mistakes.

Krishna Shrivastava
May 30, 2026
LeetCodeBSTBinary Search TreeJavaRecursionTreeMedium
Read More
Search in a Binary Search Tree (LeetCode 700) Java Solution with Explanation and Dry Run

Search in a Binary Search Tree (LeetCode 700) Java Solution with Explanation and Dry Run

Learn how to efficiently search for a value in a Binary Search Tree using Java with step-by-step explanation, intuition, recursion approach, dry run, and complexity analysis.

Krishna Shrivastava
May 30, 2026
LeetCodeBinary Search TreeJavaBSTEasyTreeRecursion
Read More
LeetCode 3121: Count the Number of Special Characters II – Java HashMap Solution Explained

LeetCode 3121: Count the Number of Special Characters II – Java HashMap Solution Explained

Learn how to solve LeetCode 3121 Count the Number of Special Characters II using HashMap in Java. Includes intuition, brute force approach, optimized solution, dry run, complexity analysis, interview explanation, and common mistakes.

Krishna Shrivastava
May 27, 2026
LeetCodeJavaHashMapStringMedium
Read More
LeetCode 387: First Unique Character in a String – Java HashMap Solution Explained

LeetCode 387: First Unique Character in a String – Java HashMap Solution Explained

Learn how to solve LeetCode 387 First Unique Character in a String using HashMap in Java. Includes brute force approach, optimized solution, intuition, dry run, complexity analysis, interview explanation, and common mistakes.

Krishna Shrivastava
May 27, 2026
LeetCodeJavaHashMapStringEasy
Read More
LeetCode 3120: Count the Number of Special Characters I – Java HashSet Solution Explained

LeetCode 3120: Count the Number of Special Characters I – Java HashSet Solution Explained

Learn how to solve LeetCode 3120 Count the Number of Special Characters I using HashSet in Java. Includes intuition, brute force approach, optimized solution, dry run, complexity analysis, interview explanation, and common mistakes.

Krishna Shrivastava
May 27, 2026
LeetCodeJavaHashSetStringEasy
Read More
LeetCode 124: Binary Tree Maximum Path Sum – Java DFS Solution Explained

LeetCode 124: Binary Tree Maximum Path Sum – Java DFS Solution Explained

Learn how to solve LeetCode 124 Binary Tree Maximum Path Sum using optimized DFS recursion in Java. Includes intuition, brute force approach, optimized solution, dry run, complexity analysis, interview explanation, and common mistakes.

Krishna Shrivastava
May 23, 2026
LeetCodeBinary Tree Maximum Path SumJavaBinary TreeDFSTreeRecursionDynamic Programming on TreesHard
Read More
LeetCode 543: Diameter of Binary Tree – Java DFS Solution Explained

LeetCode 543: Diameter of Binary Tree – Java DFS Solution Explained

Learn how to solve LeetCode 543 Diameter of Binary Tree using optimized DFS recursion in Java. Includes brute force approach, optimized solution, intuition, dry run, complexity analysis, interview explanation, and common mistakes.

Krishna Shrivastava
May 23, 2026
LeetCodeDiameter of Binary TreeJavaBinary TreeDFSTreeRecursionEasy
Read More
Page 4 of 19164 articles total
Ai Assistant Kas