3 - Lesson 1 - Two Pointers - MR Algorithms | تعلّم… طبّق… حل

محتوى الدورة

الجزء الأول – Course Introduction

0/2

1 – Introduction Video

2 – جروب تلجرام المتابعة

الجزء الثاني – Two Pointers

0/11

3 – Lesson 1 – Two Pointers

4 – Problem 1 – Valid Palindrome

5 – Problem 2 – Is Subsequence

6 – Problem 3 – Two Sum II – Input Array Is Sorted

7 – Problem 4 – Container With Most Water

8 – Problem 5 – 3Sum part 1

9 – Problem 5 – 3Sum part 2

10 – Problem 6 Codeforces B. Books

11 – Problem 7 – Codeforces C. Alice, Bob and Chocolate

12 – Problem 8 – Codeforces C. Coffee Break

13 – Problem 9 – Codeforces C. They Are Everywhere

الجزء الثالث – Sliding Window

0/5

14 – Lesson 2 – Sliding Window

15 – Problem 10 – Maximum Average Subarray I

16 – Problem 11 – Maximum Number of Vowels in a Substring of Given Length

17 – Problem 12 – Max Consecutive Ones III

18 – Problem 13 – Longest Subarray of 1’s After Deleting One Element

الجزء الرابع – Math Introduction

0/11

19 – Lesson 3 – Sum formulas

20- Problem 14 – A. Soldier and Bananas

21 – Lesson 4 – Set theory

22 – Lesson 5 – Logic

23 – Lesson 6 – Functions

24 – Lesson 7 – Power and Logarithm

25 – Lesson 8 – Modular introduction

26 – Problem 15 – Codeforces A. Vladik and Courtesy

27 – Problem 16 – Codeforces A. Double Cola

28 – Problem 17 – Codeforces A. Even Odds

29 – Problem 18 – Codeforces B. The Eternal Immortality

الجزء الخامس – Greedy Algorithm

0/16

30 – Lesson 9 – Greedy Algorithm

31 – Lesson 10 – Greedy Vs Dynamic Programming

32 – Lesson 11 Kadane’s Algorithm

33 – Problem 19 – LeetCode 53. Maximum Subarray

34 – Problem 20 – LeetCode 918. Maximum Sum Circular Subarray

35 – Problem 21 – ( Coin Change Greedy ) – LeetCode 860: Lemonade Change

36 – Problem 22 – ( Scheduling (Intervals) ) – Non-overlapping Intervals

37 – Problem 23 – Scheduling (Intervals) – Minimum Number of Arrows to Burst Balloons

38 – Problem 24 – Minimizing Sums (Median vs Average) – Minimum Moves to Equal Array Elements II

39 – Lesson 12 – Huffman Coding

40 – Problem 25 – Aizu 15_D : Huffman Coding

41 – Problem 26 – Codeforces A. Twins

42 – Problem 27 – C. Move Brackets

43 – Problem 28 – Aizu 15_A : Change Making

44 – Problem 29 – Aizu 15_B : Fractional Knapsack Problem

45 – problem 30 – 15_C : Activity Selection Problem

الجزء السادس – Math and Greedy Problems

0/2

46 – Problem 31 – Codeforces C. Range Operation

47 – Problem 32 – Codeforces C. Given Length and Sum of Digits

الجزء السابع – String Search

0/21

48 – Lesson 13 – Basics of String Manipulation

49 – Problem 33 – Hacker Earth Sort the Substring

50 – Lesson 14 – Knuth Morris Pratt Algorithm

51 – Problem 34 – Hacker Earth Apply KMP

52 – Lesson 15 – Z Algorithm

53 – Problem 35 – Hacker Earth Count Substring Occurrences

54 – Lesson 16 – Manachar’s Algorithm part 1

55 – Problem 36 – Leetcode 5. Longest Palindromic Substring Part 1

56 – Problem 36 – Leetcode 5. Longest Palindromic Substring Part 2

57 – Lesson 17 – Manachar’s Algorithm part 2

58 – Lesson 18 – Manachar’s Algorithm part 3

59 – Lesson 19 – String Hashing

important note – اقراها قبل ما تكمل مشاهدة الفيديوهات

60 – Lesson 20 – Rabin-Karp Algorithm

61 – Problem 37 – Codeforces D. Good Substrings

62 – Problem 38 – Aizu 14_A : Naive String Search

63 – Problem 39 – Aizu 14_B : String Search

64 – Problem 40 – Aizu 14_C : Pattern Search ( Look at the solution ) – Rabin Karp ( 2d )

65 – Problem 41 – Aizu 14_D : Multiple String Matching ( don’t solve )

important note – اقراها قبل ما تكمل مشاهدة الفيديوهات

66 – Lesson 21 – Aho-Corasick Algorithm intuition

الجزء الثامن – Range Queries

0/29

67 – Lesson 22 – Cumulative Sum

68 – Problem 42 – Aizu 5_A : The Maximum Number of Customers

69 – Problem 43 – Aizu 5_B : The Maximum Number of Overlaps IDEA

70 – Problem 43 – Aizu 5_B : The Maximum Number of Overlaps Code

71 – Lesson 23 – Disjoint Set

72 – Problem 44 – Aizu 1_A : Disjoint Set: Union Find Tree

73 – Problem 45 – Aizu 1_B : Weighted Union Find Trees

74 – Lesson 24 – Segment Tree ( Basic )

75 – Segment Tree Coding – Problem 46 – Aizu 2_A : Range Minimum Query (RMQ)

76 -Segment Tree Coding 2 – Problem 46 – Aizu 2_A : Range Minimum Query (RMQ)

77 – Problem 47 – 2_B : Range Sum Query (RSQ)

78 – Lesson 25 – Segment Tree ( Lazy Propagation ) – Update Range

79 – Lesson 25 – Segment Tree ( Lazy Propagation ) – Update Query

80 – Problem 48 – Aizu 2_D : Range Update Query (RUQ)

81 – Problem 49 – Aizu 2_F : RMQ and RUQ

82 – Problem 50 – Aizu 2_G : RSQ and RAQ

83 – Problem 51 – Aizu 2_H : RMQ and RAQ

84 – Problem 52 – Aizu 2_I : RSQ and RUQ

85 – Lesson 26 – Fenwick Tree (Binary Indexed Tree – BIT).mp4

86 – Problem 52 – Aizu 2_B : Range Sum Query (RSQ)

87 – Problem 53 – Aizu 2_E : Range Add Query (RAQ)

88 – Lesson 27 – k-D Tree (k-Dimensional Tree)

89 – Problem 54 – Aizu 2_C : Range Search (kD Tree)

90 – Lesson 28 – k-D Tree (k-Dimensional Tree) Balanced Vs unbalanced Time complexity

91 – Lesson 29 Coordinate Compression

92 – Problem 55 – Aizu 4_A : Union of Rectangles

93 – Lesson 29 – Trie ( Prefix Tree )

94 – Problem 56 : Unique prefixes Hacker Earth

95 – Last Video – Very important

المستوى 4: Math Intro, Greedy, String Search & Range Queries

0% مكتمل