How mickey0521/codility works
This repository is a collection of independent Java solutions to Codility lesson problems, rather than a single application. The principal workflow is a caller supplying a problem’s inputs to that problem’s solution method and receiving its result; the files do not form a shared runtime pipeline. The graph groups representative solutions by their lesson topics and includes the documented algorithm families. Source sampling confirms implementation details for only some files, so unsampled solutions are represented only at their documented paths, without inferred internal calls.
Main entry points: BinaryGap.java Binary gap · OddOccurrencesInArray.java Odd occurrences · CyclicRotation.java Cyclic rotation · FrogJmp.java Frog jump
Components 33
Arrays and Counting
- Binary gap
BinaryGap.java - Odd occurrences
OddOccurrencesInArray.java - Cyclic rotation
CyclicRotation.java - Frog jump
FrogJmp.java - River crossing
FrogRiverOne.java - Missing integer
MissingInteger.java - Max counters
MaxCounters.java
Prefixes and Sorting
- Genomic queries
GenomicRangeQuery.java - Passing cars
PassingCars.java - Minimum average
MinAvgTwoSlice.java - Distinct values
Distinct.java - Triangle test
Triangle.java - Disc intersections
NumberOfDiscIntersections.java
Stacks and Leaders
- Brackets
Brackets.java - Fish survival
Fish.java - Stone wall
StoneWall.java - Dominator
Dominator.java - Equi leader
EquiLeader.java
Number Theory
- Count factors
CountFactors.java - Count semiprimes
CountSemiprimes.java - Count non-divisors
CountNonDivisible.java - Chocolates by numbers
ChocolatesByNumbers.java
Advanced Algorithms
- Maximum slice
MaxSliceSum.java - Maximum double slice
MaxDoubleSliceSum.java - Peak blocks
Peaks.java - Ladder ways
Ladder.java - Fibonacci frog
FibFrog.java - Min-max division
MinMaxDivision.java - Nonoverlapping segments
MaxNonoverlappingSegments.java - Distinct slices
CountDistinctSlices.java - Count triangles
CountTriangles.java - Number solitaire
NumberSolitaire.java
Other components
- Problem caller
Connections 48
- Problem caller → Binary gap: submits input
- Binary gap → Problem caller: returns result
- Problem caller → Odd occurrences: submits input
- Odd occurrences → Problem caller: returns result
- Problem caller → Cyclic rotation: submits input
- Cyclic rotation → Problem caller: returns result
- Problem caller → Frog jump: submits input
- Frog jump → Problem caller: returns result
- Problem caller → River crossing: submits input
- River crossing → Problem caller: returns result
- Problem caller → Missing integer: submits input
- Missing integer → Problem caller: returns result
- Problem caller → Max counters: submits input
- Max counters → Problem caller: returns result
- Problem caller → Genomic queries: submits input
- Genomic queries → Problem caller: returns result
- Problem caller → Passing cars: submits input
- Passing cars → Problem caller: returns result
- Problem caller → Minimum average: submits input
- Minimum average → Problem caller: returns result
- Problem caller → Distinct values: submits input
- Distinct values → Problem caller: returns result
- Problem caller → Triangle test: submits input
- Triangle test → Problem caller: returns result
- Problem caller → Disc intersections: submits input
- Disc intersections → Problem caller: returns result
- Problem caller → Brackets: submits input
- Brackets → Problem caller: returns result
- Problem caller → Fish survival: submits input
- Fish survival → Problem caller: returns result
- Problem caller → Stone wall: submits input
- Stone wall → Problem caller: returns result
- Problem caller → Dominator: submits input
- Dominator → Problem caller: returns result
- Problem caller → Equi leader: submits input
- Equi leader → Problem caller: returns result
- Problem caller → Count factors: submits input
- Count factors → Problem caller: returns result
- Problem caller → Count semiprimes: submits input
- Count semiprimes → Problem caller: returns result
- Problem caller → Count non-divisors: submits input
- Count non-divisors → Problem caller: returns result
- Problem caller → Chocolates by numbers: submits input
- Chocolates by numbers → Problem caller: returns result
- Problem caller → Maximum slice: submits input
- Maximum slice → Problem caller: returns result
- Problem caller → Maximum double slice: submits input
- Maximum double slice → Problem caller: returns result