Formed in 2009, the Archive Team (not to be confused with the archive.org Archive-It Team) is a rogue archivist collective dedicated to saving copies of rapidly dying or deleted websites for the sake of history and digital heritage. The group is 100% composed of volunteers and interested parties, and has expanded into a large amount of related projects for saving online and digital history.
Practice codility lessons on Python.
| Lesson | Task | Categories |
|---|---|---|
| 1 - Iterations | BinaryGap | PAINLESS |
| 2 - Arrays | OddOccurrencesInArray | PAINLESS |
| 2 - Array | CyclicRotation | PAINLESS |
| 3 - Time Complexity | FrogJmp | PAINLESS |
| 3 - Time Complexity | PermMissingElem | PAINLESS |
| 3 - Time Complexity | TapeEquilibrium | PAINLESS |
| 4 - Counting Elements | PermCheck | PAINLESS |
| 4 - Counting Elements | FrogRiverOne | PAINLESS |
| 4 - Counting Elements | MissingInteger | RESPECTABLE |
| 4 - Counting Elements | MaxCounters | RESPECTABLE |
| 5 - Prefix Sums | PassingCars | PAINLESS |
| 5 - Prefix Sums | GenomicRangeQuery | RESPECTABLE |
| 5 - Prefix Sums | MinAvgTwoSlice | RESPECTABLE |
| 5 - Prefix Sums | CountDiv | RESPECTABLE |
| 6 - Sorting | Distinct | PAINLESS |
| 6 - Sorting | MaxProductOfThree | PAINLESS |
| 6 - Sorting | Triangle | PAINLESS |
| 6 - Sorting | NumberOfDiscIntersections | RESPECTABLE |
| 7 - Stacks and Queues | Brackets | PAINLESS |
| 7 - Stacks and Queues | Fish | PAINLESS |
| 7 - Stacks and Queues | StoneWall | PAINLESS |
| 7 - Stacks and Queues | Nesting | PAINLESS |
| 8 - Leader | EquiLeader | PAINLESS |
| 8 - Leader | Dominator | PAINLESS |
| 9 - Maximum slice problem | MaxSliceSum | PAINLESS |
| 9 - Maximum slice problem | MaxProfit | PAINLESS |
| 9 - Maximum slice problem | MaxDoubleSliceSum | RESPECTABLE |
| 10 - Prime and composite numbers | CountFactors | PAINLESS |
| 10 - Prime and composite numbers | MinPerimeterRectangle | PAINLESS |
| 10 - Prime and composite numbers | Peaks | RESPECTABLE |
| 10 - Prime and composite numbers | Flags | RESPECTABLE |
| 11 - Sieve of Eratosthenes | CountNonDivisible | RESPECTABLE |
| 11 - Sieve of Eratosthenes | CountSemiprimes | RESPECTABLE |
| 12 - Euclidean algorithm | ChocolatesByNumbers | PAINLESS |
| 12 - Euclidean algorithm | CommonPrimeDivisors | RESPECTABLE |
| 13 - Fibonacci numbers | FibFrog | RESPECTABLE |
| 13 - Fibonacci numbers | Ladder | RESPECTABLE |
| 14 - Binary search algorithm | MinMaxDivision | RESPECTABLE |
| 14 - Binary search algorithm | NailingPlanks | RESPECTABLE |
| 15 - Caterpillar method | AbsDistinct | PAINLESS |
| 15 - Caterpillar method | CountDistinctSlices | PAINLESS |
| 15 - Caterpillar method | CountTriangles | PAINLESS |
| 15 - Caterpillar method | MinAbsSumOfTwo | RESPECTABLE |
| 16 - Greedy algorithms | MaxNonoverlappingSegments | PAINLESS |
| 16 - Greedy algorithms | TieRopes | PAINLESS |
| 17 - Dynamic programming | NumberSolitaire | RESPECTABLE |
| 17 - Dynamic programming | MinAbsSum | AMBITIOUS |
