Hello Codeforces,↵
↵
On February 2018 the Problem Solving Training by Mixed Dimensions Inc — Hackatari in collabration with ACM PSUT Student Chapter was held in PSUT Presented By Master Hasan Al-Hamsh [user:Hasan0540,2018-09-14], covers varied topics consists of 4 Lectures. The training is recorded and published on youtube on SolverToBe channel↵
↵
*note: language of training is Arabic.↵
↵
**Lecture 1**↵
---------↵
↵
### Introduction To Competitve Programming↵
↵
<spoiler summary="Introduction To Competitve Programming"> ↵
Part 1 | [Introduction to Competitve Programming](https://www.youtube.com/watch?v=JSmoa1iWWpk)↵
↵
Part 2 | [Problem Defense of Kingdom — BruteForce Solution](https://www.youtube.com/watch?v=YdwyjH_I5kI)↵
↵
Part 3 | [Complexity](https://www.youtube.com/watch?v=w8SbP4Ldow4)↵
↵
Part 4 | [Problem Defense of Kingdom — O(N Log N) Solution](https://www.youtube.com/watch?v=ixKpuj6fefY)↵
↵
Part 5 | [Multiplication Subsequare Problem](https://www.youtube.com/watch?v=0r56Kaf2ZLg)↵
</spoiler>↵
↵
### Introduction To Graphs↵
↵
<spoiler summary="Graphs I"> ↵
Part 6 | [Introduction to Graphs](https://www.youtube.com/watch?v=hl39eE9KdhM)↵
↵
Part 7 | [Graph Traversal on Tree](https://www.youtube.com/watch?v=tRANtJDZ8q4)↵
↵
Part 8 | [Number of Components in Forest](https://www.youtube.com/watch?v=D4MelDVaabA)↵
↵
Part 9 | [Longest Path on Tree](https://www.youtube.com/watch?v=WHOs7GpM8nQ)↵
</spoiler>↵
↵
**Lecture 2**↵
---------↵
↵
### Graphs II↵
↵
<spoiler summary="Graphs II"> ↵
Part 1 | [Longest Path on Tree 2](https://www.youtube.com/watch?v=1DSrLNy6WPQ)↵
↵
Part 2 | [Vertex Cover of a Tree](https://www.youtube.com/watch?v=Rx9lSlhdfjU)↵
↵
Part 3 | [Connected Component — Undirected Graph](https://www.youtube.com/watch?v=t0dnMxvwz2Y)↵
↵
Part 4 | [Cycle Detection — Undirected Graph](https://www.youtube.com/watch?v=8B9zKQ_UJcY)↵
↵
Part 5 | [Cycle Detection — Directed Graph](https://www.youtube.com/watch?v=Q_zhBOYOAzE)↵
↵
Part 6 | [Bridges and Articulation Points](https://www.youtube.com/watch?v=VpjykHVul2s)↵
↵
Part 7 | [Strongly Connected Components — Directed Graph](https://www.youtube.com/watch?v=mDGqvjA31w0)↵
</spoiler>↵
↵
↵
**Lecture 3**↵
---------↵
↵
### 2-SAT↵
↵
<spoiler summary="2-SAT"> ↵
Part 1 | [Strongly Connected Components — Review and Implementation](https://www.youtube.com/watch?v=lergyFWMSSY)↵
↵
Part 2 | [2-SAT Problem](https://www.youtube.com/watch?v=jI79VxSDN1w)↵
↵
Part 3 | [Problem Ring Road 2 — CodeForces 27D](https://www.youtube.com/watch?v=td8cRJ2I2q4)↵
↵
Part 4 | [Problem SPOJ TORNJEVI](https://www.youtube.com/watch?v=yF-iVaouEwg)↵
</spoiler>↵
↵
**Lecture 4**↵
---------↵
### String Algorithms↵
↵
↵
<spoiler summary="String Algorithm"> ↵
Part 1 | [KMP Algorithm I](https://www.youtube.com/watch?v=V_cS906OMWc)↵
↵
Part 2 | [KMP Algorithm II and Failuer Array](https://www.youtube.com/watch?v=d7FnvZUtRQQ)↵
↵
Part 3 | [Applications on KMP Algorithm](https://www.youtube.com/watch?v=rpQ8FU0_FNw)↵
↵
Part 4 | [Trie](https://www.youtube.com/watch?v=0GuTn_g7B2o)↵
↵
Part 5 | [Suffix Array I — O(N^2 Log N)](https://www.youtube.com/watch?v=E7JEbYpXyDo)↵
↵
Part 6 | [Longest Common Prefix](https://www.youtube.com/watch?v=ytyBI1NYOoA)↵
↵
Part 7 | [Suffix Array II — O(N Log^2 N)](https://www.youtube.com/watch?v=YDHomyCBmvc)↵
↵
Part 8 | [Suffix Array III — O(N Log N) and Radix Sort](https://www.youtube.com/watch?v=f2Bx-ndtNac)↵
</spoiler>↵
↵
Good Luck!↵
↵
On February 2018 the Problem Solving Training by Mixed Dimensions Inc — Hackatari in collabration with ACM PSUT Student Chapter was held in PSUT Presented By Master Hasan Al-Hamsh [user:Hasan0540,2018-09-14], covers varied topics consists of 4 Lectures. The training is recorded and published on youtube on SolverToBe channel↵
↵
*note: language of training is Arabic.↵
↵
**Lecture 1**↵
---------↵
↵
### Introduction To Competitve Programming↵
↵
<spoiler summary="Introduction To Competitve Programming"> ↵
Part 1 | [Introduction to Competitve Programming](https://www.youtube.com/watch?v=JSmoa1iWWpk)↵
↵
Part 2 | [Problem Defense of Kingdom — BruteForce Solution](https://www.youtube.com/watch?v=YdwyjH_I5kI)↵
↵
Part 3 | [Complexity](https://www.youtube.com/watch?v=w8SbP4Ldow4)↵
↵
Part 4 | [Problem Defense of Kingdom — O(N Log N) Solution](https://www.youtube.com/watch?v=ixKpuj6fefY)↵
↵
Part 5 | [Multiplication Subsequare Problem](https://www.youtube.com/watch?v=0r56Kaf2ZLg)↵
</spoiler>↵
↵
### Introduction To Graphs↵
↵
<spoiler summary="Graphs I"> ↵
Part 6 | [Introduction to Graphs](https://www.youtube.com/watch?v=hl39eE9KdhM)↵
↵
Part 7 | [Graph Traversal on Tree](https://www.youtube.com/watch?v=tRANtJDZ8q4)↵
↵
Part 8 | [Number of Components in Forest](https://www.youtube.com/watch?v=D4MelDVaabA)↵
↵
Part 9 | [Longest Path on Tree](https://www.youtube.com/watch?v=WHOs7GpM8nQ)↵
</spoiler>↵
↵
**Lecture 2**↵
---------↵
↵
### Graphs II↵
↵
<spoiler summary="Graphs II"> ↵
Part 1 | [Longest Path on Tree 2](https://www.youtube.com/watch?v=1DSrLNy6WPQ)↵
↵
Part 2 | [Vertex Cover of a Tree](https://www.youtube.com/watch?v=Rx9lSlhdfjU)↵
↵
Part 3 | [Connected Component — Undirected Graph](https://www.youtube.com/watch?v=t0dnMxvwz2Y)↵
↵
Part 4 | [Cycle Detection — Undirected Graph](https://www.youtube.com/watch?v=8B9zKQ_UJcY)↵
↵
Part 5 | [Cycle Detection — Directed Graph](https://www.youtube.com/watch?v=Q_zhBOYOAzE)↵
↵
Part 6 | [Bridges and Articulation Points](https://www.youtube.com/watch?v=VpjykHVul2s)↵
↵
Part 7 | [Strongly Connected Components — Directed Graph](https://www.youtube.com/watch?v=mDGqvjA31w0)↵
</spoiler>↵
↵
↵
**Lecture 3**↵
---------↵
↵
### 2-SAT↵
↵
<spoiler summary="2-SAT"> ↵
Part 1 | [Strongly Connected Components — Review and Implementation](https://www.youtube.com/watch?v=lergyFWMSSY)↵
↵
Part 2 | [2-SAT Problem](https://www.youtube.com/watch?v=jI79VxSDN1w)↵
↵
Part 3 | [Problem Ring Road 2 — CodeForces 27D](https://www.youtube.com/watch?v=td8cRJ2I2q4)↵
↵
Part 4 | [Problem SPOJ TORNJEVI](https://www.youtube.com/watch?v=yF-iVaouEwg)↵
</spoiler>↵
↵
**Lecture 4**↵
---------↵
### String Algorithms↵
↵
↵
<spoiler summary="String Algorithm"> ↵
Part 1 | [KMP Algorithm I](https://www.youtube.com/watch?v=V_cS906OMWc)↵
↵
Part 2 | [KMP Algorithm II and Failuer Array](https://www.youtube.com/watch?v=d7FnvZUtRQQ)↵
↵
Part 3 | [Applications on KMP Algorithm](https://www.youtube.com/watch?v=rpQ8FU0_FNw)↵
↵
Part 4 | [Trie](https://www.youtube.com/watch?v=0GuTn_g7B2o)↵
↵
Part 5 | [Suffix Array I — O(N^2 Log N)](https://www.youtube.com/watch?v=E7JEbYpXyDo)↵
↵
Part 6 | [Longest Common Prefix](https://www.youtube.com/watch?v=ytyBI1NYOoA)↵
↵
Part 7 | [Suffix Array II — O(N Log^2 N)](https://www.youtube.com/watch?v=YDHomyCBmvc)↵
↵
Part 8 | [Suffix Array III — O(N Log N) and Radix Sort](https://www.youtube.com/watch?v=f2Bx-ndtNac)↵
</spoiler>↵
↵
Good Luck!↵
