Project L
Ctrlk
  • Preface
  • Part 1
    • Introduction
    • Before We Begin
    • Basic Data Structures
      • Array and String
      • Hashing
      • Linked List
      • Stack
      • Queue
      • Binary Tree
      • Priority Queue
        • Top K Largest Numbers
        • Top K Frequent Elements
        • K Closest Points
        • Kth Smallest Element in a Sorted Matrix
        • Find Median from Data Stream
        • Ugly Number
        • Merge K Sorted Arrays
        • Sliding Window Median
        • 🧵Reorganize String
  • Part 2
    • Divide and Conquer
    • Graph Search
    • Greedy Algorithm
    • Dynamic Programming
  • Part 3
    • Advanced Topics
  • Part 4
    • Advanced Data Structures
  • Part 5
    • System Design
    • References
Powered by GitBook
On this page
  1. Part 1
  2. Basic Data Structures
  3. Priority Queue

Ugly Number

Question (LC.264)

PreviousFind Median from Data StreamNextMerge K Sorted Arrays

Last updated 1 year ago