Tasks Details
medium
1.
Peaks
Divide an array into the maximum number of same-sized blocks, each of which should contain an index P such that A[P - 1] < A[P] > A[P + 1].
Task Score
100%
Correctness
100%
Performance
100%
A non-empty array A consisting of N integers is given.
A peak is an array element which is larger than its neighbors. More precisely, it is an index P such that 0 < P < N − 1, A[P − 1] < A[P] and A[P] > A[P + 1].
For example, the following array A:
A[0] = 1 A[1] = 2 A[2] = 3 A[3] = 4 A[4] = 3 A[5] = 4 A[6] = 1 A[7] = 2 A[8] = 3 A[9] = 4 A[10] = 6 A[11] = 2has exactly three peaks: 3, 5, 10.
We want to divide this array into blocks containing the same number of elements. More precisely, we want to choose a number K that will yield the following blocks:
- A[0], A[1], ..., A[K − 1],
- A[K], A[K + 1], ..., A[2K − 1],
...- A[N − K], A[N − K + 1], ..., A[N − 1].
What's more, every block should contain at least one peak. Notice that extreme elements of the blocks (for example A[K − 1] or A[K]) can also be peaks, but only if they have both neighbors (including one in an adjacent blocks).
The goal is to find the maximum number of blocks into which the array A can be divided.
Array A can be divided into blocks as follows:
- one block (1, 2, 3, 4, 3, 4, 1, 2, 3, 4, 6, 2). This block contains three peaks.
- two blocks (1, 2, 3, 4, 3, 4) and (1, 2, 3, 4, 6, 2). Every block has a peak.
- three blocks (1, 2, 3, 4), (3, 4, 1, 2), (3, 4, 6, 2). Every block has a peak. Notice in particular that the first block (1, 2, 3, 4) has a peak at A[3], because A[2] < A[3] > A[4], even though A[4] is in the adjacent block.
However, array A cannot be divided into four blocks, (1, 2, 3), (4, 3, 4), (1, 2, 3) and (4, 6, 2), because the (1, 2, 3) blocks do not contain a peak. Notice in particular that the (4, 3, 4) block contains two peaks: A[3] and A[5].
The maximum number of blocks that array A can be divided into is three.
Write a function:
func Solution(A []int) int
that, given a non-empty array A consisting of N integers, returns the maximum number of blocks into which A can be divided.
If A cannot be divided into some number of blocks, the function should return 0.
For example, given:
A[0] = 1 A[1] = 2 A[2] = 3 A[3] = 4 A[4] = 3 A[5] = 4 A[6] = 1 A[7] = 2 A[8] = 3 A[9] = 4 A[10] = 6 A[11] = 2the function should return 3, as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..100,000];
- each element of array A is an integer within the range [0..1,000,000,000].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Go
Time spent on task 10 minutes
Notes
not defined yet
Code: 14:14:31 UTC,
java,
autosave
Code: 14:14:41 UTC,
go,
autosave
Code: 14:15:17 UTC,
go,
autosave
Code: 14:15:27 UTC,
go,
autosave
Code: 14:15:46 UTC,
go,
autosave
Code: 14:15:56 UTC,
go,
autosave
Code: 14:16:16 UTC,
go,
autosave
Code: 14:16:40 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
}
Code: 14:17:10 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
for i := 1; i < length - 1; i++{
if A[i-1] < A[i]
}
}
Code: 14:17:29 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
for i := 1; i < length - 1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
}
}
}
Code: 14:17:58 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
for i := 1; i < length - 1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
}
}
Code: 14:18:24 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
for i := 1; i < length - 1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
}
Code: 14:18:34 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
for i := 1; i < length - 1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
}
Code: 14:18:46 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
for i := 1; i < length - 1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
}
Code: 14:19:04 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
for i := 1; i < length - 1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
}
}
Code: 14:19:18 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
for i := 1; i < length - 1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
}
}
Code: 14:19:28 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
for i := 1; i < length - 1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
}
}
Code: 14:19:38 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
for i := 1; i < length - 1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
lastPeak := 0
}
}
Code: 14:19:52 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
for i := 1; i < length - 1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
lastPeak := 0
for i :=
}
}
Code: 14:20:13 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
for i := 1; i < length - 1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
lastPeak := 0
for i := 1; i <= block; i++{
}
}
}
Code: 14:20:35 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
for i := 1; i < length - 1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
lastPeak := 0
for i := 1; i <= block; i++{
if peakArray[i*block-1]
}
}
}
Code: 14:20:45 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
for i := 1; i < length - 1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
lastPeak := 0
for i := 1; i <= block; i++{
if peakArray[i*block-1] >
}
}
}
Code: 14:21:21 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
for i := 1; i < length - 1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
lastPeak := 0
for i := 1; i <= block; i++{
if peakArray[i*block-1] > lastP
}
}
}
Code: 14:21:35 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
for i := 1; i < length - 1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
lastPeak := 0
for i := 1; i <= block; i++{
if peakArray[i*block-1] > lastPeak{
lastPeak = peakArray[i*block-1]
}
}
}
}
Code: 14:21:45 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
for i := 1; i < length - 1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
lastPeak := 0
for i := 1; i <= block; i++{
if peakArray[i*block-1] > lastPeak{
lastPeak = peakArray[i*block-1]
} else{
}
}
}
}
Code: 14:22:00 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
for i := 1; i < length - 1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
lastPeak := 0
ok := true
for i := 1; i <= block; i++{
if peakArray[i*block-1] > lastPeak{
lastPeak = peakArray[i*block-1]
} else{
ok = false
break
}
}
}
}
Code: 14:22:24 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
for i := 1; i < length - 1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
lastPeak := 0
ok := true
result := 0
for i := 1; i <= block; i++{
if peakArray[i*block-1] > lastPeak{
lastPeak = peakArray[i*block-1]
} else{
ok = false
break
}
}
if ok {
result = divisor
}
}
}
Code: 14:22:37 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
result := 0
for i := 1; i < length - 1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
lastPeak := 0
ok := true
for i := 1; i <= block; i++{
if peakArray[i*block-1] > lastPeak{
lastPeak = peakArray[i*block-1]
} else{
ok = false
break
}
}
if ok {
result = divisor
}
}
return result
}
Code: 14:22:45 UTC,
go,
verify,
result: Failed
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
result := 0
for i := 1; i < length - 1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
lastPeak := 0
ok := true
for i := 1; i <= block; i++{
if peakArray[i*block-1] > lastPeak{
lastPeak = peakArray[i*block-1]
} else{
ok = false
break
}
}
if ok {
result = divisor
}
}
return result
}
Analysis
expand all
Example tests
1.
0.001 s
RUNTIME ERROR,
tested program terminated with exit code 2
stderr:
panic: runtime error: index out of range goroutine 1 [running]: solution.Solution(0xc20803a060, 0xc, 0xc, 0x56c370) /tmp/workspace/src/solution/solution.go:34 +0x431 main.main() /tmp/workspace/src/main/exec.go:157 +0x1a0 goroutine 2 [runnable]: runtime.forcegchelper() /usr/local/go/src/runtime/proc.go:90 runtime.goexit() /usr/local/go/src/runtime/asm_amd64.s:2232 +0x1 goroutine 3 [runnable]: runtime.bgsweep() /usr/local/go/src/runtime/mgc0.go:82 runtime.goexit() /usr/local/go/src/runtime/asm_amd64.s:2232 +0x1 goroutine 4 [runnable]: runtime.runfinq() /usr/local/go/src/runtime/malloc.go:712 runtime.goexit() /usr/local/go/src/runtime/asm_amd64.s:2232 +0x1
Code: 14:23:07 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
result := 0
for i := 1; i < length; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
lastPeak := 0
ok := true
for i := 1; i <= block; i++{
if peakArray[i*block-1] > lastPeak{
lastPeak = peakArray[i*block-1]
} else{
ok = false
break
}
}
if ok {
result = divisor
}
}
return result
}
Code: 14:23:10 UTC,
go,
verify,
result: Failed
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
result := 0
for i := 1; i < length; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
lastPeak := 0
ok := true
for i := 1; i <= block; i++{
if peakArray[i*block-1] > lastPeak{
lastPeak = peakArray[i*block-1]
} else{
ok = false
break
}
}
if ok {
result = divisor
}
}
return result
}
Analysis
expand all
Example tests
1.
0.001 s
RUNTIME ERROR,
tested program terminated with exit code 2
stderr:
panic: runtime error: index out of range goroutine 1 [running]: solution.Solution(0xc20803a060, 0xc, 0xc, 0x56c370) /tmp/workspace/src/solution/solution.go:34 +0x42b main.main() /tmp/workspace/src/main/exec.go:157 +0x1a0 goroutine 2 [runnable]: runtime.forcegchelper() /usr/local/go/src/runtime/proc.go:90 runtime.goexit() /usr/local/go/src/runtime/asm_amd64.s:2232 +0x1 goroutine 3 [runnable]: runtime.bgsweep() /usr/local/go/src/runtime/mgc0.go:82 runtime.goexit() /usr/local/go/src/runtime/asm_amd64.s:2232 +0x1 goroutine 4 [runnable]: runtime.runfinq() /usr/local/go/src/runtime/malloc.go:712 runtime.goexit() /usr/local/go/src/runtime/asm_amd64.s:2232 +0x1
Code: 14:23:17 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
result := 0
for i := 1; i < length -1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
lastPeak := 0
ok := true
for i := 1; i <= block; i++{
if peakArray[i*block-1] > lastPeak{
lastPeak = peakArray[i*block-1]
} else{
ok = false
break
}
}
if ok {
result = divisor
}
}
return result
}
Code: 14:23:48 UTC,
go,
autosave
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
result := 0
for i := 1; i < length -1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
lastPeak := 0
ok := true
for i := 1; i <= divi; i++{
if peakArray[i*block-1] > lastPeak{
lastPeak = peakArray[i*block-1]
} else{
ok = false
break
}
}
if ok {
result = divisor
}
}
return result
}
Code: 14:23:50 UTC,
go,
verify,
result: Passed
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
result := 0
for i := 1; i < length -1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
lastPeak := 0
ok := true
for i := 1; i <= divisor; i++{
if peakArray[i*block-1] > lastPeak{
lastPeak = peakArray[i*block-1]
} else{
ok = false
break
}
}
if ok {
result = divisor
}
}
return result
}
Analysis
Code: 14:23:54 UTC,
go,
verify,
result: Passed
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
result := 0
for i := 1; i < length -1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
lastPeak := 0
ok := true
for i := 1; i <= divisor; i++{
if peakArray[i*block-1] > lastPeak{
lastPeak = peakArray[i*block-1]
} else{
ok = false
break
}
}
if ok {
result = divisor
}
}
return result
}
Analysis
Code: 14:23:57 UTC,
go,
final,
score:
100
package solution
// you can also use imports, for example:
// import "fmt"
// import "os"
// you can write to stdout for debugging purposes, e.g.
// fmt.Println("this is a debug message")
func Solution(A []int) int {
peaks := 0
var divisors []int
peakArray := []int{0}
length := len(A)
result := 0
for i := 1; i < length -1; i++{
if A[i-1] < A[i] && A[i] > A[i+1]{
peaks++
}
peakArray = append(peakArray, peaks)
if length % i == 0{
divisors = append(divisors, i)
}
}
peakArray = append(peakArray, peaks)
for _, divisor := range divisors{
block := length / divisor
lastPeak := 0
ok := true
for i := 1; i <= divisor; i++{
if peakArray[i*block-1] > lastPeak{
lastPeak = peakArray[i*block-1]
} else{
ok = false
break
}
}
if ok {
result = divisor
}
}
return result
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N * log(log(N)))
expand all
Correctness tests
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
0.001 s
OK
5.
0.001 s
OK
1.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
1.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
3.
0.001 s
OK
4.
0.001 s
OK
1.
0.001 s
OK
2.
0.001 s
OK
expand all
Performance tests
1.
0.001 s
OK
2.
0.001 s
OK
1.
0.001 s
OK
1.
0.008 s
OK
2.
0.004 s
OK
1.
0.008 s
OK
2.
0.008 s
OK
1.
0.012 s
OK
2.
0.020 s
OK