1837. Sum of Digits in Base K

Before I explain both solution I just want to say that for me the first solution is not as readable as the second solution but easyer to understand (Note: I wrote the first solution before the second solution so that might be why).

The first solution basicly uses the fact that n only goes up to 100 and that k has a range of 2 to 10

func sumBase(n int, k int) int {
	arr := make([]int, 7)
	res := 0
	product := 1
	for i := 0; i < 7; i++ {
		arr[len(arr) - i - 1] = product
		product *= k
	}
	
	counter := 0
	for n > 0 {
		res += n / arr[counter]
		n = n % arr[counter]
		counter++
	}
	return res
}

func sumBase(n int, k int) int {
	res := 0
	for n > 0 {
		res += n % k
		n /= k
	}
	return res
}