GamifiedGamified challengesPracticeRaceLeaderboardPricing

Learn data structures by watching them move, then doing it yourself. Press M anytime to toggle sound.

A product of Amypo Technologies, Coimbatore.

Learn

  • All topics
  • Learning path
  • How it works
  • About dotprep

Practice

  • Practice arena
  • Daily challenge
  • Gamified challenges
  • Race mode
  • Leaderboard

Interview prep

  • Java interview
  • Coding questions
  • Company questions
  • System design
  • Jobs & careers

You

  • Dashboard
  • Settings
  • Pricing
  • Create account

© 2026 dotprep

Content last updated 20 November 2026

GamifiedGamified challengesPracticeRaceLeaderboardPricing
Log inStart free
Gamified challengesSquare Root Digger

Gamified challenge · Binary search on an integer range

Square Root Digger

Given a whole number n ≥ 0 (up to 2³¹ − 1), write isqrt(n) that returns ⌊√n⌋: the largest whole r with r · r ≤ n. No sqrt, pow or ** 0.5: only whole-number arithmetic.

Example: isqrt(8) is 2 because 2² = 4 ≤ 8 < 9 = 3², and isqrt(16) is 4. Watch out in Java: mid * mid overflows an int once mid passes 46,340.

Sign in to play Square Root Digger

This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.

Sign in with Google

or log in with email · create an account