PROBLEM DESCRIPTION Given two arrays of integers a[] and b[] of size n and m, the task is to check if a pair of values (one value from each array) exists such that swapping the elements of the pai...

PROBLEM DESCRIPTION Given an array of strings arr[] of length n representing non-negative integers, arrange them in a manner, such that, after concatenating them in order, it results in the larges...

PROBLEM DESCRIPTION The stock span problem is a financial problem where we have a series of n daily price quotes for a stock and we need to calculate the span of stocks price for all n days. The s...

PROBLEM DESCRIPTION Given an integer array coins[ ] of size N representing different denominations of currency and an integer sum, find the number of ways you can make sum by using different combi...

PROBLEM DESCRIPTION Given two sorted arrays arr1 and arr2 and an element k. The task is to find the element that would be at the kth position of the combined sorted array. geeksforgeeks SOLUTION...

PROBLEM DESCRIPTION The cost of stock on each day is given in an array A[] of size N. Find all the segments of days on which you buy and sell the stock such that the sum of difference between sell...

PROBLEM DESCRIPTION You are given a rectangular matrix, and your task is to return an array while traversing the matrix in spiral form. geeksforgeeks SOLUTION class Solution { // Function ...

PROBLEM DESCRIPTION Given an array arr[] of size N and an integer K. Find the maximum for each and every contiguous subarray of size K. geeksforgeeks SOLUTION class Solution { static ArrayL...

PROBLEM DESCRIPTION Given an array having both positive and negative integers. The task is to compute the length of the largest subarray with sum 0. geeksforgeeks SOLUTION class GfG { int m...

PROBLEM DESCRIPTION Given arrival and departure times of all trains that reach a railway station. Find the minimum number of platforms required for the railway station so that no train is kept wai...