zofy

import Data.List (isPrefixOf, intercalate)
import Data.List.Split
import Control.Monad

data Tree a = Empty | Node a [Tree a] deriving (Show, Eq)

type Zipper a = (Tree a, [Tree a], [Int])

_nthItem :: [a] -> Int -> a
_nthItem (x:xs) 1 = x

zofy

from itertools import chain, permutations as perm
from operator import ge, gt, le, lt


#  Algorithm for finding permutations by moving from permutation to next lexicographical permutation
#  for more info: https://www.nayuki.io/page/next-lexicographical-permutation-algorithm


def _suffix(cont, op):
	"""