Here are my solutions to the codility lessons. You can find the lessons here.

Details Legend: D = Difficulty; TS = Task Score; C = Completeness; P = Performance; TC = Time Complexity

Task - Solution	Details
Lesson 1 - Iterations
BinaryGap.cpp
Lesson 2 - Arrays
CyclicRotation.cpp
OddOccurencesInArray.cpp
Lesson 3 - Time Complexity
PermMissingElem.cpp
FrogJmp - FrogJmp.cpp
TapeEquilibrium.cpp
Lesson 4 - Counting Elements
PermCheck.cpp
FrogRiverOne.cpp
MaxCounters.cpp
MissingInteger.cpp
Lesson 5 - Prefix Sums
PassingCars.cpp
GenomicRangeQuery.cpp
MinAvgTwoSlice.cpp
CountDiv.cpp
Lesson 6 - Sorting
Distinct.cpp
Triangle.cpp
MaxProductOfThree.cpp
NumberOfDiscIntersections
Lesson 7 - Stacks and Queues
Brackets.cpp
Nesting.cpp
StoneWall.cpp
Fish.cpp
Lesson 8 - Leader
EquiLeader.cpp
Dominator.cpp
Lesson 9 - Maximum Slice Problem
MaxSliceSum.cpp
MaxProfit.cpp
MaxDoubleSliceSum
Lesson 10 - Prime and Composite Numbers
CountFactors.cpp
MinPerimeterRectangle.cpp
Peaks
Flags
Lesson 11 - Sieve Of Eratosthenes
CountNonDivisible.cpp
CountSemiprimes
Lesson 12 - Euclidean Algorithm
ChocolatesByNumbers.cpp
CommonPrimeDivisors
Lesson 13 - Fibonacci Numbers
FibFrog.cpp
Ladder
Lesson 14 - Binary Search Algorithm
MinMaxDivision.cpp
NailingPlanks.cpp
Lesson 15 - Caterpillar Method
AbsDistinct.cpp
CountDistinctSlices.cpp
CountTriangles.cpp
MinAbsSumOfTwo
Lesson 16 - Greedy Algorithms
MaxNonoverlappingSegments.cpp
TieRopes.cpp
Lesson 17 - Dynamic Programming
NumberSolitaire
MinAbsSum