문제
FrogJmp coding task - Learn to Code - Codility
Count minimal number of jumps from position X to Y.
app.codility.com
결과
Test results - Codility
A small frog wants to get to the other side of the road. The frog is currently located at position X and wants to get to a position greater than or equal to Y. The small frog always jumps a fixed distance, D. Count the minimal number of jumps that the smal
app.codility.com
'🔥 PS(Problem Solving) 🔥 > Codility' 카테고리의 다른 글
| [Codility] Lesson 3 Time Complexity : TapeEquilibrium (0) | 2021.04.06 |
|---|---|
| [Codility] Lesson 3 Time Complexity : PermMissingElem (0) | 2021.04.06 |
| [Codility] Lesson 2 Arrays : OddOccurrencesInArray (0) | 2021.04.05 |
| [Codility] Lesson 2 Arrays : CyclicRotation (0) | 2021.04.02 |
| [Codility] Lessons 1 Iterations : BinaryGap (0) | 2021.04.02 |
댓글