182 Lessons

125 Challenges

1043 Playgrounds

217 Illustrations

Part of our Curated Interview Prep Paths

Ace Your Coding Interviews

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

Explore Path

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 inter...

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.

IntroductionMaximum 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 1Solution Review: Problem Challenge 1Problem Challenge 2Solution Review: Problem Challenge 2Problem Challenge 3Solution Review: Problem Challenge 3Problem Challenge 4Solution Review: Problem Challenge 4

IntroductionPair 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)Problem Challenge 1Solution Review: Problem Challenge 1Problem Challenge 2Solution Review: Problem Challenge 2Problem Challenge 3Solution Review: Problem Challenge 3

IntroductionLinkedList Cycle (easy)Start of LinkedList Cycle (medium)Happy Number (medium)Middle of the LinkedList (easy)Problem Challenge 1Solution Review: Problem Challenge 1Problem Challenge 2Solution Review: Problem Challenge 2Problem Challenge 3Solution Review: Problem Challenge 3

IntroductionMerge Intervals (medium)Insert Interval (medium)Intervals Intersection (medium)Conflicting Appointments (medium)Problem Challenge 1Solution Review: Problem Challenge 1Problem Challenge 2Solution Review: Problem Challenge 2Problem Challenge 3Solution Review: Problem Challenge 3

IntroductionCyclic Sort (easy)Find the Missing Number (easy)Find all Missing Numbers (easy)Find the Duplicate Number (easy)Find all Duplicate Numbers (easy)Problem Challenge 1Solution Review: Problem Challenge 1Problem Challenge 2Solution Review: Problem Challenge 2Problem Challenge 3Solution Review: Problem Challenge 3

IntroductionReverse a LinkedList (easy)Reverse a Sub-list (medium)Reverse every K-element Sub-list (medium)Problem Challenge 1Solution Review: Problem Challenge 1Problem Challenge 2Solution Review: Problem Challenge 2

IntroductionBinary 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)Problem Challenge 1Solution Review: Problem Challenge 1Problem Challenge 2Solution Review: Problem Challenge 2

IntroductionBinary 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)Problem Challenge 1Solution Review: Problem Challenge 1Problem Challenge 2Solution Review: Problem Challenge 2

IntroductionFind the Median of a Number Stream (medium)Sliding Window Median (hard)Maximize Capital (hard)Problem Challenge 1Solution Review: Problem Challenge 1

IntroductionSubsets (easy)Subsets With Duplicates (easy)Permutations (medium)String Permutations by changing case (medium)Balanced Parentheses (hard)Unique Generalized Abbreviations (hard)Problem Challenge 1Solution Review: Problem Challenge 1Problem Challenge 2Solution Review: Problem Challenge 2Problem Challenge 3Solution Review: Problem Challenge 3

IntroductionOrder-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)Problem Challenge 1Solution Review: Problem Challenge 1Problem Challenge 2Solution Review: Problem Challenge 2Problem Challenge 3Solution Review: Problem Challenge 3

IntroductionSingle Number (easy)Two Single Numbers (medium)Complement of Base 10 Number (medium)Problem Challenge 1Solution Review: Problem Challenge 1

IntroductionTop '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)Problem Challenge 1Solution Review: Problem Challenge 1Problem Challenge 2Solution Review: Problem Challenge 2Problem Challenge 3Solution Review: Problem Challenge 3

IntroductionMerge K Sorted Lists (medium)Kth Smallest Number in M Sorted Lists (Medium)Kth Smallest Number in a Sorted Matrix (Hard)Smallest Number Range (Hard)Problem Challenge 1Solution Review: Problem Challenge 1

Introduction0/1 Knapsack (medium)Equal Subset Sum Partition (medium)Subset Sum (medium)Minimum Subset Sum Difference (hard)Problem Challenge 1Solution Review: Problem Challenge 1Problem Challenge 2Solution Review: Problem Challenge 2

IntroductionTopological Sort (medium)Tasks Scheduling (medium)Tasks Scheduling Order (medium)All Tasks Scheduling Orders (hard)Alien Dictionary (hard)Problem Challenge 1Solution Review: Problem Challenge 1Problem Challenge 2Solution Review: Problem Challenge 2

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

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.

Mo Jafri

Totally worth it!

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.

Riley Shanahan

Better than LeetCode and Cracking the Coding Interview

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.

Mo Jafri

Totally worth it!

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.

Riley Shanahan

Better than LeetCode and Cracking the Coding Interview

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

Ahmet Hanif

Software Programmer

COURSE BY:

Design Gurus

Teams of every size choose

Educative for Business

to train, upskill & onboard their developers