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 for job switch
·
Module 1
Foundational Concepts & Arrays
1
Big-O Notation: Analyzing Algorithm Complexity
Analyze the time and space complexity of algorithms using Big-O notation.
2
Dynamic Arrays: Implementation and Complexity
Implement and use dynamic arrays (lists in Python), understanding their time complexity for common operations.
3
In-Place Array Manipulation Techniques
Solve problems involving in-place array manipulation (e.g., removing duplicates, rotating arrays).
Two-Pointer Technique for Sorted Data
Apply the two-pointer technique to solve sorted array and string problems.
5
Sliding Window Technique: Substring and Subarray Problems
Apply the sliding window technique to solve substring and subarray problems.
Matrix Traversal and In-Place Manipulation
Solve matrix traversal and in-place manipulation problems (e.g., spiral traversal, rotation).
Next module isn't ready yet,
Back to course
Previous module
Next module