In this Kata, you will be given a number in form of a string and an integer `k` and your task is to insert `k` commas into the string and determine which of the partitions is the largest. 

```
For example:
solve('1234',1) = 234 because ('1','234') or ('12','34') or ('123','4').
solve('1234',2) = 34 because ('1','2','34') or ('1','23','4') or ('12','3','4'). 
solve('1234',3) = 4
solve('2020',1) = 202
```

More examples in test cases. Good luck!

Please also try [Simple remove duplicates](https://www.codewars.com/kata/5ba38ba180824a86850000f7)

Source: codewars | Difficulty: EASY
Tags: Fundamentals

Starter code: def solve(st,k):
	

Solutions:
def solve(st, k):
	length = len(st) - k
	return max((int(st[i:i + length]) for i in range(k + 1)))


def solve(st, k):
	n = len(st) - k
	return max((int(st[i:i + n]) for i in range(len(st))))


def solve(st, k):
	a = len(st) - k
	q = [st[i:i + a] for i in range(0, len(st))]
	r = [int(item) for item in q]
	return max(r)


def solve(st, k):
	x = len(st) - k
	m = 0
	for i in range(len(str(st))):
		y = int(st[i:i + x])
		if y > m:
			m = y
	return m


def solve(s, k):
	n = len(s) - k
	return max((int(s[i:i + n]) for i in range(0, k + 1)))