This project includes implementations of sorting and searching algorithms, as well as string manipulation tasks, based on the 'Data Structures 3' course from Code with Mosh. The code was refactored from a single class into individual classes to improve organization and readability.
To enhance code quality, unit tests are being written retroactively to ensure the correctness and reliability of all implemented methods.
The exercises focused on algorithm design, problem-solving, and optimization. Each algorithm was approached independently to develop efficient solutions, followed by a review of the instructor's solutions for comparison and refinement.
String manipulation tasks included reversing strings, checking for palindromes, determining if two strings are anagrams, and many others. These activities provided practical experience in addressing common string challenges and designing clear, effective solutions.
This project is licensed under the MIT License - see the LICENSE file for details.