Kangaroo (Number Line Jumps) | Hackerrank Solution | Golang

Kangaroo (Number Line Jumps). O(n) time & O(1) space complexity.
NOTE: n (time complexity) is depends to each kangaroos starting point and speed which determine duration while they meet each others in same point.

🌐 Website: https://ivanauliaa.netlify.app/

📝 Helpers: https://github.com/ivanauliaa/cp-helpers

🔔 Subscribe: https://www.youtube.com/channel/UCnTUAVecF2J7FNUWG9iD0TA
📷 Instagram: https://www.instagram.com/ivanauliaa.dev
🔣 LinkedIn: https://www.linkedin.com/in/ivanauliaa
🎯 GitHub: https://github.com/ivanauliaa

#kangaroo #numberlineofjumps #numberlinejumps #howtosolve #hackerrank #hackerranksolutions #hackersrealm #warmup #problemsolving #tutorial #algorithms #datastructures #programming #coding #codinginterview #education #golang #javascript #java #flutter #react #android #ios #uiux #python #cpc #competitiveprogramming

Скачать видео