← All ebooks
DSADSA for Interviews in JavaScriptCareerKit
- TopicDSA
- LevelIntermediate
- Length128 pages
- Inside80 problems
- FormatPDF
DSA for Interviews in JavaScript
The most common coding round problems, solved in JavaScript with brute-force and optimised approaches.
What's inside
- Big O in plain words
- Arrays and strings
- Hashing and two pointers
- Stacks, queues and linked lists
- Trees and recursion
- Sorting and searching
Sample from the ebook
How do you find two numbers that add up to a target?
Store each number in a hash map as you go. For each number, check if target minus that number is already in the map. This runs in O(n) time.
₹349Was ₹69950% off
Free sample questions
Read 12 full answers from this ebook for free, and see all 80 problems it covers.
- What is Big O notation?
- How do you work out the time complexity of a piece of code?
- Maximum subarray sum (Kadane's algorithm)
- Move all zeroes to the end