Binary Search

363. 矩形区域不超过 K 的最大数值和

Hard | Array, Binary Search, Matrix, Prefix Sum, Ordered Set

Hard | Math, Binary Search

Medium | Array, Binary Search, Dynamic Programming, Sliding Window, Rolling Hash, Hash Function

Medium | Array, Hash Table, String, Binary Search, Dynamic Programming, Trie, Sorting

Hard | Array, Binary Search, Bit Manipulation, Segment Tree

Hard | Array, String, Binary Search, Sliding Window, Prefix Sum

Medium | Array, Binary Search, Greedy, Sorting

Hard | Array, Binary Search, Sorting

Medium | Array, String, Binary Search, Dynamic Programming, Greedy, Trie, Segment Tree, Rolling Hash, String Matching, Hash Function

Hard | Array, String, Binary Search, Dynamic Programming, Greedy, Segment Tree, Rolling Hash, String Matching, Hash Function