1792. Maximum Average Pass Ratio
There is a school that has classes of students and each class will be having a final exam. You are […]
Peak element
Given an array arr[] where no two adjacent elements are same, find the index of a peak element. An element is considered to be a peak if it
2762. Continuous Subarrays
You are given a 0-indexed integer array nums. A subarray of nums is called continuous if: Let i, i + 1, …, jbe the indices in the subarray. Then, for
2779. Maximum Beauty of an Array After Applying Operation
You are given a 0-indexed array nums and a non-negative integer k. In one operation, you can do the following: Choose an index i that hasn’t been chosen before from the
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