author-cover

Grokking Coding Interview Patterns in JavaScript

Takeaway Skills

Understand the essential patterns behind common coding interview questions — without having to drill endless problem sets

Identify the underlying pattern of each interview question by assessing the problem statement (and learn the tricks required to solve it)

Practice your skills in a hands-on, setup-free coding environment

Learn to efficiently evaluate the tradeoffs between time and space complexity in different solutions

Develop a flexible conceptual framework for solving any question, by connecting problem characteristics, solution techniques, and coding design patterns

Understand the essential patterns behind common coding interview questions — without having to drill endless problem sets

Identify the underlying pattern of each interview question by assessing the problem statement (and learn the tricks required to solve it)

Practice your skills in a hands-on, setup-free coding environment

Learn to efficiently evaluate the tradeoffs between time and space complexity in different solutions

Develop a flexible conceptual framework for solving any question, by connecting problem characteristics, solution techniques, and coding design patterns

Course Overview

With thousands of potential questions to account for, preparing for the coding interview can feel like an impossible challenge. Yet with a strategic approach, coding interview prep doesn’t have to take more than a few weeks. Stop drilling endless sets of practice problems, and prepare ...

How You'll Learn

Hands-on coding environments

You don’t get better at swimming by watching others. Coding is no different. Practice as you learn with live code environments inside your browser.

Faster than videos

Videos are holding you back. The average video tutorial is spoken at 150 words per minute, while you can read at 250. That‘s why our courses are text-based.

No set-up required

Start learning immediately instead of fiddling with SDKs and IDEs. It‘s all on the cloud.

Progress you can show

Built in assessments let you test your skills. Completion certificates let you show them off.

Hands-on coding environments

You don’t get better at swimming by watching others. Coding is no different. Practice as you learn with live code environments inside your browser.

Faster than videos

Videos are holding you back. The average video tutorial is spoken at 150 words per minute, while you can read at 250. That‘s why our courses are text-based.

No set-up required

Start learning immediately instead of fiddling with SDKs and IDEs. It‘s all on the cloud.

Progress you can show

Built in assessments let you test your skills. Completion certificates let you show them off.

Course Contents

1. Getting Started

Course Overview

Who Should Take This Course

2. Two Pointers

Two Pointers: Introduction

Valid Palindrome

Solution: Valid Palindrome

Sum of Three Values

Solution: Sum of Three Values

Reverse Words in a String

Solution: Reverse Words in a String

Valid Palindrome II

3. Fast and Slow Pointers

Fast and Slow Pointers: Introduction

Solution: Happy Number

Linked List Cycle

Solution: Linked List Cycle

Middle of the Linked List

Solution: Middle of the Linked List

Circular Array Loop

Solution: Circular Array Loop

Palindrome Linked List

Solution: Palindrome Linked List

4. Sliding Window

Sliding Window: Introduction

Find Maximum in Sliding Window

Solution: Find Maximum in Sliding Window

Minimum Window Subsequence

Solution: Minimum Window Subsequence

Repeated DNA Sequences

Solution: Repeated DNA Sequences

Minimum Window Substring

Solution: Minimum Window Substring

Longest Substring without Repeating Characters

Solution: Longest Substring without Repeating Characters

Minimum Size Subarray Sum

Solution: Minimum Size Subarray Sum

Best Time to Buy and Sell Stock

5. Merge Intervals

Merge Intervals: Introduction

Merge Intervals

Solution: Merge Intervals

Insert Interval

Solution: Insert Interval

Interval List Intersections

Solution: Interval List Intersections

Employee Free Time

Solution: Employee Free Time

Meeting Rooms II

6. In-place Reversal of a Linked List

In-place Reversal of a Linked List: Introduction

Reverse Linked List

Solution: Reverse Linked List

Reverse Nodes in k-Group

Solution: Reverse Nodes in k-Group

Reverse Linked List II

Solution: Reverse Linked List II

Solution: Reorder List

Swapping Nodes in a Linked List

Solution: Swapping Nodes in a Linked List

Reverse Nodes In Even Length Groups

Solution: Reverse Nodes in Even Length Groups

Swap Nodes in Pairs

7. Two Heaps

Two Heaps: Introduction

Maximize Capital

Solution: Maximize Capital

Find Median from a Data Stream

Solution: Find Median from a Data Stream

Sliding Window Median

Solution: Sliding Window Median

Schedule Tasks on Minimum Machines

Solution: Schedule Tasks on Minimum Machines

8. K-way merge

K-way Merge: Introduction

Merge Sorted Array

Solution: Merge Sorted Array

Kth Smallest Number in M Sorted Lists

Solution: Kth Smallest Number in M Sorted Lists

Find K Pairs with Smallest Sums

Solution: Find K Pairs with Smallest Sums

Merge K Sorted Lists

Solution: Merge K Sorted Lists

Kth Smallest Element in a Sorted Matrix

Solution: Kth Smallest Element in a Sorted Matrix

Median of Two Sorted Arrays

9. Top K Elements

Top K Elements: Introduction

Kth Largest Element in a Stream

Solution: Kth Largest Element in a Stream

Reorganize String

Solution: Reorganize String

K Closest Points to Origin

Solution: K Closest Points to Origin

Top K Frequent Elements

Solution: Top K Frequent Elements

Kth Largest Element in an Array

Solution: Kth Largest Element in an Array

Kth Smallest Element in a BST

10. Modified Binary Search

Modified Binary Search: Introduction

Search in Rotated Sorted Array

Solution: Search in Rotated Sorted Array

First Bad Version

Solution: First Bad Version

Random Pick with Weight

Solution: Random Pick with Weight

Find K Closest Elements

Solution: Find K Closest Elements

Single Element in a Sorted Array

Solution: Single Element in a Sorted Array

Search in Rotated Sorted Array II

11. Subsets

Subsets: Introduction

Solution: Subsets

Solution: Permutations

Letter Combinations of a Phone Number

Solution: Letter Combinations of a Phone Number

Generate Parentheses

Solution: Generate Parentheses

Find K-Sum Subsets

12. Greedy Techniques

Greedy Techniques: Introduction

Solution: Jump Game I

Boats to Save People

Solution: Boats to Save People

Solution: Gas Stations

Two City Scheduling

Solution: Two City Scheduling

13. Backtracking

Backtracking: Introduction

Solution: N-Queens

Solution: Word Search

House Robber III

Solution: House Robber III

Restore IP Addresses

Solution: Restore IP Addresses

Matchsticks to Square

14. Dynamic Programming

Dynamic Programming: Introduction

Solution: 0/1 Knapsack

Solution: Coin Change

N-th Tribonacci Number

Solution: N-th Tribonacci Number

Partition Equal Subset Sum

Solution: Partition Equal Subset Sum

Solution: Word Break II

Minimum Number of Refueling Stops

Solution: Minimum Number of Refueling Stops

Climbing Stairs

15. Cyclic Sort

Cyclic Sort: Introduction

Solution: Missing Number

First Missing Positive

Solution: First Missing Positive

Find The Duplicate Number

Solution: Find The Duplicate Number

Find the Corrupt Pair

Solution: Find the Corrupt Pair

Find the First K Missing Positive Numbers

16. Topological Sort

Topological Sort: Introduction

Compilation Order

Solution: Compilation Order

Alien Dictionary

Solution: Alien Dictionary

Verifying an Alien Dictionary

Solution: Verifying an Alien Dictionary

Course Schedule II

Solution: Course Schedule II

Course Schedule

Solution: Course Schedule

Find All Possible Recipes from Given Supplies

17. Stacks

Stacks: Introduction

Basic Calculator

Solution: Basic Calculator

Remove All Adjacent Duplicates In String

Solution: Remove All Adjacent Duplicates In String

Minimum Remove to Make Valid Parentheses

Solution: Minimum Remove to Make Valid Parentheses

Exclusive Execution Time of Functions

Solution: Exclusive Execution Time of Functions

Flatten Nested List Iterator

Solution: Flatten Nested List Iterator

Valid Parentheses

18. Tree Depth First Search

Tree Depth-first Search: Introduction

Flatten Binary Tree to Linked List

Solution: Flatten Binary Tree to Linked List

Diameter of Binary Tree

Solution: Diameter of Binary Tree

Serialize and Deserialize Binary Tree

Solution: Serialize and Deserialize Binary Tree

Invert Binary Tree

Solution: Invert Binary Tree

Binary Tree Maximum Path Sum

Solution: Binary Tree Maximum Path Sum

Maximum Depth of Binary Tree

19. Tree Breadth First Search

Tree Breadth-first Search: Introduction

Level Order Traversal of Binary Tree

Solution: Level Order Traversal of Binary Tree

Binary Tree Zigzag Level Order Traversal

Solution: Binary Tree Zigzag Level Order Traversal

Populating Next Right Pointers in Each Node

Solution: Populating Next Right Pointers in Each Node

Vertical Order Traversal of a Binary Tree

Solution: Vertical Order Traversal of a Binary Tree

Connect All Siblings of a Binary Tree

20. Trie

Trie: Introduction

Solution: Implement Trie

Search Suggestions System

Solution: Search Suggestions System

Solution: Replace Words

Design Add and Search Words Data Structure

Solution: Design Add and Search Words Data Structure

Solution: Word Search II

Lexicographical Numbers

21. Hash Maps

Hash Maps: Introduction

Solution: Design HashMap

Fraction to Recurring Decimal

Solution: Fraction to Recurring Decimal

Logger Rate Limiter

Solution: Logger Rate Limiter

Next Greater Element

Solution: Next Greater Element

Isomorphic Strings

Solution: Isomorphic Strings

Longest Palindrome

22. Knowing What to Track

Knowing What to Track: Introduction

Palindrome Permutation

Solution: Palindrome Permutation

Design Tic-Tac-Toe

Solution: Design Tic-Tac-Toe

Solution: Group Anagrams

Maximum Frequency Stack

Solution: Maximum Frequency Stack

First Unique Character in a String

Solution: First Unique Character in a String

Find All Anagrams in a String

Solution: Find All Anagrams in a String

23. Union Find

Union Find: Introduction

Redundant Connection

Solution: Redundant Connection

Number of Islands

Solution: Number of Islands

Last Day Where You Can Still Cross

Solution: Last Day Where You Can Still Cross

Regions Cut by Slashes

Solution: Regions Cut by Slashes

Minimize Malware Spread

Solution: Minimize Malware Spread

Evaluate Division

24. Custom Data Structures

Custom Data Structures: Introduction

Solution: Snapshot Array

Time-Based Key-Value Store

Solution: Time-Based Key-Value Store

Implement LRU Cache

Solution: Implement LRU Cache

Insert Delete GetRandom O(1)

Solution: Insert Delete GetRandom O(1)

Solution: Min Stack

25. Bitwise Manipulation

Bitwise Manipulation: Introduction

Find the Difference

Solution: Find the Difference

Complement of Base 10 Number

Solution: Complement of Base 10 Number

Flipping an Image

Solution: Flipping an Image

Solution: Single Number

Two Single Numbers

Solution: Two Single Numbers

26. Challenge Yourself

Challenge Yourself: Introduction

Shortest Bridge

Number of Connected Components in an Undirected Graph

Pacific Atlantic Water Flow

Contains Duplicate

Maximum Subarray

Find Minimum in Rotated Sorted Array

Non-overlapping Intervals

Largest Rectangle in Histogram

Subtree of Another Tree

Number of 1 Bits

Container with the Most Water

Evaluate Reverse Polish Notation

Product of Array Except Self

Longest Increasing Subsequence

Sum of Two Integers

Majority Element

Longest Palindromic Substring

Permutations II

Number of Provinces

Top K Frequent Words

Linked List Cycle II

Minimum Flips to Make the Binary String Alternate

Lemonade Change

Find All Numbers Disappeared in an Array

Find All Duplicates in an Array

Design In-Memory File System

Design File System

Asteroid Collision

Rotting Oranges

27. Conclusion

Where to Go from Here?

author-cover

Join more than 1.4 million learners from companies like

Recommended before you start this course

Recommended before you start this course

Recommended before you start this course

Recommended after you finish this course

Recommended after you finish this course

Recommended after you finish this course

What our learners are saying

What our learners are saying

COURSE BY:

Educative

Teams of every size choose

Educative for Business

to train, upskill & onboard their developers

Learn in-demand tech skills in half the time

SOLUTIONS

For Enterprise

For Individuals

For HR & Recruiting

For Bootcamps

PRODUCTS

Educative Learning

Educative Onboarding

Educative Skill Assessments

Educative Projects

Pricing

For Enterprise

For Individuals

Free Trial

LEGAL

Privacy Policy

Terms of Service

Business Terms of Service

CONTRIBUTE

Become an Author

Become an Affiliate

Become a Contributor

RESOURCES

Educative Blog

EM Hub

Educative Sessions

Educative Answers

ABOUT US

Our Team

Careers

Hiring

Frequently Asked Questions

Contact Us

Press

MORE

GitHub Students Scholarship

Course Catalog

Early Access Courses

Earn Referral Credits

CodingInterview.com

Copyright ©2023 Educative, Inc. All rights reserved.

soc2