Shubham Learnyard

Two Pointer

Make String a Subsequence Using Cyclic Increments Solution In C++/Java/Python/JS

Make String a Subsequence Using Cyclic Increments Problem Description: You are given two 0-indexed strings str1 and str2. In an operation, you select a set of indices in str1, and for each index i in the set, increment str1[i] to the next character cyclically. That is 'a'

How to Find Ceil and Floor Solution In C++/Java/Python/JS

How to find Ceil and Floor Problem Description Given a real number x, find: Ceil of x: The smallest integer that is greater than or equal to x. Floor of x: The largest integer that is less than or equal to x. You must return both values as output. Examples:

Maximum Number of Robots Within Budget Solution In C++/Java/Python/JS

Maximum Number of Robots Within Budget Problem Description: You have n robots. You are given two 0-indexed integer arrays, chargeTimes and runningCosts, both of length n. The i-th robot costs chargeTimes[i] units to charge and costs runningCosts[i] units to run. You are also given an integer budget. The

Maximum Running Time of N Computers Solution In C++/Java/Python/JS

Maximum Running Time of N Computers Problem Description: You have n computers. You are given the integer n and a 0-indexed integer array batteries where the ith battery can run a computer for batteries[i] minutes. You are interested in running all n computers simultaneously using the given batteries. Initially,

Split Array Largest Sum Solution In C++/Java/Python/JS

Split array largest sum Problem Description: Given an integer array nums and an integer k, split nums into k non-empty subarrays such that the largest sum of any subarray is minimized. Return the minimized largest sum of the split. A subarray is a contiguous part of the array. Examples: Input:

Minimum Number of Days to Make m Bouquets Solution In C++/Java/Python/JS

Problem Description: You are given an integer array bloomDay, an integer m and an integer k. You want to make m bouquets. To make a bouquet, you need to use k adjacent flowers from the garden. The garden consists of n flowers, the i-th flower will bloom in the bloomDay[

Find the Smallest Divisor Given a Threshold Solution In C++/Java/Python/JS

Problem Description: Given an array of integers nums and an integer threshold, we will choose a positive integer divisor, divide all the array by it, and sum the division's result. Find the smallest divisor such that the result mentioned above is less than or equal to threshold. Each

Koko Eating Bananas Solution In C++/Java/Python/JS

Problem Description: Koko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours. Koko can decide her bananas-per-hour eating speed of k. Each hour, she chooses some pile of bananas and eats

Capacity To Ship Packages Within D Days Solution In C++/Java/Python/JS

Problem Description: A conveyor belt has packages that must be shipped from one port to another within D days. The ith package on the conveyor belt has a weight of weights[i]. Each day, we load the ship with packages on the conveyor belt (in the order given by weights)

Find the Duplicate Number Solution In C++/Java/Python/JS

Find the Duplicate Number Problem Description: Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive. There is only one repeated number in nums, return this repeated number. You must solve the problem without modifying the array nums and using

Minimum Common Value Solution In C++/Java/Python/JS

Minimum Common Value Problem Description: Given two integer arrays nums1 and nums2, sorted in non-decreasing order, return the minimum integer common to both arrays. If there is no common integer among nums1 and nums2, return -1. An integer is said to be common to nums1 and nums2 if both arrays

Single Element in a Sorted Array Solution In C++/Java/Python/JS

Problem Description: You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once. Return the single element that appears only once. Your solution must run in O(log n) time and O(1) space. Examples: Input: nums

Kth Missing Positive Number Solution In C++/Java/Python/JS

Problem Description: Given an array arr of positive integers sorted in a strictly increasing order, and an integer k. Return the k-th positive integer that is missing from this array. Examples: Input: arr = [2, 3, 4, 7, 11], k = 5 Output: 9 Explanation: The missing positive integers are [1, 5,

Introduction to Smart Pointers

Imagine this: You borrow your friend's bicycle to go to the nearby park. You're careful with it because it's not yours, and you promise to return it safely. But what if no one keeps track of it? What if you leave it somewhere, and

Using Pointers as Parameters

Imagine you're at home, and your mom asks you to go to your friend's house and give him a note. But instead of giving you the whole notebook, she just gives you the address of the notebook so your friend can go directly to your house

Pointers and Arrays: Understanding Their Relationship and Use Cases in C++

Have you ever seen a treasure map? The map itself isn’t the treasure, right? It just shows you where the treasure is hidden. You follow the map to reach the real thing. In C++, pointers are like that treasure map — they don't hold the treasure (the actual

Pointer Arithmetic and Const Pointers in C++

Have you ever played a treasure hunt game? You start with a tiny clue, and each clue leads you closer to the final treasure. You don’t just jump directly to the treasure — you move step-by-step, following the trail of hints carefully. In the world of C++, pointers work just

Pointers Fundamentals

Imagine you want to visit your friend's house. You don't pick up their entire house and carry it with you, right? That would be impossible! Instead, you simply carry something much lighter and more useful: their address. Using this address, you can easily find and visit

Arrays in C++

Have you ever seen books sitting neatly on a bookshelf? Each book has its own special slot! Imagine you have a bookshelf with 12 slots, and each slot can hold one book. You can put a book in any slot, take one out, or replace it with another. The slots

Sort Array By Parity II Solution In C++/Java/Python/JS

Sort Array By Parity II Problem Description: Given an array of integers nums, half of the integers in nums are odd, and the other half are even. Sort the array so that whenever nums[i] is odd, i is odd, and whenever nums[i] is even, i is even.Return

Minimize the Maximum of Two Arrays Solution in C++/Java/Python/JS

Minimize the Maximum of Two Arrays Problem Description: We have two arrays arr1 and arr2 which are initially empty. You need to add positive integers to them such that they satisfy all the following conditions: arr1 contains uniqueCnt1 distinct positive integers, each of which is not divisible by divisor1. arr2

Binary Search

Ugly Number III Solution In C++/Python/Java/JS

Ugly Number III Problem Description: An ugly number is a positive integer that is divisible by a, b, or c. Given four integers n, a, b, and c, return the nth ugly number. Examples: Input: n = 3, a = 2, b = 3, c = 5 Output: 4 Explanation: The ugly numbers are

Sell Diminishing-Valued Colored Balls Solution in C++/Java/Python/JS

Sell Diminishing-Valued Colored Balls Problem Description: You have an inventory of different colored balls, and there is a customer that wants to order balls of any color. The customer weirdly values the colored balls. Each colored ball's value is the number of balls of that color you currently

Minimum Absolute Difference Between Elements with Constraint Solution in C++/Java/Python/JS

Problem Description: You are given a 0-indexed integer array nums and an integer x. Find the minimum absolute difference between two elements in the array that are at least x indices apart. In other words, find two indices i and j such that abs(i - j) >= x and

Binary Search

Maximum White Tiles Covered by a Carpet Solution in C++/Java/Python/JS

Maximum White Tiles Covered by a Carpet Problem Description: You are given a 2D integer array tiles where tiles[i] = [li, ri] represents that every tile j in the range li <= j <= ri is colored white. You are also given an integer carpetLen, the length of a single