Skip to main content
Back to course
Log in
Get started
Someone wanted to learn this too, so Grasp built them a personal learning path.
Create your own
Google
·
Module 1
Interview Problem-Solving Foundations in JavaScript
1
Inferring Time Complexity from Input Constraints
Infer an appropriate target time complexity from a problem's input constraints.
Infer an appropriate target time complexity from a problem's input constraints.
2
Calculating Time Complexity of Sequential and Nested Loops
Calculate the time complexity of a JavaScript algorithm containing sequential and nested loops.
Calculate the time complexity of a JavaScript algorithm containing sequential and nested loops.
3
Calculating Auxiliary Space Complexity in JavaScript Algorithms
Calculate the auxiliary space complexity of a JavaScript algorithm, including its recursion stack.
Calculate the auxiliary space complexity of a JavaScript algorithm, including its recursion stack.
4
Using JavaScript Map and Set for Constant-Time Lookups
Use JavaScript Map and Set correctly for constant-time lookup in algorithm solutions.
Use JavaScript Map and Set correctly for constant-time lookup in algorithm solutions.
5
From Brute Force to Optimization
Derive a brute-force solution before selecting an optimization.
Derive a brute-force solution before selecting an optimization.
6
Lookup-Based Preprocessing for Efficient Computation
Replace repeated searches or computations with lookup-based preprocessing.
Replace repeated searches or computations with lookup-based preprocessing.
7
Constructing Edge-Case Tests for Array and String Algorithms
Construct edge-case tests for an array or string algorithm.
Construct edge-case tests for an array or string algorithm.
Next module isn't ready yet,
Back to course
Previous module
Next module