Introduction

This is a complementary level to what we started in the second level, you will learn more interesting topics such as Dynamic Programming and more advanced Graphs and Data Structure.

Also we still focus on developing your speed and coding accuracy.

• Level 2

• Combinatorics
• Probability Theory
• Modulo Arithmetic, Fermat Little Theorem and Euler’s Totient (Phi)
• Dynamic Programming
• Union-Find Disjoint Sets
• Minimum Spanning Tree (Kruskal)
• Eulerian Graph
• Binary Search Tree
• Heap & HashTable
• Segment Tree

You will be tested at the end of the training. If you do not pass the test, you will repeat the same training for free.  

• 14 Weeks 
• 1 - 2 Lectures per week
• 3 - 4 Hours for each session

• 2400 EGP