Two Sum – Pair with Given Sum
Given an array arr[] of positive integers and another integer target. Determine if there exists two distinct indices such that the sum of […]
3203. Find Minimum Diameter After Merging Two Trees
There exist two undirected trees with n and m nodes, numbered from 0 to n – 1 and from 0 to m – 1, respectively. You are given two 2D integer arrays edges1 and edges2 of lengths n
Search in a sorted Matrix
Given a strictly sorted 2D matrix mat[][] of size n x m anda number x. Find whether the number x is present in the matrix or not.Note:
2940. Find Building Where Alice and Bob Can Meet
You are given a 0-indexed array heights of positive integers, where heights[i] represents the height of the ith building. If a person is in building i, they can move
Search in a Row-Column sorted matrix
Given a 2D integer matrix mat[][] of size n x m, where every row and column is sorted in increasing order and
769. Max Chunks To Make Sorted
You are given an integer array arr of length n that represents a permutation of the integers in the range [0, n – 1]. We
Kth Missing Positive Number in a Sorted Array
Given a sorted array of distinct positive integers arr[], we need to find the kth positive number that is missing from arr[]. Examples
1475. Final Prices With a Special Discount in a Shop
You are given an integer array prices where prices[i] is the price of the ith item in a shop. There is a special discount for items
Allocate Minimum Pages
You are given an array arr[] of integers, where each element arr[i] represents the number of pages in the ith book. You also have
2182. Construct String With Repeat Limit
You are given a string s and an integer repeatLimit. Construct a new string repeatLimitedString using the characters of s such that no letter appears more than repeatLimit times in a
Aggressive Cows
You are given an array with unique elements of stalls[],which denote the position of a stall. You are also given an
3264. Final Array State After K Multiplication Operations I
Given two sorted arrays a[] and b[] and an element k, the task is to find the element that would be at the kth position of the