Given an array with n integers, you need to find if there are triplets (i, j, k) which satisfies following conditions: 0 < i, i + 1 < j, j + 1 < k < n - 1 Sum of subarrays (0, i - 1), (i + 1, j - 1), ...
// Given an integer array A of size N, check if the input array can be splitted in two parts such that - // - Sum of both parts is equal // - All elements in the input, which are divisible by 5 should ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results