Codility
1.BinaryGap
A binary gap within a positive integer N is any maximal sequence of consecutive zeros that is surrounded by ones at both ends in the binary
2.CyclicRotation
Rotation of the array means that each element is shifted right by one index, and the last element of the array is moved to the first place.
3.OddOccurrencesInArray
A non-empty array A consisting of N integers is given.
4.FrogJmp
A small frog wants to get to the other side of the road.
5.PermMissingElem
An array A consisting of N different integers is given.
6.TapeEquilibrium
A non-empty array A consisting of N integers is given.
7.FrogRiverOne
A small frog wants to get to the other side of a river.
8.PermCheck
A non-empty array A consisting of N integers is given.
9.MaxCounters
You are given N counters, initially set to 0, and you have two possible operations on them
10.MissingInteger
This is a demo task. Write a function: def solution(A)
11.PassingCars
A non-empty array A consisting of N integers is given.
12.CountDiv
Write a function that, given three integers A, B and K, returns the number of integers within the range [A..B] that are divisible by K
13.MinAvgTwoSlice
A non-empty array A consisting of N integers is given.
14.Triangle
An array A consisting of N integers is given.
15.Distinct
Write a function that, given an array A consisting of N integers, returns the number of distinct values in array A.
16.MaxProductOfThree
A non-empty array A consisting of N integers is given. The prod
17.NumberOfDiscIntersections
We draw N discs on a plane. The discs are numbered from 0 to N − 1.
18. Brackets
A string S consisting of N characters is considered to be properly nested if any of the following conditions is true
19.Fish
You are given two non-empty arrays A and B consisting of N integers.
20.Nesting
A string S consisting of N characters is called properly nested
21.StoneWall
You are going to build a stone wall.
22.Dominator
An array A consisting of N integers is given.
23.EquiLeader
A non-empty array A consisting of N integers is given.
24.MaxSliceSum
A non-empty array A consisting of N integers is given.
25.MaxProfit
An array A consisting of N integers is given.
26.MaxDoubleSliceSum
A non-empty array A consisting of N integers is given.
27.CountFactors
A positive integer D is a factor of a positive integer N if there exists an integer M such that N = D * M.
28.MinPerimeterRectangle
An integer N is given, representing the area of some rectangle.
29.Flags
A non-empty array A consisting of N integers is given.
30.ChocolatesByNumbers
Two positive integers N and M are given. Integer N represents the number of chocolates arranged in a circle, numbered from 0 to N − 1.
31.AbsDistinct
A non-empty array A consisting of N numbers is given.
32.MaxNonoverlappingSegments
Located on a line are N segments, numbered from 0 to N − 1, whose positions are given in arrays A and B.
33.TieRopes
There are N ropes numbered from 0 to N − 1, whose lengths are given in an array A, lying on the floor in a line.
34.LongestPassword
You would like to set a password for a bank account. However, there are three restrictions on the format of the password: