Problem title
Difficulty
Avg time to solve

Regular Expression Match
Easy
10 mins
Interval List Intersection
Easy
15 mins
Find MSB In O(1)
Easy
10 mins
Number In AP
Moderate
15 mins
Break The Board
Easy
20 mins
Middle Of Three
Easy
15 mins
Least Greater Element
Moderate
30 mins
Ninja and his sword
Moderate
30 mins
Maximum equal sum stack
Easy
15 mins
Find Maximum number possible by doing at-most K swaps
Moderate
15 mins 4

# Split Array Into K Subarrays

Difficulty: EASY
Avg. time to solve
25 min
Success Rate
75%

Problem Statement

#### You are required to check if it is possible to split the array with the above condition and print the answer in the binary format 1 if it is possible or 0 if it is not possible to split the array.

##### For Example:
``````Input:
N = 4
M = 1
K = 3
A[] = {5, 4, 1, 1}

Output
1

The given array can be split like this , ,  there are three consecutive non-overlapping subarrays.
``````
##### Input Format:
``````The first line contains a single integer 'T' denoting the number of test cases to be run. Then the test cases follow.

The first line of each test case contains three space-separated integers ‘N’, ‘M’, and ‘K’, where  ‘N’ denotes the size of the array, ‘M’ denotes the size of subarray required and ‘K’ denotes the number of subarrays required.

The second line of each test case contains ‘N’ space - separated
integers denoting the elements of the given array.
``````
##### Output Format:
``````For each test case, print an integer  0 or 1. 1 if it is possible to split the array or 0 if it is not possible.

Output for each test case will be printed in a separate line.
``````
##### Note:
``````You are not required to print anything; it has already been taken care of. Just implement the function and return the answer.
``````
##### Constraints:
``````1 <= T <= 50
1 <= N, M, K <= 100000
1 <= A[i] <= 100000

Time Limit: 1 sec.
``````
##### Sample Input 1:
``````2
6 1 3
6 1 3 3 3 3
6 2 3
3 5 3 5 3 1
``````
##### Sample Output 1:
``````1
0
``````
##### Explanation For Sample Output 1:
``````In test case 1:

Here for this test case for the given test cases K consecutive
non-overlapping subarrays are {6}, {1}, {3}}. hence the answer is
1.

In test case 2:

For this test case, there is no possible way to divide the array,
``````
##### Sample Input 2:
``````2
5 3 2
4 3 5 2 5
5 1 2
3 2 2 2 2
``````
##### Sample Output 2:
``````0
1
``````   Console