In this tutorial, I have explained valid perfect square LeetCode Java solution using binary search.
LeetCode May Challenge PlayList - https://www.youtube.com/watch?v=Usm-QCwTQcg&list=PLUg9hRlm7gxSX8aXepxe54oslSpMvmyh4
LeetCode April Challenge PlayList - https://www.youtube.com/watch?v=-I1pUv57WG8&list=PLUg9hRlm7gxT8mrwa_648iC8Ah42E0W1o
Given a positive integer num, We have to write a code to returns true if num is a perfect square else false.
Note: Do not use any built-in library function such as sqrt.
For Example -
Example 1:
Input: 25
output: true
Example 2:
Input: 19
output: false
Example 3:
Input: 1
output: true
Website - https://webrewrite.com/
Paypal - https://www.paypal.me/programmingtutorials
