FastPrepUgly Number

Ugly Number

SambaNova Systems logoSambaNova Systems● EasyNEW GRADPHONE SCREENONSITE INTERVIEW
Learn

Problem statement

Return whether n is a positive integer whose prime factors are limited to 2, 3, and 5. The number 1 is ugly because it has no prime factors.

Function

isUgly(n: int) → boolean

Examples

Example 1

n = 6return = true

6 equals 2 times 3.

Example 2

n = 1return = true

One has no prime factors.

Example 3

n = 14return = false

The factor 7 is forbidden.

Constraints

  • -2^31 <= n <= 2^31 - 1.

More SambaNova Systems problems

See SambaNova Systems hiring insights
public boolean isUgly(int n) {
    // write your code here
}
n6
expectedtrue
Checking account…