Codility lessons in Scala

Lessons from Codility implemented in Scala.

Iterations:

• BinaryGap (100%)

Arrays:

• CyclicRotation (100%)
• OddOccurrencesInArray (88%)

Time Complexity:

• Tape Equilibrium (100%)
• FrogJmp (100%)
• PermMissingElem (100%)

Counting Elements:

• PermCheck (100%)
• FrogRiverOne (100%)
• MissingInteger (100%)
• MaxCounters (88%)

Prefix Sums:

• PassingCars
• CountDiv
• GenomicRangeQuery
• MinAvgTwoSlice

Sorting:

• Triangle (93%)
• Distinct (100%)
• MaxProductOfThree (100%)
• NumberOfDiscIntersections

Stacks and Queues:

• Fish
• Brackets (100%)
• Nesting (100%)
• StoneWall

Leader:

• Dominator (91%)
• EquiLeader (11%)

Maximum Slice Problem:

• MaxDoubleSliceSum
• MaxSliceSum
• MaxProfit

Prime and Composite Numbers:

• CountFactors
• MinPerimeterRectangle
• Flags
• Peaks

License

Copyright 2015 Fabio Tiriticco / Fabway

Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

   http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.