Coding Interview Essentials: The Ultimate Guide to 75 Must-Know Coding Questions.

Level:

Beginner

Study Time:

25h

Lessons:

151

Playgrounds :

154

Course Overview

Unlock the secrets of acing coding interviews with "Grokking 75 - Top Coding Interview Questions," the definitive course made for those determined to excel in interviews at top tech giants like the FAANG companies. This expertly designed course zeroes in on the most important and frequently asked questions from the past year, ensuring you engage with material that's both up-to-date and highly relevant. Whether you're pressed for time or just looking to refine your coding skills, this course promises to equip you with the knowledge and skills necessary to navigate the complexities of technical interviews confidently.

The course is meticulously structured to cater to a wide range of learners—from aspiring software engineers and seasoned professionals seeking a refresher, to students eager to bolster their problem-solving capabilities. With features like pattern-based learning, multilingual support, and real interview simulations, "Grokking 75" transforms your preparation into an immersive learning experience. Dive into a curriculum that covers critical patterns such as Sliding Window, Two Pointers, Dynamic Programming, Backtracking, and Graph Algorithms, among others, and emerge fully prepared to tackle any coding challenge thrown your way. Don't just prepare—master the art of coding interviews with a course that’s as ambitious as you are.

Get instant access to all current and upcoming courses through subscription.

$21

.42

/mo

billed yearly ($257)

OR

Get Lifetime access to this course only.

$99

Certification on completing the course.

Course Content

• 19 Chapters • 151 Lessons

1.

Introduction

1 lesson

Course Overview

2.

Array/String

14 lessons

Kids With the Greatest Number of Candies (easy)

Solution: Kids With the Greatest Number of Candies

Roman to Integer (easy)

Solution: Roman to Integer

Best Time to Buy and Sell (easy)

Solution: Best Time to Buy and Sell Stock

Zigzag Conversion (medium)

Solution: Zigzag Conversion

Jump Game (medium)

Solution: Jump Game

Jump Game II (medium)

Solution: Jump Game II

H-Index (medium)

Solution: H-Index

3.

Two Pointers

8 lessons

Pair with Target Sum (easy)

Solution: Pair with Target Sum

Dutch National Flag Problem (medium)

Solution: Dutch National Flag Problem

Comparing Strings containing Backspaces (medium)

Solution: Comparing Strings containing Backspaces

Minimum Window Sort (medium)

Solution: Minimum Window Sort

4.

Sliding Window

12 lessons

Maximum Average Subarray I (easy)

Solution: Maximum Average Subarray I

Maximum Number of Vowels in a Substring of Given Length (medium)

Solution: Maximum Number of Vowels in a Substring of Given Length

Max Consecutive Ones III (Medium)

Solution: Max Consecutive Ones III

Longest Subarray of 1's After Deleting One Element (medium)

Solution: Longest Subarray of 1's After Deleting One Element

Minimum Size Subarray Sum (medium)

Solution: Minimum Size Subarray Sum

Longest Substring Without Repeating Characters (medium)

Solution: Longest Substring Without Repeating Characters (medium)

5.

Matrix

8 lessons

Valid Sudoku (Medium)

Solution: Valid Sudoku

Spiral Matrix (medium)

Solution: Spiral Matrix

Rotate Image (medium)

Solution: Rotate Image

Set Matrix Zeroes (medium)

Solution: Set Matrix Zeroes

6.

Hash Map/Set

10 lessons

Contains Duplicate II (easy)

Solution: Contains Duplicate II

Word Pattern (easy)

Solution: Word Pattern

Determine if Two Strings Are Close (medium)

Solution: Determine if Two Strings Are Close

Group Anagrams (Medium)

Solution: Group Anagrams

Longest Consecutive Sequence (medium)

Solution: Longest Consecutive Sequence

7.

Linked List

8 lessons

Add Two Numbers (medium)

Solution: Add Two Numbers

Reverse Linked List II (medium)

Solution: Reverse Linked List II

Odd Even Linked List (medium)

Solution: Odd Even Linked List

Reverse Nodes in k-Group (hard)

Solution: Reverse Nodes in k-Group

8.

Stack & Monotonic Stack

8 lessons

Valid Parentheses (Easy)

Solution: Valid Parentheses

Evaluate Reverse Polish Notation (medium)

Solution: Evaluate Reverse Polish Notation

Simplify Path (medium)

Solution: Simplify Path

Daily Temperatures (medium)

Solution: Daily Temperatures

9.

Tree Depth First Search (DFS)

10 lessons

Tree Diameter (easy)

Solution: Tree Diameter

Maximum Depth (or Height) of Binary Tree (easy)

Solution: Maximum Depth (or Height) of Binary Tree

Path Sum III (medium)

Solution: Path Sum III

Count Good Nodes in Binary Tree (medium)

Solution: Count Good Nodes in Binary Tree

Lowest Common Ancestor of a Binary Search Tree (medium)

Solution: Lowest Common Ancestor of a Binary Search Tree

10.

Tree Breadth First Search (BFS)

8 lessons

All Nodes Distance K in Binary Tree (medium)

Solution: All Nodes Distance K in Binary Tree

Even Odd Tree (medium)

Solution: Even Odd Tree

Right View of a Binary Tree (medium)

Solution: Right View of a Binary Tree

Validate Binary Search Tree (medium)

Solution: Validate Binary Search Tree

11.

Binary Tree

12 lessons

Cousins in Binary Tree (Easy)

Solution: Cousins in Binary Tree

Pseudo-Palindromic Paths in a Binary Tree (medium)

Solution: Pseudo-Palindromic Paths in a Binary Tree

Amount of Time for Binary Tree to Be Infected (medium)

Solution: Amount of Time for Binary Tree to Be Infected

Maximum Difference Between Node and Ancestor (medium)

Solution: Maximum Difference Between Node and Ancestor

Kth Smallest Element in a BST (medium)

Solution: Kth Smallest Element in a BST

Path with Maximum Sum (hard)

Solution: Path with Maximum Sum

12.

Graph

6 lessons

Find the Town Judge (easy)

Solution: Find the Town Judge

Course Schedule (medium)

Solution: Course Schedule

Clone Graph (medium)

Solution: Clone Graph

13.

Graph BFS/DFS

8 lessons

Walls and Gates (medium)

Solution: Walls and Gates

Shortest Path in a Grid with Obstacles Elimination (hard)

Solution: Shortest Path in a Grid with Obstacles Elimination

Rotting Oranges (medium)

Solution: Rotting Oranges

Word Ladder (hard)

Solution: Word Ladder

14.

Heap/Priority Queue

10 lessons

Smallest Range Covering Elements from K Lists (hard)

Solution: Smallest Range Covering Elements from K Lists

K-th Smallest Prime Fraction (medium)

Solution: K-th Smallest Prime Fraction

Sort Characters By Frequency (medium)

Solution: Sort Characters By Frequency (medium)

Rearrange String (hard)

Solution: Rearrange String

Median of Two Sorted Arrays (hard)

Solution: Median of Two Sorted Arrays

15.

Backtracking

8 lessons

Permutations II (medium)

Solution: Permutations II

Letter Combinations of a Phone Number (medium)

Solution: Letter Combinations of a Phone Number

Balanced Parentheses (hard)

Solution: Balanced Parentheses

Palindromic Partitioning

Solution: Palindromic Partitioning

16.

Dynamic Programming (DP)

6 lessons

N-th Tribonacci Number (easy)

Solution: N-th Tribonacci Number

Partition Array for Maximum Sum (medium)

Solution: Partition Array for Maximum Sum

Number of Dice Rolls With Target Sum (medium)

Solution: Number of Dice Rolls With Target Sum

17.

Intervals

4 lessons

Merge Intervals (medium)

Solution: Merge Intervals

Insert Interval (medium)

Solution: Insert Interval

18.

Divide & Conquore

4 lessons

Majority Element (easy)

Solution: Majority Element

Longest Substring with At Least K Repeating Characters (medium)

Solution: Longest Substring with At Least K Repeating Characters - Copy

19.

Trie

6 lessons

Implement Trie (Prefix Tree) (medium)

Solution: Implement Trie (Prefix Tree)

Design Add and Search Words Data Structure (medium)

Solution: Design Add and Search Words Data Structure

Search Suggestions System (medium)

Solution: Search Suggestions System

Related Courses

New

Grokking Graph Algorithms for Coding Interviews

New

Grokking SQL for Tech Interviews

What people say about our courses

Get instant access to all current and upcoming courses through subscription.