1 Iterations π
β’ BinaryGap
2 Arrays π
β’ CyclicRotation
β’ OddOccurrencesInArray
3 Time Complexity π
β’ FrogJmp
β’ PermMissingElem
β’ TapeEquilibrium
4 Counting Elements π
β’ PermCheck
β’ FrogRiverOne
β’ MaxCounters
β’ MissingInteger
5 Prefix Sums π
β’ PassingCars
β’ CountDiv
β’ GenomicRangeQuery
β’ MinAvgTwoSlice
6 Sorting π
β’ Distinct
β’ MaxProductOfThree
β’ Triangle
β’ NumberOfDiscIntersections β οΈ
7 Stack & Queues π
β’ Nesting
β’ Fish
β’ Brackets
β’ StoneWall β οΈ
8 Leader π
β’ Dominator
β’ EquiLeader β οΈ
9 Maximum slice problem π
β’ MaxSliceSum
β’ MaxProfit
β’ MaxDoubleSliceSum β οΈ
10 Prime and composite numbers π
β’ CountFactors
β’ MinPerimeterRectangle
β’ Flags β οΈ
β’ Peaks β οΈ
11 Sieve of Eratosthenes π
β’ CountNonDivisible β οΈ
β’ CountSemiprimes β οΈ
12 Euclidean algorithm π
β’ ChocolatesByNumber
β’ CommonPrimeDivisors β οΈ
13 Fibonacci numbers π
β’ FibFrog β οΈ
β’ Ladder β οΈ
14 Binary search algorithm π
β’ MinMaxDivision β οΈ
β’ NailingPlanks β οΈ
15 Caterpillar method π
β’ CountDistinctSlices β οΈ
β’ CountTriangles β οΈ
β’ AbsDistinct
β’ MinAbsSumOfTwo β οΈ
16 Greedy algorithms π
β’ MaxNonOverlappingSegments β οΈ
β’ TieRopes β οΈ
17 Dynamic programming π
β’ NumberSolitaire β οΈ
β’ MinAbsSum β οΈ
β’ SqlSum
β’ StrSymmetryPoint
β’ TreeHeight β οΈ
β’ ArrayInversionCount β οΈ
β’ PolygonConcavityIndex β οΈ