Ways to Split Array - Google GOCC

Problem Preview

"You are given an array A of distinct positive integers of length N. You need to find the number of ways to split the array into two non-empty contiguous subarrays such that: * Every element in the left subarray is strictly smaller than every element in the right subarray. The visible example is approximately: ### Problem N = 6 A = [8, 2, 10, 4, 11, 12] ### Output Output: 2 The explanation mentions that there are 2 valid partitions, but the exact partition indices are too blurry to read."