Solution to Codility.com Coding Challenge 2nd Problem

second.py

import math

def move_element_at_index_to_last(i, l):
  return l[:i] + l[i + 1:] + [l[i]]

BEST = math.inf

def find(l, d):
  global BEST

  if d >= BEST:
    return BEST

  total = 0
  for i, el in enumerate(l):
    if total + el < 0:
      candidates = sorted(filter(lambda x: x[1] < 0, enumerate(l[:i + 1])), key=lambda x: x[1])
      reses = []
      for i, c in candidates:
        moved = move_element_at_index_to_last(i, l)
        solution_depth = find(moved, d + 1)
        if solution_depth < BEST:
          BEST = solution_depth
        reses.append(solution_depth)
      return min(reses)
    total += el
  return d

def solve(A):
  return find(A, 0)