Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/abhisaphire/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. [2020]
https://github.com/abhisaphire/algorithmic-toolbox

2020 abhisaphire algorithmic-toolbox algorithms coursera coursera-course divide-and-conquer dynamic-programming greedy-algorithms practical-applications space-complexity-analysis space-time-tradeoff time-complexity-analysis

Last synced: about 2 months ago
JSON representation

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. [2020]

Awesome Lists containing this project

README

        

# Algorithmic-Toolbox

[![All Contributors](https://img.shields.io/badge/all_contributors-1-orange.svg?style=flat-square)](#contributors-)

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](/Week-1/week1.pdf)
* [APlusB.cpp](/Week-1/1-APlusB.cpp)
* [max_pairwise_product.cpp](/Week-1/2-max_pairwise_product.cpp)

### Week 2 Algorithmic Warm-up [PDF](/Week-2/week2.pdf)
* [fibonacci.py](/Week-2/1-fibonacci.py)
* [fibonacci-last_digit.py](/Week-2/2-fibonacci_last_digit.py)
* [gcd.py](/Week-2/3-gcd.py)
* [lcm.py](/Week-2/4-lcm.py)
* [fibonacci_huge.py](/Week-2/5-fibonacci_huge.py)
* [fibonacci_sum_last_digit.py](/Week-2/5-fibonacci_huge.py)
* [fibonacci_partial_sum.py](/Week-2/7-fibonacci_partial_sum.py)
* [fibonacci_sum_squares.py](/Week-2/7-fibonacci_partial_sum.py)

### Week 3 Greedy Algorithms [PDF](/Week-3/week3.pdf)
* [change.py](/Week-3/1-change.py)
* [fractional_knapsack.py](/Week-3/1-change.py)
* [car_fueling.py](/Week-3/3-car_fueling.py)
* [dot_product.py](/Week-3/4-dot_product.py)
* [covering_segments.py](/Week-3/5-covering_segments.py)
* [different_summands.py](/Week-3/6-different_summands.py)
* [largest_number.py](/Week-3/7-largest_number.py)

### Week 4 Divide and Conquer [PDF](/Week-4/week4.pdf)
* [binary_search.py](/Week-4/binary_search.py)
* [sorting.py](/Week-4/sorting.py)
* [inversion.py](/Week-4/inversions.py)
* [majority_element.py](/Week-4/majority_element.py)
* [points_and_segments.py](/Week-4/points_and_segments.py)
* [closest.py](/Week-4/closest.py)

### Week 5 Dynamic Programming -1 [PDF](/Week-5/week5.pdf)
* [change_dp.py](/Week-5/change_dp.py)
* [primitive_calculator.py](/Week-5/primitive_calculator.py)
* [edit_distance.py](/Week-5/edit_distance.py)
* [lcs2.py](/Week-5/lcs2.py)
* [lcs3.py](/Week-5/lcs3.py)

### Week 6 Dynamic Programming -2 [PDF](/Week-6/week6.pdf)
* [knapsack.py](/Week-6/knapsack.py)
* [partition3.py](/Week-6/partition3.py)
* [placing_parentheses.py](/Week-6/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](AlgorithmicToolbox.pdf)
## Contributors ✨

Thanks goes to these wonderful people ([emoji key](https://allcontributors.org/docs/en/emoji-key)):



Abhishek Kumar

💻 🖋

This project follows the [all-contributors](https://github.com/all-contributors/all-contributors) specification. Contributions of any kind welcome!