educative.io

Grokking the Coding Interview: Patterns for Coding Questions (Design Gurus)


Pattern: Cyclic Sort - Find all Missing Numbers (easy) Have questions about Find all Missing Numbers (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/Y52qNM0ljWK). Pattern: K-way merge - Kth Smallest Number in M Sorted Lists (Medium) Have questions about Kth Smallest Number in M Sorted Lists (Medium)? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/4890648534581248). Pattern : 0/1 Knapsack (Dynamic Programming) - Introduction Have questions about Introduction? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/6356896447463424). Pattern: Topological Sort (Graph) - Introduction Have questions about Introduction? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/4529109747105792). Pattern: Topological Sort (Graph) - Tasks Scheduling (medium) Have questions about Tasks Scheduling (medium)? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/5590021564268544). Pattern: Topological Sort (Graph) - Problem Challenge 1 Have questions about Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/5792384199688192). Pattern: K-way merge - Kth Smallest Number in a Sorted Matrix (Hard) Have questions about Kth Smallest Number in a Sorted Matrix (Hard)? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/4605334997958656). Pattern: K-way merge - Problem Challenge 1 Have questions about Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/6588270395785216). Pattern: Sliding Window - Smallest Subarray with a given sum (easy) Have questions about Smallest Subarray with a given sum (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/7XMlMEQPnnQ). Pattern: Bitwise XOR - Single Number (easy) Have questions about Single Number (easy)? Go for it! Pattern: Fast & Slow pointers - Solution Review: Problem Challenge 1 Have questions about Solution Review: Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/JERG3q0p912). Pattern: Merge Intervals - Introduction Have questions about Introduction? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/3YVYvogqXpA). Pattern: Two Pointers - Problem Challenge 2 Have questions about Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/g7pBzR12YPl). Pattern: Fast & Slow pointers - LinkedList Cycle (easy) Have questions about LinkedList Cycle (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/N7rwVyAZl6D). Pattern: Topological Sort (Graph) - Tasks Scheduling Order (medium) Have questions about Tasks Scheduling Order (medium)? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/5066018374287360). Pattern: Two Heaps - Introduction Have questions about Introduction? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/xlm8k0ZND93). Pattern: Top 'K' Elements - Solution Review: Problem Challenge 1 Have questions about Solution Review: Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/6244851517489152). Pattern: Top 'K' Elements - Frequency Sort (medium) Have questions about Frequency Sort (medium)? Go for it! Pattern: Two Heaps - Maximize Capital (hard) Have questions about Maximize Capital (hard)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/B6x69OLX4jY). Pattern: Tree Depth First Search - Binary Tree Path Sum (easy) Have questions about Binary Tree Path Sum (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/RMlGwgpoKKY). Pattern: Modified Binary Search - Search in Rotated Array (medium) Have questions about Pattern: Modified Binary Search - Search in Rotated Array (medium)? Go for it! Pattern: Tree Breadth First Search - Introduction Have questions about Introduction? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/qARvkz138r3). Pattern: Cyclic Sort - Cyclic Sort (easy) Have questions about Cyclic Sort (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/B8qXVqVwDKY). Pattern: Tree Breadth First Search - Reverse Level Order Traversal (easy) Have questions about Reverse Level Order Traversal (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/m2N6GwARL8r). Pattern: Tree Breadth First Search - Solution Review: Problem Challenge 3 Have questions about Solution Review: Problem Challenge 3? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/NEOjJormLVp). Pattern: Subsets - Problem Challenge 2 Have questions about Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/3j9V2QL3Ky9). Pattern: Two Pointers - Problem Challenge 4 Have questions about Problem Challenge 4? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/5619753626370048). Pattern: Fast & Slow pointers - Problem Challenge 1 Have questions about Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/B1PzmqOKDLQ). Pattern: Sliding Window - No-repeat Substring (hard) Have questions about No-repeat Substring (hard)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/YMzBx1gE5EO). Pattern: Modified Binary Search - Minimum Difference Element (medium) Have questions about Minimum Difference Element (medium)? Go for it! Pattern: Merge Intervals - Solution Review: Problem Challenge 3 Have questions about Solution Review: Problem Challenge 3? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/RLwKZWgMJ1q). Pattern: Fast & Slow pointers - Middle of the LinkedList (easy) Have questions about Middle of the LinkedList (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/3j5GD3EQMGM). Pattern: Tree Breadth First Search - Binary Tree Level Order Traversal (easy) Have questions about Binary Tree Level Order Traversal (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/xV7E64m4lnz). Pattern: Modified Binary Search - Problem Challenge 3 Have questions about Problem Challenge 3? Go for it! Pattern: Top 'K' Elements - Sum of Elements (medium) Have questions about Sum of Elements (medium)? Go for it! Pattern: Modified Binary Search - Problem Challenge 1 Have questions about Problem Challenge 1? Go for it! Pattern: Bitwise XOR - Solution Review: Problem Challenge 1 Have questions about Solution Review: Problem Challenge 1? Go for it! Pattern: Top 'K' Elements - Kth Largest Number in a Stream (medium) Have questions about Kth Largest Number in a Stream (medium)? Go for it! Pattern: Top 'K' Elements - Introduction Have questions about Introduction? Go for it! Conclusions - Where to Go from Here Have questions about Where to Go from Here? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/6021896313241600). Pattern: Topological Sort (Graph) - Solution Review: Problem Challenge 2 Have questions about Solution Review: Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/5717310448861184). Pattern: Fast & Slow pointers - Problem Challenge 2 Have questions about Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/YQJ4mr7yOrW). Pattern: Cyclic Sort - Introduction Have questions about Introduction? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/YVjXo6J9xN9). Pattern: Top 'K' Elements - Maximum Distinct Elements (medium) Have questions about Maximum Distinct Elements (medium)? Go for it! Pattern: Top 'K' Elements - Connect Ropes (easy) Have questions about Connect Ropes (easy)? Go for it! Pattern: Merge Intervals - Insert Interval (medium) Have questions about Insert Interval (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/3jKlyNMJPEM). Pattern: Cyclic Sort - Solution Review: Problem Challenge 3 Have questions about Solution Review: Problem Challenge 3? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/g286M2Gk3YY). Pattern: Cyclic Sort - Solution Review: Problem Challenge 1 Have questions about Solution Review: Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/N7Vw2GBQr6D). Pattern: Subsets - Balanced Parentheses (hard) Have questions about Balanced Parentheses (hard)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/NEXBg8YA5A2). Pattern: Modified Binary Search - Problem Challenge 2 Have questions about Problem Challenge 2? Go for it! Pattern: Modified Binary Search - Solution Review: Problem Challenge 3 Have questions about Solution Review: Problem Challenge 3? Go for it! Pattern: Tree Depth First Search - Solution Review: Problem Challenge 1 Have questions about Solution Review: Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/JYVW7l2L4EJ). Pattern: Modified Binary Search - Solution Review: Problem Challenge 2 Have questions about Solution Review: Problem Challenge 2? Go for it! Pattern : 0/1 Knapsack (Dynamic Programming) - Minimum Subset Sum Difference (hard) Have questions about Minimum Subset Sum Difference (hard)? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/5390739594805248). Pattern: Cyclic Sort - Solution Review: Problem Challenge 2 Have questions about Solution Review: Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/R1GXQ071GQ0). Pattern: Cyclic Sort - Problem Challenge 3 Have questions about Problem Challenge 3? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/q2LA7G0ANX0). Pattern: K-way merge - Smallest Number Range (Hard) Have questions about Smallest Number Range (Hard)? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/5553519291531264). Pattern: Modified Binary Search - Introduction Have questions about Introduction? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/JQJOO357VDo). Pattern: Tree Depth First Search - Count Paths for a Sum (medium) Have questions about Count Paths for a Sum (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/xV2J7jvN1or). Pattern: Merge Intervals - Problem Challenge 3 Have questions about Problem Challenge 3? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/YQykDmBnvB0). Pattern: Two Pointers - Solution Review: Problem Challenge 2 Have questions about Solution Review: Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/xVKE8MJDlzq). Pattern: Subsets - Subsets With Duplicates (easy) Have questions about Subsets With Duplicates (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/7npk3V3JQNr). Pattern: Two Pointers - Solution Review: Problem Challenge 3 Have questions about Solution Review: Problem Challenge 3? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/gxL951y9xj3). Pattern: Two Pointers - Remove Duplicates (easy) Have questions about Remove Duplicates (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/mEEA22L5mNA). Pattern: K-way merge - Solution Review: Problem Challenge 1 Have questions about Solution Review: Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/6521584850305024). Pattern: Two Heaps - Sliding Window Median (hard) Have questions about Sliding Window Median (hard)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/3Y9jm7XRrXO). Pattern: In-place Reversal of a LinkedList - Reverse a LinkedList (easy) Have questions about Reverse a LinkedList (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/3wENz1N4WW9). Pattern: Tree Breadth First Search - Solution Review: Problem Challenge 1 Have questions about Solution Review: Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/qVxy1qop77p). Pattern: Subsets - Introduction Have questions about Introduction? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/R87WmWYrELz). Pattern: Tree Breadth First Search - Solution Review: Problem Challenge 2 Have questions about Solution Review: Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/gxVWnvZjMn9). Pattern: Subsets - Problem Challenge 1 Have questions about Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/gx7O7nO0R8l). Pattern: Subsets - Unique Generalized Abbreviations (hard) Have questions about Unique Generalized Abbreviations (hard)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/NEOZDEg5PlN). Pattern: Top 'K' Elements - Problem Challenge 1 Have questions about Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/5684793748488192). Pattern: Merge Intervals - Solution Review: Problem Challenge 2 Have questions about Solution Review: Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/YVwln9kYxV2). Pattern: Cyclic Sort - Problem Challenge 1 Have questions about Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/mE2LVDE3wp0). Pattern: Tree Depth First Search - All Paths for a Sum (medium) Have questions about All Paths for a Sum (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/B815A0y2Ajn). Pattern: Tree Breadth First Search - Level Averages in a Binary Tree (easy) Have questions about Level Averages in a Binary Tree (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/YQWkA2l67GW). Pattern: Sliding Window - Problem Challenge 3 Have questions about Problem Challenge 3? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/3wDJAYG2pAR). Pattern: Two Pointers - Triplet Sum Close to Target (medium) Have questions about Triplet Sum Close to Target (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/3YlQz7PE7OA). Pattern: Modified Binary Search - Ceiling of a Number (medium) Have questions about Ceiling of a Number (medium)? Go for it! Pattern: Two Pointers - Problem Challenge 1 Have questions about Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/gxDOJJ7xAJl). Pattern: Two Pointers - Solution Review: Problem Challenge 1 Have questions about Solution Review: Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/B6XOq8KlkWo). Pattern: Modified Binary Search - Number Range (medium) Have questions about Number Range (medium)? Go for it! Pattern: In-place Reversal of a LinkedList - Problem Challenge 1 Have questions about Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/m2YYJJRP9KG). Pattern: Tree Depth First Search - Problem Challenge 1 Have questions about Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/xVV1jA29YK9). Pattern: In-place Reversal of a LinkedList - Reverse a Sub-list (medium) Have questions about Reverse a Sub-list (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/qVANqMonoB2). Pattern: Top 'K' Elements - Top 'K' Numbers (easy) Have questions about Top ‘K’ Numbers (easy)? Go for it! Pattern: Tree Depth First Search - Problem Challenge 2 Have questions about Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/B89q6NpX0Vx). Pattern: In-place Reversal of a LinkedList - Solution Review: Problem Challenge 2 Have questions about Solution Review: Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/gkAM9kxgY8Z). Pattern: Top 'K' Elements - Rearrange String (hard) Have questions about Rearrange String (hard)? Go for it! Pattern: Top 'K' Elements - Top 'K' Frequent Numbers (medium) Have questions about Top ‘K’ Frequent Numbers (medium)? Go for it! Pattern: Merge Intervals - Solution Review: Problem Challenge 1 Have questions about Solution Review: Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/JQMAmrVPL7l). Pattern: Modified Binary Search - Order-agnostic Binary Search (easy) Have questions about Order-agnostic Binary Search (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/R8LzZQlj8lO). Pattern: Two Heaps - Find the Median of a Number Stream (medium) Have questions about Find the Median of a Number Stream (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/3Yj2BmpyEy4). Pattern: Two Pointers - Dutch National Flag Problem (medium) Have questions about Dutch National Flag Problem (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/RMBxV6jz6Q0). Pattern: Tree Breadth First Search - Level Order Successor (easy) Have questions about Level Order Successor (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/7nO4VmA74Lr). Pattern: Sliding Window - Solution Review: Problem Challenge 3 Have questions about Solution Review: Problem Challenge 3? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/xoyL4q6ApNE). Pattern: In-place Reversal of a LinkedList - Reverse every K-element Sub-list (medium) Have questions about Reverse every K-element Sub-list (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/RMZylvkGznR). Pattern: Two Pointers - Triplet Sum to Zero (medium) Have questions about Triplet Sum to Zero (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/gxk639mrr5r). Pattern: In-place Reversal of a LinkedList - Problem Challenge 2 Have questions about Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/mErolRNQ00R). Pattern: Tree Depth First Search - Path With Given Sequence (medium) Have questions about Path With Given Sequence (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/m280XNlPOkn). Pattern: Sliding Window - Longest Substring with Same Letters after Replacement (hard) Have questions about Longest Substring with Same Letters after Replacement (hard)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/R8DVgjq78yR). Pattern: Fast & Slow pointers - Solution Review: Problem Challenge 3 Have questions about Solution Review: Problem Challenge 3? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/NE67J9YMj3m). Pattern: K-way merge - Introduction Have questions about Introduction? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/4973849063981056). Pattern: Top 'K' Elements - Problem Challenge 2 Have questions about Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/6005247778488320). Pattern: Top 'K' Elements - Solution Review: Problem Challenge 2 Have questions about Solution Review: Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/6209895416201216). Pattern: K-way merge - Merge K Sorted Lists (medium) Have questions about Merge K Sorted Lists (medium)? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/4611799594827776). Pattern: Sliding Window - Solution Review: Problem Challenge 1 Have questions about Solution Review: Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/N0o9QnPLKNv). Pattern: Topological Sort (Graph) - All Tasks Scheduling Orders (hard) Have questions about All Tasks Scheduling Orders (hard)? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/4994209155121152). Miscellaneous - Kth Smallest Number (hard) Have questions about Kth Smallest Number (hard)? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/4817079184130048). Pattern: Topological Sort (Graph) - Topological Sort (medium) Have questions about Topological Sort (medium)? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/6010387461832704). Pattern: Tree Depth First Search - Sum of Path Numbers (medium) Have questions about Sum of Path Numbers (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/YQ5o5vEXP69). Pattern : 0/1 Knapsack (Dynamic Programming) - 0/1 Knapsack (medium) Have questions about 0/1 Knapsack (medium)? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/5008218180812800). Pattern : 0/1 Knapsack (Dynamic Programming) - Subset Sum (medium) Have questions about Subset Sum (medium)? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/6126968124735488). Pattern: Fast & Slow pointers - Introduction Have questions about Introduction? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/g76PJVmL5PZ). Pattern: Subsets - Solution Review: Problem Challenge 3 Have questions about Solution Review: Problem Challenge 3? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/NE1V3EDAnWN). Introduction - Who should take this course? Have questions about Who should take this course?? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/RMyv02ylw2q). Pattern: Subsets - Solution Review: Problem Challenge 1 Have questions about Solution Review: Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/N0Q3PKRKMPz). Pattern: Subsets - Problem Challenge 3 Have questions about Problem Challenge 3? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/gx6BMKoWqR9). Pattern: Tree Depth First Search - Solution Review: Problem Challenge 2 Have questions about Solution Review: Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/xVPgnOvWVJq). Pattern: Sliding Window - Fruits into Baskets (medium) Have questions about Fruits into Baskets (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/Bn2KLlOR0lQ). Pattern : 0/1 Knapsack (Dynamic Programming) - Problem Challenge 2 Have questions about Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/4686075182186496). Pattern: Sliding Window - Longest Subarray with Ones after Replacement (hard) Have questions about Longest Subarray with Ones after Replacement (hard)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/B6VypRxPolJ). Pattern: Top 'K' Elements - Kth Smallest Number (easy) Have questions about Kth Smallest Number (easy)? Go for it! Pattern: Two Pointers - Solution Review: Problem Challenge 4 Have questions about Solution Review: Problem Challenge 4? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/5232329553346560). Pattern: Fast & Slow pointers - Solution Review: Problem Challenge 2 Have questions about Solution Review: Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/qAo438WozV7). Pattern: Sliding Window - Problem Challenge 2 Have questions about Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/YQ8N2OZq0VM). Pattern: Sliding Window - Solution Review: Problem Challenge 4 Have questions about Solution Review: Problem Challenge 4? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/N8nMBvDQJ0m). Pattern: Two Pointers - Introduction Have questions about Introduction? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/xlK78P3Xl7E). Pattern: Two Pointers - Pair with Target Sum (easy) Have questions about Pair with Target Sum (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/xog6q15W9GP). Pattern: Tree Breadth First Search - Problem Challenge 2 Have questions about Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/B8nj5RB1LJo). Pattern: Topological Sort (Graph) - Problem Challenge 2 Have questions about Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/6545337986580480). Pattern: Topological Sort (Graph) - Solution Review: Problem Challenge 1 Have questions about Solution Review: Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/6460939912085504). Pattern: Top 'K' Elements - Solution Review: Problem Challenge 3 Have questions about Solution Review: Problem Challenge 3? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/6223867750121472). Pattern: Top 'K' Elements - Problem Challenge 3 Have questions about Problem Challenge 3? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/4868698198245376). Pattern: Two Pointers - Squaring a Sorted Array (easy) Have questions about Squaring a Sorted Array (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/R1ppNG3nV9R). Pattern: Subsets - Subsets (easy) Have questions about Subsets (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/gx2OqlvEnWG). Pattern: Fast & Slow pointers - Start of LinkedList Cycle (medium) Have questions about Start of LinkedList Cycle (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/N7pvEn86YrN). Pattern: Sliding Window - Problem Challenge 1 Have questions about Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/N8vB7OVYo2D). Pattern: Tree Breadth First Search - Problem Challenge 3 Have questions about Problem Challenge 3? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/JYWqZ60LgZJ). Pattern: Merge Intervals - Problem Challenge 2 Have questions about Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/xVlyyv3rR93). Pattern: Merge Intervals - Problem Challenge 1 Have questions about Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/xVoBRZz7RwP). Pattern: Top 'K' Elements - 'K' Closest Numbers (medium) Have questions about ‘K’ Closest Numbers (medium)? Go for it! Pattern: Cyclic Sort - Find all Duplicate Numbers (easy) Have questions about Find all Duplicate Numbers (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/RLw1Pjk1GQ0). Pattern: Two Pointers - Problem Challenge 3 Have questions about Problem Challenge 3? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/N8rOAP6Lmw6). Pattern : 0/1 Knapsack (Dynamic Programming) - Problem Challenge 1 Have questions about Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/4874044023242752). Pattern : 0/1 Knapsack (Dynamic Programming) - Solution Review: Problem Challenge 2 Have questions about Solution Review: Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/6711007000920064). Pattern: Merge Intervals - Merge Intervals (medium) Have questions about Merge Intervals (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/3jyVPKRA8yx). Pattern : 0/1 Knapsack (Dynamic Programming) - Equal Subset Sum Partition (medium) Have questions about Equal Subset Sum Partition (medium)? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/6336012772966400). Pattern: Tree Depth First Search - Introduction Have questions about Introduction? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/q2GxL8GWB6y). Pattern: Topological Sort (Graph) - Alien Dictionary (hard) Have questions about Alien Dictionary (hard)? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/6610306698575872). Pattern: Merge Intervals - Conflicting Appointments (medium) Have questions about Conflicting Appointments (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/qVV79nGVgAG). Introduction - Course Overview Have questions about Course Overview? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/xl0ElGxR6Bq). Pattern: Cyclic Sort - Find the Missing Number (easy) Have questions about Find the Missing Number (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/JPnp17NYXE9). Pattern: In-place Reversal of a LinkedList - Solution Review: Problem Challenge 1 Have questions about Solution Review: Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/q2lZKgLm980). Pattern: Two Heaps - Problem Challenge 1 Have questions about Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/gkkmqXO6zrY). Pattern: Modified Binary Search - Solution Review: Problem Challenge 1 Have questions about Solution Review: Problem Challenge 1? Go for it! Pattern : 0/1 Knapsack (Dynamic Programming) - Solution Review: Problem Challenge 1 Have questions about Solution Review: Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5671464854355968/4802520532647936). Pattern: Modified Binary Search - Next Letter (medium) Have questions about Next Letter (medium)? Go for it! Pattern: Two Heaps - Solution Review: Problem Challenge 1 Have questions about Solution Review: Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/JP8VKGOEpXl). Pattern: Sliding Window - Introduction Have questions about Introduction? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/7D5NNZWQ8Wr). Pattern: Sliding Window - Longest Substring with K Distinct Characters (medium) Have questions about Longest Substring with K Distinct Characters (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/YQQwQMWLx80). Pattern: Tree Breadth First Search - Connect Level Order Siblings (medium) Have questions about Connect Level Order Siblings (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/m2YYxXDOJ03). Pattern: Sliding Window - Problem Challenge 4 Have questions about Problem Challenge 4? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/Y5YDWzqPn7O). Pattern: Modified Binary Search - Bitonic Array Maximum (easy) Have questions about Bitonic Array Maximum (easy)? Go for it! Pattern: Subsets - Permutations (medium) Have questions about Permutations (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/B8R83jyN3KY). Pattern: Bitwise XOR - Introduction Have questions about Introduction? Go for it! Pattern: Bitwise XOR - Two Single Numbers (medium) Have questions about Two Single Numbers (medium)? Go for it! Pattern: Fast & Slow pointers - Happy Number (medium) Have questions about Happy Number (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/39q3ZWq27jM). Pattern: Sliding Window - Solution Review: Problem Challenge 2 Have questions about Solution Review: Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/xl2g3vxrMq3). Pattern: Cyclic Sort - Problem Challenge 2 Have questions about Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/3jEXWgB5ZmM). Pattern: Cyclic Sort - Find the Duplicate Number (easy) Have questions about Find the Duplicate Number (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/3wEkKy6Pr9A). Pattern: Tree Breadth First Search - Zigzag Traversal (medium) Have questions about Zigzag Traversal (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/qVA27MMYYn0). Pattern: Tree Breadth First Search - Minimum Depth of a Binary Tree (easy) Have questions about Minimum Depth of a Binary Tree (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/3jwVx84OMkO). Pattern: Two Pointers - Triplets with Smaller Sum (medium) Have questions about Triplets with Smaller Sum (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/mElknO5OKBO). Pattern: Sliding Window - Maximum Sum Subarray of Size K (easy) Have questions about Maximum Sum Subarray of Size K (easy)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/JPKr0kqLGNP). Pattern: In-place Reversal of a LinkedList - Introduction Have questions about Introduction? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/JE8vzXroA5P). Pattern: Two Pointers - Subarrays with Product Less than a Target (medium) Have questions about Subarrays with Product Less than a Target (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/RMV1GV1yPYz). Pattern: Tree Breadth First Search - Problem Challenge 1 Have questions about Problem Challenge 1? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/NE5109Jl02v). Pattern: Fast & Slow pointers - Problem Challenge 3 Have questions about Problem Challenge 3? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/3jY0GKpPDxr). Pattern: Subsets - String Permutations by changing case (medium) Have questions about String Permutations by changing case (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/xVlKmyX542P). Pattern: Subsets - Solution Review: Problem Challenge 2 Have questions about Solution Review: Problem Challenge 2? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/xVQyDZBMpKE). Pattern: Modified Binary Search - Search in a Sorted Infinite Array (medium) Have questions about Search in a Sorted Infinite Array (medium)? Go for it! Pattern: Merge Intervals - Intervals Intersection (medium) Have questions about Intervals Intersection (medium)? Go for it! View the lesson [here](https://www.educative.io/courses/grokking-the-coding-interview/JExVVqRAN9D). Pattern: Bitwise XOR - Problem Challenge 1 Have questions about Problem Challenge 1? Go for it! Pattern: Top 'K' Elements - 'K' Closest Points to the Origin (easy) Have questions about ‘K’ Closest Points to the Origin (easy)? Go for it! Pattern: Bitwise XOR - Complement of Base 10 Number (medium) Have questions about Complement of Base 10 Number (medium)? Go for it!
About the Grokking the Coding Interview: Patterns for Coding Questions (Design Gurus) category [Grokking the Coding Interview: Patterns for Coding Questions (Design Gurus)] (1)
Simplified version [Pattern: Cyclic Sort - Find the Duplicate Number (easy)] (1)
Point with maximum number of overlaps [Pattern: Merge Intervals - Solution Review: Problem Challenge 1] (1)
Able to solve problem 1 in O(N2) rather than O(N3) which is complexity of solution [Pattern: Two Pointers - Problem Challenge 1] (1)
Simple Explanation for program line : count += right - left; [Pattern: Two Pointers - Triplets with Smaller Sum (medium)] (3)
Solution does not to support order of character for pattern. It is support for permutation [Pattern: Sliding Window - Solution Review: Problem Challenge 3] (1)
Should not use Adjacent List to store the map, use Adjacent HashSet instead [Pattern: Topological Sort (Graph) - Problem Challenge 1] (1)
Start from sink, more order are valid [Pattern: Topological Sort (Graph) - Topological Sort (medium)] (1)
Solution does not work if an employee E1 has two intervals before E2 - EDIT: It works [Pattern: Merge Intervals - Solution Review: Problem Challenge 3] (1)
Why is the Time Complexity O(N) for smallest sub array? [Pattern: Sliding Window - Smallest Subarray with a given sum (easy)] (7)
Max Heap initialization (reverse order comparator) [Pattern: Two Heaps - Sliding Window Median (hard)] (1)
Do we need DP here? [Pattern : 0/1 Knapsack (Dynamic Programming) - Minimum Subset Sum Difference (hard)] (1)
The provided solution is not correct! [Pattern: Tree Breadth First Search - Solution Review: Problem Challenge 3] (2)
Why does heap store index of capital and profit? [Pattern: Two Heaps - Maximize Capital (hard)] (5)
What should we do if a level has only one node and it should be in the left/right view based on left/right child of its parent node? [Pattern: Tree Breadth First Search - Solution Review: Problem Challenge 3] (3)
The question don't said the numbers taken from the range 1 to ‘n’ [Pattern: Cyclic Sort - Solution Review: Problem Challenge 2] (2)
Bug: comparator in heap [Pattern: Two Heaps - Find the Median of a Number Stream (medium)] (1)
Bug: does not work if both children are negative [Pattern: Tree Depth First Search - Solution Review: Problem Challenge 2] (1)
Why start is the ceiling of the number? [Pattern: Modified Binary Search - Ceiling of a Number (medium)] (2)
How space complexity is O(N*2^N) instead of O(N)? [Pattern: Subsets - Balanced Parentheses (hard)] (1)
Need better explanation and example walk through [Pattern: Sliding Window - Longest Substring with Same Letters after Replacement (hard)] (1)
Why do we need a 3rd Loop, can it be done in 2 loops? [Pattern: Two Pointers - Subarrays with Product Less than a Target (medium)] (1)
Is the 24th line of the solution wrong? [Pattern: Sliding Window - Solution Review: Problem Challenge 1] (1)
When product is bigger than target, why do we set the upperbound for left pointer to length of the arrary [Pattern: Two Pointers - Subarrays with Product Less than a Target (medium)] (1)
Line 16 of the solution [Pattern: Two Pointers - Triplet Sum Close to Target (medium)] (1)
Space complexity analysis for sliding window and two pointer [Pattern: Two Pointers - Triplet Sum Close to Target (medium)] (1)
Assumption on the solution [Pattern: Two Pointers - Triplet Sum Close to Target (medium)] (2)
Why this problem is similar to Maximum Sum Subarray of Size? [Pattern: Sliding Window - Solution Review: Problem Challenge 4] (2)
The "if" statement might cause some bugs [Pattern: Sliding Window - Longest Substring with Same Letters after Replacement (hard)] (2)
Time Complexity is O(N^2 * N!) not O(N * N!) [Pattern: Subsets - Permutations (medium)] (1)