Shubham Learnyard

Earliest Second to Mark Indices I Solution in C++/Java/Python/JS

Earliest Second-to-Mark Indices I Problem Description: You are given two 1-indexed integer arrays, nums and, changeIndices, having lengths n and m, respectively. Initially, all indices in nums are unmarked. Your task is to mark all indices in nums. In each second, s, in order from 1 to m (inclusive), you

Heaters Leetcode Solution in C++/Java/Python/JS

Heaters Problem Description: Winter is coming! During the contest, your first job is to design a standard heater with a fixed warm radius to warm all the houses. Every house can be warmed, as long as the house is within the heater's warm radius range. Given the positions

Binary Search

Maximum Number of Removable Characters Solution in C++/Java/Python/JS

Maximum Number of Removable Characters Problem Description: You are given two strings s and p where p is a subsequence of s. You are also given a distinct 0-indexed integer array removable containing a subset of indices of s (s is also 0-indexed). You want to choose an integer k

Minimum Time to Repair Cars Solution in C++/Java/Python/JS

Minimum Time to Repair Cars Problem Description: You are given an integer array ranks representing the ranks of some mechanics. ranks[i] is the rank of the i-th mechanic. A mechanic with a rank r can repair n cars in r * n² minutes. You are also given an integer cars

Binary Search

Minimum Speed to Arrive on Time Solution in C++/Java/Python/JS

Minimum Speed to Arrive on Time Problem Description: You are given a floating-point number hour, representing the amount of time you have to reach the office. To commute to the office, you must take n trains in sequential order. You are also given an integer array dist of length n,

Binary Search

Maximum Side Length of a Square with Sum Less than or Equal to Threshold

Maximum Side Length of a Square with Sum Less than or Equal to Threshold Problem Description: Given an m * n matrix mat and an integer threshold, return the maximum side-length of a square with a sum less than or equal to threshold or return 0 if there is no such

Aggressive Cows Leetcode Solution

Aggressive Cows Problem Description: You are given an array with unique elements of stalls[], which denote the position of a stall. You are also given an integer k which denotes the number of aggressive cows. Your task is to assign stalls to k cows such that the minimum distance between

Maximum Candies Allocated to K Children Solution

Maximum Candies Allocated to K Children Problem Description: You are given a 0-indexed integer array candies. Each element in the array denotes a pile of candies of size candies[i]. You can divide each pile into any number of sub-piles, but you cannot merge two piles together. You are also

Most Profit Assigning Work Leetcode Solution

Most Profit Assigning Work Problem Description: You have n jobs and m workers. You are given three arrays: difficulty, profit, and worker where: difficulty[i] and profit[i] are the difficulty and the profit of the ith job, and worker[j] is the ability of the jth worker (i.e.

Binary Search

Maximum Value at a Given Index in a Bounded Array Solution in C++/Java/Python/JS

Maximum Value at a Given Index in a Bounded Array Problem Description: You are given three positive integers: n, index, and maxSum. You want to construct an array nums (0-indexed) that satisfies the following conditions: nums.length == n nums[i] is a positive integer where 0 <= i < n.

Binary Search

Sqrt(x) LeetCode Solution | Approaches in C++/Java/Python/JS

Problem Description: Given a non-negative integer x, return the square root of x rounded down to the nearest integer. The returned integer should be non-negative as well. You must not use any built-in exponent function or operator. For example, do not use pow(x, 0.5) in C++ or x

Binary Search

Binary Search Algorithm Solution: Iterative & Recursive Ways

Problem Description: Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1. You must write an algorithm with O(log n) runtime complexity. Examples: Input: nums

Count Beautiful Substrings II Solution In C++/Java/Python/JS

Problem Description: You are given a string s and a positive integer k. Let vowels and consonants be the number of vowels and consonants in a string. A string is beautiful if: vowels == consonants. (vowels * consonants) % k == 0, in other terms the multiplication of vowels and consonants is divisible by

Count the Number of Good Partitions Solution In C++/Python/Java/Javascript

Problem Description: You are given a 0-indexed array nums consisting of positive integers. A partition of an array into one or more contiguous subarrays is called good if no two subarrays contain the same number. Return the total number of good partitions of nums. Since the answer may be large,

Rank Teams by Votes

Problem Description: In a special ranking system, each voter gives a rank from highest to lowest to all teams participating in the competition. The ordering of teams is decided by who received the most position-one votes. If two or more teams tie in the first position, we consider the second

Custom Sort String Solution In C++/Java/Python/Javascript

Problem Description: You are given two strings order and s. All the characters of order are unique and were sorted in some custom order previously. Permute the characters of s so that they match the order that order was sorted. More specifically, if a character x occurs before a character

Sort the Jumbled Numbers

Problem Description: You are given a 0-indexed integer array mapping which represents the mapping rule of a shuffled decimal system. mapping[i] = j means digit i should be mapped to digit j in this system. The mapped value of an integer is the new integer obtained by replacing each occurrence

Largest Number

Problem Description: Given a list of non-negative integers nums, arrange them such that they form the largest number and return it. Since the result may be very large, so you need to return a string instead of an integer. Examples: Input: nums = [10,2] Output: "210" Explanation: Arrange

+5 Problems on Comparator Sort | Code C++/Python/Java

Sorting is one of the cornerstones of computer science, enabling faster searches and streamlined data processing. Among the various sorting methods, comparator-based sorting stands out for its versatility and adaptability. However, despite its widespread use, it has its own set of challenges that can stump even seasoned programmers. This guide

Comparator Sort

A comparator sort is a sorting algorithm that determines the order of elements in a list, array, or other data structure using a comparison function. This comparison function is applied to pairs of elements and decides their relative order. This comparison function is used to compare two elements at a

People Whose List of Favorite Companies is Not a Subset of Another List Solution In C++/Python/Java/Javascript

Problem Description: Given the array favoriteCompanies where favoriteCompanies[i] is the list of favorite companies for the i-th person (indexed from 0): Return the indices of people whose list of favorite companies is not a subset of any other list of favorite companies. You must return the indices in increasing

Find the Maximum Number of Elements in Subset Solution In C++/Python/Java/Javascript

Problem Description: You are given an array of positive integers nums. You need to select a subset of nums which satisfies the following condition: You can place the selected elements in a 0-indexed array such that it follows the pattern: [x, x², x⁴, ..., xᵏ/², xᵏ, xᵏ/², ..., x⁴, x², x] (Note

Word Subsets Solution In C++/Python/Java/Javascript

Problem Description: You are given two lists of words: words1 and words2. A word from words2 is called a subset of a word in words1 if: All the letters in the word from words2 are present in the word from words1. And each letter appears at least as many times

Groups of Special-Equivalent Strings Solution In C++/Python/Java/Javascript

Problem Statement: You are given an array of strings of the same length words. In one move, you can swap any two even indexed characters or any two odd indexed characters of a string words[i]. Two strings words[i] and words[j] are special-equivalent if after any number of

Optimal Partition of String Solution In C++/Python/Java/Javascript

Problem Description: Given a string s, partition the string into one or more substrings such that the characters in each substring are unique. That is, no letter appears in a single substring more than once. Return the minimum number of substrings in such a partition. Note that each character should