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, Thank you for your care. I've just checked your job description carefully.
As a senior AI developer, I have 7+ years experiences of Algorithms
Please contact me and discuss about your job in chat or call to finish your job correctly.
Within your budget and period, I also hope your project is completed. I would love to work with you. Look forward to hear from you soon.
Thank you. Best Regards.
Hey,
This is Naman Vyas here, I'm a Computer Science teacher. Without wasting your time lemme tell you how I'm gonna teach you.
first step involve exploration : I'll try to explore you, your strengths and weaknesses and what you wanna learn.
second step is building the curriculum : I'll plan your next class and lemme tell you I gather information from multiple verified sources added with my experience.
Third step include delivering you the knowledge : We'll have a class with sufficient examples and very well defined theory.
we aren't done yet,
fourth step include giving you the questions to grasp what you've learn in class and you can contact me for any doubt.
We'll be both learning though I'll also be earning ?.
looking forward to teach you the way nobody has ever taught you before.
have a nice day.