You're given a number and asked to write a function that checks whether that number is a perfect square. To solve this question, we are going to use #binary #search to iterate through the values less than the number given to see if we can find a square root. Happy Coding!
TIMESTAMPS
--------------------------------------------------------------------------------------------------------
Illustration: 00:00
Complexity analysis: 03:16
Code: 05:05
QUESTION LINKS
---------------------------------------------------------------------------------------------------------
Difficulty: Easy
Source Code: https://github.com/MichaelVandi/CodingInterview/blob/master/Easy/12_03_2020_valid_perfect_square.java
Problem Link: https://leetcode.com/problems/valid-perfect-square/
FIND ME HERE
--------------------------------------------------------------------------------------------------------
Website: https://mvandi.com
Instagram: https://www.instagram.com/mike_ehl_/
Twitter: https://twitter.com/michael_vandi
Github: https://github.com/MichaelVandi/
Flyte (Side Project): https://flyte-app.com
Evalu8 (Side Project): https://evalu8.xyz
