Merge Without Extra Space
Given two sorted arrays a[] and b[] in non-decreasing order. Merge them in sorted order without using any extra space. Modify a so that it contains the […]
2981. Find Longest Special Substring That Occurs Thrice I
You are given a string s that consists of lowercase English letters. A string is called special if it is made up of only
Non-overlapping Intervals
Given a 2D array intervals[][] of representing intervals where intervals [i] = [starti, endi ]. Return the minimum number of intervals you need to remove to make
3152. Special Array II
An array is considered special if every pair of its adjacent elements contains two numbers with different parity. You are given an
Insert Interval
Geek has an array ofnon-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith event and intervals is sorted in ascending
2054. Two Best Non-Overlapping Events
You are given a 0-indexed 2D integer array of events where events[i] = [startTimei, endTimei, valuei]. The ith event starts at startTimeiand ends at endTimei, and if you attend
Overlapping Intervals
Given an arrayof Intervals arr[][], where arr[i] = [starti, endi]. The task is to merge all of the overlapping Intervals. Examples: Input: arr[][] =
1760. Minimum Limit of Balls in a Bag
You are given an integer array nums where the ith bag contains nums[i] balls. You are also given an integer maxOperations. You can perform the following operation
Count Inversions
Given an array of integers arr[]. Find the Inversion Count in the array.Two elements arr[i] and arr[j] form an inversion if arr[i] > arr[j] and i
2554. Maximum Number of Integers to Choose From a Range I
You are given an integer array banned and two integers n and maxSum. You are choosing some number of integers following the below rules: The
Find H-Index
Given an integer array citations[], where citations[i] is the number of citations a researcher received for the ith paper. The task is to find the H-index. H-Index is
2337. Move Pieces to Obtain a String
You are given two strings start and target, both of length n. Each string consists only of the characters ‘L’, ‘R’, and ‘_’ where: The characters ‘L’ and ‘R’ represent pieces, where a piece ‘L’ can