Maximum Length of Repeated Subarray

In problem “Maximum Length of Repeated Subarray” we have given two arrays Array 1 and Array 2, your task is to find the maximum length of the sub-array that appears in both the arrays. Example Input: [1,2,3,2,1] [3,2,1,4,7] Output: 3 Explanation: Because the maximum length of sub-array is 3 and …

Read moreMaximum Length of Repeated Subarray

Length of the largest subarray with contiguous elements

The problem “Length of the largest subarray with contiguous elements” states that you are given an integer array. The problem statement asks to find out the length of the longest contiguous sub-array of which elements can be arranged in a sequence (continuous, either ascending or descending). The numbers in the …

Read moreLength of the largest subarray with contiguous elements

Generate all possible sorted arrays from alternate elements of two given sorted arrays

The problem “Generate all possible sorted arrays from alternate elements of two given sorted arrays” states that suppose you have two sorted arrays. The problem statement asks to find out all the possible sorted arrays, such that number should be arranged alternatively from the two given different arrays. Example ArrA[] …

Read moreGenerate all possible sorted arrays from alternate elements of two given sorted arrays

Maximize sum of consecutive differences in a circular array

Problem Statement Suppose you have an integer array. This array should be treated as a circular array. The last value of an array will be connected to the first array, an ⇒ a1. The problem “Maximize sum of consecutive differences in a circular array” asks to find out the maximum …

Read moreMaximize sum of consecutive differences in a circular array

BFS for Disconnected Graph

Problem Statement The problem “BFS for Disconnected Graph” states that you are given a disconnected directed graph, print the BFS traversal of the graph. Example The BFS traversal of the graph above gives: 0 1 2 5 3 4 6 Approach Breadth first Search (BFS) traversal for Disconnected Directed Graph …

Read moreBFS for Disconnected Graph

Count subarrays with equal number of 1’s and 0’s

Problem Statement The problem “Count subarrays with equal number of 1’s and 0’s” states that you are given an array consisting of 0’s and 1’s only. The problem statement asks to find out the count of sub-arrays consisting equal no of 0’s ad 1’s. Example arr[] = {0, 0, 1, …

Read moreCount subarrays with equal number of 1’s and 0’s