Latest Articles

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

LeetCode 143 Reorder List - Java Solution Explained

LeetCode 143 Reorder List - Java Solution Explained

Learn how to solve LeetCode 143 Reorder List using Fast & Slow Pointer, Reverse Linked List, and Merge techniques in Java. Includes step-by-step dry run, time & space complexity analysis.

Krishna Shrivastava
Apr 5, 2026
LeetCodeJavaLinked ListTwo PointerFast Slow PointerMedium
Read More
Queue Data Structure Complete Guide - Java Explained With All Operations

Queue Data Structure Complete Guide - Java Explained With All Operations

Learn everything about Queue data structure in Java. Includes types of queues, all operations, real life examples, time & space complexity, and top LeetCode problems to practice.

Krishna Shrivastava
Apr 4, 2026
QueueData StructureJavaBFSDequePriority QueueCircular Queue
Read More
LeetCode 402: Remove K Digits — Java Solution Explained

LeetCode 402: Remove K Digits — Java Solution Explained

Learn how to solve LeetCode 402 Remove K Digits using Monotonic Stack in Java. Includes greedy intuition, step-by-step dry run, leading zeros handling, time & space complexity analysis.

Krishna Shrivastava
Apr 3, 2026
LeetCodeJavaStackMonotonic StackGreedyStringMedium
Read More
LeetCode 735: Asteroid Collision — Java Solution Explained

LeetCode 735: Asteroid Collision — Java Solution Explained

Learn how to solve LeetCode 735 Asteroid Collision using Stack in Java. Includes all collision cases explained, step-by-step dry run, time & space complexity, and common mistakes to avoid.

Krishna Shrivastava
Apr 3, 2026
LeetCodeJavaStackArrayMedium
Read More
LeetCode 1021: Remove Outermost Parentheses — Java Solution Explained

LeetCode 1021: Remove Outermost Parentheses — Java Solution Explained

Learn How to Identify and Remove Outermost Parentheses of Every Primitive Component Using Counter and Stack Approaches in Java — With Full Dry Run and Complexity Analysis

Krishna Shrivastava
Apr 2, 2026
StringStackEasyLeetCode
Read More
LeetCode 1614: Maximum Nesting Depth of Parentheses — Java Solution Explained

LeetCode 1614: Maximum Nesting Depth of Parentheses — Java Solution Explained

Learn How to Find Maximum Nesting Depth Using Stack and O(1) Space Counter Approach in Java — With Step-by-Step Dry Run and Full Complexity Analysis

Krishna Shrivastava
Apr 2, 2026
StringStackLeetCodeEasy
Read More
LeetCode 20: Valid Parentheses — Java Solution Explained

LeetCode 20: Valid Parentheses — Java Solution Explained

Master the Classic Stack Problem With Step-by-Step Dry Run, Edge Cases, and Full Complexity Analysis in Java — The Most Asked Easy Problem in Coding Interviews

Krishna Shrivastava
Apr 2, 2026
StringStackEasyLeetCode
Read More
LeetCode 496: Next Greater Element I — Java Solution With All Approaches Explained

LeetCode 496: Next Greater Element I — Java Solution With All Approaches Explained

Master the Monotonic Stack Pattern With HashMap Optimization — Step-by-Step Dry Run, Brute Force to O(n) Solution, and Full Complexity Analysis in Java

Krishna Shrivastava
Apr 2, 2026
ArrayStackMonotonic StackHashMapEasyLeetCode
Read More
LeetCode 844: Backspace String Compare — Java Solution With All Approaches Explained

LeetCode 844: Backspace String Compare — Java Solution With All Approaches Explained

Learn How to Compare Two Strings After Backspace Operations Using StringBuilder, Stack, and O(1) Space Two Pointer — With Step-by-Step Dry Run and Full Complexity Analysis in Java

Krishna Shrivastava
Apr 2, 2026
StringStackTwo PointerString Builder
Read More
Page 8 of 17150 articles total
Ai Assistant Kas