My uHunt: Gabriel Machado (gabriel.machado) statistics
Hey, ho, let's go! This repository showcases my solutions to a variety of competitive programming problems from online judges, implemented in Python. Each solution is meticulously organized as a Jupyter Notebook (*.ipynb) and categorized based on the primary data structure employed to solve the problem. This structure allows for easy navigation and a focused understanding of how different data structures are applied in practical problem-solving scenarios.
This repository is segmented according to the core data structure utilized in each solution, providing a clear and educational overview of algorithm design and implementation.
-
- Data Structure: Dictionary
- Problem Focus: Counting the occurrences of numbers.
-
- Data Structure: Dictionary
- Problem Focus: Counting the number of women per country.
- UVA1203.ipynb
- Data Structure: Min-Heap
- Problem Focus: Managing queries based on time.
- UVA11363.ipynb
- Data Structure: Hash Table
- Problem Focus: Determining if a query string is present in a dictionary.
- UVA11995.ipynb
- Data Structures: Stack, Queue, Priority Queue
- Problem Focus: Identifying the correct data structure based on a sequence of operations.
- UVA10954.ipynb
- Data Structure: List
- Problem Focus: Managing sums of numbers.
To explore the implemented solutions, simply navigate to the Jupyter Notebook corresponding to the data structure you are interested in. Each notebook contains the problem statement, a detailed explanation of the solution approach, and the complete Python code implementation. This format aims to provide a clear and understandable learning resource.
While this repository primarily serves as a personal portfolio, contributions and suggestions for improvement are welcome. If you identify potential enhancements or have additional solutions you would like to contribute, please feel free to open an issue or submit a pull request :)
This project is licensed under the MIT License.