Tries, union-find, shortest paths, greedy, backtracking, dynamic programming, segment trees and more: advanced problem solving in Python or Java.
من إعداد Ouissem BEN HENIA
تتكيف هذه الدورة معك: اختر مسارًا ثم تقنية واحدة لكل مجموعة. يتبع الفهرس وتقدمك وشهادتك اختيارك.
The concept videos are shared; pick the language of the code, the library videos and the labs.
معاينة المحتوى لـ Data Structures and Algorithms — Level 2 — Python
40
الفيديوهات
40
الاختبارات
17
المختبرات
10 س 43 د
المدة الإجمالية
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 دورات • 7 تلميذ • 0 ★
