Name: Grokking the Coding Interview: Patterns for Coding Questions
Author: Design Gurus

Take this course as part of a comprehensive learning path. Cover everything you'll need to nail your interviews with confidence.

Part of our Curated Interview Prep Paths

Update: This course by Design Gurus has helped 30k+ subscribers to land a job in top companies, including Google, Facebook, Amazon, and Microsoft.

Coding interviews are getting tougher every day. A few years back, brushing up on key data structures and going through 50-75 coding interview questions was more than enough prep for an interview. Today, everyone has access to massive sets of coding questions that have even gotten more complex. The overall process has gotten more competitive.

When our team sat together to brainstorm ideas to make the interview process easier for candidates, we quickly realized that one skill helped us the most when we were preparing for coding interviews: "the ability to map a new problem to an already known problem."

To help candidates with that, we've come up with a list of 16 patterns for coding questions, based on similarities in the techniques needed to solve them. As a result, once you're familiar with a pattern, you'll be able to solve dozens of problems with it.

Mo Jafri

The courses which have "grokking" before them, are exceptionally well put together! These courses magically condense 3 years of CS in short bite-size courses and lectures (I have tried System Design, OODI, and Coding patterns). The Grokking courses are godsent, to be honest.

Totally worth it!

Riley Shanahan

I'm a rising senior at UC Berkeley & just finished my 2nd internship at Google. This course provides the exact details that other coding platforms like LeetCode don't offer. I LOVE that the course is broken up into different "patterns" to develop a deep understanding of problems.

Better than LeetCode and Cracking the Coding Interview

Ahmet Hanif

Whoever put this together, you folks are life savers. Thank you :) 

Software Programmer

Chris Redford

I really feel like the whole binary search section nails the pattern finding goal of the course. I love the use of `start` and `end` at the end of a normal Binary Search to solve interesting problems using properties we know they will have.

Really like this!

Brandan

Excellent course. Thanks for putting all in one place. Please give us more courses like this.

Software Developer

Grokking the Coding Interview: Patterns for Coding Questions

Who should take this course?

Course Overview

Introduction

Maximum Sum Subarray of Size K  (easy)

Smallest Subarray With a Greater Sum (easy)

Longest Substring with maximum K Distinct Characters (medium)

Fruits into Baskets   (medium)

Longest Substring with Distinct Characters (hard)

Longest Substring with Same Letters after Replacement (hard)

Longest Subarray with Ones after Replacement (hard)

Problem Challenge 1

Solution Review: Problem Challenge 1

Problem Challenge 2

Solution Review: Problem Challenge 2

Problem Challenge 3

Solution Review: Problem Challenge 3

Problem Challenge 4

Solution Review: Problem Challenge 4

Pattern: Sliding Window

Pair with Target Sum (easy)

Remove Duplicates (easy)

Squaring a Sorted Array (easy)

Triplet Sum to Zero (medium)

Triplet Sum Close to Target (medium)

Triplets with Smaller Sum (medium)

Subarrays with Product Less than a Target (medium)

Dutch National Flag Problem (medium)

Pattern: Two Pointers

LinkedList Cycle (easy)

Start of LinkedList Cycle (medium)

Happy Number (medium)

Middle of the LinkedList  (easy)

Pattern: Fast & Slow pointers

Merge Intervals (medium)

Insert Interval (medium)

Intervals Intersection (medium)

Conflicting Appointments (medium)

Pattern: Merge Intervals

Cyclic Sort (easy)

Find the Missing Number (easy)

Find all Missing Numbers (easy)

Find the Duplicate Number (easy)

Find all Duplicate Numbers (easy)

Pattern: Cyclic Sort

Reverse a LinkedList (easy)

Reverse a Sub-list (medium)

Reverse every K-element Sub-list (medium)

Pattern: In-place Reversal of a LinkedList

Binary Tree Level Order Traversal (easy)

Reverse Level Order Traversal (easy)

Zigzag Traversal (medium)

Level Averages in a Binary Tree (easy)

Minimum Depth of a Binary Tree (easy)

Level Order Successor (easy)

Connect Level Order Siblings (medium)

Pattern: Tree Breadth First Search

Binary Tree Path Sum (easy)

All Paths for a Sum (medium)

Sum of Path Numbers (medium)

Path With Given Sequence (medium)

Count Paths for a Sum (medium)

Pattern: Tree Depth First Search

Find the Median of a Number Stream (medium)

Sliding Window Median (hard)

Maximize Capital (hard)

Pattern: Two Heaps

Subsets (easy)

Subsets With Duplicates (easy)

Permutations (medium)

String Permutations by changing case (medium)

Balanced Parentheses (hard)

Unique Generalized Abbreviations (hard)

Pattern: Subsets

Order-agnostic Binary Search (easy)

Ceiling of a Number (medium)

Next Letter (medium)

Number Range (medium)

Search in a Sorted Infinite Array (medium)

Minimum Difference Element (medium)

Bitonic Array Maximum (easy)

Pattern: Modified Binary Search

Single Number (easy)

Two Single Numbers (medium)

Complement of Base 10 Number (medium)

Pattern: Bitwise XOR

Top 'K' Numbers (easy)

Kth Smallest Number (easy)

'K' Closest Points to the Origin (easy)

Connect Ropes (easy)

Top 'K' Frequent Numbers (medium)

Frequency Sort (medium)

Kth Largest Number in a Stream (medium)

'K' Closest Numbers (medium)

Maximum Distinct Elements (medium)

Sum of Elements (medium)

Rearrange String (hard)

Pattern: Top 'K' Elements

Merge K Sorted Lists (medium)

Kth Smallest Number in M Sorted Lists (Medium)

Kth Smallest Number in a Sorted Matrix (Hard)

Smallest Number Range (Hard)

Pattern: K-way merge

0/1 Knapsack (medium)

Equal Subset Sum Partition (medium)

Subset Sum (medium)

Minimum Subset Sum Difference (hard)

Pattern : 0/1 Knapsack (Dynamic Programming)

Topological Sort (medium)

Tasks Scheduling (medium)

Tasks Scheduling Order (medium)

All Tasks Scheduling Orders (hard)

Alien Dictionary (hard)

Pattern: Topological Sort (Graph)

Kth Smallest Number (hard)

Miscellaneous

Where to Go from Here

Conclusions

Grokking the Coding Interview: Patterns for Coding Questions

Join 450,000 learners from companies like

Teams of every size choose
Educative for Business
to train, upskill & onboard their developers

Grokking the Coding Interview: Patterns for Coding Questions

Join 450,000 learners from companies like

Teams of every size choose Educative for Business to train, upskill & onboard their developers

Teams of every size choose
Educative for Business
to train, upskill & onboard their developers