The Interval tree has been implemented from scratch. The methods - insert(node,interval), delete(item), search(node,interval) are built. Sample Dataset is provided and some intervals have been tested.

Questions based on dynamic programming are solved in C++.

Three problems solved are : problem1: https://community.topcoder.com/stat?c=problem_statement&pm=1259 problem2: https://community.topcoder.com/stat?c=problem_statement&pm=1889 problem3: https://www.codechef.com/problems/D2/

Bellman Ford Algorithm has been implemented in C++. Some test cases are run and corresponding outputs are matched.

The following algorithms have been implemented from the scratch :

Gift wrapping algorithm Graham scan algorithm Quickhull