What you will learn
- Before writing code, determine the number of operations, memory requirements, and a suitable approach.
- Choose suitable data structures for problems that require fast access, counting, and matching.
- Manage sequential data and LIFO/FIFO processing with suitable structures.
- Traverse hierarchical and connected data and select the best candidate.
- Learn classic algorithms and how to break a large problem into smaller subproblems.
This course is in development
Enrollment is not open yet. You can preview the curriculum below. Access and pricing will be confirmed when the course launches.
View the first available courseCourse curriculum
5 modules 20 lessons
- Big O, Omega, and Theta
- Time and space complexity
- Brute force and optimization
- Two pointers and sliding window