محتوى الدورة
الجزء الأول – Course Introduction
0/2
1 – Introduction Video
04:47
2 – جروب تلجرام المتابعة
الجزء الثاني – Two Pointers
0/11
3 – Lesson 1 – Two Pointers
03:36
4 – Problem 1 – Valid Palindrome
17:16
5 – Problem 2 – Is Subsequence
14:04
6 – Problem 3 – Two Sum II – Input Array Is Sorted
07:02
7 – Problem 4 – Container With Most Water
06:22
8 – Problem 5 – 3Sum part 1
38:19
9 – Problem 5 – 3Sum part 2
10:09
10 – Problem 6 Codeforces B. Books
39:12
11 – Problem 7 – Codeforces C. Alice, Bob and Chocolate
11:39
12 – Problem 8 – Codeforces C. Coffee Break
11:21
13 – Problem 9 – Codeforces C. They Are Everywhere
09:47
الجزء الثالث – Sliding Window
0/5
14 – Lesson 2 – Sliding Window
02:42
15 – Problem 10 – Maximum Average Subarray I
16:56
16 – Problem 11 – Maximum Number of Vowels in a Substring of Given Length
15:28
17 – Problem 12 – Max Consecutive Ones III
25:22
18 – Problem 13 – Longest Subarray of 1’s After Deleting One Element
07:20
الجزء الرابع – Math Introduction
0/11
19 – Lesson 3 – Sum formulas
14:09
20- Problem 14 – A. Soldier and Bananas
13:19
21 – Lesson 4 – Set theory
07:10
22 – Lesson 5 – Logic
02:55
23 – Lesson 6 – Functions
02:26
24 – Lesson 7 – Power and Logarithm
02:51
25 – Lesson 8 – Modular introduction
00:00
26 – Problem 15 – Codeforces A. Vladik and Courtesy
13:31
27 – Problem 16 – Codeforces A. Double Cola
20:04
28 – Problem 17 – Codeforces A. Even Odds
11:52
29 – Problem 18 – Codeforces B. The Eternal Immortality
20:46
الجزء الخامس – Greedy Algorithm
0/16
30 – Lesson 9 – Greedy Algorithm
04:05
31 – Lesson 10 – Greedy Vs Dynamic Programming
01:00
32 – Lesson 11 Kadane’s Algorithm
03:16
33 – Problem 19 – LeetCode 53. Maximum Subarray
09:29
34 – Problem 20 – LeetCode 918. Maximum Sum Circular Subarray
14:12
35 – Problem 21 – ( Coin Change Greedy ) – LeetCode 860: Lemonade Change
14:50
36 – Problem 22 – ( Scheduling (Intervals) ) – Non-overlapping Intervals
34:37
37 – Problem 23 – Scheduling (Intervals) – Minimum Number of Arrows to Burst Balloons
10:00
38 – Problem 24 – Minimizing Sums (Median vs Average) – Minimum Moves to Equal Array Elements II
15:44
39 – Lesson 12 – Huffman Coding
03:41
40 – Problem 25 – Aizu 15_D : Huffman Coding
05:53
41 – Problem 26 – Codeforces A. Twins
12:16
42 – Problem 27 – C. Move Brackets
08:47
43 – Problem 28 – Aizu 15_A : Change Making
07:31
44 – Problem 29 – Aizu 15_B : Fractional Knapsack Problem
23:00
45 – problem 30 – 15_C : Activity Selection Problem
16:12
الجزء السادس – Math and Greedy Problems
0/2
46 – Problem 31 – Codeforces C. Range Operation
20:13
47 – Problem 32 – Codeforces C. Given Length and Sum of Digits
36:49
الجزء السابع – String Search
0/21
48 – Lesson 13 – Basics of String Manipulation
00:33
49 – Problem 33 – Hacker Earth Sort the Substring
12:07
50 – Lesson 14 – Knuth Morris Pratt Algorithm
21:29
51 – Problem 34 – Hacker Earth Apply KMP
09:49
52 – Lesson 15 – Z Algorithm
17:39
53 – Problem 35 – Hacker Earth Count Substring Occurrences
15:46
54 – Lesson 16 – Manachar’s Algorithm part 1
07:00
55 – Problem 36 – Leetcode 5. Longest Palindromic Substring Part 1
40:47
56 – Problem 36 – Leetcode 5. Longest Palindromic Substring Part 2
09:26
57 – Lesson 17 – Manachar’s Algorithm part 2
20:11
58 – Lesson 18 – Manachar’s Algorithm part 3
10:35
59 – Lesson 19 – String Hashing
07:22
important note – اقراها قبل ما تكمل مشاهدة الفيديوهات
60 – Lesson 20 – Rabin-Karp Algorithm
08:25
61 – Problem 37 – Codeforces D. Good Substrings
19:37
62 – Problem 38 – Aizu 14_A : Naive String Search
01:47
63 – Problem 39 – Aizu 14_B : String Search
03:20
64 – Problem 40 – Aizu 14_C : Pattern Search ( Look at the solution ) – Rabin Karp ( 2d )
14:53
65 – Problem 41 – Aizu 14_D : Multiple String Matching ( don’t solve )
00:48
important note – اقراها قبل ما تكمل مشاهدة الفيديوهات
66 – Lesson 21 – Aho-Corasick Algorithm intuition
03:21
الجزء الثامن – Range Queries
0/29
67 – Lesson 22 – Cumulative Sum
04:00
68 – Problem 42 – Aizu 5_A : The Maximum Number of Customers
15:04
69 – Problem 43 – Aizu 5_B : The Maximum Number of Overlaps IDEA
04:25
70 – Problem 43 – Aizu 5_B : The Maximum Number of Overlaps Code
13:39
71 – Lesson 23 – Disjoint Set
01:18
72 – Problem 44 – Aizu 1_A : Disjoint Set: Union Find Tree
23:12
73 – Problem 45 – Aizu 1_B : Weighted Union Find Trees
07:17
74 – Lesson 24 – Segment Tree ( Basic )
03:00
75 – Segment Tree Coding – Problem 46 – Aizu 2_A : Range Minimum Query (RMQ)
34:00
76 -Segment Tree Coding 2 – Problem 46 – Aizu 2_A : Range Minimum Query (RMQ)
01:43
77 – Problem 47 – 2_B : Range Sum Query (RSQ)
02:00
78 – Lesson 25 – Segment Tree ( Lazy Propagation ) – Update Range
15:14
79 – Lesson 25 – Segment Tree ( Lazy Propagation ) – Update Query
08:34
80 – Problem 48 – Aizu 2_D : Range Update Query (RUQ)
02:10
81 – Problem 49 – Aizu 2_F : RMQ and RUQ
02:45
82 – Problem 50 – Aizu 2_G : RSQ and RAQ
08:50
83 – Problem 51 – Aizu 2_H : RMQ and RAQ
04:51
84 – Problem 52 – Aizu 2_I : RSQ and RUQ
05:36
85 – Lesson 26 – Fenwick Tree (Binary Indexed Tree – BIT).mp4
17:13:00
86 – Problem 52 – Aizu 2_B : Range Sum Query (RSQ)
07:43
87 – Problem 53 – Aizu 2_E : Range Add Query (RAQ)
09:50
88 – Lesson 27 – k-D Tree (k-Dimensional Tree)
14:17
89 – Problem 54 – Aizu 2_C : Range Search (kD Tree)
17:13
90 – Lesson 28 – k-D Tree (k-Dimensional Tree) Balanced Vs unbalanced Time complexity
05:14
91 – Lesson 29 Coordinate Compression
01:14
92 – Problem 55 – Aizu 4_A : Union of Rectangles
03:07
93 – Lesson 29 – Trie ( Prefix Tree )
34:05
94 – Problem 56 : Unique prefixes Hacker Earth
09:29
95 – Last Video – Very important
04:20
الدورة الرابعة – Math intro & Array Techniques & Greedy Algorithms & String Search & Range Queries
السابق
التالي
0% مكتمل