- algorithms
- rust
- data structures
- math
- code optimization
- notes
•
•
•
•
•
HandsOn 3
Third hands-on of a.y. 23/24 for the course Competitive Programming and Contests at University of Pisa
HandsOn 2
Second hands-on of a.y. 23/24 for the course Competitive Programming and Contests at University of Pisa
Mo's Algorithm
The Mo's Algorithm is a powerful and efficient technique for solving a wide variety of range query problems. It becomes particularly useful for kind of queries where the use of a Segment Tree or similar data structures is not feasible.
Dynamic Prefix Sums with Fenwick Tree
The Fenwick Tree, also known as the Binary Indexed Tree (BIT), efficiently manages the prefix sum of an array, even as it undergoes updates. In these notes, we introduce this elegant data structure and describe a basic Rust implementation.
The Power of Prefix Sums
Prefix sums offer an elegant and efficient solution to a variety of problems. In this notes, we showcase several such problems and provide their solutions with Rust implementations.
