Latest Articles
Discover our latest posts and insights from the Kode$word journey
Ceil in a Sorted Array – Binary Search Explained with Story & Visuals | GeeksforGeeks
GeeksforGeeks Problem – Find the smallest element ≥ x in a sorted array using multiple approaches, dry runs, and story-based visualization.
Floor in a Sorted Array – Binary Search Explained with Story & Visuals | GeeksforGeeks
GeeksforGeeks Problem – Find the largest element ≤ x in a sorted array efficiently with multiple approaches, dry runs, and story-based visuals.
Valid Anagram – Frequency Counting Pattern Explained (LeetCode 242)
Using HashMap and Array Optimization to Detect Anagrams Efficiently
Reverse Vowels of a String – From Extra Space Approach to Two Pointer Optimization (LeetCode 345)
Understanding Different Ways to Reverse Only Vowels Efficiently
Reverse Only Letters – Two Pointer Strategy Explained (LeetCode 917)
Reversing Letters While Preserving Special Characters in Place
Ransom Note – Frequency Counting Made Simple (LeetCode 383)
Using HashMap to Validate Character Availability Efficiently
Find the Difference – Smart ASCII Sum Trick (LeetCode 389)
Solving the Problem Using Character Arithmetic Instead of Extra Space
Longest Palindrome – Building the Maximum Length from Given Letters (LeetCode 409)
Using Frequency Counting to Construct the Largest Possible Palindrome
Check if All Characters Have Equal Number of Occurrences – Frequency Map Approach (LeetCode 1941)
Simple HashMap Technique to Validate Equal Character Frequencies