(Arabic) Session#2: Prefix array in deep
00:37 A O(n) solution of leetcode 242. Valid Anagram by Iyadh Tabai
22:23 Problem statement
25:03 Plan
26:05 Naive approach
31:20 Discussion
35:00 Prefix product array
42:50 Proof of corrctness
46:19 query formula
51:19 242. Valid Anagram: Best case
57:37 242. Valid Anagram: Worst case
01:01:32 Pseudo Code
01:03:01 C++: Naive approach (Time: O(n²), Extra Space: O(1))
01:07:45 C++: Prefix array (Time: Ω(n),O(n²), Extra Space: O(n))
01:29:11 Prefx array optimization: Discussion
01:32:01 Prefx array optimization: Observation #1
01:37:47 Prefx array optimization: Observation #2
01:42:18 Prefx array optimization: C++
01:52:15 Wrap up
01:52:28 Homework
02:00:47 Discussion