LeetCode 263 | Ugly Number | Solution Explained (Java)

Running Time: O(1)
Space Complexity: O(1)
The description reads:
"Write a program to check whether a given number is an ugly number.
Ugly numbers are positive numbers whose prime factors only include 2, 3, 5.
Example 1:
Input: 6
Output: true
Explanation: 6 = 2 × 3
Example 2:
Input: 8
Output: true
Explanation: 8 = 2 × 2 × 2
Example 3:
Input: 14
Output: false
Explanation: 14 is not ugly since it includes another prime factor 7."
Always be pluggin:
Slack Channel: join.slack.com...
Github: github.com/xav...
Facebook: / xavier.hollingsworth.3
Instagram: / xavierelon
LinkedIn: / xavier-hollingsworth-5...
Twitter: / elon_xavier

[@chaoschao9432]

I am watching, did a great job, thanks.

[@xavierelon]

Thanks man, I appreciate it

[@PiyushDuragkar]

keep up bro, we are watching, u have a good approach!!!

[@imranimmu4714]

Thank u

[@RC8787]

I am watching! Keep up the good work my man...