Latest Articles

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

LeetCode 2: Add Two Numbers – Step-by-Step Linked List Addition Explained Clearly

LeetCode 2: Add Two Numbers – Step-by-Step Linked List Addition Explained Clearly

Learn How to Add Numbers Represented as Linked Lists Using Carry Logic, Dummy Nodes, and Iterative Traversal (Beginner Friendly Guide)

Krishna Shrivastava
Mar 17, 2026
Linked ListMathSimulationCarry HandlingDummy NodeLeetCode Medium
Read More
LeetCode 203: Remove Linked List Elements – Step-by-Step Guide for Beginners

LeetCode 203: Remove Linked List Elements – Step-by-Step Guide for Beginners

Learn How to Remove Nodes from a Linked List Using Iteration, Edge Case Handling, and Dummy Node Technique (With Clear Intuition)

Krishna Shrivastava
Mar 17, 2026
Linked ListIterationDummy NodePointer ManipulationLeetCodeEasy
Read More
LeetCode 290: Word Pattern – Multiple Ways to Verify Bijection Between Pattern Characters and Words

LeetCode 290: Word Pattern – Multiple Ways to Verify Bijection Between Pattern Characters and Words

Learn How to Solve the Word Pattern Problem Using HashMaps, Bidirectional Mapping, and Index Mapping Techniques

Krishna Shrivastava
Mar 15, 2026
HashMapString ManipulationBijection MappingTwo HashMapsIndex MappingLeetCode Easy
Read More
LeetCode 123 — Best Time to Buy and Sell Stock III | At Most Two Transactions Explained

LeetCode 123 — Best Time to Buy and Sell Stock III | At Most Two Transactions Explained

From left-right prefix DP to the elegant four-variable state machine — a complete guide to the hardest constraint in the stock series.

Krishna Shrivastava
Mar 10, 2026
LeetCodeDynamic ProgrammingHardJavaDSAPrefix DPArraysStock Series
Read More
LeetCode 122 — Best Time to Buy and Sell Stock II | Every Approach Explained

LeetCode 122 — Best Time to Buy and Sell Stock II | Every Approach Explained

From greedy intuition to peak-valley thinking — a complete guide to maximizing stock profit with unlimited transactions.

Krishna Shrivastava
Mar 10, 2026
LeetCodeGreedyTwo PointersDynamic ProgrammingMediumJavaArrays
Read More
LeetCode 121 — Best Time to Buy and Sell Stock I | Two Pointer / Sliding Window Explained

LeetCode 121 — Best Time to Buy and Sell Stock I | Two Pointer / Sliding Window Explained

A beginner-friendly breakdown of the classic stock profit problem — intuition, dry run, commented Java code, and complexity analysis.

Krishna Shrivastava
Mar 10, 2026
LeetCodeTwo PointersEasyJavaDSA
Read More
LeetCode 1283 — Find the Smallest Divisor Given a Threshold | Binary Search on Answer Explained

LeetCode 1283 — Find the Smallest Divisor Given a Threshold | Binary Search on Answer Explained

Another clean example of the "Binary Search on Answer" pattern — intuition, greedy check, commented Java code, dry run, and complexity analysis.

Krishna Shrivastava
Mar 10, 2026
LeetCodeBinary SearchMediumJavaBinary Search on AnswerArraysCeiling Division
Read More
LeetCode 1011 — Capacity To Ship Packages Within D Days | Binary Search on Answer Explained

LeetCode 1011 — Capacity To Ship Packages Within D Days | Binary Search on Answer Explained

Master the "Binary Search on Answer" pattern with a complete walkthrough — intuition, dry run, commented Java code, and complexity analysis.

Krishna Shrivastava
Mar 10, 2026
LeetCodeBinary SearchMediumJavaBinary Search on AnswerArrays
Read More
LeetCode 1482: Minimum Number of Days to Make m Bouquets – Binary Search on the Earliest Day

LeetCode 1482: Minimum Number of Days to Make m Bouquets – Binary Search on the Earliest Day

A Complete Guide to Solving the Bouquet Problem Using Binary Search on Answer with Intuition, Dry Run, and Java Implementation

Krishna Shrivastava
Mar 9, 2026
Binary SearchArraysBinary Search on AnswerLeetCodeMedium
Read More
Page 1 of 763 articles total

Ai Assistant Kas