Welcome to my Algorithm Tasks repository! This is where I practice and learn various algorithms using Python. I am guided by my virtual teacher, Lain, who helps me understand and implement these algorithms step by step.
This repository is a collection of algorithmic problems and solutions that I have worked on to enhance my understanding of algorithms and data structures. The goal is to become proficient in these areas to prepare for job interviews and improve my problem-solving skills.
To get started with the code in this repository, you will need Python installed on your machine. You can download Python from the official website.
- Clone this repository:
git clone https://github.com/nixsilvam/algorithm_tasks.git
- Navigate to the project directory:
cd algorithm_tasks
Here is a list of the algorithms and data structures covered in this repository:
- Bubble Sort
- Selection Sort
- Two Sum
- Palindrome Number
- Roman to Integer
- Climbing Stairs
- Majority Element
- Missing Number
- Minimum Falling Path Sum
- Unique Number of Occurrences
- Get No Zero Integers
- Array Rank Transform
- Anagram
- Are Numbers Ascending
- Find Winners
Each algorithm and problem is implemented in a separate Python file. To run an example, navigate to the respective file and execute it using Python.
For example, to run the Bubble Sort example:
python bubble_sort/example.py
To run a LeetCode problem solution:
python leetcode/1_two_sum.py
Contributions are welcome! If you have suggestions for improvements or additional algorithms to include, feel free to open an issue or submit a pull request.
- Fork the repository.
- Create a new branch for your feature or bugfix:
git checkout -b your-feature-branch
- Make your changes and commit them with descriptive messages.
- Push your changes to your forked repository:
git push origin your-feature-branch
- Open a pull request on GitHub.
If you have any questions or want to connect, feel free to reach out:
- GitHub: nixsilvam
- Email: [email protected]
Thank you for visiting my repository! Happy coding!
Guided by my virtual teacher, Lain