Commit and push regularly.
- Fork and clone this repository.
- Complete exercises 1 - 8
ex1.py
toex8.py
. Test your solutions. - Complete Max Value (algorithms folder)
max.py
. Test with test case. - Complete Password Checker
passwordChecker.py
. Be sure to understand what is being asked and PSEUDO CODE first!. Test with the given code, try multiple password inputs - Complete Fibonacci Sequence
fibonacci.py
. Be sure to understand what is being asked and PSEUDO CODE first!. Test with the given code, try different n inputs - Complete Prime Number
prime.py
. Be sure to understand what is being asked and PSEUDO CODE first!. Test with the given code, try different number inputs - Complete Palindrome Checker
palindrome.py
. Be sure to understand what is being asked and PSEUDO CODE first!. Test with the given code, try different string inputs - Complete Guess Number game
guess.py
. Be sure to understand what is being asked and PSEUDO CODE first!. Test with the given code, try different runs of the game. - Complete Most Frequent Character algorithm
most_frequent.py
. Run the test cases and make your own test cases. - Complete Linked List to array algorithm
linkedList.py
. Run the test case and make your own. Be sure to not edit the class 'Node', only change the function body oflinked_list_values
. - Complete the Factorial number algorithm
factorial.py
. Run the test case and try your own. This algorithm can be solved with a regular loop (iterative solution) but I encourage you to try implementing a RECURSIVE solution.
- Push up your work to your personal fork.