Tries, union-find, shortest paths, greedy, backtracking, dynamic programming, segment trees and more: advanced problem solving in Python or Java.
Created by Ouissem BEN HENIA
This course adapts to you: pick a track, then one technology per group. The table of contents, your progress and your certificate follow your choice.
The concept videos are shared; pick the language of the code, the library videos and the labs.
Preview the content for Data Structures and Algorithms — Level 2 — Python
40
Videos
40
Quizzes
17
Labs
10h 43m
Total time
Go from knowing data structures to solving hard problems. Each topic starts with a shared concept video (the idea, the animation, the cost and the real use cases) and continues in Python or Java: build it, use the standard library, solve the problem and avoid the traps. A step-by-step method for any problem, interview corners, and a capstone route planner with Dijkstra, a heap and a trie.
Ouissem BEN HENIA
8 courses • 7 students • 0 ★
