Algorithmic-Toolbox

The course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming.

Note

I encourage you to try and solve each problem yourself first and only then look at these solutions.

Quick Access

Week 1 Programming Challenges PDF

• APlusB.cpp
• max_pairwise_product.cpp

Week 2 Algorithmic Warm-up PDF

• fibonacci.py
• fibonacci-last_digit.py
• gcd.py
• lcm.py
• fibonacci_huge.py
• fibonacci_sum_last_digit.py
• fibonacci_partial_sum.py
• fibonacci_sum_squares.py

Week 3 Greedy Algorithms PDF

• change.py
• fractional_knapsack.py
• car_fueling.py
• dot_product.py
• covering_segments.py
• different_summands.py
• largest_number.py

Week 4 Divide and Conquer PDF

• binary_search.py
• sorting.py
• inversion.py
• majority_element.py
• points_and_segments.py
• closest.py

Week 5 Dynamic Programming -1 PDF

• change_dp.py
• primitive_calculator.py
• edit_distance.py
• lcs2.py
• lcs3.py

Week 6 Dynamic Programming -2 PDF

• knapsack.py
• partition3.py
• placing_parentheses.py

Contributions

Any type of legit contribution will be appreciated. Contributions may include :

• Documentation
• Improved algorithm implementation
• Code cleaning
• Code modularization

Certification PDF

Contributors ✨

Thanks goes to these wonderful people (emoji key):

Abhishek Kumar 💻 🖋

This project follows the all-contributors specification. Contributions of any kind welcome!