You must know:
1. Algorithms (asymptotic notation of running time complexity, space and time complexity, order of growth of functions etc).
2. Mergesort, quicksort, heapsort, heapification etc.
3. DP: Knapsack, matrix chain, longest common subsequence, transitive closure of a graph, Floyd-Warshall algorithm.
5 freelancere byder i gennemsnit $51 timen for dette job
Algorithm, Mathematics, Python, Excel skilled professional with over 9 years of experience. Can build a solution as needed and deliver on the expected lines .Thanks