Data Structures & Algorithms
Competitive Programming
Covers Linear Search & Linked Lists, Fenwick Tree, Greedy Approach and more.
- DURATION
- [Ask us]
- PREREQUISITES
- [Ask us]
- SYLLABUS
- 8 modules
- FEE
- On enquiry
Syllabus
Every module is taught live, with practice problems and assignments between classes.
- 01Linear Search & Linked Lists
- 02Fenwick Tree
- 03Greedy Approach
- 04String Searching with KMP
- 05Graph Problems
- 06Topological Sorting
- 07Substring Problems
- 08Computational Geometry
Not sure where to start?
Book a free demo class. Pick a few times that suit you and we'll call you back to confirm one, answer your questions and suggest a track.