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.
Hello. I have gone through the description of the project carefully. If given an opportunity, I am confident of completing this task. We can discuss further about this project over the chat. Looking forward to talk to you soon.
Have a great day ahead.
Hello!
I am very interested in your post project.
While I read your description carefully, I was excited with feeling that I would be able to satisfy for your requirements in this job.
We can negotiate on price/Budget, you will get good result.
Looking forward to work with you. Thanks
Regards:
IT Tech SOL.
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