InBackToCodingbyMilind Amrutkar·Jun 14Running Sum of 1D Array (Leetcode 1480): All Approaches explainedBrute force to in-place O(1) space, the prefix-sum pattern explained, with time and space complexity for each solution.
InBackToCodingbyMilind Amrutkar·Aug 24, 2025Best Time to Buy and Sell Stock (LeetCode 121) (Part 2) BackToCodingBest Time to Buy and Sell Stock — LeetCode 121 Solution | Java & Kotlin Complete Guide with Step-by-Step Explanation
InBackToCodingbyMilind Amrutkar·Aug 23, 2025Best Time to Buy and Sell Stock (LeetCode 121) (Part 1) BackToCodingBest Time to Buy and Sell Stock — LeetCode 121 Solution | Java & Kotlin Complete Guide with Step-by-Step Explanation
InBackToCodingbyMilind Amrutkar·Aug 22, 2025Trapping Rain Water — Solved using Java and Kotlin (Part 3) Neetcode 150 — BackToCodingLearn to solve the classic Trapping Rain Water challenge with multiple approaches in Java & Kotlin. Complete guide with step-by-step…
InBackToCodingbyMilind Amrutkar·Aug 21, 2025Trapping Rain Water — Solved using Java and Kotlin (Part 2) Neetcode 150 — BackToCodingLearn to solve the classic Trapping Rain Water challenge with multiple approaches in Java & Kotlin. Complete guide with step-by-step…
