Two Pointers is an algorithm technique that uses two or more pointers.
Binary Search is an algorithm technique that reduces solution space by half at one iteration. Although Binary Search often is used in which we search a specific value in a given sorted array, it is not limited. We can use this technique in many problems. It's a pretty powerful technique.
Binary Search (Integer) | C++ code Binary Search (Double) | C++ code
- 食塩水
- Widespread
- 射撃王
- 壁抜け
- 001 - Yokan Party
- D - No Need
- Gluttony - AtCoder ABC144E
- Buy an Integer - AtCoder ABC146C
🚧WIP
🚧WIP
Arithmetic in Modulo
modint provides arithmetic operations in modulo.
Selects the k-th smallest element of an unsorted array in linear time.