Introduction

We focus at this level on developing your knowledge, thinking skills, coding speed and accuracy.

You will explore more advanced topics in this level such as Graphs, String Matching and divide and conquer.

• Level 1

• Greedy
• Backtracking
• Primes & Factors
• GCD & LCM
• Linear sorting algorithms
• Merge Sort
• Quick Sort
• Graph data structure
• Graph traversal algorithms (BFS - DFS)
• DFS applications (Connected Component - Flood Fill)
• Topological sort (DAG)
• Bipartite Graph
• Shortest path algorithms (Dijkstra - Bellman Ford - Floyd Warshall)
• String Processing (Trie - KMP)

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