- algorithms
- rust
- data structures
- math
- code optimization
- notes
•
•
•
•
•
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.
Sweep Line Algorithm
The Sweep Line Algorithm is a powerful paradigm for solving a variety of problems in computational geometry. In these notes, we employ it to address problems both on a line and in a plane, providing Rust implementations for their solutions.
Tree Traversals in Rust
First hands-on of a.y. 23/24 for the course Competitive Programming and Contests at University of Pisa
Applications of Binary Search
Binary search is undeniably one of the most renowned and fundamental algorithms in computer science. In these notes, we delve into problems that can be solved using the idea of 'Binary Searching for the Answer'.
Sliding Window Maximum
The Sliding Window Maximum problem is a classic algorithmic challenge that involves processing an array in a sliding window fashion. The goal is to find the maximum element within a fixed-size window as it moves through the array. In this notes, we describe several possible solutions to this problem and their implementations in Rust.
