Search
⌘K
Get Premium
Leetcode 367. Valid Perfect Square
Determine whether a positive integer is a perfect square without using built-in sqrt — i.e., decide if there exists an integer x such that x*x == num (1 ≤ num ≤ 2^31−1).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.