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
JavaScript Interview Problem-Solving Foundations
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
From Brute Force to Optimization
Derive a brute-force solution before selecting an optimization.
Derive a brute-force solution before selecting an optimization.
3
Analyzing Time and Space Complexity in JavaScript Loops and Recursion
Determine the asymptotic time and auxiliary-space complexity of JavaScript code containing loops or recursion.
Determine the asymptotic time and auxiliary-space complexity of JavaScript code containing loops or recursion.
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
Sorting Numeric Data with JavaScript Comparators and Cost Analysis
Sort numeric data correctly with a JavaScript comparator and account for the sorting cost.
Sort numeric data correctly with a JavaScript comparator and account for the sorting cost.
6
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