Skip to content
Implementations of various problems using Python. Dynamic Programming, BackTracking & Sorting algorithms 💻
Python
Branch: master
Clone or download

Latest commit

Fetching latest commit…
Cannot retrieve the latest commit at this time.

Files

Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
.github/ISSUE_TEMPLATE
BackTracking
Dynamic Programming
Sorting-algorithms
CODE_OF_CONDUCT.md
README.md

README.md

py-problems-solutions 💻

Some implementations to various problems with Python.

Python 3.6 Codacy Badge

I wrote these files while I was attending 'Algorithm Design' course held by Prof. Monti in Sapienza University. The course concerned about:

   Graph Theory
   Greedy algorithms
   Divide et Impera
   Dynamic Programming
   BackTracking algorithms
   Depth and Breadth first search
   Dijkstra's algorithm
   Tarjan's algorithm
   Directed acyclic graph
   Particular graphs and problems:
       - Knapsack
       - Longest Path in DAG
       - CPM
       - Sudoku

Download 📡

v1.0


If you liked it drop a ⭐️

https://www.edoardoottavianelli.it for contact me.

  Edoardo Ottavianelli ©
You can’t perform that action at this time.