nleiva

package main

import (
	"fmt"
	"sort"
)

type Slice []int

func (a Slice) Len() int           { return len(a) }

nleiva

// Slice implements sort.Interface
type Slice []int

func (a Slice) Len() int           { return len(a) }
func (a Slice) Swap(i, j int)      { a[i], a[j] = a[j], a[i] }
func (a Slice) Less(i, j int) bool { return a[i] < a[j] }

func combine(n int, k int) [][]int {
	a := []int{}
	for i := 1; i <= n; i++ {

nleiva

func findMaxConsecutiveOnes(nums []int) int {
	total := 0
	max := 0
	for i := 0; i < len(nums); i++ {
		if nums[i] == 1 {
			total++
			if total > max {
				max = total
			}
		} else {