When solving using C#

35 is a perfect power
Expected: not null
But was: null

Description is confusing could be improved:
It could be explained in many ways, but these two descriptions should reduce the confusion:

1. Highlighting process of adding the smallest number to the total:
   "How many operations of addition we need to reach a sum which is equal to or greater than the given number (k)
   while adding only the next smallest number from the array."
2. Highlighting sub-array length:
   "What is minimum length of the sub-array whose sum is equal to or greater than the given number (k)"
   (Optionally: given the elements of the array are non-descreasing.)

Could you please suggestion what should the random tests test?

The description is updated.

Thank you,
I have corrected them.

Thanks for you feedback,

1. What do you mean by fixed tests? The ones listed are not enough or ?
2. Edge cases I understand. I will include them.
3. What do you mean by changing the behaviour of the builtin function? Could you please be more specific?
4. From the suggestions, I didn't find anything that was close to this.
5. What is the point of so many tests cases? To check if your algorithm is fast enough for larger inputs.

I updated the description with these:
If there number is 912 or 127 or 833:
912 := [9,7,5,3,1]
127 := []
833 := [8 5]

Now it is marked as resolved.

It is resolved.

I removed the '(s)' from the description, 's' was meant to represent the argument.

Corrected these.

Just added them.

Try using regex :)

I don't understand why is failing in the 11th test!
Is there an issue with the test cases?