عن الدبلومة
دبلومة هياكل البيانات والخوارزميات باستخدام ++C
٥٥ درس، +١٣٠ ساعة
دبلومة تأسيسية تدمج بين الفهم النظري العميق والتدريب العملي المكثف، باستخدام واحدة من أقوى لغات البرمجة.
هذه دورة مُسجّلة، مقدّمة باللغة العربية، تضم جميع النقاشات العميقة والتفصيلية التي تمت في النسخة الحية.
.للدفع بالجنيه المصري من داخل مصر، يُرجى الضغط على الزر المخصص أدناه
(15000 EGP) شراء الآناحصل على معاينة مجانية
سجّل الآن للوصول إلى الجزء المجاني وتجربة طريقة الشرح قبل الاشتراك الكامل
سجّل للوصول المجانيCurriculum
-
00 Welcome
3 lessons- 01 Welcome - QA
- 02 Basics Structure Classes and Pointers Review
- 03 DS Intro - Vector1
-
01 Vector
7 lesson- 04 Vector 2
-
Homework Videos
- Vector Homework 5 Medium Challenge
- HW1 - Sol - p1
- HW1 - Sol - p2
- HW1 - Sol - p3
- HW1 - Sol - p4
- HW1 - Sol - p5
-
02 Complexity
2 lessons- 04 Complexity 1
- 05 Complexity 1
-
03 Singly Linked List
30 lessons- 06 Singly-LinkedList 1
- 07 Singly-LinkedList 2
-
SSL Homework 1 - 6 Easy Challenges
- 06 SLL Homework 1 - 6 Easy Challenges
- 06 SLL Homework 1 - Solutions p1
- 06 SLL Homework 1 - Solutions p2
- 06 SLL Homework 1 - Solutions p3
- 06 SLL Homework 1 - Solutions p4
- 06 SLL Homework 1 - Solutions p5
- 06 SLL Homework 1 - Solutions p6
-
SSL Homework 2 - 5 Easy to Medium Challenges
- 08 SLL Homework 2 - 5 Easy to Medium Challenges
- 08 SLL Homework 2 - Solution p1
- 08 SLL Homework 2 - Solution p2
- 08 SLL Homework 2 - Solution p4 delete even
- 08 SLL Homework 2 - Solution p3 - reverse
- 08 SLL Homework 2 - Solution p5 sorted
-
SSL Homework 3 - 6 Medium Challenges
- 09 SLL Homework 3 - Solution p1 - swap
- 09 SLL Homework 3 - Solution p2 - rotate left
- 09 SLL Homework 3 - Solution p3 - remove duplicate
- 09 SLL Homework 3 - Solution p4 - last occuerance
- 09 SLL Homework 3 - Solution p5 - move to end
- 09 SLL Homework 3 - Solution p6 - max
-
SSL Homework 4 - 5 Medium to Hard Challenges
- 10 SLL Homework 4 - 5 Medium to Hard Challenges
- 10 SLL Homework 4 - Solution p1 - arrange even odd
- 10 SLL Homework 4 - Solution p2 - alternate
- 10 SLL Homework 4 - Solution p3 - add
- 10 SLL Homework 4 - Solution p4 - remove dup
- 10 SLL Homework 4 - Solution p5 - reverse k
-
NEW From Python DSA Live
- 10 singly linked list 2 - Homework 1 and 2 Discussion
- 11 singly linked list 2 - Homework 3 Discussion
- 12 singly linked list 2 - Homework 4 Discussion
-
04 Doubly Linked List
11 lesson- 08 Doubly Linked List
-
DLL Homework 1 - 4 Easy to Medium Challenges
- 04 DLL Homework 1 - 4 Easy to Medium Challeneges
- 04 DLL Homework 1 - Solution p1 - delete key
- 04 DLL Homework 1 - Solution p2 - delete evenp
- 04 DLL Homework 1 - Solution p3 - delete oddp
- 04 DLL Homework 1 - Solution p4 - palindrome
-
DLL Homework 2 - 4 Medium to Hard Challenges
- 05 DLL Homework 2 - 4 Medium to Hard Challenges
- 05 DLL Homework 2 - Solution p1 - middle
- 05 DLL Homework 2 - Solution p2 - swap k
- 05 DLL Homework 2 - Solution p3
- 05 DLL Homework 2 - Solution p4
-
05 Stack
21 lessons- 09 Stack 1
- 10 Stack 2
-
Stk Homework 1 - 6 Easy to Medium Challenges
- 03 Stk Homework 1 - 6 Easy to Medium Challenges
- 03 Stk Homework 1 - Solution p1
- 03 Stk Homework 1 - Solution p2
- 03 Stk Homework 1 - Solution p3
- 03 Stk Homework 1 - Solution p4
- 03 Stk Homework 1 - Solution p5
- 03 Stk Homework 1 - Solution p6
-
Stk Homework 3 - 3 Medium Challenges
- 09 STK Homework 3 - 3 Medium Challenges
- 09 STK Homework 3 - Solution p2 - infix-postfix
- 09 STK Homework 3 - Solution p3 - middle
-
Stk Homework 2 - 5 Medium to Hard Challenges
- 04 Stk Homework 2 - 6 Medium to Hard Challenges
- 04 Stk Homework 2 - Solution p1 - asteriod
- 04 Stk Homework 2 - Solution p2 - bottom
- 04 Stk Homework 2 - Solution p3 - reverse
- 04 Stk Homework 2 - Solution p4 - score
- 04 Stk Homework 2 - Solution p5 - greater
-
NEW From Python DSA Live
- 15 Stack 1 - homework1
- 16 Stack 2 - homework2
- 18 Stack 4 - homework 3 and 4
-
06 Queue
11 lesson- 11 Queue
-
Queue Homework 1 - 2 Easy Challenges
- 04 Queue Homework 1 - 2 Easy Challenges
- 04 Queue Homework 1 - Solution p1 - deque
- 04 Queue Homework 1 - Solution p2 - stack using single queue
-
Queue Homework 2 - 2 Medium Challenges
- 05 Queue Homework 2 - 2 Medium Challenges
- 05 Queue Homework 2 - Solution p1 - dequen O 1
- 05 Queue Homework 2 - Solution p2 - priority queue
-
Queue Homework 3 - 2 Hard Challenges
- 06 Queue Homework 3 - 2 Hard Challenges
- 06 Queue Homework 3 - Solution p1 - enqueue O 1
- 06 Queue Homework 3 - Solution p2 - stream k
-
NEW From Python DSA Live
- 11 Queue - 3 homework solving
-
07 Binary Tree
14 lessons- 12 Binary Tree 1
- 13 Binary Tree 2
- 14 Binary tree
- 15 Problem-Solving - Is Full - Is Perfect - Diameter
- 16 Diameter Code - Level Order Traversal
- 17 Unique Representation
-
BT Homework 1 - 6 Easy Challenges
- 09 BT Homework 1 - 6 Easy Challenges
- 09 BT Homework 1 - Solution p3 - target sum
- 09 BT Homework 1 - Solution p4 - left leaves
- 09 BT Homework 1 - Solution p5 - cousines
-
BT Homework 3 - 3 Medium Challenges
- 14 BT Homework 3 - 3 Medium Challenges
- 14 BT Homework 3 - Solution p3 - duplicate subtrees
-
BT Homework 2 - 3 Medium to Hard Challenges
- 11 BT Homework 2 - 3 Medium to Hard Challenges
- 11 BT Homework 2 - Solution p2 - completeness
-
08 Binary Search Tree
11 lessons- 18 BST Intro
- 19 BST Successor - deletion
- 20 BST Deletion
-
BST Homework 1 - 2 Easy Challenges
- 03 BST Homework 1 - 2 Easy Challenges
- 03 BST Homework 1 - 2 Easy Challenges - p1 - search iterative
- 03 BST Homework 1 - 2 Easy Challenges - p2 - sorted to bst
-
BST Homework 2 - 3 Medium Challenges
- 04 BST Homework 2 - 3 Medium Challenges
- 04 BST Homework 2 - 3 Medium Challenges - p1 - is bst
- 04 BST Homework 2 - 3 Medium Challenges - p2 - kth
-
BST Homework 3 - 3 Medium Challenges
- 09 BST Homework 3 - 3 Medium Challenges
- 09 BST Homework 3 - 3 Medium Challenges - p1 - from preorder
-
09 Heap
7 lesson- 21 Heap
-
Heap Homework 1 - 5 Easy to Medium Challenges
- 07 Heap Homework 1 - 5 Easy to Medium Challenges
- 07 Heap Homework 1 - 5 Easy to Medium Challenges - p3 less than
- 07 Heap Homework 1 - 5 Easy to Medium Challenges - p4 is heap
- 07 Heap Homework 1 - 5 Easy to Medium Challenges - p5 heap sort inplace
-
Heap Homework 2 - 4 Medium to Hard Challenges
- 08 Heap Homework 2 - 4 Medium to Hard Challenges
- 08 Heap Homework 2 - 4 Medium to Hard Challenges - p2 p3
-
10 Trie
12 lesson- 22 Trie - UVA problem
-
Homework Videos
- 03 Trie Homework 1 - 5 Easy to Medium Challenges
- 03 Trie Homework 1 - Soution p1 - iterative
- 03 Trie Homework 1 - Soution p2 - minimal word
- 03 Trie Homework 1 - Soution p3 - suffix
- 03 Trie Homework 1 - Soution p4 - map
- 03 Trie Homework 1 - Soution p4 - path
- 04 Trie Homework 2 - 3 Medium Challenges
- 04 Trie Homework 2 - Solution p1 - list all
- 04 Trie Homework 2 - Solution p2 - autocomplete
- 05 Trie Homework 3 - 2 Hard Challenges
- 05 Trie Homework 3 - p2 prefix suffix
-
11 AVL Tree
4 lesson- 23 AVL
-
AVL Homework 1 - 3 Medium to Hard Challenges
- 07 AVL Homework 1 - 3 Medium to Hard Challenges
- 07 AVL Homework 1 - 3 Medium to Hard Challenges - p1 p2
- 07 AVL Homework 1 - 3 Medium to Hard Challenges - p3 inversions
-
12 HashTables
9 lessons- 24 HashTable 1
- 25 HashTable 2
-
Homework Videos
- 06 Hash Homework 1 - 3 Medium Challenges
- 06 Hash Homework 1 - Solution p1 - hash string
- 06 Hash Homework 1 - Soution p2 - hash object
- 06 Hash Homework 1 - Soution p3 - rehashing
- 10 Hash Homework 2 - 5 Medium Challenges
- 10 Hash Homework 2 - Solution p1 - linked list
- 10 Hash Homework 2 - Solution p2 - quadratic
-
01 Sorting
3 lessons- 26 Sorting 1
- 26 Sorting 2
- 27 Sorting 3 - problem solving
-
02 Binary Search
12 lessons- 28 Binary Search 1
- 29 Binary Search 2
- 30 Binary Search 3 real values - Intro to graph
-
Homework Videos
- 03 Binary Search Homework 1 - 4 Medium Challenges
- 03 Binary Search Homework 1 - Solutions - p2 - LeetCode 436
- 06 Binary Search Homework 2 - 3 Medium Challenges
- 06 Binary Search Homework 2 - p3 - LeetCode 475
- 07 Binary Search Homework 3 - 2 Hard Challenges
- 07 Binary Search Homework 3 - Solutions p1 - LeetCode 1060
- 07 Binary Search Homework 3 - Solutions p2 - LeetCode 668
- 09 Binary Search Homework 4 - 3 Medium Challenges
- 09 Binary Search Homework 4 - Solution P3
-
03 Graph (Part1)
33 lessons- 31 Graph Repr - DFS
- 32 DFS on Matrix
- 33 DFS Reduction - Edge Classification
- 34 DFS Reduction
- 35 BFS
- 36 BFS
- 37 Topo Sort 1
- 38 Topo Sort 2
-
Graph Repr - Homework Videos
- 05 Graph Representation Homework 1 - 3 Easy Challenges
- 05 Graph Representation Homework 1 - Solutions
- 06 Graph Representation Homework 2 - 5 Medium Challenges
- 06 Graph Representation Homework 2 - Solutions p1 p2
- 06 Graph Representation Homework 2 - Solutions p3 p4
-
DFS - Homework Videos
- 03 DFS Homework 1 - 3 Easy Problems
- 03 DFS Homework 1 - 3 Easy Problems - solutions
- 05 DFS Homework 2 - 4 Medium Problems
- 05 DFS Homework 2 - Solution p3- leetcode 1254
- 05 DFS Homework 2 - Solution p3- leetcode 1559
- 08 DFS Homework 4 - 4 Hard Problems
- 08 DFS Homework 4 - Solution p1 - LeetCode 785
- 08 DFS Homework 4 - Solution p2 - LeetCode 1466
- 08 DFS Homework 4 - Solution p3 - LeetCode 1631
- 08 DFS Homework 4 - Solution p4 cycles in graph
-
BFS - Homework Videos
- 1 BFS Homework 1 - 3 Easy Problems
- 1 BFS Homework 1 - Solutions
- 2 BFS Homework 2 - 3 Medium Problems
- 2 BFS Homework 2 - Solutions
- 3 BFS Homework 3 - 3 Medium Problems
- 3 BFS Homework 3 - Solutions
- 4 BFS Homework 4 - 3 Medium to Hard Challenges
- 4 BFS Homework 4 - Solutions
- 5 BFS Homework 5 - 2 Hard Challenges
- 5 BFS Homework 5 - Solutions
-
04 Dynamic Programming
36 lessons- 39 DP Intro - Knapsack intro
- 40 Knapsack 2
- 41 LIS
- 42 LCS
- 43 Pick Or Leave Solving
- 44 Brute-forcing edit distance
- 45 Integer break
- 46 DP Ranges
- 47 DP Ranges Solving
- 48 DP Counting
- 49 DP on Grid
- 50 Build Output
- 51 Tabulation 2
-
02 DP pick or leave - Homework
- 12 DP pickleave homework 1 - 3 Medium Challenges
- 12 DP pickleave homework 1 - Solutions - p3 - 1691
- 13 DP pickleave homework 2 - 3 Medium to Hard Challenges
- 13 DP pickleave homework 2 - Solution p1 - 198
-
03 DP Enumerating the choices - Homework
- 05 DP bfchoices Homework 1 - 2 Easy to Medium Challenges
- 05 DP bfchoices Homework 1 - Solution p1 - 746
-
04 DP Range Patterns - Homework
- 05 DP ranges Homework 1 - 3 Medium Challenges
- 05 DP ranges Homework 1 - Solution p3 - 1312
- 06 DP ranges Homework 2 - 2 Hard Challenges
-
05 DP Counting - Homework
- 03 DP Counting Homework 1 - 4 Medium Challenges
- 03 DP Counting Homework 1 - Solution p3 - 1155
- 03 DP Counting Homework 1 - Solution p4 - 823
-
06 DP Grid - Homework
- 02 DP on Grid Homework 1 - 4 Medium to Hard Challenges
- 02 DP on Grid Homework 1 - Soutions p1 - 933
- 02 DP on Grid Homework 1 - Soutions p4 - 174
-
07 DP Building Output - Homework
- 02 Building DP Output Homework 1 - 3 Medium Challenges
- 02 Building DP Output Homework 1 - Solution p1 - lis v2
- 02 Building DP Output Homework 1 - Solution p3 - mcm
-
08 DP Tabulation - Homework
- 06 DP Tabulation Homework 1 - 4 Easy to Medium Challenges
- 06 DP Tabulation Homework 1 - Solution p1
- 06 DP Tabulation Homework 1 - Solution p2
- 06 DP Tabulation Homework 1 - Solution p3
- 06 DP Tabulation Homework 1 - Solution p4
-
05 Backtrack
2 lessons- 50 Backtracking 1
- 51 Backtracking 2
-
06 Divide and Conquer
2 lessons- 52 Merge and Quick Sort
- 53 Complexitity
-
07 Graph (Part2)
6 lessons- 53 Graph - Floyd
- 54 Graph - BellmanFord
- 55 Graph - Dijkstra 1
- 56 Graph - Dijkstra 2 - Node split
- 57 Graph - MST - Prime
- 58 Graph - MST - Kruskal
-
Some Recursive Function Materials
2 lessons- 12 Recursive Function
- 13 Pass by Reference - Recursive functions
-
Slides and Codes
2 lessons- 1 Data Structures
- 2 Algorithms
-
Course Review
1 lesson- Course Review Form
تقييمات الطلاب
ما يقوله الطلاب عن تجربتهم
بعض آراء الطلاب عن رحلتهم التعليمية
عن الدورة
ما الذي يميز هذه الدبلومة ؟
مقدم الدورة حاصل على ماجستير ودكتوراه في واحد من مجالات الذكاء الاصطناعي ويتمتع بخبرة أكثر من 17 سنة في المجال بالإضافة إلى اشتغاله بالتدريس لأكثر من 10 سنوات
أهداف الدبلومة
تسعى الدبلومة للتأسيس في أربع محاور والتي من خلالهما تستطيع التقدم لسوق العمل ملفتاً الانتباه إلى معارفك ومهاراتك
فهم عميق لهياكل البيانات
مثل المصفوفات، القوائم، الأكوام، الطوابير، الأشجار، والرسوم البيانية.
إتقان الخوارزميات الأساسية والمتقدمة
مثل الفرز، البحث، التكرار، البرمجة الديناميكية، وخوارزميات الرسم البياني (DFS, BFS, Dijkstra, Floyd, Bellman-Ford، إلخ).
بناء مهارات قوية في حل المشكلات وتحليل الأداء وتطبيقها في مواقف حقيقية.
التحضير للمقابلات التقنية والمسابقات البرمجية (مثل ACM ICPC، Google Interview)
مميزات الدبلومة
تغطية شاملة لأهم المفاهيم المستخدمة في شركات البرمجيات والمسابقات التقنية.
تشرح المفاهيم المعقدة بأسلوب سهل ومنطقي يناسب الجميع.
تشمل تدريبات كثيفة تؤهلك للتفكير المنطقي وبناء حلول فعالة.
تساعدك في الانتقال من المفاهيم النظرية إلى التنفيذ العملي بخطوات واضحة.
إمكانية تحميل المادة ومراجعتها في أي وقت.
طلبات الدورة
إتقان البرمجة بلغة ++C
خبرة جيدة بالتعامل مع المؤشرات (Pointers) والكائنات (Objects)
فهم أساسي للبرمجة الكائنية (OOP)