ProDeveloperTutorial.com

Problem Statement: Given a bianry array and a value k, you need to find the count of sub array sum whose sum is equal to k. Example: Input:…

Problem Statement: You are given a array with sum k. You need to find the number of subarrays with sum k. Example:   Input: arr = [1, 2,…

Problem Statement: You are given an array, and a value K, find the length of the longest subarray. Example: Input: arr = [1, 2, 3, 4], k = 4…

Problem Statement: You are given an array with +ve and -ve integers, find the length of the longest subarray with sum 0. Example: Input: arr[]…

Problem Statement: You are given a prefix sum array. You need to find the original array. Example:   Input: [1, 3, 6, 10] Output: [1, 2,…

Problem Statement: Given an array, you need to find the maximum value of prefix sum which is also suffix sum for index i in arr[] Example:…

Problem Statement: You are given an array, you need to find the bitwise or of sum of all the sub sequence of the array. Example: Input: arr []…

Problem Statement: You are given an array, you need to find Equilibrium Index. Equilibrium Index meaning, an index such that the sum of all…

Problem Statement: You are given intervals [start, end], return the minimum number of intervals that you need to remove to make the rest of…

Problem Statement: You are given an array where in arr[s][e], will represent the start and end time of the meeting. You need to check if it is…