LintCode & LeetCode
search
Ctrlk
LintCode & LeetCode
  • Introduction
  • Linked List
  • Binary Search
  • Hash Table
  • String
  • Array
  • Matrix
  • Queue
  • Stack
  • Heap
  • Data Structure & Design
  • Union Find
  • Trie
  • Trees
  • Segment Tree
  • Binary Indexed Tree
  • Graph & Search
  • Backtracking
  • Two Pointers
  • Mathematics
    • Ugly Number
    • Ugly Number II
    • Super Ugly Number
    • Sqrt(x)
    • Random Number 1 to 7 With Equal Probability
    • Pow(x, n)
    • Narcissistic Number
    • Rectangle Overlap
    • Happy Number
    • Add N Days to Given Date
    • Reverse Integer
    • Greatest Common Divisor or Highest Common Factor
  • Bit Operation
  • Random
  • Dynamic Programming
  • Knapsack
  • High Frequency
  • Sorting
  • Greedy
  • Minimax
  • Sweep Line & Interval
  • Other Algorithms and Data Structure
  • Company Tag
  • Problem Solving Summary
  • Reference
gitbookPowered by GitBook
block-quoteOn this pagechevron-down

Mathematics

Ugly Numberchevron-rightUgly Number IIchevron-rightSuper Ugly Numberchevron-rightSqrt(x)chevron-rightRandom Number 1 to 7 With Equal Probabilitychevron-rightPow(x, n)chevron-rightNarcissistic Numberchevron-rightRectangle Overlapchevron-rightHappy Numberchevron-rightAdd N Days to Given Datechevron-rightReverse Integerchevron-rightGreatest Common Divisor or Highest Common Factorchevron-right
PreviousBackspace String Comparechevron-leftNextUgly Numberchevron-right

Last updated 5 years ago