Binary Search

2981. 找出至少出现三次的最长特殊子字符串 I

Medium | Hash Table, String, Binary Search, Sliding Window, Counting

Medium | Hash Table, String, Binary Search, Sliding Window, Counting

Medium | Two Pointers, String, Binary Search, Rolling Hash, String Matching, Hash Function

Medium | Math, Binary Search, Dynamic Programming, Bit Manipulation

Hard | Two Pointers, String, Binary Search, Rolling Hash, String Matching, Hash Function

Medium | Array, Binary Search

Hard | Array, Binary Search, Greedy, Heap (Priority Queue)

Hard | Array, Binary Search, Stack, Monotonic Stack

Hard | Array, Math, Binary Search, Bit Manipulation, Combinatorics, Number Theory

Hard | Array, Binary Search, Dynamic Programming, Bit Manipulation, Segment Tree, Queue

Hard | Array, Hash Table, Binary Search, Sliding Window

Medium | Array, Hash Table, String, Binary Search, Sorting

Hard | Array, Binary Search, Bit Manipulation

Medium | Array, Binary Search, Prefix Sum

Hard | Array, Binary Search, Binary Indexed Tree, Segment Tree

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

Medium | Array, Hash Table, Two Pointers, Binary Search, Dynamic Programming, Sorting, Counting

Hard | Array, Binary Search, Greedy, Binary Indexed Tree, Segment Tree, Sorting, Ordered Set

Hard | Array, Hash Table, Binary Search, Dynamic Programming, Memoization, Sorting, Matrix, Ordered Set

Hard | Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Sorting, Monotonic Stack