An array of distinct integers, find length of the longest sub array which contains numbers that can be arranged in a continuous sequence.
Tag - kadane’s algorithm java
An array of distinct integers, find length of the longest subarray which contains numbers that can be arranged in a continuous sequence.
we have discussed a solution that assumes that elements in given array are distinct. Here we discuss a solution that works even if the input array.
Java Programming - Maximum sum rectangle in a 2D matrix - Dynamic Programming - Given a 2D array, find the maximum sum subarray in it. For example
Java Programming - Largest Sum Contiguous Subarray - Dynamic Programming Write a program to find the sum of contiguous subarray within one-dimensional array
Given an array and a number k where k is smaller than size of array, we need to find the k’th smallest element in the given array.
C++ Programming number of contiguous subsequences - Mathematical Algorithms - Given a number as a string, write a function to find the number of substrings
