diff --git a/patterns/0-1-knapsack.md b/patterns/0-1-knapsack.md index 271a5ec..f2e7607 100644 --- a/patterns/0-1-knapsack.md +++ b/patterns/0-1-knapsack.md @@ -92,5 +92,6 @@ Note that O(n × C) is pseudo-polynomial. It depends on the size of the capacity ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to 0/1 Knapsack Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-01-knapsack-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) - Every dynamic programming pattern, in depth: [Grokking Dynamic Programming](https://www.designgurus.io/course/grokking-dynamic-programming) diff --git a/patterns/articulation-points-and-bridges.md b/patterns/articulation-points-and-bridges.md index 673d58a..fcb572e 100644 --- a/patterns/articulation-points-and-bridges.md +++ b/patterns/articulation-points-and-bridges.md @@ -103,4 +103,5 @@ Critical Connections in a Network, Minimum Number of Days to Disconnect Island, ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Articulation Points and Bridges Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-articulation-points-and-bridges-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/backtracking.md b/patterns/backtracking.md index c88069a..e23a408 100644 --- a/patterns/backtracking.md +++ b/patterns/backtracking.md @@ -105,5 +105,6 @@ Sudoku Solver, N-Queens, Generate Parentheses, Word Search, Letter Combinations ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Backtracking Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-backtracking-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) - Recursion and backtracking in depth: [Grokking the Art of Recursion](https://www.designgurus.io/course/grokking-recursion-for-coding-interview) diff --git a/patterns/binary-indexed-tree.md b/patterns/binary-indexed-tree.md index dfb8e2f..7858151 100644 --- a/patterns/binary-indexed-tree.md +++ b/patterns/binary-indexed-tree.md @@ -105,4 +105,5 @@ Range Sum Query Mutable, Count of Smaller Numbers After Self, Count of Range Sum ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Binary Indexed Tree Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-binary-indexed-tree-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/bitwise-xor.md b/patterns/bitwise-xor.md index f5ca11d..ecb9f0b 100644 --- a/patterns/bitwise-xor.md +++ b/patterns/bitwise-xor.md @@ -95,4 +95,5 @@ Single Number, Two Single Numbers, Single Number II, Complement of Base 10 Numbe ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Bitwise XOR Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-bitwise-xor-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/clone.md b/patterns/clone.md index 0de4ea9..c37108a 100644 --- a/patterns/clone.md +++ b/patterns/clone.md @@ -103,4 +103,5 @@ Clone Graph, Copy List with Random Pointer, Clone N-ary Tree, Clone Binary Tree ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Clone Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-clone-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/counting.md b/patterns/counting.md index 85262ac..ec77c48 100644 --- a/patterns/counting.md +++ b/patterns/counting.md @@ -89,4 +89,5 @@ Count Elements With Maximum Frequency, Maximum Population Year, Least Number of ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Counting Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-counting-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/cyclic-sort.md b/patterns/cyclic-sort.md index a6f2895..c11b12a 100644 --- a/patterns/cyclic-sort.md +++ b/patterns/cyclic-sort.md @@ -84,4 +84,5 @@ Cyclic Sort, Find the Missing Number, Find all Missing Numbers, Find the Duplica ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Cyclic Sort Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-cyclic-sort-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/fast-and-slow-pointers.md b/patterns/fast-and-slow-pointers.md index a9ba80e..b7f162b 100644 --- a/patterns/fast-and-slow-pointers.md +++ b/patterns/fast-and-slow-pointers.md @@ -87,4 +87,5 @@ Linked List Cycle, Start of Linked List Cycle, Middle of the Linked List, Palind ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Fast & Slow Pointers Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-fast-slow-pointers-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/fibonacci-numbers.md b/patterns/fibonacci-numbers.md index 89ac4bc..527eaf9 100644 --- a/patterns/fibonacci-numbers.md +++ b/patterns/fibonacci-numbers.md @@ -95,5 +95,6 @@ Fibonacci Numbers, Staircase, Number Factors, Minimum Jumps to Reach the End, Mi ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Fibonacci Numbers Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-fibonacci-numbers-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) - Every dynamic programming pattern, in depth: [Grokking Dynamic Programming](https://www.designgurus.io/course/grokking-dynamic-programming) diff --git a/patterns/graphs.md b/patterns/graphs.md index 521d719..e11e8e9 100644 --- a/patterns/graphs.md +++ b/patterns/graphs.md @@ -113,5 +113,6 @@ Find if Path Exists in Graph, Number of Provinces, Word Ladder, Bus Routes, Find ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Graph](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-graph) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) - The data structure itself, from scratch: [Grokking Data Structures](https://www.designgurus.io/course/grokking-data-structures-for-coding-interviews) diff --git a/patterns/greedy-algorithms.md b/patterns/greedy-algorithms.md index 3a3e5be..099b750 100644 --- a/patterns/greedy-algorithms.md +++ b/patterns/greedy-algorithms.md @@ -89,4 +89,5 @@ Maximum Length of Pair Chain, Non-overlapping Intervals, Minimum Add to Make Par ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Greedy Algorithm](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-greedy-algorithm) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/hash-maps.md b/patterns/hash-maps.md index daba564..0d08608 100644 --- a/patterns/hash-maps.md +++ b/patterns/hash-maps.md @@ -80,5 +80,6 @@ Two Sum, First Non-repeating Character, Contains Duplicate, Longest Palindrome, ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Hash Tables](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-hash-tables) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) - The data structure itself, from scratch: [Grokking Data Structures](https://www.designgurus.io/course/grokking-data-structures-for-coding-interviews) diff --git a/patterns/in-place-reversal-of-a-linked-list.md b/patterns/in-place-reversal-of-a-linked-list.md index 57c8cb0..a506c4d 100644 --- a/patterns/in-place-reversal-of-a-linked-list.md +++ b/patterns/in-place-reversal-of-a-linked-list.md @@ -100,4 +100,5 @@ Reverse a Linked List, Reverse a Sub-list, Reverse Every K-element Sub-list, Rev ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to In-place Reversal of a Linked List Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-inplace-reversal-of-a-linked-list-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/island-matrix-traversal.md b/patterns/island-matrix-traversal.md index 5d725c9..f1b5f87 100644 --- a/patterns/island-matrix-traversal.md +++ b/patterns/island-matrix-traversal.md @@ -115,4 +115,5 @@ Number of Islands, Biggest Island, Flood Fill, Number of Closed Islands, Surroun ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Island Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-island-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/k-way-merge.md b/patterns/k-way-merge.md index 6fd472c..76db95b 100644 --- a/patterns/k-way-merge.md +++ b/patterns/k-way-merge.md @@ -102,4 +102,5 @@ Merge K Sorted Lists, Kth Smallest Number in M Sorted Lists, Kth Smallest Number ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to K-way Merge Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-kway-merge-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/linear-sorting-algorithms.md b/patterns/linear-sorting-algorithms.md index be8e75a..3ea7312 100644 --- a/patterns/linear-sorting-algorithms.md +++ b/patterns/linear-sorting-algorithms.md @@ -95,4 +95,5 @@ Sort Colors, Relative Sort Array, Height Checker, Maximum Gap, Array Partition, ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Linear Sorting Algorithms](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-linear-sorting-algorithms) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/meet-in-the-middle.md b/patterns/meet-in-the-middle.md index 180726e..53f48ef 100644 --- a/patterns/meet-in-the-middle.md +++ b/patterns/meet-in-the-middle.md @@ -86,4 +86,5 @@ Subset Sum Equal to Target, Subsets having Sum between A and B, Closest Subseque ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Meet in the Middle](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-meet-in-the-middle) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/merge-intervals.md b/patterns/merge-intervals.md index a970759..2a99a90 100644 --- a/patterns/merge-intervals.md +++ b/patterns/merge-intervals.md @@ -90,4 +90,5 @@ Merge Intervals, Insert Interval, Intervals Intersection, Conflicting Appointmen ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Merge Intervals Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-merge-intervals-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/modified-binary-search.md b/patterns/modified-binary-search.md index d029493..afd408f 100644 --- a/patterns/modified-binary-search.md +++ b/patterns/modified-binary-search.md @@ -97,4 +97,5 @@ Order-agnostic Binary Search, Ceiling of a Number, Next Letter, Number Range, Se ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Modified Binary Search Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-modified-binary-search-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/monotonic-queue.md b/patterns/monotonic-queue.md index c95303b..4416862 100644 --- a/patterns/monotonic-queue.md +++ b/patterns/monotonic-queue.md @@ -83,4 +83,5 @@ Sliding Window Maximum, Shortest Subarray with Sum at Least K, Constrained Subse ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Monotonic Queue Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-monotonic-queue-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/monotonic-stack.md b/patterns/monotonic-stack.md index 69f5d3f..ce20f2a 100644 --- a/patterns/monotonic-stack.md +++ b/patterns/monotonic-stack.md @@ -93,4 +93,5 @@ Next Greater Element, Next Smaller Element, Daily Temperatures, Stock Span, Larg ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Monotonic Stack](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-monotonic-stack) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/mos-algorithm.md b/patterns/mos-algorithm.md index 04f8832..58d1369 100644 --- a/patterns/mos-algorithm.md +++ b/patterns/mos-algorithm.md @@ -116,4 +116,5 @@ XOR Queries of a Subarray, Distinct Elements in a Subarray, Minimum Absolute Dif ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to MO’s Algorithm Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-mos-algorithm-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/multi-threaded.md b/patterns/multi-threaded.md index ab2441e..b315ddc 100644 --- a/patterns/multi-threaded.md +++ b/patterns/multi-threaded.md @@ -109,5 +109,6 @@ Print in Order, Print FooBar Alternately, Print Zero Even Odd, Building H2O, Fiz ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Multi-threaded Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-multithreaded-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) - Concurrency in depth: [Grokking Multithreading and Concurrency](https://www.designgurus.io/course/grokking-multithreading-and-concurrency-for-coding-interviews) diff --git a/patterns/ordered-set.md b/patterns/ordered-set.md index a8ccc24..68108bf 100644 --- a/patterns/ordered-set.md +++ b/patterns/ordered-set.md @@ -90,4 +90,5 @@ My Calendar I, My Calendar II, 132 Pattern, Merge Similar Items, Longest Continu ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Ordered Set Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-ordered-set-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/palindromic-subsequence.md b/patterns/palindromic-subsequence.md index fc8b177..e73aa43 100644 --- a/patterns/palindromic-subsequence.md +++ b/patterns/palindromic-subsequence.md @@ -96,5 +96,6 @@ Longest Palindromic Subsequence, Longest Palindromic Substring, Count of Palindr ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Palindromic Subsequence Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-palindromic-subsequence-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) - Every dynamic programming pattern, in depth: [Grokking Dynamic Programming](https://www.designgurus.io/course/grokking-dynamic-programming) diff --git a/patterns/prefix-sum.md b/patterns/prefix-sum.md index 3144fbb..4bd82aa 100644 --- a/patterns/prefix-sum.md +++ b/patterns/prefix-sum.md @@ -96,4 +96,5 @@ Find the Middle Index in Array, Subarray Sum Equals K, Subarray Sums Divisible b ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction Prefix Sum Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-prefix-sum-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/segment-tree.md b/patterns/segment-tree.md index 636d3db..1641994 100644 --- a/patterns/segment-tree.md +++ b/patterns/segment-tree.md @@ -117,4 +117,5 @@ Range Sum Query Mutable, Range Minimum Query, Count of Smaller Numbers After Sel ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Segment Tree Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-segment-tree-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/serialize-and-deserialize.md b/patterns/serialize-and-deserialize.md index 8bde13a..d2a7cc9 100644 --- a/patterns/serialize-and-deserialize.md +++ b/patterns/serialize-and-deserialize.md @@ -101,4 +101,5 @@ Serialize and Deserialize Binary Tree, Serialize and Deserialize BST, Serialize ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Serialize and Deserialize Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-serialize-and-deserialize-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/simulation.md b/patterns/simulation.md index d24baa6..7fd9d1c 100644 --- a/patterns/simulation.md +++ b/patterns/simulation.md @@ -107,4 +107,5 @@ Array Transformation, Water Bottles, Spiral Matrix, Spiral Matrix III, Robot Bou ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Simulation Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-simulation-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/sliding-window.md b/patterns/sliding-window.md index bd3b420..41cb85d 100644 --- a/patterns/sliding-window.md +++ b/patterns/sliding-window.md @@ -86,4 +86,5 @@ Maximum Sum Subarray of Size K, Smallest Subarray with a Given Sum, Longest Subs ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Sliding Window Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-sliding-window-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/stacks.md b/patterns/stacks.md index 8242721..a631a1a 100644 --- a/patterns/stacks.md +++ b/patterns/stacks.md @@ -90,5 +90,6 @@ Balanced Parentheses, Reverse a String, Decimal to Binary Conversion, Simplify P ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Stack](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-stack) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) - The data structure itself, from scratch: [Grokking Data Structures](https://www.designgurus.io/course/grokking-data-structures-for-coding-interviews) diff --git a/patterns/subsets.md b/patterns/subsets.md index b7d9268..55f70c8 100644 --- a/patterns/subsets.md +++ b/patterns/subsets.md @@ -96,5 +96,6 @@ Subsets, Subsets With Duplicates, Permutations, String Permutations by changing ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Subsets Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-subsets-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) - Recursion and backtracking in depth: [Grokking the Art of Recursion](https://www.designgurus.io/course/grokking-recursion-for-coding-interview) diff --git a/patterns/top-k-elements.md b/patterns/top-k-elements.md index 8b361bd..160e2f8 100644 --- a/patterns/top-k-elements.md +++ b/patterns/top-k-elements.md @@ -100,5 +100,6 @@ Top K Numbers, Kth Smallest Number, K Closest Points to Origin, Connect Ropes, T ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Top 'K' Elements Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-top-k-elements-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) - The heap itself, from scratch: [Grokking Data Structures](https://www.designgurus.io/course/grokking-data-structures-for-coding-interviews) diff --git a/patterns/topological-sort.md b/patterns/topological-sort.md index 5703f52..19fdc2a 100644 --- a/patterns/topological-sort.md +++ b/patterns/topological-sort.md @@ -95,4 +95,5 @@ Task Scheduling, Task Scheduling Order, All Tasks Scheduling Orders, Course Sche ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Topological Sort](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-topological-sort) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/tree-depth-first-search.md b/patterns/tree-depth-first-search.md index 71d19a5..f4a6488 100644 --- a/patterns/tree-depth-first-search.md +++ b/patterns/tree-depth-first-search.md @@ -92,4 +92,5 @@ Binary Tree Path Sum, All Paths for a Sum, Sum of Path Numbers, Path With Given ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Tree Depth First Search Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-tree-depth-first-search-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/tree-level-order-traversal.md b/patterns/tree-level-order-traversal.md index 854f2c2..30a8379 100644 --- a/patterns/tree-level-order-traversal.md +++ b/patterns/tree-level-order-traversal.md @@ -101,4 +101,5 @@ Binary Tree Level Order Traversal, Reverse Level Order Traversal, Zigzag Travers ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Tree Level Order Traversal Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-tree-breadth-first-search-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/trie.md b/patterns/trie.md index 0574b7e..9cae792 100644 --- a/patterns/trie.md +++ b/patterns/trie.md @@ -109,5 +109,6 @@ Implement Trie, Design Add and Search Words Data Structure, Search Suggestions S ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Trie](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-trie) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) - The data structure itself, from scratch: [Grokking Data Structures](https://www.designgurus.io/course/grokking-data-structures-for-coding-interviews) diff --git a/patterns/two-heaps.md b/patterns/two-heaps.md index 046b312..e3ed58e 100644 --- a/patterns/two-heaps.md +++ b/patterns/two-heaps.md @@ -86,5 +86,6 @@ Find the Median of a Number Stream, Sliding Window Median, Maximize Capital, IPO ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Two Heaps Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-two-heaps-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) - The heap itself, from scratch: [Grokking Data Structures](https://www.designgurus.io/course/grokking-data-structures-for-coding-interviews) diff --git a/patterns/two-pointers.md b/patterns/two-pointers.md index 98b46f0..6d71cb4 100644 --- a/patterns/two-pointers.md +++ b/patterns/two-pointers.md @@ -88,4 +88,5 @@ Pair with Target Sum, Remove Duplicates, Squaring a Sorted Array, Triplet Sum to ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Two Pointers Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-two-pointers-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) diff --git a/patterns/union-find.md b/patterns/union-find.md index e8c4edb..a908b05 100644 --- a/patterns/union-find.md +++ b/patterns/union-find.md @@ -97,4 +97,5 @@ Redundant Connection, Number of Provinces, Number of Islands II, Accounts Merge, ## Go deeper -- The full pattern, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview) +- This pattern's introduction in the course: [Introduction to Union Find Pattern](https://www.designgurus.io/course-play/grokking-the-coding-interview/doc/introduction-to-union-find-pattern) +- The problems that use it, with worked solutions in six languages and runnable tests: [Grokking the Coding Interview](https://www.designgurus.io/course/grokking-the-coding-interview)