About Course
In this course, you’ll learn the fundamentals of computer programming by getting in-depth into Data Structures and Algorithms (DSA) for 5 weeks. This course is being run in collaboration with top recruitment companies in Kenya i.e. Gebeya and Workforce Africa who will both come in post Week 5 for career workshops and technical interview preparation. Here is what we’ll cover in the next 5 weeks:
- Module 1: Foundational Algorithms (Week 1)
- Module 2: Linear Data Structures (Week 2)
- Module 3: Divide & Conquer Algorithms (Week 3-4)
- Module 4: Advanced Data Structures (Week 4-5)
Acknowledgement(s)
The contents of this course have been curated by technical mentors from Zindua School: Bonaventure Ogeto (DSA Foundations), Cyril Michino (Divide & Conquer), and Dan Walobwa (Data Structures). Projects and challenges associated with the course have been sourced from Leetcode, which is the top resource of Data Structures and Algorithms preparation. We appreciate Gebeya and Workforce Africa, both top recruitment companies in Africa, for stepping in for the career and technical interview preparation segments.
Course Content
0.0 Welcome to the Challenge
-
Overview of the course
00:00 -
5-week course structure
00:00 -
Before you begin…
00:00
1.1 Algorithm Analysis
1.2 Array Search Algorithms
1.3 Basic Sorting Algorithms
1.4 Recursive Sorting Algorithms
1.5. Week 1 Challenges
2.1 Array Data Structure
2.2 Hashmap Data Structure
2.3: Linked List Data Structure
2.4 Stacks, Queues, Dequeues
3.1 Understanding Greedy Algorithms
3.2 Foundations of Dynamic Programming
3.3 Zero-One Knapsack Dynamic Programming
3.4 Unbounded Knapsack Dynamic Programming
4.1 LCS & Egg-Dropping Dynamic Programming
4.2 2D Dynamic Programming (DP in Grid)
4.3 Foundations of Trees
4.4 Tries & Heaps
5.1 Foundations of Graphs
5.2 Graph Traversal (DFS and BFS)
5.3 Backtracking & Graph Pathfinding
5.4 Advanced Graph Algorithms
6.1 BONUS: All Challenge Recordings
6.2 Conclusion & Next Steps
Student Ratings & Reviews
