You are using an outdated browser. For a faster, safer browsing experience, upgrade for free today.
The winner of the previous round held on 20th June 2020 is

Balu Vadivel (balu15gb@gmail.com),
Diploma in Computer Engineering.
Congrats Balu!
The challenge for this round is as follows.
Problem statement

Given an array of positive integers, split the array into N number of arrays such that the sum of the individual elements of each array are equal. If the array cannot be partitioned, then display a message that it cannot be partitioned. The expected inputs and outputs are given below.

Example 1: Positive Case where the array can be split into 3 arrays.

Enter the size of the array:

  • 6

Enter the elements of the array:

  • 3, 7, 8, 10, 5, 12

Thank you for entering the details of the array. This array can be split into 3 arrays whose sum equals 15.

The arrays elements are as follows:

  • Array 1: {3, 12}
  • Array 2: {7, 8}
  • Array 3: {10, 5}

Example 2: Negative case where the array cannot be split into N number of arrays.

Enter the size of the array:

  • 8

Enter the elements of the array:

  • 4, 2, 8, 10, 14, 13, 11, 7

Thank you for entering the details of the array. Sorry, this array cannot be split.


Please submit your solutions to below address

ksrcodechallenge@xenovex.com