## Find maximum absolute difference between sum of two non-overlapping sub-arrays

Given an array, find the maximum absolute difference between sum of elements of two non-overlapping sub-arrays in linear time.

Coding made easy

Given an array, find the maximum absolute difference between sum of elements of two non-overlapping sub-arrays in linear time.

Given a directed weighted graph, report a negative-weight cycle in the graph if any. A negative-weight cycle is a cycle in graph whose edges sum to a negative value.

Given an array of pairs of integers, find all symmetric pairs i.e. pairs that are mirror of each other. For instance, pairs (x, y) and (y, x) are mirrors of each other.

Write a efficient algorithm to construct the longest palindrome by shuffling or deleting characters from a given string.

Given an array of integers, partition the array into two sub-arrays having the same sum of elements.

Given an array and an integer k, find the count of distinct elements in every sub-array of size k in the array.

Given a string and a pattern (having all distinct characters), determine if characters of the string follows specific order as defined by characters of the pattern.

Given an array of integers between 0 to 9, find two numbers with maximum sum formed by using all digits of the array. The difference in number of digits of the two numbers should be ± 1.

Given an array of integers, print all maximum size sub-arrays having all distinct elements in them.

Given an array of integers, find a triplet having maximum product in the array.

Write a program to count number of ways to calculate a target number from elements of specified array by using only addition and subtraction operator. The use of any other operator is forbidden.

Given an array of integers, find minimum index of a repeating element in linear time and doing just one traversal of the array.