Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
DSA, ML, DL, & Data Science
·
Module 1
Foundations: Complexity & Core Data Structures
1
Big-O Algorithm Analysis
Analyze the time complexity of an algorithm using Big-O notation.
2
Space-Time Complexity Analysis
Analyze the space complexity of an algorithm and its trade-offs with time complexity.
Dynamic Arrays in Python
Implement and manipulate dynamic arrays (lists in Python).
4
String Manipulation Fundamentals
Manipulate strings using reversal, substring extraction, and character comparison.
5
Hash Maps: Efficient Lookups
Explain the purpose of a hash map for efficient lookups.
6
Sliding Window Technique for Subarrays and Substrings
Apply the sliding window technique to solve subarray/substring problems.
7
Prefix Sums for Efficient Range Queries
Solve prefix sum problems on arrays for efficient range queries.
Next module isn't ready yet,
Back to course
Previous module
Next module