ViewTube

Welcome to Mohan Codes. In this video, we solve the Plus One problem, a popular array-based coding interview question ...

In this video, we solve Plus One (LeetCode Q66) using the Carry Propagation approach and understand how digit-by-digit ...

Learn how to solve the LeetCode 66 "Plus One" problem using an intuitive, school-math-inspired approach. In this video, we walk ...

PROBLEM DESCRIPTION* You are given an array of integers nums, there is a sliding window of size k which is moving from the ...

Find a target in a sorted array. O(log n). Seven elements, three comparisons. Every developer knows this algorithm. Most can't ...

In this video, we deep-dive into one of the most popular array interview questions asked by Google, Amazon, Meta, and Netflix.

In this video, we explore LeetCode 3286 - Find a Safe Walk Through a Grid, a graph-based problem that is best solved using the ...

LRU Cache is one of the most-asked coding and low level design (LLD) interview problems — this is the O(1) get and put solution ...

PROBLEM DESCRIPTION* Given an array of integers heights representing the histogram's bar height where the width of each bar ...

In this video, we solve LeetCode Problem 884: Uncommon Words from Two Sentences using Java. Problem Summary: Given ...

LeetCode number three — Longest Substring Without Repeating Characters — is one of the most frequently asked sliding ...

Sorted array + O(log n) — that's the signal. Binary search, every time. LC 35 is a clean one-pass binary search. The trick isn't ...

Welcome back to the channel! Today we are tackling LeetCode 3983: Subsequence After One Replacement. This is a fantastic ...

Most Java developers think passing coding interviews is about solving more LeetCode problems. It isn't. International companies ...

In this video, we tackle the hard LeetCode problem Count Subarrays With Majority Element II using an incredibly efficient O(n) ...

Sorted array + O(log n) constraint — that's your signal. Binary search, every time. LC 34 breaks down into two clean helper ...

LeetCode 3976 | Maximum Subarray Sum After Multiplier | Dynamic Programming | 3-State DP In this video, we solve LeetCode ...

Container With Most Water, explained visually — the classic two-pointer problem, built up from the one idea that makes it click: the ...

1358 Number of Substrings Containing All Three Characters. How it works: Track last seen positions - Maintain the most recent ...

In this video, we dive into the LeetCode problem Count Subarrays With Majority Element I. We will break down how to use ...