Longest Consecutive Subsequence
Given an array arr[] of non-negative integers. Find the length of the longest sub-sequence such that elements in the subsequence are consecutive integers, the consecutive […]
2466. Count Ways To Build Good Strings
Given the integers zero, one, low, and high, we can construct a string by starting with an empty string, and then at each step
Union of Arrays with Duplicates
Given two arrays a[] and b[],the task is to find the number of elements in the union between these two arrays. The Union of
1639. Number of Ways to Form a Target String Given a Dictionary
You are given a list of strings of the same length words and a string target. Your task is to form target using the given words under the
Calculating Subarray Sums Using Two Pointers
Efficient computation of subarray sums is a common problem in programming. One effective approach is the two-pointer technique, which allows
Intersection of Two arrays with Duplicate Elements
Given two integer arrays a[] and b[], you have to find the intersection of the two arrays. Intersection of two arrays is said to be elements that are
689. Maximum Sum of 3 Non-Overlapping Subarrays
Given an integer array nums and an integer k, find three non-overlapping subarrays of length k with maximum sum and return them. Return the result
494. Target Sum
You are given an integer array nums and an integer target. You want to build an expression out of nums by adding one of the
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