Code Heist

 Write a method to check if a number is ugly number or not.   Note: An Ugly number is a positive integer whose prime factors are limited to 2, 3 and 5.   Example 1: Input: n = 6 Output: true Explanation: 6 = 2 × 3 Example 2: Input: n = 8 Output: true Explanation: 8 = 2 × 2 × 2 Example 3: Input: n = 14 Output: false Explanation: 14 is not ugly since it includes the prime factor 7. Example 4: Input: n = 1 Output: true Explanation: 1 has no prime factors, therefore all of its prime factors are limited to 2, 3, and 5. Solution: Java: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 public static boolean isUgly ( int n) { if (n== 0 ) return false ; while (n% 2 == 0 ) n=n/ 2 ; while (n% 3 == 0 ) n=n/ 3 ; while (n% 5 == 0 ) n=n/ 5 ; if (n== 1 ) return true ; else return false ; } Python: def isUgly(n): ...