Interview Preparation
FAANG Interview Preparation
Learn the 15 essential coding patterns (Sliding Window, Two Pointers, DP) to crack FAANG coding interviews with ease.
Lessons
Two Pointers
Introduction to Two Pointers
30 m
Master the Introduction to Two Pointers pattern to solve top interview questions efficiently.
Two Sum II - Input Array Is Sorted
30 m
Master the Two Sum II - Input Array Is Sorted pattern to solve top interview questions efficiently.
Container With Most Water
30 m
Master the Container With Most Water pattern to solve top interview questions efficiently.
3-Sum
30 m
Master the 3-Sum pattern to solve top interview questions efficiently.
Valid Triangle Number
30 m
Master the Valid Triangle Number pattern to solve top interview questions efficiently.
Move Zeroes
30 m
Master the Move Zeroes pattern to solve top interview questions efficiently.
Sort Colors
30 m
Master the Sort Colors pattern to solve top interview questions efficiently.
Trapping Rain Water
30 m
Master the Trapping Rain Water pattern to solve top interview questions efficiently.
Sliding Window
Introduction to Sliding Window
30 m
Master the Introduction to Sliding Window pattern to solve top interview questions efficiently.
Longest Substring Without Repeating Characters
30 m
Master the Longest Substring Without Repeating Characters pattern to solve top interview questions efficiently.
Longest Repeating Character Replacement
30 m
Master the Longest Repeating Character Replacement pattern to solve top interview questions efficiently.
Overview (Fixed Length)
30 m
Master the Overview (Fixed Length) pattern to solve top interview questions efficiently.
Maximum Points You Can Obtain from Cards
30 m
Master the Maximum Points You Can Obtain from Cards pattern to solve top interview questions efficiently.
Maximum Sum of Distinct Subarrays With Length K
30 m
Master the Maximum Sum of Distinct Subarrays With Length K pattern to solve top interview questions efficiently.
Intervals
Intervals Overview
30 m
Master the Intervals Overview pattern to solve top interview questions efficiently.
Merge Intervals
30 m
Master the Merge Intervals pattern to solve top interview questions efficiently.
Insert Interval
30 m
Master the Insert Interval pattern to solve top interview questions efficiently.
Non-overlapping Intervals
30 m
Master the Non-overlapping Intervals pattern to solve top interview questions efficiently.
Meeting Rooms
30 m
Master the Meeting Rooms pattern to solve top interview questions efficiently.
Meeting Rooms II
30 m
Master the Meeting Rooms II pattern to solve top interview questions efficiently.
Min Arrows to Burst Balloons
30 m
Master the Min Arrows to Burst Balloons pattern to solve top interview questions efficiently.
Linked List
Linked List Overview
30 m
Master the Linked List Overview pattern to solve top interview questions efficiently.
Linked List Cycle
30 m
Master the Linked List Cycle pattern to solve top interview questions efficiently.
Palindrome Linked List
30 m
Master the Palindrome Linked List pattern to solve top interview questions efficiently.
Remove Nth Node From End of List
30 m
Master the Remove Nth Node From End of List pattern to solve top interview questions efficiently.
Reorder List
30 m
Master the Reorder List pattern to solve top interview questions efficiently.
Swap Nodes in Pairs
30 m
Master the Swap Nodes in Pairs pattern to solve top interview questions efficiently.
Stack
Stack Overview
30 m
Master the Stack Overview pattern to solve top interview questions efficiently.
Valid Parentheses
30 m
Master the Valid Parentheses pattern to solve top interview questions efficiently.
Decode String
30 m
Master the Decode String pattern to solve top interview questions efficiently.
Longest Valid Parentheses
30 m
Master the Longest Valid Parentheses pattern to solve top interview questions efficiently.
Overview (Monotonic Stack)
30 m
Master the Overview (Monotonic Stack) pattern to solve top interview questions efficiently.
Daily Temperatures
30 m
Master the Daily Temperatures pattern to solve top interview questions efficiently.
Largest Rectangle in Histogram
30 m
Master the Largest Rectangle in Histogram pattern to solve top interview questions efficiently.
Evaluate Reverse Polish Notation
30 m
Master the Evaluate Reverse Polish Notation pattern to solve top interview questions efficiently.
Min Stack
30 m
Master the Min Stack pattern to solve top interview questions efficiently.
Binary Search
Binary Search
30 m
Master the Binary Search pattern to solve top interview questions efficiently.
Apple Harvest (Koko Variant)
30 m
Master the Apple Harvest (Koko Variant) pattern to solve top interview questions efficiently.
Search in Rotated Sorted Array
30 m
Master the Search in Rotated Sorted Array pattern to solve top interview questions efficiently.
Heap / Priority Queue
Heap Overview
30 m
Master the Heap Overview pattern to solve top interview questions efficiently.
Kth Largest Element in an Array
30 m
Master the Kth Largest Element in an Array pattern to solve top interview questions efficiently.
K Closest Points to Origin
30 m
Master the K Closest Points to Origin pattern to solve top interview questions efficiently.
Find K Closest Elements
30 m
Master the Find K Closest Elements pattern to solve top interview questions efficiently.
Merge K Sorted Lists
30 m
Master the Merge K Sorted Lists pattern to solve top interview questions efficiently.
Depth-First Search
Introduction to DFS
30 m
Master the Introduction to DFS pattern to solve top interview questions efficiently.
DFS Fundamentals
30 m
Master the DFS Fundamentals pattern to solve top interview questions efficiently.
Return Values in DFS
30 m
Master the Return Values in DFS pattern to solve top interview questions efficiently.
Maximum Depth of Binary Tree
30 m
Master the Maximum Depth of Binary Tree pattern to solve top interview questions efficiently.
Path Sum
30 m
Master the Path Sum pattern to solve top interview questions efficiently.
Passing Values Down (State)
30 m
Master the Passing Values Down (State) pattern to solve top interview questions efficiently.
Validate Binary Search Tree
30 m
Master the Validate Binary Search Tree pattern to solve top interview questions efficiently.
Binary Tree Tilt
30 m
Master the Binary Tree Tilt pattern to solve top interview questions efficiently.
Diameter of Binary Tree
30 m
Master the Diameter of Binary Tree pattern to solve top interview questions efficiently.
Path Sum II
30 m
Master the Path Sum II pattern to solve top interview questions efficiently.
Longest Univalue Path
30 m
Master the Longest Univalue Path pattern to solve top interview questions efficiently.
Graphs Overview
30 m
Master the Graphs Overview pattern to solve top interview questions efficiently.
Graph Representation: Adjacency List
30 m
Master the Graph Representation: Adjacency List pattern to solve top interview questions efficiently.
Clone Graph
30 m
Master the Clone Graph pattern to solve top interview questions efficiently.
Graph Valid Tree
30 m
Master the Graph Valid Tree pattern to solve top interview questions efficiently.
Matrices as Graphs
30 m
Master the Matrices as Graphs pattern to solve top interview questions efficiently.
Flood Fill
30 m
Master the Flood Fill pattern to solve top interview questions efficiently.
Types of DFS (Tree Traversals)
30 m
Master the Types of DFS (Tree Traversals) pattern to solve top interview questions efficiently.
Number of Islands
30 m
Master the Number of Islands pattern to solve top interview questions efficiently.
Surrounded Regions
30 m
Master the Surrounded Regions pattern to solve top interview questions efficiently.
Pacific Atlantic Water Flow
30 m
Master the Pacific Atlantic Water Flow pattern to solve top interview questions efficiently.
Breadth-First Search
Introduction to BFS
30 m
Master the Introduction to BFS pattern to solve top interview questions efficiently.
BFS Overview
30 m
Master the BFS Overview pattern to solve top interview questions efficiently.
Binary Tree Level Order Sum
30 m
Master the Binary Tree Level Order Sum pattern to solve top interview questions efficiently.
Binary Tree Rightmost Node
30 m
Master the Binary Tree Rightmost Node pattern to solve top interview questions efficiently.
Binary Tree Zigzag Level Order Traversal
30 m
Master the Binary Tree Zigzag Level Order Traversal pattern to solve top interview questions efficiently.
Maximum Width of Binary Tree
30 m
Master the Maximum Width of Binary Tree pattern to solve top interview questions efficiently.
Graphs Overview
30 m
Master the Graphs Overview pattern to solve top interview questions efficiently.
Minimum Knight Moves
30 m
Master the Minimum Knight Moves pattern to solve top interview questions efficiently.
Rotting Oranges
30 m
Master the Rotting Oranges pattern to solve top interview questions efficiently.
01 Matrix
30 m
Master the 01 Matrix pattern to solve top interview questions efficiently.
Bus Routes
30 m
Master the Bus Routes pattern to solve top interview questions efficiently.
Backtracking
Introduction to Backtracking
30 m
Master the Introduction to Backtracking pattern to solve top interview questions efficiently.
Solution Space Trees
30 m
Master the Solution Space Trees pattern to solve top interview questions efficiently.
Subsets (Power Set)
30 m
Master the Subsets (Power Set) pattern to solve top interview questions efficiently.
Combination Sum
30 m
Master the Combination Sum pattern to solve top interview questions efficiently.
Generate Parentheses
30 m
Master the Generate Parentheses pattern to solve top interview questions efficiently.
Word Search
30 m
Master the Word Search pattern to solve top interview questions efficiently.
Graphs (Topological Sort)
Ordering Dependencies (Topological Sort)
30 m
Master the Ordering Dependencies (Topological Sort) pattern to solve top interview questions efficiently.
Course Schedule
30 m
Master the Course Schedule pattern to solve top interview questions efficiently.
Course Schedule II
30 m
Master the Course Schedule II pattern to solve top interview questions efficiently.
Dynamic Programming
Intro to Dynamic Programming
30 m
Master the Intro to Dynamic Programming pattern to solve top interview questions efficiently.
Solving a Question with DP
30 m
Master the Solving a Question with DP pattern to solve top interview questions efficiently.
Counting Bits
30 m
Master the Counting Bits pattern to solve top interview questions efficiently.
Decode Ways
30 m
Master the Decode Ways pattern to solve top interview questions efficiently.
Maximal Square
30 m
Master the Maximal Square pattern to solve top interview questions efficiently.
Unique Paths
30 m
Master the Unique Paths pattern to solve top interview questions efficiently.
Longest Increasing Subsequence
30 m
Master the Longest Increasing Subsequence pattern to solve top interview questions efficiently.
Word Break
30 m
Master the Word Break pattern to solve top interview questions efficiently.
Maximum Profit in Job Scheduling
30 m
Master the Maximum Profit in Job Scheduling pattern to solve top interview questions efficiently.
Greedy Algorithms
Introduction to Greedy Algorithms
30 m
Master the Introduction to Greedy Algorithms pattern to solve top interview questions efficiently.
Best Time to Buy and Sell Stock
30 m
Master the Best Time to Buy and Sell Stock pattern to solve top interview questions efficiently.
Gas Station
30 m
Master the Gas Station pattern to solve top interview questions efficiently.
Jump Game
30 m
Master the Jump Game pattern to solve top interview questions efficiently.
Trie
Introduction to Tries (Prefix Trees)
30 m
Master the Introduction to Tries (Prefix Trees) pattern to solve top interview questions efficiently.
Implement Trie (Prefix Tree)
30 m
Master the Implement Trie (Prefix Tree) pattern to solve top interview questions efficiently.
Prefix Matching
30 m
Master the Prefix Matching pattern to solve top interview questions efficiently.
Prefix Sum
Introduction to Prefix Sums
30 m
Master the Introduction to Prefix Sums pattern to solve top interview questions efficiently.
Count Vowels in Ranges
30 m
Master the Count Vowels in Ranges pattern to solve top interview questions efficiently.
Subarray Sum Equals K
30 m
Master the Subarray Sum Equals K pattern to solve top interview questions efficiently.
Matrices
Spiral Matrix
30 m
Master the Spiral Matrix pattern to solve top interview questions efficiently.
Rotate Image
30 m
Master the Rotate Image pattern to solve top interview questions efficiently.
Set Matrix Zeroes
30 m
Master the Set Matrix Zeroes pattern to solve top interview questions efficiently.
What You Will Learn
Two Pointers & Sliding Window
Fast & Slow Pointers
Merge Intervals
Cyclic Sort
In-place Reversal of a Linked List
Tree BFS & DFS
Two Heaps
Subsets & Backtracking
Modified Binary Search
Top 'K' Elements
K-way Merge
0/1 Knapsack (Dynamic Programming)
Topological Sort (Graphs)
Skills You Will Gain
Pattern Recognition
Algorithms
Data Structures
Problem Deconstruction
Overview
The Ultimate Guide to Cracking Coding Interviews.
Stop solving random LeetCode problems. Learn the underlying patterns that govern 95% of interview questions.
This course breaks down complex algorithms into digestible patterns like Sliding Window, Two Pointers, and Dynamic Programming. By mastering these patterns, you'll be able to solve thousands of unseen problems with confidence.
What's Included:
- Deep dives into 15+ essential coding patterns
- Visual explanations for complex concepts
- Curated selection of high-yield problems
Share:
Register Now & Get 20% Discount on All Courses
Unlock your full potential with our premium courses. Advance your career and master new skills with FaangPrep today!