Browser tab content: Problem List
0
Debugging...
Run
Submit
00:00:00
Description
Editorial
Editorial
Solutions
Solutions
Submissions
Submissions
Code
Note
Note
Testcase
Testcase
Test Result
263. Ugly Number
Easy
Topics
Companies

An ugly number is a positive integer whose prime factors are limited to 2, 3, and 5.

Given an integer n, return true if n is an ugly number.

 

Example 1:

Input: n = 6
Output: true
Explanation: 6 = 2 × 3


Example 2:

Input: n = 1
Output: true
Explanation: 1 has no prime factors, therefore all of its prime factors are limited to 2, 3, and 5.


Example 3:

Input: n = 14
Output: false
Explanation: 14 is not ugly since it includes the prime factor 7.


 

Constraints:

-231 <= n <= 231 - 1
Seen this question in a real interview before?
1/5
Yes
No
Accepted
572.3K
Submissions
1.4M
Acceptance Rate
42.2%
Topics
Math
Companies
0 - 3 months
Google
3
0 - 6 months
Meta
2
Microsoft
2
6 months ago
Amazon
8
Bloomberg
7
Adobe
5
Apple
5
Uber
4
J.P. Morgan
3
Similar Questions
Happy Number
Easy
Count Primes
Medium
Ugly Number II
Medium
Discussion (88)
Choose a type
Preview
Comment
💡 Discussion Rules

1. Please don't post any solutions in this discussion.

2. The problem discussion is for asking questions about the problem or for sharing tips - anything except for solutions.

3. If you'd like to share your solution for feedback and ideas, please head to the solutions tab and post it there.

Sort by:Best
No comments yet.
1
2
3
4
5
6
9
Copyright ©️ 2024 LeetCode All rights reserved
3.5K
88
Java
Auto
1
2
3
4
5
class Solution {
    public boolean isUgly(int n) {
        
    }
}
Saved
Ln 1, Col 1
You must run your code first

Flatten 2D Vector - LeetCode

Problem List
Tag
189. Rotate Array

Med.

190. Reverse Bits

Easy

191. Number of 1 Bits

Easy

192. Word Frequency

Med.

193. Valid Phone Numbers

Easy

194. Transpose File

Med.

195. Tenth Line

Easy

196. Delete Duplicate Emails

Easy

197. Rising Temperature

Easy

198. House Robber

Med.

199. Binary Tree Right Side View

Med.

200. Number of Islands

Med.

201. Bitwise AND of Numbers Range

Med.

202. Happy Number

Easy

203. Remove Linked List Elements

Easy

204. Count Primes

Med.

205. Isomorphic Strings

Easy

206. Reverse Linked List

Easy

207. Course Schedule

Med.

208. Implement Trie (Prefix Tree)

Med.

209. Minimum Size Subarray Sum

Med.

210. Course Schedule II

Med.

211. Design Add and Search Words Data Structure

Med.

212. Word Search II

Hard

213. House Robber II

Med.

214. Shortest Palindrome

Hard

215. Kth Largest Element in an Array

Med.

216. Combination Sum III

Med.

217. Contains Duplicate

Easy

218. The Skyline Problem

Hard

219. Contains Duplicate II

Easy

220. Contains Duplicate III

Hard

221. Maximal Square

Med.

222. Count Complete Tree Nodes

Easy

223. Rectangle Area

Med.

224. Basic Calculator

Hard

225. Implement Stack using Queues

Easy

226. Invert Binary Tree

Easy

227. Basic Calculator II

Med.

228. Summary Ranges

Easy

229. Majority Element II

Med.

230. Kth Smallest Element in a BST

Med.

231. Power of Two

Easy

232. Implement Queue using Stacks

Easy

233. Number of Digit One

Hard

234. Palindrome Linked List

Easy

235. Lowest Common Ancestor of a Binary Search Tree

Med.

236. Lowest Common Ancestor of a Binary Tree

Med.

237. Delete Node in a Linked List

Med.

238. Product of Array Except Self

Med.

239. Sliding Window Maximum

Hard

240. Search a 2D Matrix II

Med.

241. Different Ways to Add Parentheses

Med.

242. Valid Anagram

Easy

243. Shortest Word Distance

Easy

244. Shortest Word Distance II

Med.

245. Shortest Word Distance III

Med.

246. Strobogrammatic Number

Easy

247. Strobogrammatic Number II

Med.

248. Strobogrammatic Number III

Hard

249. Group Shifted Strings

Med.

250. Count Univalue Subtrees

Med.

251. Flatten 2D Vector

Med.

252. Meeting Rooms

Easy

253. Meeting Rooms II

Med.

254. Factor Combinations

Med.

255. Verify Preorder Sequence in Binary Search Tree

Med.

256. Paint House

Med.

257. Binary Tree Paths

Easy

258. Add Digits

Easy

259. 3Sum Smaller

Med.

260. Single Number III

Med.

261. Graph Valid Tree

Med.

262. Trips and Users

Hard

263. Ugly Number

Easy

264. Ugly Number II

Med.

265. Paint House II

Hard

266. Palindrome Permutation

Easy

267. Palindrome Permutation II

Med.

268. Missing Number

Easy

269. Alien Dictionary

Hard

270. Closest Binary Search Tree Value

Easy

271. Encode and Decode Strings

Med.

272. Closest Binary Search Tree Value II

Hard

273. Integer to English Words

Hard

274. H-Index

Med.

275. H-Index II

Med.

276. Paint Fence

Med.

277. Find the Celebrity

Med.

278. First Bad Version

Easy

279. Perfect Squares

Med.

280. Wiggle Sort

Med.

281. Zigzag Iterator

Med.

282. Expression Add Operators

Hard

283. Move Zeroes

Easy

284. Peeking Iterator

Med.

285. Inorder Successor in BST

Med.

286. Walls and Gates

Med.

287. Find the Duplicate Number

Med.

288. Unique Word Abbreviation

Med.

289. Game of Life

Med.

290. Word Pattern

Easy

291. Word Pattern II

Med.

292. Nim Game

Easy

293. Flip Game

Easy

294. Flip Game II

Med.

295. Find Median from Data Stream

Hard

296. Best Meeting Point

Hard

297. Serialize and Deserialize Binary Tree

Hard

298. Binary Tree Longest Consecutive Sequence

Med.

299. Bulls and Cows

Med.

300. Longest Increasing Subsequence

Med.

301. Remove Invalid Parentheses

Hard

302. Smallest Rectangle Enclosing Black Pixels

Hard

303. Range Sum Query - Immutable

Easy

304. Range Sum Query 2D - Immutable

Med.

305. Number of Islands II

Hard

306. Additive Number

Med.

307. Range Sum Query - Mutable

Med.

308. Range Sum Query 2D - Mutable

Hard

309. Best Time to Buy and Sell Stock with Cooldown

Med.

310. Minimum Height Trees

Med.

311. Sparse Matrix Multiplication

Med.

312. Burst Balloons

Hard

313. Super Ugly Number

Med.

314. Binary Tree Vertical Order Traversal

Med.

315. Count of Smaller Numbers After Self

Hard

316. Remove Duplicate Letters

Med.

317. Shortest Distance from All Buildings

Hard

318. Maximum Product of Word Lengths

Med.

319. Bulb Switcher

Med.

320. Generalized Abbreviation

Med.

321. Create Maximum Number

Hard

322. Coin Change

Med.

323. Number of Connected Components in an Undirected Graph

Med.

324. Wiggle Sort II

Med.

325. Maximum Size Subarray Sum Equals k

Med.

326. Power of Three

Easy

327. Count of Range Sum

Hard

328. Odd Even Linked List

Med.

329. Longest Increasing Path in a Matrix

Hard

330. Patching Array

Hard

331. Verify Preorder Serialization of a Binary Tree

Med.

332. Reconstruct Itinerary

Hard

333. Largest BST Subtree

Med.

334. Increasing Triplet Subsequence

Med.

335. Self Crossing

Hard

336. Palindrome Pairs

Hard

337. House Robber III

Med.

338. Counting Bits

Easy

Give simple, common, and optimized Java solution.