Each file contains a description of the problem/algorithm at the top with solutions below. Contributions are always welcome. You may find some solutions to the challenges and solutions to algorithmic problems.
In this repository you will find my practice projects, where my knowledge of the programming language is tested.
-
Clone or download de repository:
$ git init $ git clone https://github.com/oardilac/Hangman_game.git
-
Open the console inside the project directory and create a virtual environment.
$ py -m venv venv $ source venv/Scripts/activate
-
If you want to run any project, you have to write this code, but depend of the case.
$ cd/project_name/file.py
Click on the folders to visit the project code.
My program will tell you if you are older or younger, even if you are the oldest person in the world. A very fun game with 3 difficulties. The computer will think a** random number** and you must guess what it is. The only clue you have, is to know if the number you entered is higher or lower than the one thought by the computer. This program will generate a random password, which will have 15 digits and will have uppercase, lowercase, symbols, and numbers. Very secure. This program gives you the ** multiplication tables ** of the number you specify. This currency converter changes some Latin American currencies to dollars. This program will give you all the elevations of a number, however, you can set a** limit**. A** palindrome **is a word that reads the same backwards and forwards, this program will **check **whether the word you typed is palindrome or not. This program will tell you if a number is prime or not. It is a challenge to know how to calculate and print payment information in relation to a credit card payment, therefore, it is shown in detail, by month, by minimum payment and by remaining balance.Pull requests are welcome! For major refactors, please open an issue first to discuss what you would like to improve. Feel free to create a fork of this repository and use the code for any noncommercial purposes.