Latest Articles
Discover our latest posts and insights from the Kode$word journey
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.
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.
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.
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.
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
LeetCode 1980: Find Unique Binary String – Multiple Ways to Generate a Missing Binary Combination
A Complete Guide to Solving “Find Unique Binary String” Using Hashing, Brute Force Thinking, and Cantor’s Diagonalization
LeetCode 875: Koko Eating Bananas – Find the Minimum Eating Speed Using Binary Search
Step-by-Step Explanation of the Koko Eating Bananas Problem with Intuition, Dry Run, and Java Implementation
Peak Index in a Mountain Array – Brute Force to Binary Search (LeetCode 852)
Learn how to find the peak index in a mountain array using multiple approaches including brute force, linear scan, and an optimized binary search solution with O(log n) time complexity.
Find Peak Element – Binary Search Explained with Java Solution (LeetCode 162)
Learn how to efficiently find a peak element in an array using binary search. This guide explains the problem clearly, builds intuition step-by-step, and walks through multiple approaches with a clean O(log n) solution.