It's much more difficult than 6 kyu~

5 or 4!

Thanks! it does help a lot~

The window will always be 2 x 2.

what does this mean? can any help? thanks~

maybe we need more examples, like N = 1 and N = 2... only N = 3, is too hard to guess what to do....

Nice solution!

x % sum(map(int, str(x))) could be better, add one more parm.

de gen(n, curSum):
  ...
  if x % (curSum+i): continue
  ....
  for y in gen(x, curSum + i):
  ...

Spoiler flag plz.

hint: don't use max(list), it's O(n) time complexity, and total will be $O(n^2)$ , time out.

and list.index(item) is $O(n)$, too.

Nice kata~thanks!!!

very very very excellent practice of DFS and traceback~

A very nice Kata!

Nice kata,

a small hint: you can return one of any valid array(solution), maybe there are more than one valid solution.

and the label could add "graph".

maybe 4kyu.

1e1 == '10', false....

I have to hard coding 'e', feel not good about it ~

String contains only uppercase letters and digits.

digits? "0", "1","8","6","9","0" may should be added into test cases too~~

one func one return, is a good code-habit~

Sudoku~

solve it~

very enjoy~

Thanks ,cool kata!~