🌃
Limited Algorithm
search
⌘Ctrlk
🌃
Limited Algorithm
  • Summary
  • Hash & TreeMap
  • Queue &Stack & PQ
  • Hybrid Data Structure
  • Graph
  • Graph Backtracking and Others
  • Tree
  • Pure Recursion & Backtracking
  • Dynamic Programming
  • Others
    • Bit Operation
    • Binary Search Practice
      • Question 1 Classical Binary Search
      • Question 2 Search in Sorted Matrix
      • Question 3 First Occurrence
      • Question 4 Last Occurrence
      • Question 5 Closest Element to target
      • Question 6 K Closest Element to Target
      • Question 7 Smallest Element Larger than Target
      • Question 8 Search in Bitonic Array
      • Question 9 Search Unknown Value
    • Random
    • MonoStack
  • Array& LinkedList & String
  • Adavance Two Pointer
  • Advance Sliding Window
  • Advance Binary Search
  • Advance Young's Matrix
  • Java Knowledge
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Others

Binary Search Practice

14 Binary Search I

Classical Binary Searcharrow-up-right

Search In Sorted Matrix Iarrow-up-right

First Occurrencearrow-up-right

Last Occurrencearrow-up-right

Closest In Sorted Arrayarrow-up-right

K Cloested In Sorted Arrayarrow-up-right

Smallest Element Larger than Targetarrow-up-right

Search In Bitonic Arrrayarrow-up-right

Search In Unknown Sized Sorted Arrayarrow-up-right

PreviousQuestion 6 Decimal to Hexadecimalchevron-leftNextQuestion 1 Classical Binary Searchchevron-right

Last updated 2 years ago