Golang exercises

This repo will contain exercises with golang.

excercises

(Missing Integer) - Return the smallest positive integer greater than 0 that does not occur in slice
(Binary Gap) - Find longest sequence of zeros in binary representation of an integer.
(Reverse slice) - Takes a slice of int and returns the reverse content.
(Length of Winter) - Splits the slice of temperatures into winter and summer and returns the length of winter.
(Odd Ocurrences in Slice) - Finds the unpair element in the slice
(Cyclic Rotation) - Rotate an array to the right N indexes
(Simple Query) - Returns the number of elements in slice A that are less then or equal to each element in B
(Perm Missing Element) - Find that missing element in a N+1 slice
(Frog Jump) - Count the minimal number of jumps that the small frog must perform to reach its target.
(TapeEquilibrium) - Given a non-empty zero-indexed array A of N integers, returns the minimal difference that can be achieved.
(PermCheck) - Given a zero-indexed array A, returns 1 if array A is a permutation and 0 if it is not.
(MissingInteger) -Find the smallest positive integer that does not occur in a given sequence.
(FrogRiverOne) -Find the earliest time when the frog can jump to the other side of the river.