feat: Add continuousmax task.

Author: goloroden

continuousmax/documentation.go

@@ -0,0 +1,3 @@
+// Package continuousmax implements a function to calculate the maximum value
+// of a sliding window over a slice of integers.
+package continuousmax

continuousmax/get_max.go

@@ -0,0 +1,38 @@
+package continuousmax
+
+import (
+	"errors"
+)
+
+func GetMax(values []int, k int) ([]int, error) {
+	if len(values) == 0 {
+		return []int{}, nil
+	}
+	if k <= 0 {
+		return nil, errors.New("k must be greater than 0")
+	}
+	if k > len(values) {
+		return nil, errors.New("k must be less than or equal to the length of values")
+	}
+
+	maxValues := make([]int, 0, len(values)-k+1)
+
+	var window []int
+	for i := 0; i < len(values); i++ {
+		if len(window) > 0 && window[0] <= i-k {
+			window = window[1:]
+		}
+
+		for len(window) > 0 && values[window[len(window)-1]] <= values[i] {
+			window = window[:len(window)-1]
+		}
+
+		window = append(window, i)
+
+		if i >= k-1 {
+			maxValues = append(maxValues, values[window[0]])
+		}
+	}
+
+	return maxValues, nil
+}

continuousmax/get_max_test.go

@@ -0,0 +1,18 @@
+package continuousmax_test
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+	"github.com/thenativeweb/codingcircle/continuousmax"
+)
+
+func TestGetMax(t *testing.T) {
+	values := []int{27, 9, 17, 2, 12, 8}
+	windowSize := 3
+
+	maxValues, err := continuousmax.GetMax(values, windowSize)
+
+	assert.NoError(t, err)
+	assert.Equal(t, []int{27, 17, 17, 12}, maxValues)
+}