From 92c153c7683e0eaba1ef3055a73b32adbc1d0144 Mon Sep 17 00:00:00 2001 From: Matej Focko Date: Sun, 13 Oct 2024 16:55:53 +0200 Subject: [PATCH] =?UTF-8?q?go:=20add=20=C2=AB2406.=20Divide=20Intervals=20?= =?UTF-8?q?Into=20Minimum=20Number=20of=20Groups=C2=BB?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit URL: https://leetcode.com/problems/divide-intervals-into-minimum-number-of-groups/ Signed-off-by: Matej Focko --- ...intervals-into-minimum-number-of-groups.go | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 go/divide-intervals-into-minimum-number-of-groups.go diff --git a/go/divide-intervals-into-minimum-number-of-groups.go b/go/divide-intervals-into-minimum-number-of-groups.go new file mode 100644 index 0000000..271cf53 --- /dev/null +++ b/go/divide-intervals-into-minimum-number-of-groups.go @@ -0,0 +1,27 @@ +package main + +func minGroups(intervals [][]int) int { + minStart, maxEnd := intervals[0][0], intervals[0][1] + for _, interval := range intervals { + start, end := interval[0], interval[1] + + minStart = min(minStart, start) + maxEnd = max(maxEnd, end) + } + + hits := make([]int, maxEnd+2) + for _, interval := range intervals { + start, end := interval[0], interval[1] + hits[start]++ + hits[end+1]-- + } + + concurrent, maxConcurrent := 0, 0 + for i := minStart; i <= maxEnd; i++ { + concurrent += hits[i] + + maxConcurrent = max(maxConcurrent, concurrent) + } + + return maxConcurrent +}