design-gurus · Aug 22, 2026 · Aug 22, 2026
diff --git 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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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)