Course 4 of 4 in the Data Structures & Algorithms diploma
From topological sort to dynamic programming and its classic problems such as knapsack, LIS, LCS and edit distance, then backtracking and divide and conquer, and finally shortest paths and minimum spanning trees: Dijkstra, Bellman-Ford, Floyd, Prim and Kruskal.
Names verified with their owners' consent. We make no job promises.
NVIDIA · PhD, SFUHe has worked in AI for 15 years across research and engineering, and has published papers at CVPR and ECCV with more than 1,000 combined citations. He has taught programming since 2006 and runs a leading Arabic competitive programming channel on YouTube with more than 134 thousand subscribers.
Units 16 to 20 of the Data Structures & Algorithms diploma. Lessons are followed by practice assignments, with video walkthroughs of the solutions.
DP pick or leave - Homework
DP Enumerating the choices - Homework
DP Range Patterns - Homework
DP Counting - Homework
DP Grid - Homework
DP Building Output - Homework
DP Tabulation - Homework
A comparison between learning from scattered resources and learning from one integrated curriculum.
No interest and no hidden fees.
21 units in C++ · 200+ problems with explained solutions · interest-free installments up to 6 months
Try the teaching with the free lectures, then enroll in Advanced Algorithms for EGP 3,750 or in installments.
Completing the third course, or knowing sorting, binary search, DFS and BFS.
Yes. You can enroll in the diploma's remaining courses one by one, or subscribe to the full diploma at any time.
Yes, over 3 months with no interest: EGP 1,675 down when you enroll, then 2 monthly payments of EGP 1,037.50.
Yes, they're fully recorded and you watch them whenever suits you.
Arabic, with technical terms in English so you can work with references and the job market.