define a 'cache' decorator or just import from functools

It's way more than enough to solve that kata. If it's too slow, that means you didn't implement it correctly (using inappropriate constructs that make grow the time complexity (or at best it's constant factor) too much)

How do you get from 3 to 5?

horizontally or vertically, but not diagonally

No.

This hint helped me quite a lot :-) Thanks

Thanks!

34 56 64 76

There are 2380 combinations (1238 distinct), so you must have filtered too much.

The tests seem ok, I think it's a problem with your code, when pasting code here, please use markdown formatting as seen here

Use the following code to print the input (note that it logs all the tests until it reaches the one your code fails, so take a look at the last one)

import java.util.Arrays

fun crap(x: Array<CharArray>, bags: Int, cap: Int): String {
  println(Arrays.deepToString(x))
  ...

Remember to state the language you're having troubles with.

No, you don't have to sort.

37 == 7 * 5 + 2 == 9 * 4 + 1?