# Solutions in Rust for some competitive programming problems

Created for the "Competitive Programming" course (academic year 23/24) at the Department of Computer Science of the University of Pisa.

> Course Page: https://pages.di.unipi.it/rossano/competitive/

Time spent on the project

[![wakatime](https://wakatime.com/badge/user/a3116382-7adb-43ba-9490-83130c4b22c5/project/c7f14dfa-7dc0-4759-a33e-6542dae0135e.svg)](https://wakatime.com/badge/user/a3116382-7adb-43ba-9490-83130c4b22c5/project/c7f14dfa-7dc0-4759-a33e-6542dae0135e)


<!-- | Day | Problems |
| --- | -------- |
| 2023-09-18 | [Leaders in an Array](https://github.com/lukefleed/competitive-programming/tree/main/2023_09_18/learders_in_an_array) <br> [Maximum Subarray](https://github.com/lukefleed/competitive-programming/tree/main/2023_09_18/maximum_subarray) <br> [Missing Number](https://github.com/lukefleed/competitive-programming/tree/main/2023_09_18/missing_number) |
| 2023-09-21 | [Sliding Window Maximum](https://github.com/lukefleed/competitive-programming/tree/main/2023_09_21/sliding-window-maximum) <br> [Trapping Rain Water](https://github.com/lukefleed/competitive-programming/tree/main/2023_09_21/trapping-rain-water) |
| 2023-09-25 | [Find Minimum in a Rotated Sorted Array](https://github.com/lukefleed/competitive-programming/tree/main/2023_09_25/find-minimum-in-rotated-sorted-array) <br> [Find Peak Element](https://github.com/lukefleed/competitive-programming/tree/main/2023_09_25/find-peak-element) <br> [First and Last Position of Element in Sorted Array](https://github.com/lukefleed/competitive-programming/tree/main/2023_09_25/First_and_Last_Position_of_Element_in_Sorted_Array) |
--!>