πŸ˜€
OJ Practices
search
⌘Ctrlk
πŸ˜€
OJ Practices
  • Introduction
  • Leetcode
    • Tree
    • Dynamic Programming
    • Depth-First-Search
    • Breadth-First Search
    • Two Pointers
    • Linked List
    • Backtracking
    • Binary Search
    • Union Find
    • Trie
    • Sort
    • Heap
    • Randomness
      • 384 Shuffle an Array
      • 470 Implement Rand10() Using Rand7()
      • 478 Generate Random Point in a Circle
      • 497 Random Point in Non-overlapping Rectangles
      • 519 Random Flip Matrix
      • 528 Random Pick with Weight
      • 710 Random Pick with Blacklist
    • Topological Sort
    • Stack
    • Hash Table
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Leetcode

Randomness

384 Shuffle an Arraychevron-right470 Implement Rand10() Using Rand7()chevron-right478 Generate Random Point in a Circlechevron-right497 Random Point in Non-overlapping Rectangleschevron-right519 Random Flip Matrixchevron-right528 Random Pick with Weightchevron-right710 Random Pick with Blacklistchevron-right
Previous882 Reachable Nodes In Subdivided Graphchevron-leftNext384 Shuffle an Arraychevron-right

Last updated 6 years ago