Skydancer

[Codility Lessons] FrogRiverOne(8/n)

less than 1 minute read

[Lesson4] Counting Elements FrogRiverOne : Find the earliest time when a frog can jump to the other side of a river.

less than 1 minute read

[Lesson4] Counting Elements PermCheck : Check whether array A is a permutation.

less than 1 minute read

[Lesson3] Time Complexity FrogJmp : Count minimal number of jumps from position X to Y.

less than 1 minute read

[Lesson3] Time Complexity PermMissingElem : Find the missing element in a given permutation.

less than 1 minute read

[Lesson3] Time Complexity TapeEquilibrium : Minimize the value |(A[0] + … + A[P-1]) - (A[P] + … + A[N-1])|.