This week focuses on foundational concepts such as Complexity Analysis, which is crucial for understanding algorithm efficiency. You'll also learn about Vectors, Pairs, Structs, and Maps, which are essential data structures. Additionally, the week covers Prefix Sum, Partial Sum, and Frequency Arrays using vectors and maps.
Abdelrahamn Elaraby
Yara Mohammed Ebraheim
Amr Ashraf
Week 2 introduces Standard Template Libraries (STLs) with a focus on Iterators, Queues, Deques, Priority Queues (Heaps), and Stacks. You'll also explore Binary Search concepts using STL functions like binary_search, lower_bound, and upper_bound.
Mahmoud Ahmed
Abdelrahman Alaa
Kareem AboSalem
In Week 3, you'll dive deeper into STLs with Sets, Unordered Sets, Maps, and Unordered Maps. The week also covers Coordinate Compression, the Sort Function, and how to use Compare Functions for custom sorting.