Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/charles-wangkai/codility
/ functions
Functions
167 in github.com/charles-wangkai/codility
⨍
Functions
167
◇
Types & classes
77
Method
solution
(int[] A)
Distinct.java:5
Method
solution
(int[] A, int[] B, int[] C)
NailingPlanks.java:2
Method
solution
(int[] A)
Dominator.java:2
Method
solution
(String S)
Brackets.java:4
Method
solution
(int N)
CountFactors.java:2
Method
solution
(int X, int Y, int D)
FrogJmp.java:2
Method
solution
(int N, int[] P, int[] Q)
CountSemiprimes.java:5
Method
solution
(int[] A)
PrefixSet.java:2
Method
solution
(int[] A)
Peaks.java:2
Method
solution
(int[] A)
HamiltonianRoutesCount.java:7
Method
solution
(int[] A)
MaxSliceSum.java:2
Method
solution
(int[] A, int[] B)
CommonPrimeDivisors.java:2
Method
solution
(int K, int[] A)
TieRopes.java:2
Method
solution
(int N, int[] A)
MaxCounters.java:2
Method
solution
(int N)
MinPerimeterRectangle.java:2
Method
solution
(String S)
StrSymmetryPoint.java:2
Method
solution
(int[] A, int[] B)
Cannonballs.java:4
Method
solution
(String S, String T, int K)
KSparseBinaryCount.java:7
Method
solution
(int[] A)
NumberSolitaire.java:2
Method
solution
(int A, int B, int K)
CountDiv.java:2
Method
solution
(int[] A)
CountNonDivisible.java:2
Method
solution
(String S)
Nesting.java:2
Method
solution
(int[] A)
PassingCars.java:4
Method
solution
(String S)
NumberOfZeros.java:9
Method
solution
(int[] A)
EquiLeader.java:2
Method
solution
(int[] A)
AbsDistinct.java:2
Method
solution
(int N, int M)
ChocolatesByNumbers.java:2
Method
solution
(int[] A)
CartesianSequence.java:5
Method
solution
(int[][] A, int K)
BallSwitchBoard.java:2
Method
solution
(int N, int M)
PowerFib.java:20
Method
solution
(int A)
HitTheNumber.java:2
Method
solution
(int N)
BinaryGap.java:2
Method
solution
(int[] A)
Triangle.java:4
Method
solution
(int[] A)
MaxProfit.java:2
Method
solution
(int[] A)
MinAbsSumOfTwo.java:4
Method
solution
(int[] A)
MaxProductOfThree.java:4
Method
solution
(int[] A)
ArrayClosestAscenders.java:4
Method
solution
(int[] A)
Flags.java:2
Method
solution
(int[] T)
MinRouterPeripherality.java:4
Method
solution
(int[] H)
StoneWall.java:5
Method
solution
(int N, int M)
TilingsCount.java:4
Method
solution
(int[] A, int[] B)
Ladder.java:5
Method
solution
(int[] T, int[] D)
SpaceCrews.java:7
Method
solution
(int[] A)
MissingInteger.java:5
Method
solution
(int[] A)
MinAbsSum.java:2
Method
solution
(int[] A)
PermMissingElem.java:2
Method
solution
(int[] A)
ArrayInversionCount.java:4
Method
solution
(int[] A)
MinAvgTwoSlice.java:2
Method
solution
(int[] A, int[] B)
MaxNonoverlappingSegments.java:2
Method
solution
(String S)
CountPalindromicSlices.java:5
Method
solution
(int[] A, int[] B)
Fish.java:4
Method
solution
(String S, int[] P, int[] Q)
GenomicRangeQuery.java:5
Method
solution
(int[] A)
ShortestAdjSeq.java:11
Method
solution
(int[] A)
CountTriangles.java:4
Method
solution
(int[] A)
TapeEquilibrium.java:2
Method
solution
(int M, int[] A)
CountDistinctSlices.java:4
Method
solution
(int[] A)
FibFrog.java:6
Method
solution
(int[] A, int[] B, int[] P, int[] Q, int[] R, int[] S)
DoubleMedian.java:4
Method
solution
(Tree T)
TreeHeight.java:8
Method
solution
(int[] A)
NumberOfDiscIntersections.java:6
Method
solution
(int[][] C)
TorusLot.java:2
Method
solution
(int[] A, int[] B)
Minfuds.java:10
Method
solution
(int X, int[] A)
FrogRiverOne.java:2
Method
solution
(int[] A)
OddOccurrencesInArray.java:2
Method
solution
(int[] D, int[] P, int T)
GasStations.java:7
Method
solution
(int K, int M, int[] A)
MinMaxDivision.java:2
Method
solution
(int[] A)
MaxDoubleSliceSum.java:2
← previous
101–167 of 167, ranked by callers