47:"/_next/static/chunks/2g8w-80ml0qgh.js" 48:"/_next/static/chunks/0iv56yrji_20j.js" 49:"/_next/static/chunks/2j22cxchii_xx.js" 4a:"/_next/static/chunks/0lc44eilyyvky.js" 4b:"/_next/static/chunks/1jl6tco-uuy-j.js" 4c:"/_next/static/chunks/20w4eaqlekefm.js" 4d:"/_next/static/chunks/3i1_gmjy-npy3.js" 4e:"/_next/static/chunks/3k2gyg36fnag_.js" 4f:"/_next/static/chunks/0om3fkgfnicab.js" 50:"/_next/static/chunks/39xqakak-rww8.js" 51:"/_next/static/chunks/2k8pepwc4pxns.js" 52:"/_next/static/chunks/3di53f0fz7pw_.js" 53:"/_next/static/chunks/1ot1rbfa0d_n4.js" 54:"/_next/static/chunks/1nyz-fz1mk3y6.js" 55:"/_next/static/chunks/2d693k1du0jif.js" 56:"/_next/static/chunks/23lvo0719esx5.js" 57:"/_next/static/chunks/2s3axvrz9s11v.js" 58:"/_next/static/chunks/3m1xjj5kw5fie.js" 59:"/_next/static/chunks/20k3408cq3fwt.js" 5a:"/_next/static/chunks/3bgoyiso1rhn7.js" 5b:"/_next/static/chunks/1r-4-7k4p367v.js" 5c:"/_next/static/chunks/0oag6lffx7d01.js" 5d:"/_next/static/chunks/082jo-0ajazgr.js" 5e:"/_next/static/chunks/0-a64pg0hn7g7.js" 5f:"/_next/static/chunks/09nq57stwzkgf.js" 60:"/_next/static/chunks/20329i6m_04t6.js" 61:"/_next/static/chunks/0wa9m1-tphf9u.js" 62:"/_next/static/chunks/0so1i35v7xcta.js" 63:"/_next/static/chunks/0i3-eynrkvqi7.js" 64:"/_next/static/chunks/1aoncsc85dt-5.js" 65:"/_next/static/chunks/2ozcrjb_hh74t.js" 66:"/_next/static/chunks/0hy4a31wjpabs.js" 67:"/_next/static/chunks/1tn-0fivsxsv1.js" 68:"/_next/static/chunks/0hlb44ca7-4a2.js" 69:"/_next/static/chunks/3ah32gv3pv1wi.js" 6a:"/_next/static/chunks/0jbzid2v9xv3h.js" 6b:"/_next/static/chunks/2wl4_vih_-70f.js" 6c:"/_next/static/chunks/1_lo_qve3gu86.js" 6d:"/_next/static/chunks/3tgd0la5mmnsn.js" 6e:"/_next/static/chunks/18ggtgz2yf759.js" 6f:"/_next/static/chunks/3odmutpycmfnf.js" 70:"/_next/static/chunks/253gnmj0-cj17.js" 71:I[593304,["$2d","$2e","$2f","$30","$31","$32","$47","$48","$49","$4a","$4b","$4c","$4d","$4e","$4f","$50","$51","$52","$53","$54","$55","$56","$57","$58","$59","$5a","$5b","$5c","$5d","$5e","$5f","$60","$61","$62","$63","$64","$65","$66","$67","$68","$69","$6a","$6b","$6c","$6d","$6e","$6f","$70"],"OwnedHydration"] 72:T4fa,// Hierarchical structure → Recursive solution interface FileSystemNode { name: string; type: 'file' | 'directory'; children?: FileSystemNode[]; // Directories contain more nodes! size?: number; } // The recursive structure is OBVIOUS: directories contain nodes // which may themselves be directories containing more nodes function calculateTotalSize(node: FileSystemNode): number { if (node.type === 'file') { return node.size ?? 0; // Base case: files have direct size } // Recursive case: sum sizes of all children // Each child is the SAME type of problem (calculate its total size) return node.children?.reduce( (total, child) => total + calculateTotalSize(child), 0 ) ?? 0; } // The hierarchy in the data DEMANDS recursive thinking const projectDir: FileSystemNode = { name: 'project', type: 'directory', children: [ { name: 'README.md', type: 'file', size: 1024 }, { name: 'src', type: 'directory', children: [ { name: 'index.ts', type: 'file', size: 2048 }, { name: 'utils.ts', type: 'file', size: 512 }, ], }, ], }; console.log(calculateTotalSize(projectDir)); // 358473:T54e,# Hierarchical structure → Recursive solution from dataclasses import dataclass from typing import Optional @dataclass class FileSystemNode: name: str node_type: str # 'file' or 'directory' children: Optional[list['FileSystemNode']] = None size: Optional[int] = None # The recursive structure is OBVIOUS: directories contain nodes # which may themselves be directories containing more nodes def calculate_total_size(node: FileSystemNode) -> int: if node.node_type == 'file': return node.size or 0 # Base case: files have direct size # Recursive case: sum sizes of all children # Each child is the SAME type of problem (calculate its total size) return sum( calculate_total_size(child) for child in (node.children or []) ) # The hierarchy in the data DEMANDS recursive thinking project_dir = FileSystemNode( name='project', node_type='directory', children=[ FileSystemNode(name='README.md', node_type='file', size=1024), FileSystemNode( name='src', node_type='directory', children=[ FileSystemNode(name='index.ts', node_type='file', size=2048), FileSystemNode(name='utils.ts', node_type='file', size=512), ], ), ], ) print(calculate_total_size(project_dir)) # 358474:T698,// Applying STAMP Framework: Count nodes in a binary tree interface TreeNode { value: number; left?: TreeNode; right?: TreeNode; } /* * STAMP Analysis for "Count nodes in binary tree": * * S - Self-Similarity: * ✓ A tree is a node + left subtree + right subtree * ✓ Counting nodes in a subtree is the SAME problem * * T - Trivial Base: * ✓ Empty tree (null/undefined) has 0 nodes * ✓ Single node with no children has 1 node * * A - Assembly: * ✓ Total = 1 (current) + count(left) + count(right) * ✓ Subproblem results combine via simple addition * * M - Measurable Progress: * ✓ Each recursive call has fewer nodes (subtree < full tree) * ✓ Eventually reaches leaf nodes, then null * * P - Pattern Recognition: * ✓ Classic tree traversal pattern * ✓ Similar to calculating tree height, sum, etc. * * VERDICT: Perfect recursive structure! Proceed with confidence. */ function countNodes(node: TreeNode | undefined): number { // T - Trivial Base: empty tree has 0 nodes if (!node) return 0; // A - Assembly: combine current node (1) with subproblem solutions // S - Self-Similarity: countNodes on subtrees is same problem // M - Progress: left and right subtrees are smaller than current tree return 1 + countNodes(node.left) + countNodes(node.right); } // The STAMP framework confirms this is naturally recursive const tree: TreeNode = { value: 1, left: { value: 2, left: { value: 4 }, right: { value: 5 }, }, right: { value: 3, right: { value: 6 }, }, }; console.log(countNodes(tree)); // 675:T6b1,# Applying STAMP Framework: Count nodes in a binary tree from dataclasses import dataclass from typing import Optional @dataclass class TreeNode: value: int left: Optional['TreeNode'] = None right: Optional['TreeNode'] = None """ STAMP Analysis for "Count nodes in binary tree": S - Self-Similarity: ✓ A tree is a node + left subtree + right subtree ✓ Counting nodes in a subtree is the SAME problem T - Trivial Base: ✓ Empty tree (None) has 0 nodes ✓ Single node with no children has 1 node A - Assembly: ✓ Total = 1 (current) + count(left) + count(right) ✓ Subproblem results combine via simple addition M - Measurable Progress: ✓ Each recursive call has fewer nodes (subtree < full tree) ✓ Eventually reaches leaf nodes, then None P - Pattern Recognition: ✓ Classic tree traversal pattern ✓ Similar to calculating tree height, sum, etc. VERDICT: Perfect recursive structure! Proceed with confidence. """ def count_nodes(node: Optional[TreeNode]) -> int: # T - Trivial Base: empty tree has 0 nodes if node is None: return 0 # A - Assembly: combine current node (1) with subproblem solutions # S - Self-Similarity: count_nodes on subtrees is same problem # M - Progress: left and right subtrees are smaller than current tree return 1 + count_nodes(node.left) + count_nodes(node.right) # The STAMP framework confirms this is naturally recursive tree = TreeNode( value=1, left=TreeNode( value=2, left=TreeNode(value=4), right=TreeNode(value=5), ), right=TreeNode( value=3, right=TreeNode(value=6), ), ) print(count_nodes(tree)) # 676:T451,Some problems don't obviously scream 'recursion!'—their recursive structure is hidden beneath surface complexity. Developing the ability to see through the disguise is what separates competent engineers from exceptional ones. ### The Reframing Technique When a problem seems iterative or chaotic, try reframing it by asking: **'What if I had already solved this for smaller inputs?'** This single question transforms your perspective. Instead of thinking about how to build up a solution from nothing, you imagine having partial solutions and ask how to extend them. **Example: Generating All Subsets of a Set** At first, this seems like a combinatorial explosion—how do you systematically list all 2ⁿ subsets? *Reframe*: What if I had all subsets of {2, 3}? They are: {}, {2}, {3}, {2,3}. Now, to get all subsets of {1, 2, 3}, I just take each subset of {2, 3} and create two versions: one without 1, one with 1. {} → {} and {1} {2} → {2} and {1,2} {3} → {3} and {1,3} {2,3} → {2,3} and {1,2,3} **The recursive structure was there all along—we just needed to reframe to see it.**77:T511,// Generating all subsets - recursive structure revealed through reframing function generateSubsets(nums: number[]): number[][] { // Base case: empty set has one subset—the empty set itself if (nums.length === 0) { return [[]]; } // Reframing: "What if I had subsets of the rest?" const first = nums[0]; const rest = nums.slice(1); // Get all subsets of the remaining elements const subsetsOfRest = generateSubsets(rest); // For each subset of rest, create two versions: // 1. The subset as-is (does not include 'first') // 2. The subset with 'first' prepended (includes 'first') const result: number[][] = []; for (const subset of subsetsOfRest) { result.push(subset); // Without first result.push([first, ...subset]); // With first } return result; } console.log(generateSubsets([1, 2, 3])); // [[], [1], [2], [1,2], [3], [1,3], [2,3], [1,2,3]] /* * The 'disguise' was thinking about the problem as: * "How do I enumerate all 2^n possibilities?" * * The 'reveal' came from reframing as: * "If I knew subsets of n-1 elements, how would I extend to n elements?" * * Answer: Each existing subset spawns two new subsets * (with and without the new element) */78:T4a2,# Generating all subsets - recursive structure revealed through reframing def generate_subsets(nums: list[int]) -> list[list[int]]: # Base case: empty set has one subset—the empty set itself if not nums: return [[]] # Reframing: "What if I had subsets of the rest?" first = nums[0] rest = nums[1:] # Get all subsets of the remaining elements subsets_of_rest = generate_subsets(rest) # For each subset of rest, create two versions: # 1. The subset as-is (does not include 'first') # 2. The subset with 'first' prepended (includes 'first') result = [] for subset in subsets_of_rest: result.append(subset) # Without first result.append([first] + subset) # With first return result print(generate_subsets([1, 2, 3])) # [[], [1], [2], [1,2], [3], [1,3], [2,3], [1,2,3]] """ The 'disguise' was thinking about the problem as: "How do I enumerate all 2^n possibilities?" The 'reveal' came from reframing as: "If I knew subsets of n-1 elements, how would I extend to n elements?" Answer: Each existing subset spawns two new subsets (with and without the new element) """79:T6e0,// Validate BST - recursive structure revealed through wishful thinking interface TreeNode { value: number; left?: TreeNode; right?: TreeNode; } /* * Wishful thinking process: * * "I wish I had a function that validates a subtree within bounds..." * → isValidBSTInRange(node, min, max): boolean * * "How would I use it?" * → Check current node is within (min, max) * → Call it on left subtree with max = current value * → Call it on right subtree with min = current value * * "Wait, that IS the recursive structure!" */ function isValidBST(root: TreeNode | undefined): boolean { return isValidBSTInRange(root, -Infinity, Infinity); } function isValidBSTInRange( node: TreeNode | undefined, min: number, max: number ): boolean { // Base case: empty tree is valid if (!node) return true; // Check current node respects the range if (node.value <= min || node.value >= max) { return false; } // Wishful thinking becomes reality: // Left subtree must have all values < node.value // Right subtree must have all values > node.value return ( isValidBSTInRange(node.left, min, node.value) && isValidBSTInRange(node.right, node.value, max) ); } // The complex constraint propagation naturally emerges from recursion const validBST: TreeNode = { value: 5, left: { value: 3, left: { value: 1 }, right: { value: 4 } }, right: { value: 7, left: { value: 6 }, right: { value: 8 } }, }; const invalidBST: TreeNode = { value: 5, left: { value: 3, left: { value: 1 }, right: { value: 6 } }, // 6 > 5! right: { value: 7 }, }; console.log(isValidBST(validBST)); // true console.log(isValidBST(invalidBST)); // false7a:T75e,# Validate BST - recursive structure revealed through wishful thinking from dataclasses import dataclass from typing import Optional import math @dataclass class TreeNode: value: int left: Optional['TreeNode'] = None right: Optional['TreeNode'] = None """ Wishful thinking process: "I wish I had a function that validates a subtree within bounds..." → is_valid_bst_in_range(node, min_val, max_val): bool "How would I use it?" → Check current node is within (min_val, max_val) → Call it on left subtree with max_val = current value → Call it on right subtree with min_val = current value "Wait, that IS the recursive structure!" """ def is_valid_bst(root: Optional[TreeNode]) -> bool: return is_valid_bst_in_range(root, -math.inf, math.inf) def is_valid_bst_in_range( node: Optional[TreeNode], min_val: float, max_val: float ) -> bool: # Base case: empty tree is valid if node is None: return True # Check current node respects the range if node.value <= min_val or node.value >= max_val: return False # Wishful thinking becomes reality: # Left subtree must have all values < node.value # Right subtree must have all values > node.value return ( is_valid_bst_in_range(node.left, min_val, node.value) and is_valid_bst_in_range(node.right, node.value, max_val) ) # The complex constraint propagation naturally emerges from recursion valid_bst = TreeNode( value=5, left=TreeNode(value=3, left=TreeNode(value=1), right=TreeNode(value=4)), right=TreeNode(value=7, left=TreeNode(value=6), right=TreeNode(value=8)), ) invalid_bst = TreeNode( value=5, left=TreeNode(value=3, left=TreeNode(value=1), right=TreeNode(value=6)), # 6 > 5! right=TreeNode(value=7), ) print(is_valid_bst(valid_bst)) # True print(is_valid_bst(invalid_bst)) # False7b:T442,While every problem is unique, certain categories almost always have recursive structure. Recognizing these categories accelerates your problem-solving. ### Category 1: Tree and Graph Traversal Trees are recursive by definition (a tree is a node plus subtrees), so any tree operation naturally fits recursion: - Computing properties (height, size, sum, diameter) - Searching and pathfinding - Transformation and modification - Comparison (equality, symmetry, subtree matching) Graphs, while not inherently recursive, become so when you frame traversal as 'visit this node, then visit its neighbors'—classic DFS. ### Category 2: Divide-and-Conquer Algorithms These follow the template: split → recurse on parts → combine: - Merge Sort, Quick Sort - Binary Search and variants - Closest Pair of Points - Karatsuba Multiplication - Many computational geometry algorithms ### Category 3: Combinatorial Generation Generating all possibilities from a set of choices: - Permutations, combinations, subsets - Partitions and compositions - Parenthesizations - Valid bracket sequences7c:T420,Just as important as recognizing recursive structure is recognizing when it's *absent* or when recursion would be a poor choice even if technically possible. ### Warning Sign 1: No Natural Self-Similarity If you're struggling to express the problem in terms of smaller versions of itself, recursion may not fit. Ask yourself: 'What would the recursive call look like?' If you can't answer cleanly, step back. **Example**: Finding the median of an array. While there are recursive median algorithms (median of medians), the naive approach doesn't decompose naturally. 'Find median of left half and right half' doesn't give you the overall median. ### Warning Sign 2: Linear Processing Without Accumulation Simple linear operations often don't benefit from recursion: - Finding max/min (though CAN be done recursively, iteration is clearer) - Summing elements (same—can be recursive, but why?) - Counting occurrences - Simple transformations (map operations) These are better served by loops or higher-order functions like `map`, `filter`, `reduce`.7d:T816,Let's solidify your skills with practice problems. For each, determine whether recursive structure is present and why. ### Problem 1: Count paths in a grid *Given an m×n grid, count the number of unique paths from top-left to bottom-right, moving only right or down.* **Analysis**: - **Self-Similarity**: ✓ From any cell, the number of paths to the destination equals paths from cell-right + paths from cell-below. Same problem, different starting point. - **Trivial Base**: ✓ At destination, exactly 1 path. Off-grid, 0 paths. - **Assembly**: ✓ Simply add the two subproblem results. - **Measurable Progress**: ✓ Each call is closer to destination (smaller remaining grid). - **Pattern**: ✓ Classic 2D DP/recursion with memoization pattern. **Verdict**: Strong recursive structure. Can be solved top-down with memoization or bottom-up DP. --- ### Problem 2: Find the longest common prefix among strings *Given an array of strings, find the longest common prefix.* **Analysis**: - **Self-Similarity**: ✗ Not obvious. LCP of n strings isn't naturally expressed as LCP of subsets. - **Alternative Structure**: Could use divide-and-conquer (LCP of left half, LCP of right half, then LCP of those two), but it's forced. - **Simpler Approach**: Character-by-character comparison across all strings is more natural. **Verdict**: Recursion possible but not the natural fit. Iteration is clearer. --- ### Problem 3: Generate all valid parentheses combinations *Given n pairs of parentheses, generate all valid combinations.* **Analysis**: - **Self-Similarity**: ✓ At each step, you can add '(' if opens remain, or ')' if it would be valid. Then generate for remaining. - **Trivial Base**: ✓ When length reaches 2n, we have a complete combination. - **Assembly**: ✓ Collect all valid continuations from current state. - **Measurable Progress**: ✓ Each call uses one character of the 2n available. - **Pattern**: ✓ Classic backtracking/generation pattern. **Verdict**: Perfect recursive structure. Backtracking approach is natural and elegant.7e:T4b1,// Generate valid parentheses - recursive structure is natural function generateParentheses(n: number): string[] { const results: string[] = []; function generate(current: string, openCount: number, closeCount: number) { // Base case: complete combination if (current.length === 2 * n) { results.push(current); return; } // Choice 1: Add '(' if we haven't used all opens if (openCount < n) { generate(current + '(', openCount + 1, closeCount); } // Choice 2: Add ')' if it would be valid (can't exceed opens) if (closeCount < openCount) { generate(current + ')', openCount, closeCount + 1); } } generate('', 0, 0); return results; } console.log(generateParentheses(3)); // ["((()))", "(()())", "(())()", "()(())", "()()()"] /* * The recursive structure is clear: * - Current state is (string so far, opens used, closes used) * - At each state, make valid choices and recurse * - Base case is when string reaches target length * * This naturally generates all valid combinations without * ever producing an invalid one. */7f:T440,# Generate valid parentheses - recursive structure is natural def generate_parentheses(n: int) -> list[str]: results = [] def generate(current: str, open_count: int, close_count: int): # Base case: complete combination if len(current) == 2 * n: results.append(current) return # Choice 1: Add '(' if we haven't used all opens if open_count < n: generate(current + '(', open_count + 1, close_count) # Choice 2: Add ')' if it would be valid (can't exceed opens) if close_count < open_count: generate(current + ')', open_count, close_count + 1) generate('', 0, 0) return results print(generate_parentheses(3)) # ["((()))", "(()())", "(())()", "()(())", "()()()"] """ The recursive structure is clear: - Current state is (string so far, opens used, closes used) - At each state, make valid choices and recurse - Base case is when string reaches target length This naturally generates all valid combinations without ever producing an invalid one. """46:["$","$L71",null,{"owner":"anonymous","state":{"mutations":[],"queries":[{"dehydratedAt":1792315781617,"state":{"data":{"json":{"archivedAt":null,"id":"seed_a45eefd7ace053183db2aca078e8dfbc","slug":"data-structures-algorithms","title":"Data Structures & Algorithms","description":"Build strong algorithmic foundations, trace algorithms visually, solve progressive DSA problems, and apply invariants in real repository and code-review exercises.","image":null,"color":"#10B981","keyTopics":["Arrays & Strings","Linked Lists","Trees & Graphs","Sorting & Searching","Dynamic Programming","Recursion & Backtracking","Bit Manipulation","Advanced Data Structures"],"estimatedHours":231.7,"problemCount":67,"visualizerCount":15,"quizCount":0,"learningCount":279,"difficulty":"BEGINNER","idealFor":["Students preparing for coding interviews","Developers building strong CS fundamentals","Competitive programming aspirants","Anyone wanting to master problem-solving"],"prerequisites":["Basic programming in any language","Understanding of variables, loops, and functions","Basic math and logical reasoning"],"skillsGained":["Algorithmic problem-solving","Data structure selection","Complexity analysis","Pattern-based thinking","Optimization techniques","Interview readiness"],"outcomes":["Build strong DSA fundamentals","Apply advanced algorithmic techniques","Write efficient and maintainable solutions","Prepare for technical interviews","Gain confidence in competitive coding"],"overview":"This complete DSA learning path covers core and advanced concepts in a structured chapter-wise flow.\n\n**What you'll learn:**\n• Algorithmic thinking and complexity\n• Core linear and non-linear data structures\n• Searching and sorting strategies\n• Recursion, divide-and-conquer, and greedy design\n• Dynamic programming and graph algorithms\n• Bit manipulation and advanced structures","createdAt":"2026-10-15T17:47:45.111Z","updatedAt":"2026-10-17T16:28:34.019Z","modules":[{"id":"seed_ec47a4bb5266da55f622094ae1965719","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 1: Algorithmic Thinking","sectionOrder":1,"title":"Why Data Structures and Algorithms Matter","order":1,"contentType":"LEARNING","contentSlug":"why-dsa-matters","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_bc7b30a01cbf1e3e4f9092cd27e03529","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 1: Algorithmic Thinking","sectionOrder":1,"title":"Computational Thinking & Problem-Solving","order":2,"contentType":"LEARNING","contentSlug":"computational-thinking","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_d472e8c0da31753f90e19b7e562f0175","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 1: Algorithmic Thinking","sectionOrder":1,"title":"Algorithms — Core Concepts","order":3,"contentType":"LEARNING","contentSlug":"algorithms-core-concepts","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_9d97f837d8ea7f1d93a5d97e385f5bed","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 1: Algorithmic Thinking","sectionOrder":1,"title":"Measuring Algorithm Efficiency","order":4,"contentType":"LEARNING","contentSlug":"measuring-algorithm-efficiency","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_0c2dbc69fc841f5d4df7bfb2f7c0eda4","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 1: Algorithmic Thinking","sectionOrder":1,"title":"Asymptotic Notation — Formalizing Algorithm Efficiency","order":5,"contentType":"LEARNING","contentSlug":"asymptotic-notation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_f87754143842e84cde091ec02d2554d3","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 1: Algorithmic Thinking","sectionOrder":1,"title":"Case Analysis & Cost Models","order":6,"contentType":"LEARNING","contentSlug":"case-analysis","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_be33845e3deee5c135dae1b7baed6691","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 1: Algorithmic Thinking","sectionOrder":1,"title":"Problem Constraints & Algorithmic Trade-offs","order":7,"contentType":"LEARNING","contentSlug":"problem-constraints-tradeoffs","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_74dcdca395126fa1e82a858c9b7cab06","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 1: Algorithmic Thinking","sectionOrder":1,"title":"Expressing Algorithms Clearly","order":8,"contentType":"LEARNING","contentSlug":"expressing-algorithms-clearly","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_305b71a8f038fa683d75ff59ef6be233","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 2: Data Structures Foundations","sectionOrder":2,"title":"What Is a Data Structure?","order":1,"contentType":"LEARNING","contentSlug":"what-is-data-structure","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_90613c04c3ee2f691d93359544c55f2d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 2: Data Structures Foundations","sectionOrder":2,"title":"Why We Need Different Data Structures","order":2,"contentType":"LEARNING","contentSlug":"why-different-data-structures","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_e66901148bc09c635f5ec45e7accc266","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 2: Data Structures Foundations","sectionOrder":2,"title":"Classification of Data Structures (High-Level View)","order":3,"contentType":"LEARNING","contentSlug":"data-structure-classification","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_9afca0fcfcb96f13b2a5221c73b51d67","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 2: Data Structures Foundations","sectionOrder":2,"title":"Primitive Data Structures — Conceptual Overview","order":4,"contentType":"LEARNING","contentSlug":"primitive-data-structures","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_b7fff935e12745c9528c3027c69255a4","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 2: Data Structures Foundations","sectionOrder":2,"title":"Non-Primitive Data Structures (Conceptual Overview)","order":5,"contentType":"LEARNING","contentSlug":"non-primitive-data-structures","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_5677d865a9e711a5687475f94d8e0550","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 2: Data Structures Foundations","sectionOrder":2,"title":"Linear Data Structures","order":6,"contentType":"LEARNING","contentSlug":"linear-data-structures","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_b61de70f398ecffce2e32da0979a9fd6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 2: Data Structures Foundations","sectionOrder":2,"title":"Non-Linear Data Structures","order":7,"contentType":"LEARNING","contentSlug":"non-linear-data-structures","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_40b70bf1e868be36fbd65686619eff19","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 2: Data Structures Foundations","sectionOrder":2,"title":"Abstract Data Types (ADT) — The Missing Mental Model","order":8,"contentType":"LEARNING","contentSlug":"abstract-data-types","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_f4d72aeb8b948dace4adb0d7848ae14f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 2: Data Structures Foundations","sectionOrder":2,"title":"Choosing the Right Data Structure (Decision Framework)","order":9,"contentType":"LEARNING","contentSlug":"choosing-the-right-data-structure","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_c29a232b747c650e448b2bbc56cde715","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 3: Primitive Data Structures","sectionOrder":3,"title":"What Are Primitive Data Structures (Revisited, But Deeper)","order":1,"contentType":"LEARNING","contentSlug":"what-are-primitives-revisited","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_daf3aab5b505af86927efaae465ece85","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 3: Primitive Data Structures","sectionOrder":3,"title":"Binary Representation & Number Systems (Essential)","order":2,"contentType":"LEARNING","contentSlug":"binary-representation-number-systems","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_e9380d82385109bfbab5d010a699ce1c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 3: Primitive Data Structures","sectionOrder":3,"title":"Integer Data Types","order":3,"contentType":"LEARNING","contentSlug":"integer-data-types","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_bf103cadf004bff26b99e9c6ce453a9d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 3: Primitive Data Structures","sectionOrder":3,"title":"Floating-Point Data Types","order":4,"contentType":"LEARNING","contentSlug":"floating-point-data-types","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_4b6d2f1fd78c5c11d5e7b3b5e37b43c4","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 3: Primitive Data Structures","sectionOrder":3,"title":"Character Data Types","order":5,"contentType":"LEARNING","contentSlug":"character-data-types","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_3d2da65e566120794edb4472b78eb781","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 3: Primitive Data Structures","sectionOrder":3,"title":"Boolean Data Type","order":6,"contentType":"LEARNING","contentSlug":"boolean-data-type","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_3ac9771e45f281b42f799f865bab140c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 3: Primitive Data Structures","sectionOrder":3,"title":"Primitive Operations & Cost Model","order":7,"contentType":"LEARNING","contentSlug":"primitive-operations-cost-model","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_84049afe827bf684f8f8ad3ba4b6b18a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 3: Primitive Data Structures","sectionOrder":3,"title":"Limitations of Primitive Data Structures","order":8,"contentType":"LEARNING","contentSlug":"limitations-of-primitive-data-structures","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_75a1d9f48b63332b701e6ac137c75029","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 3: Primitive Data Structures","sectionOrder":3,"title":"Language-Level View of Primitives (Bridge Module)","order":9,"contentType":"LEARNING","contentSlug":"language-level-view","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_d3442d96b469393feb173f2fdad1fb1c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"What Is a String?","order":1,"contentType":"LEARNING","contentSlug":"what-is-a-string","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_49b75783e00cf698880fa4882e2c8373","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"How Strings Are Represented (Conceptual View)","order":2,"contentType":"LEARNING","contentSlug":"how-strings-are-represented","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_94daed2204782b3fb6552fdc75631630","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"Basic String Operations & Their Cost Model","order":3,"contentType":"LEARNING","contentSlug":"basic-string-operations","description":null,"estimatedMins":60,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_909a61505bdd7254f6e02829a4838a5b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"String Immutability & Its Implications","order":4,"contentType":"LEARNING","contentSlug":"string-immutability","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_4236a14fc8b41ccbb666c6a70cdc7792","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"Common String Patterns & Problem-Solving Techniques","order":5,"contentType":"LEARNING","contentSlug":"common-string-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_07399ed78256c46a827d2122b4232080","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"String Comparison, Ordering & Equality","order":6,"contentType":"LEARNING","contentSlug":"string-comparison-ordering-equality","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_0063fbe3ee1cf27cc487e8b2ef3f8f20","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"Memory & Space Behavior of Strings (Conceptual)","order":7,"contentType":"LEARNING","contentSlug":"strings-memory-and-space-behavior","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_190e23bffb8a289708eaff8e4b702513","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"Real-World Applications of Strings","order":8,"contentType":"LEARNING","contentSlug":"strings-real-world-applications","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_eae113ad799cfc1acf2d27b5de59e148","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"Limitations of Strings as a Data Structure","order":9,"contentType":"LEARNING","contentSlug":"limitations-of-strings","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_d05df03b99d8e482599d97336abc98c1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"Strings as a Gateway to Arrays","order":10,"contentType":"LEARNING","contentSlug":"strings-as-gateway-to-arrays","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_853f8f8a6de8e303becd34f3d1d7a79e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"Substring Position Finder","order":11,"contentType":"VISUALIZER","contentSlug":"substring-position-finder","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_37e8c79fad34a50b13b93a8926e9bfc9","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"Substring Position Finder","order":12,"contentType":"PROBLEM","contentSlug":"substring-position-finder","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_2a01c2759211e37c7dc7aef19b3ae036","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"Maximum Symmetric Substring","order":13,"contentType":"PROBLEM","contentSlug":"maximum-symmetric-substring","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_5147b0436d5a822524f8430361eee234","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"Maximum Unique Substring Length","order":14,"contentType":"PROBLEM","contentSlug":"max-unique-substring-length","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_befd5884506278b2bcd4e492bb5da891","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"What Is an Array? — The Fundamental Collection","order":1,"contentType":"LEARNING","contentSlug":"what-is-an-array","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_6182b2c4dadea21131520dd3e981eb2c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Array Memory Model & Contiguous Storage","order":2,"contentType":"LEARNING","contentSlug":"array-memory-model","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_8c3c8de9e95eb9a635aec5120fb6de8e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Static vs Dynamic Arrays","order":3,"contentType":"LEARNING","contentSlug":"static-vs-dynamic-arrays","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_b1bbb2c6a9454ace1b3115e5a4f6bb7e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Core Array Operations & Cost Model","order":4,"contentType":"LEARNING","contentSlug":"core-array-operations","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_7f0e51c6ae1cce67caf9968ac084052d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Array Traversal Patterns","order":5,"contentType":"LEARNING","contentSlug":"array-traversal-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_ea95dcd14ec38ec21f8712e028e0edc7","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"The Two-Pointer Technique","order":6,"contentType":"LEARNING","contentSlug":"two-pointer-technique","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_9fd991af7e14f0940f563e068b81473e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Sliding Window Technique","order":7,"contentType":"LEARNING","contentSlug":"sliding-window-technique","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_248cdd279c1cb9a09350ecca2a81779a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Common Array Patterns & Problem Types","order":8,"contentType":"LEARNING","contentSlug":"common-array-patterns","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_b833c299acfd509c1fa33a4735e51f47","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Multi-Dimensional Arrays — Extending Arrays to Grids and Beyond","order":9,"contentType":"LEARNING","contentSlug":"multi-dimensional-arrays","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_6bbf0f61e00e935ad06b0fb4698a604a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Array Limitations & Need for Linked Structures","order":10,"contentType":"LEARNING","contentSlug":"array-limitations-and-need-for-linked-structures","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_52ab95686cef6c922d0ac7f83787fbf5","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Filter Array By Value","order":11,"contentType":"VISUALIZER","contentSlug":"filter-array-by-value","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_fd8bc4d876254b556fb491a1544ee92e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Filter Array By Value","order":12,"contentType":"PROBLEM","contentSlug":"filter-array-by-value","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_853ab7fe55cdc7b4141f430b30c5e209","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"In-Place Unique Elements","order":13,"contentType":"PROBLEM","contentSlug":"inplace-unique-elements","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_39a124b4356d93429f3ede0729a958b0","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Pair Target Sum","order":14,"contentType":"PROBLEM","contentSlug":"pair-target-sum","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_48de12458d19943500080fa1ce29fb10","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Maximum Water Container","order":15,"contentType":"PROBLEM","contentSlug":"maximum-water-container","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_05313c690a2efb13b67da99bec5a7dc6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Optimal Contiguous Subarray Sum","order":16,"contentType":"PROBLEM","contentSlug":"optimal-contiguous-subarray-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_2cd056c25a55635ca40264e86d5c46d1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Why Linked Lists? Limitations of Arrays","order":1,"contentType":"LEARNING","contentSlug":"why-linked-lists","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_3457e9a42c714365d1ff6a283b70380a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"What Is a Linked List?","order":2,"contentType":"LEARNING","contentSlug":"what-is-a-linked-list","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_997d58ea2dd9296634eab85e0e08c9bb","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Singly Linked List — Structure & Intuition","order":3,"contentType":"LEARNING","contentSlug":"singly-linked-list","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_6bb7932ae26b4cd64b7e9d5034d13c59","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Node-Based Thinking: Pointers and References","order":4,"contentType":"LEARNING","contentSlug":"node-based-thinking","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_be574ad4030fea98180351795970f7c7","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Core Linked List Operations & Cost Model","order":5,"contentType":"LEARNING","contentSlug":"core-linked-list-operations-cost-model","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_5ef1addbdcef38a7935aea7625d6e682","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Traversal, Insertion, and Deletion Patterns","order":6,"contentType":"LEARNING","contentSlug":"traversal-insertion-deletion-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_990fc3655b8be6e3c1ca87f07efb5ae0","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Doubly Linked Lists — Bidirectional Navigation","order":7,"contentType":"LEARNING","contentSlug":"doubly-linked-lists","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_06de6d84d5c0dfdd04929ef427f5b20d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Circular Linked Lists","order":8,"contentType":"LEARNING","contentSlug":"circular-linked-lists","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_a0075693236da58a762629b3dbb04c2e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Two-Pointer Techniques for Linked Lists","order":9,"contentType":"LEARNING","contentSlug":"two-pointer-techniques-linked-lists","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_b9780a03b6f7d14f59b5c4a16b1fe8a0","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Common Linked List Patterns & Problem Types","order":10,"contentType":"LEARNING","contentSlug":"common-linked-list-patterns","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_5c42891c22f72753cb49fa1195906248","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Linked Lists vs Arrays — When to Use Which","order":11,"contentType":"LEARNING","contentSlug":"linked-lists-vs-arrays","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_086e895b3d9cf842c4b182a1c2146fe1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Combine Ordered Sequences","order":12,"contentType":"VISUALIZER","contentSlug":"combine-ordered-sequences","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_10336bedc316a5565343dff2a35fe8a4","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Combine Ordered Sequences","order":13,"contentType":"PROBLEM","contentSlug":"combine-ordered-sequences","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_368d00e9f4c7e6ebf13c6f376ffb9ed2","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Linked List Center Node","order":14,"contentType":"PROBLEM","contentSlug":"linked-list-center-node","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_f7a6d7d01a24ae5d158f9bc85c94383e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Cyclic Chain Detection","order":15,"contentType":"PROBLEM","contentSlug":"cyclic-chain-detection","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_8949b8bebcf8700fcdf15b20c85e683f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Linked List Number Addition","order":16,"contentType":"PROBLEM","contentSlug":"linked-list-number-addition","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_00011cd8f2ed5781cef6a1b2bb81e7bd","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"What Is a Stack? Real-World Intuition","order":1,"contentType":"LEARNING","contentSlug":"what-is-a-stack","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_b86092b1e6123e2c8e20e97ef1a0e9cf","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Stack as an Abstract Data Type (ADT)","order":2,"contentType":"LEARNING","contentSlug":"stack-as-abstract-data-type","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_072fd86b0ab33ef91775e76a170c0a50","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Stack Operations & Interface","order":3,"contentType":"LEARNING","contentSlug":"stack-operations-interface","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_e7bea9be9a42685c95a7a45c6424de1e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Array-Based Stack Implementation","order":4,"contentType":"LEARNING","contentSlug":"array-based-stack-implementation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_900e404b9123e780a7aab330b643a98e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Linked List-Based Stack Implementation","order":5,"contentType":"LEARNING","contentSlug":"linked-list-based-stack-implementation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_e72a9f4b697eca7e4d9f812e733bcddc","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Implementation Trade-offs: Array vs Linked List","order":6,"contentType":"LEARNING","contentSlug":"stacks-implementation-tradeoffs","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_b1315d2c1461e3d1abc0342349c03a5c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Common Stack Patterns & Problem Types","order":7,"contentType":"LEARNING","contentSlug":"common-stack-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_3c5890f524be925b7cda7c55e0ba276c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Parentheses Matching & Expression Problems","order":8,"contentType":"LEARNING","contentSlug":"parentheses-matching-expression-problems","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_5da79dfc3742bc27973f7b54fed2406d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Monotonic Stacks — Advanced Pattern","order":9,"contentType":"LEARNING","contentSlug":"monotonic-stacks","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_d7f1096aa8cc269e45f5da33a8144919","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Call Stack & Execution Contexts","order":10,"contentType":"LEARNING","contentSlug":"call-stack-execution-contexts","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_321c8aa7e9d37fd4419638f296271687","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Smallest Element Tracker Stack","order":11,"contentType":"VISUALIZER","contentSlug":"smallest-element-tracker-stack","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_029932385269f0b333f338ec2d51de29","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Smallest Element Tracker Stack","order":12,"contentType":"PROBLEM","contentSlug":"smallest-element-tracker-stack","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_f9d990fcc41114231b95cd752d4b3a1a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Next Warmer Day Distance","order":13,"contentType":"PROBLEM","contentSlug":"next-warmer-day-distance","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_c303d30428b083f49a2d93b36e334213","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Nested Bracket Scoring","order":14,"contentType":"PROBLEM","contentSlug":"nested-bracket-scoring","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_ae9908924fd229e50f39cd72883e6bf4","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 8: Queues","sectionOrder":8,"title":"What Is a Queue? Real-World Intuition","order":1,"contentType":"LEARNING","contentSlug":"what-is-a-queue","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_ac252916796107b155c577fa1fe0828d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 8: Queues","sectionOrder":8,"title":"Queue as an Abstract Data Type (ADT)","order":2,"contentType":"LEARNING","contentSlug":"queue-as-abstract-data-type","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_99bb2238f2039202e2df4814a35ca537","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 8: Queues","sectionOrder":8,"title":"Queue Operations & Interface","order":3,"contentType":"LEARNING","contentSlug":"queue-operations-interface","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_2577a6e5d10fd88a0be966c3945cfe76","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 8: Queues","sectionOrder":8,"title":"Array-Based Queue & Circular Queue Implementation","order":4,"contentType":"LEARNING","contentSlug":"array-based-circular-queue","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_5413826bfe0e9c8c6d8117b6ff62efdb","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 8: Queues","sectionOrder":8,"title":"Linked List-Based Queue Implementation","order":5,"contentType":"LEARNING","contentSlug":"linked-list-queue-implementation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_7ed3f9abb607f5d9398d31b61e06e8e7","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 8: Queues","sectionOrder":8,"title":"Double-Ended Queue (Deque) — Flexible Two-End Access","order":6,"contentType":"LEARNING","contentSlug":"double-ended-queue","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_3c4667eec06a910438ec5510e017495e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 8: Queues","sectionOrder":8,"title":"Priority Queue — Conceptual Introduction","order":7,"contentType":"LEARNING","contentSlug":"priority-queue-conceptual-introduction","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_58fa2a9f6e58f97e28fe9d90e01169bb","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 8: Queues","sectionOrder":8,"title":"Common Queue Patterns & Problem Types","order":8,"contentType":"LEARNING","contentSlug":"common-queue-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_62b13177ff47e69056be078acf083bbc","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 8: Queues","sectionOrder":8,"title":"Sliding Window Maximum — Monotonic Deque","order":9,"contentType":"LEARNING","contentSlug":"sliding-window-maximum","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_8dcf61a06b537b2e9e0f6caa061cf803","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 8: Queues","sectionOrder":8,"title":"Stacks vs Queues — Comparison & Use Cases","order":10,"contentType":"LEARNING","contentSlug":"stacks-vs-queues-comparison","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_dbd6f55864bb9ee18410b2885d743c7b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"What Is Recursion? Conceptual Foundation","order":1,"contentType":"LEARNING","contentSlug":"what-is-recursion","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_3ce33a85c0099383a2f9c858d2dba016","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"The Anatomy of a Recursive Function","order":2,"contentType":"LEARNING","contentSlug":"anatomy-of-recursive-function","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_15e967e95406b186ffe565b88a894542","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"Base Cases & Recursive Cases","order":3,"contentType":"LEARNING","contentSlug":"base-cases-and-recursive-cases","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_f0921a5f62daa63700cfd53a1a524349","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"The Call Stack & Recursion Execution","order":4,"contentType":"LEARNING","contentSlug":"call-stack-and-recursion-execution","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_588264e971eb8707423bb447a86222a9","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"Visualizing Recursion Trees","order":5,"contentType":"LEARNING","contentSlug":"visualizing-recursion-trees","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_cac105a44dd128c2d5db809818374528","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"Recursion vs Iteration","order":6,"contentType":"LEARNING","contentSlug":"recursion-vs-iteration","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_0f8e119f6976597efe3f0ebc1f79f24d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"Time & Space Complexity of Recursive Algorithms","order":7,"contentType":"LEARNING","contentSlug":"recursion-time-space-complexity","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_c9878cbb3c96179f7b3bd1d1d1bd314f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"Common Recursive Patterns","order":8,"contentType":"LEARNING","contentSlug":"common-recursive-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_487e0c70d28192e69344202ba9d38a7d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"Tail Recursion & Optimization","order":9,"contentType":"LEARNING","contentSlug":"tail-recursion-optimization","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_f95f337bf01a11c812481b87014ff41f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"When Recursion Goes Wrong","order":10,"contentType":"LEARNING","contentSlug":"when-recursion-goes-wrong","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_89bd77daca96b399038980a43bab217c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"Recursive Problem-Solving Strategies","order":11,"contentType":"LEARNING","contentSlug":"recursive-problem-solving-strategies","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_e5b36e1e163274fba090d76b7fbcfa24","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"Binary Power Verification","order":12,"contentType":"PROBLEM","contentSlug":"binary-power-verification","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_c8777fb5843efe7cf79f97d83fce4a76","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"Tree Root-to-Leaf Paths","order":13,"contentType":"PROBLEM","contentSlug":"tree-root-to-leaf-paths","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_d6d5efcf1c12e807580ba7475fb858cf","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"The Limitation Problem — Why O(1) Access Matters","order":1,"contentType":"LEARNING","contentSlug":"the-limitation-problem","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_9854d64ee5cd353cb999650dc29ebf5c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"What Is Hashing? Core Intuition","order":2,"contentType":"LEARNING","contentSlug":"what-is-hashing-core-intuition","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_974f334ce9021fd3caee42dde840c011","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"Hash Functions: Properties & Design","order":3,"contentType":"LEARNING","contentSlug":"hash-functions-properties-and-design","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_250575993027f3a236c740e1b65dd2a3","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"Hash Tables — Structure & Mechanism","order":4,"contentType":"LEARNING","contentSlug":"hash-table-structure-mechanism","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_ee56eebd83f5a561ca446a0364fcabd1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"Collision Handling: Chaining","order":5,"contentType":"LEARNING","contentSlug":"collision-handling-chaining","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_95bc6695b5ce2139439e2c60de139484","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"Collision Handling — Open Addressing","order":6,"contentType":"LEARNING","contentSlug":"collision-handling-open-addressing","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_31f53e8206d2aa6d307ca144914742fd","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"Load Factor & Rehashing","order":7,"contentType":"LEARNING","contentSlug":"load-factor-and-rehashing","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_d46a68c8c761e1be94ff0dbf86756209","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"Hash Table Operations & Amortized Cost Model","order":8,"contentType":"LEARNING","contentSlug":"hash-table-operations-amortized-cost","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_a8a3df7be9bad969259f97c54c579191","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"Hash Sets vs Hash Maps","order":9,"contentType":"LEARNING","contentSlug":"hash-sets-vs-hash-maps","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_5e4ef2b17b888c2d0c8549c82cab47f4","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"Common Hashing Patterns & Problem Types","order":10,"contentType":"LEARNING","contentSlug":"common-hashing-patterns","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_d1cb8a898a05388c59576e3da2a115aa","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"When Hashing Fails — Pathological Cases & Alternatives","order":11,"contentType":"LEARNING","contentSlug":"when-hashing-fails","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_5b0bc8690c1bc38c23e4794a81a4bc43","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"Anagram Clustering","order":12,"contentType":"PROBLEM","contentSlug":"anagram-clustering","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_2a343ddc8134da748992081a4862aabd","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"Duplicate Linked List with Arbitrary Links","order":13,"contentType":"PROBLEM","contentSlug":"duplicate-linked-list-with-arbitrary-links","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_4857b4c744f2fff1dca9d3953831d8f2","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees","sectionOrder":11,"title":"What Is a Tree? Definition & Terminology","order":1,"contentType":"LEARNING","contentSlug":"what-is-a-tree","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_ce3c1c32ea6bf85fe5d37bf0fae716fe","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees","sectionOrder":11,"title":"Binary Trees — Structure & Representation","order":2,"contentType":"LEARNING","contentSlug":"binary-trees-structure-representation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_960a98b48958c887000cd94fd350f46f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees","sectionOrder":11,"title":"Recursive Tree Algorithms","order":3,"contentType":"LEARNING","contentSlug":"recursive-tree-algorithms","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_8057739a78818e8057389c7d405df0e6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees","sectionOrder":11,"title":"Tree Construction & Serialization","order":4,"contentType":"LEARNING","contentSlug":"tree-construction-serialization","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_cb1ce4cc8ce58d8e3219f51e6f274507","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees","sectionOrder":11,"title":"Common Tree Patterns & Problem Types","order":5,"contentType":"LEARNING","contentSlug":"common-tree-patterns","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_15657fae45c408f612eae20f510a3b44","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees","sectionOrder":11,"title":"N-ary Trees & General Tree Structures","order":6,"contentType":"LEARNING","contentSlug":"nary-trees-general-structures","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_a155191d52f63cc021dabdadd3f477c5","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees Hierarchical Data Structures","sectionOrder":12,"title":"Why Trees? Limitations of Linear Structures","order":1,"contentType":"LEARNING","contentSlug":"why-trees-limitations-of-linear-structures","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_edaf4def2b1a62c78b8b5b67be1aa4e2","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees Hierarchical Data Structures","sectionOrder":12,"title":"Tree Properties — Height, Depth, Levels","order":2,"contentType":"LEARNING","contentSlug":"tree-properties-height-depth-levels","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_050c2f27cd1a0141aceeaf233c5a4312","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees Hierarchical Data Structures","sectionOrder":12,"title":"Tree Traversals — Inorder, Preorder, Postorder","order":3,"contentType":"LEARNING","contentSlug":"tree-traversals-inorder-preorder-postorder","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_20bd2ded6e638213c1ef8978d8d6d46c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees Hierarchical Data Structures","sectionOrder":12,"title":"Level-Order Traversal — BFS on Trees","order":4,"contentType":"LEARNING","contentSlug":"level-order-traversal-bfs-on-trees","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_05f265eeb0dfed1fd7e0980327e6404b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees Hierarchical Data Structures","sectionOrder":12,"title":"Layer-by-Layer Binary Tree Values","order":5,"contentType":"VISUALIZER","contentSlug":"layer-by-layer-binary-tree-values","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_5fb8e6de8606b084de49b5e7935104ae","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees Hierarchical Data Structures","sectionOrder":12,"title":"Layer-by-Layer Binary Tree Values","order":6,"contentType":"PROBLEM","contentSlug":"layer-by-layer-binary-tree-values","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_ab41cf44e1ead2b2535328535b594742","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees Hierarchical Data Structures","sectionOrder":12,"title":"Aggregate Path Numbers in Binary Tree","order":7,"contentType":"PROBLEM","contentSlug":"aggregate-path-numbers","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_2e121b410eb1ba14677adbcaae3a4a3a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees Hierarchical Data Structures","sectionOrder":12,"title":"Rightmost Level Nodes","order":8,"contentType":"PROBLEM","contentSlug":"rightmost-level-nodes","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_3dd93c5f36ee7b45683792d91f4ab9d7","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"What Is a Binary Search Tree (BST)?","order":1,"contentType":"LEARNING","contentSlug":"what-is-bst","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_92d367431efe0e48a0395a842ac31034","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"The BST Property & Its Power","order":2,"contentType":"LEARNING","contentSlug":"bst-property-power","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_6a640c4e06b5a406b2eaf33025387fde","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"BST Search Operation","order":3,"contentType":"LEARNING","contentSlug":"bst-search-operation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_d6aa91371e334271b04531d1352ffec9","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"BST Insertion Operation","order":4,"contentType":"LEARNING","contentSlug":"bst-insertion","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_920c11e41491f80f090838aa95f6f4a8","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"BST Deletion Operation — The Complete Guide","order":5,"contentType":"LEARNING","contentSlug":"bst-deletion-operation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_3cd2d257466b1520fba526b163da448d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"BST Time Complexity Analysis","order":6,"contentType":"LEARNING","contentSlug":"bst-time-complexity-analysis","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_6ec8c6961d846b57f9381f90d0e56ae9","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"The Balance Problem — Degenerate BSTs","order":7,"contentType":"LEARNING","contentSlug":"bst-balance-problem","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_d0bf08acd360a770ea2b478668a2a227","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"Inorder Traversal & Sorted Output","order":8,"contentType":"LEARNING","contentSlug":"bst-inorder-traversal-sorted-output","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_c8b75c39a5bfa2e0faba8750f8088d67","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"Common BST Patterns & Problem Types","order":9,"contentType":"LEARNING","contentSlug":"common-bst-patterns","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_5bd75643c2325ae0224d05cea0324385","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"BST Variants & Extensions","order":10,"contentType":"LEARNING","contentSlug":"bst-variants-extensions","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_440c9e8e53e7d615451ee18db116a35e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"Smallest Value Gap in Binary Search Tree","order":11,"contentType":"VISUALIZER","contentSlug":"smallest-value-gap-in-binary-search-tree","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_788176cee356968f900e7c3b310d6b04","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"Smallest Value Gap in Binary Search Tree","order":12,"contentType":"PROBLEM","contentSlug":"smallest-value-gap-in-binary-search-tree","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_d73250fa23f86ee1d96568318a3522cf","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"BST Rank Finder","order":13,"contentType":"PROBLEM","contentSlug":"bst-rank-finder","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_a8a015e3626bca9c5848b605327a0e14","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 13: Balanced Search Trees","sectionOrder":14,"title":"Why Balance Matters — Motivation","order":1,"contentType":"LEARNING","contentSlug":"balanced-trees-why-balance-matters","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_5bcdf0227abde1db6bac54aeb0ec13dc","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 13: Balanced Search Trees","sectionOrder":14,"title":"Height-Balanced Trees — Concept & Invariants","order":2,"contentType":"LEARNING","contentSlug":"height-balanced-trees","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_3178dd74c3074857971c1ec07fee3aaa","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 13: Balanced Search Trees","sectionOrder":14,"title":"AVL Trees — Rotations & Balancing","order":3,"contentType":"LEARNING","contentSlug":"avl-trees-rotations-balancing","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_07408caed080b87b5f5d6f09106e4941","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 13: Balanced Search Trees","sectionOrder":14,"title":"Red-Black Trees — Conceptual Overview","order":4,"contentType":"LEARNING","contentSlug":"red-black-trees-conceptual-overview","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_ec4ef5fb0429c365ddd396c7a3d6fb68","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 13: Balanced Search Trees","sectionOrder":14,"title":"2-3 Trees & B-Trees — Conceptual Introduction","order":5,"contentType":"LEARNING","contentSlug":"2-3-trees-and-b-trees","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_34492f1ec7ca178537272c7e3f6a044c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 13: Balanced Search Trees","sectionOrder":14,"title":"Balanced Tree Operations & Guarantees","order":6,"contentType":"LEARNING","contentSlug":"balanced-tree-operations","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_2da1f964846ef177f53361d7392d1c6f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 13: Balanced Search Trees","sectionOrder":14,"title":"Self-Balancing Trees in Practice","order":7,"contentType":"LEARNING","contentSlug":"self-balancing-trees-in-practice","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_7f62edb3e4ee48ea25aceb63a3095d7f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 13: Balanced Search Trees","sectionOrder":14,"title":"When to Use Balanced Trees vs Hash Tables","order":8,"contentType":"LEARNING","contentSlug":"balanced-trees-vs-hash-tables","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_f8fc19670c47b20cba220dc3afb75d72","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Priority Queues Revisited — Now with Implementation","order":1,"contentType":"LEARNING","contentSlug":"priority-queues-revisited","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_be434bbd4790118206b208824e0f57f4","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Complete Binary Trees — The Foundation of Array-Based Heaps","order":2,"contentType":"LEARNING","contentSlug":"complete-binary-tree-representation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_d98892eab7c3a52deff7ffbaee2bb00e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Array-Based Heap Implementation","order":3,"contentType":"LEARNING","contentSlug":"array-based-heap-implementation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_9a042880a113ac091ae21d4617378ab8","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Heap Operations — Insert & Extract","order":4,"contentType":"LEARNING","contentSlug":"heap-operations-insert-and-extract","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_611895eb8bb1110d9163be084c7a3990","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Heapify — Building a Heap Efficiently","order":5,"contentType":"LEARNING","contentSlug":"heapify-building-a-heap-efficiently","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_96837e7f1bcdf90075337cb13330b5b1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Heap Time Complexity Analysis","order":6,"contentType":"LEARNING","contentSlug":"heap-time-complexity-analysis","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_1d4ea250922c1dab1f4f82b30b337a85","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Min-Heap vs Max-Heap","order":7,"contentType":"LEARNING","contentSlug":"min-heap-vs-max-heap","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_4a73c2e9a477a6ae62c53370410d571c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Common Heap Patterns & Problem Types","order":8,"contentType":"LEARNING","contentSlug":"common-heap-patterns","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_fafd67a9de3860a6b0859ccd61eb5664","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Top-K Problems & Heap Applications","order":9,"contentType":"LEARNING","contentSlug":"top-k-problems-and-heap-applications","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_71626bb08417031c4ca34715e53a5064","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Streaming Kth Highest Tracker","order":10,"contentType":"VISUALIZER","contentSlug":"streaming-kth-highest-tracker","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_ed4fe84a214dd0186313b9d39b41e0b9","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Streaming Kth Highest Tracker","order":11,"contentType":"PROBLEM","contentSlug":"streaming-kth-highest-tracker","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_86cbc16cc78ba1799ff5a717459630b8","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Find Kth Ranked Element","order":12,"contentType":"PROBLEM","contentSlug":"find-kth-ranked-element","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_4f3706fc1c19f79adeb46071e1b1a3ca","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Adjacent Character Separator","order":13,"contentType":"PROBLEM","contentSlug":"adjacent-character-separator","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_5dad5ef459494facedf6b9f997dfe19b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps Priority Queues","sectionOrder":16,"title":"What Is a Heap? Structure & Properties","order":1,"contentType":"LEARNING","contentSlug":"what-is-a-heap","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_b27888c6bfde04bc95ca786881d416cc","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 15: Tries","sectionOrder":17,"title":"String Search Problems — Motivation for Tries","order":1,"contentType":"LEARNING","contentSlug":"string-search-problems","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_d3c526857682c7c26951df7bb266b9e8","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 15: Tries","sectionOrder":17,"title":"What Is a Trie? Structure & Intuition","order":2,"contentType":"LEARNING","contentSlug":"what-is-a-trie","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_983a4767ad51e5bef32a495e700a202a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 15: Tries","sectionOrder":17,"title":"Trie Node Representation","order":3,"contentType":"LEARNING","contentSlug":"trie-node-representation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_b529f1662c3f4c6894e9cb75ad252036","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 15: Tries","sectionOrder":17,"title":"Trie Operations — Insert, Search, StartsWith","order":4,"contentType":"LEARNING","contentSlug":"trie-operations-insert-search-startswith","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_a6225fbaba1615a527e94c2698d8fbc7","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 15: Tries","sectionOrder":17,"title":"Trie Time & Space Complexity","order":5,"contentType":"LEARNING","contentSlug":"trie-time-and-space-complexity","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_0d58d320c343a004b4f754a49fe7c730","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 15: Tries","sectionOrder":17,"title":"Word Dictionary & Autocomplete Systems","order":6,"contentType":"LEARNING","contentSlug":"word-dictionary-and-autocomplete-systems","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_5020e6c5c7cf72d894e3eeed9e686ea3","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 15: Tries","sectionOrder":17,"title":"Common Trie Patterns & Problem Types","order":7,"contentType":"LEARNING","contentSlug":"common-trie-patterns","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_cd857951ac94f10ec3cbdd6afa095c60","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 15: Tries","sectionOrder":17,"title":"Compressed Tries — Patricia/Radix Trees (Conceptual)","order":8,"contentType":"LEARNING","contentSlug":"compressed-tries-patricia-radix-trees","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_ae48e0369a209554eff2cd6b8560854b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 15: Tries","sectionOrder":17,"title":"String Segmentation","order":9,"contentType":"PROBLEM","contentSlug":"string-segmentation","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_11134c60cc01262c39b95bffb9b125c7","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 15: Tries","sectionOrder":17,"title":"Dictionary Sentence Formation","order":10,"contentType":"PROBLEM","contentSlug":"dictionary-sentence-formation","description":null,"estimatedMins":45,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_ee56984e01c6945156735038f4364bad","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Why Graphs? Real-World Networks","order":1,"contentType":"LEARNING","contentSlug":"why-graphs","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_b5a2d327cf997f8db1ef578ac79e2b4b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"What Is a Graph? Definition & Terminology","order":2,"contentType":"LEARNING","contentSlug":"graph-definition-terminology","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_09bd9ba5e2136b3930873b87b10ebaa4","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Graph Types — Directed, Undirected, Weighted","order":3,"contentType":"LEARNING","contentSlug":"graph-types","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_e17908acfcd0ef41acb19711781924c8","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Graph Representation — Adjacency Matrix","order":4,"contentType":"LEARNING","contentSlug":"graph-representation-adjacency-matrix","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_0376d05c1b751ded8db6fc67e0321a68","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Graph Representation — Adjacency List","order":5,"contentType":"LEARNING","contentSlug":"graph-representation-adjacency-list","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_cd4175bc0590e7a7032db8b3d4ae7268","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Graph Representation Trade-offs","order":6,"contentType":"LEARNING","contentSlug":"graph-representation-tradeoffs","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_6303a37730125b6a899a615ca7c81e93","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Graph Properties — Connectivity, Cycles, Degree","order":7,"contentType":"LEARNING","contentSlug":"graph-properties","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_be02d56047bbe40184523ec74ad8f819","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Trees as Special Graphs","order":8,"contentType":"LEARNING","contentSlug":"trees-as-special-graphs","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_634dd69b7179703868265f39d3962e89","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Common Graph Modeling Patterns","order":9,"contentType":"LEARNING","contentSlug":"common-graph-modeling-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_4cb87105d1cf017d678fdf9e032f68f6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Introduction to Graph Algorithms","order":10,"contentType":"LEARNING","contentSlug":"intro-to-graph-algorithms","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_25bb2e8b5415253b3c1868a9490a3f73","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Count Connected Landmasses","order":11,"contentType":"VISUALIZER","contentSlug":"count-connected-landmasses","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_620cae0ca8d40eba680512b8d15fbd48","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Deep Copy Network","order":12,"contentType":"PROBLEM","contentSlug":"deep-copy-network","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_e1cbe167ba313e56ac9b143e98eedb63","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Count Connected Landmasses","order":13,"contentType":"PROBLEM","contentSlug":"count-connected-landmasses","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_d73a4e35cfacaebb23ce2765ec9a83c8","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"The Search Problem — Formalization","order":1,"contentType":"LEARNING","contentSlug":"search-problem-formalization","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_1c7d3f00fed06ed61d390302bcb4d1ea","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Linear Search — The Baseline Search Algorithm","order":2,"contentType":"LEARNING","contentSlug":"linear-search-baseline","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_0441c25f2e21af90b7f2ab5b4e854318","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Binary Search — Core Algorithm","order":3,"contentType":"LEARNING","contentSlug":"binary-search-core-algorithm","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_cbaf1c318052d5255fec68f0d024ee21","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Binary Search Variations & Edge Cases","order":4,"contentType":"LEARNING","contentSlug":"binary-search-variations","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_26c868e59b097b51270fa329ccc9f544","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Binary Search on Answer Space","order":5,"contentType":"LEARNING","contentSlug":"binary-search-on-answer-space","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_ece15e4cd7b5f47a7e52fb655ec30566","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Search in Rotated Arrays","order":6,"contentType":"LEARNING","contentSlug":"search-in-rotated-arrays","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_20d10beaed510af721397e63cd462d6e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Search Space Reduction Patterns","order":7,"contentType":"LEARNING","contentSlug":"search-space-reduction-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_6a4bca0c588a77ca5241c81a0eb3b6f1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Ternary Search — Finding Extrema in Unimodal Functions","order":8,"contentType":"LEARNING","contentSlug":"ternary-search","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_678a4667c12f3a2d832463f166888057","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Interpolation Search — Intelligent Probing Based on Value Distribution","order":9,"contentType":"LEARNING","contentSlug":"interpolation-search","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_707b3c0a50b78b7066f62276107372e3","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Searching in 2D Matrices","order":10,"contentType":"LEARNING","contentSlug":"searching-in-2d-matrices","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_6735663376c0d45646eef775690744fe","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Sorted Array Position Finder","order":11,"contentType":"VISUALIZER","contentSlug":"sorted-array-position-finder","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_34ad240ac4e0dd90fbac46290b1e4538","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Sorted Array Position Finder","order":12,"contentType":"PROBLEM","contentSlug":"sorted-array-position-finder","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_60336d74208914ac7e3ab7866d92aa6d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Rotated Array Search","order":13,"contentType":"PROBLEM","contentSlug":"rotated-array-search","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_aafdeaecf0576050fd12f8839b014179","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Target Element Range","order":14,"contentType":"PROBLEM","contentSlug":"target-element-range","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_466d99ce09958c4be88ef165d384365d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Why Sorting Matters","order":1,"contentType":"LEARNING","contentSlug":"why-sorting-matters","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_9d2015878733633a39d0439dbd8d3b6e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Sorting Problem Formalization & Stability","order":2,"contentType":"LEARNING","contentSlug":"sorting-problem-formalization-stability","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_a90b45407dcce62ce76e6337d793f4d5","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Bubble Sort — Understanding the Simplest Sorting Algorithm","order":3,"contentType":"LEARNING","contentSlug":"bubble-sort-intuition-analysis","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_efdbfee73be37b7a74d3595da1b34dc5","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Selection Sort — Intuition & Analysis","order":4,"contentType":"LEARNING","contentSlug":"selection-sort-intuition-analysis","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_6725d2977df6562e1abe4c072c61bb15","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Insertion Sort — Intuition & Analysis","order":5,"contentType":"LEARNING","contentSlug":"insertion-sort-intuition-analysis","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_012f9c65fc1f17173043ceeae0833d4d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Merge Sort — Divide & Conquer Sorting","order":6,"contentType":"LEARNING","contentSlug":"merge-sort-divide-conquer","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_d750a16393ea1734bb9dd5f405cd5b7c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Quick Sort — Partition-Based Sorting","order":7,"contentType":"LEARNING","contentSlug":"quick-sort","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_afce62f58f760432621f09364c4cbe5f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Heap Sort — Heap-Based Sorting","order":8,"contentType":"LEARNING","contentSlug":"heap-sort","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_cf850f76b5bae77ac59966e6a4dfdc46","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Counting Sort: Breaking the Comparison-Based Barrier","order":9,"contentType":"LEARNING","contentSlug":"counting-sort","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_f6c849b8966ba724cd6e3341ac4fb8ba","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Radix Sort — Digit-Based Sorting","order":10,"contentType":"LEARNING","contentSlug":"radix-sort","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_df891407ca3a4b80cd77c8888cad5af6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Sorting Algorithm Comparison & Selection","order":11,"contentType":"LEARNING","contentSlug":"sorting-algorithm-comparison-selection","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_d7ee717f97775c22a5ceab878ba67188","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Sorting in Practice — Library Functions","order":12,"contentType":"LEARNING","contentSlug":"sorting-in-practice","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_457c9c34fc01e0043e2f40f1a24abf82","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Linked List Sort","order":13,"contentType":"VISUALIZER","contentSlug":"linked-list-sort","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_1f735e6e916da2982e63f89036e9d43a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Linked List Sort","order":14,"contentType":"PROBLEM","contentSlug":"linked-list-sort","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_4d501d9328bf70e8992d38f3e61f880e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"What Is Divide and Conquer?","order":1,"contentType":"LEARNING","contentSlug":"what-is-divide-and-conquer","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_ee00ad087998653706c17138c1fab68c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"The D&C Pattern — Divide, Conquer, Combine","order":2,"contentType":"LEARNING","contentSlug":"dc-pattern","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_5129e34914db429dc5d01f01b50cfff4","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"Recurrence Relations & Master Theorem","order":3,"contentType":"LEARNING","contentSlug":"recurrence-relations-master-theorem","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_d1520258738dd00094941d767dddfe33","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"Merge Sort as Divide and Conquer — Deep Dive","order":4,"contentType":"LEARNING","contentSlug":"merge-sort-as-dc","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_5a52e438285669df8cab51e53bb66c1b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"Quick Sort as Divide and Conquer — Deep Dive","order":5,"contentType":"LEARNING","contentSlug":"quick-sort-as-dc","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_802b16803e3fc00aeafa5cd2ab42e7d3","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"Binary Search as Divide and Conquer","order":6,"contentType":"LEARNING","contentSlug":"binary-search-as-dc","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_4a51da15ec66ceef1c35c175cb7f9470","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"Maximum Subarray — Divide & Conquer Approach","order":7,"contentType":"LEARNING","contentSlug":"maximum-subarray-dc","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_edf850c997f310312ee940da2e00d83a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"Matrix Multiplication & Strassen's Algorithm","order":8,"contentType":"LEARNING","contentSlug":"matrix-multiplication-strassen","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_a69f40a81837e25e371c0c4e8acf35a1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"Common Divide and Conquer Patterns","order":9,"contentType":"LEARNING","contentSlug":"common-dc-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_f017f364c243e7411109dfc053f056f1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"When to Apply Divide and Conquer","order":10,"contentType":"LEARNING","contentSlug":"when-to-apply-dc","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_933c329ee59eb40405e4b19559dd9ec9","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"Combine Sorted Sequences","order":11,"contentType":"PROBLEM","contentSlug":"combine-sorted-sequences","description":null,"estimatedMins":45,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_7c64d637794589a1abad8666faa8ccdb","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"What Is a Greedy Algorithm?","order":1,"contentType":"LEARNING","contentSlug":"what-is-greedy-algorithm","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_1cb406da7d4f568218720f7c7c1cff3d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"The Greedy Choice Property — Foundation of Greedy Algorithms","order":2,"contentType":"LEARNING","contentSlug":"greedy-choice-property","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_7054f5f082e645d97af6786199e735e2","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Optimal Substructure for Greedy Algorithms","order":3,"contentType":"LEARNING","contentSlug":"optimal-substructure-for-greedy","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_fc7fa285d5adc56bb80410f73ee35398","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Proving Greedy Algorithm Correctness","order":4,"contentType":"LEARNING","contentSlug":"proving-greedy-correctness","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_bfcfd0b611edbb63eef52c99e335770d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Activity Selection Problem","order":5,"contentType":"LEARNING","contentSlug":"activity-selection-problem","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_9220eca6c3a37d32cdcb27fb8d9d1ee2","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Fractional Knapsack — When Greedy Achieves Optimality","order":6,"contentType":"LEARNING","contentSlug":"greedy-fractional-knapsack","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_3fd9e3bcbb8b59b2b239e8f74ded4e5a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Huffman Coding — Optimal Prefix Codes","order":7,"contentType":"LEARNING","contentSlug":"huffman-coding","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_085003c44a0cbb1d9860e09769fa94b3","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Interval Scheduling Patterns","order":8,"contentType":"LEARNING","contentSlug":"interval-scheduling-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_eb84aa55e14a86ee373b3587226ee95d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Common Greedy Patterns","order":9,"contentType":"LEARNING","contentSlug":"common-greedy-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_acba27b372711d4dfc1044a0f5fd3a6a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"When Greedy Fails vs When It Works","order":10,"contentType":"LEARNING","contentSlug":"when-greedy-fails-vs-works","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_89eac737965eda25a704dee4a1f6c26f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Circular Route Fuel Station","order":11,"contentType":"VISUALIZER","contentSlug":"circular-route-fuel-station","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_a4460f888b3d40284456f9863afe3e28","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Circular Route Fuel Station","order":12,"contentType":"PROBLEM","contentSlug":"circular-route-fuel-station","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_c67d56ddc77429e09fbdc728c7abeca2","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Destination Reachability","order":13,"contentType":"PROBLEM","contentSlug":"destination-reachability","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_d3a399318602027f64ce9fd6693ae18c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Minimum Hops to Destination","order":14,"contentType":"PROBLEM","contentSlug":"minimum-hops-to-destination","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_4ba51f8c0e7b0f74ad512fda2a18e63f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"What Is Dynamic Programming?","order":1,"contentType":"LEARNING","contentSlug":"what-is-dynamic-programming","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_41334efce624cf929981f8009916e6bb","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Overlapping Subproblems — The Heart of Dynamic Programming","order":2,"contentType":"LEARNING","contentSlug":"overlapping-subproblems","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_068bf9eb83f9d28861a601b610d437bf","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Optimal Substructure — The Foundation of Dynamic Programming","order":3,"contentType":"LEARNING","contentSlug":"dynamic-programming-optimal-substructure","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_802bef85a0929f1dd2f27bbbf0f22ebe","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Memoization — Top-Down Dynamic Programming","order":4,"contentType":"LEARNING","contentSlug":"memoization-top-down-dp","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_309f97c0785c5f308780d999533dee35","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Tabulation — Bottom-Up Dynamic Programming","order":5,"contentType":"LEARNING","contentSlug":"tabulation-bottom-up-dp","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_c6aa1d5596e2379db52b8e03fbcd8a25","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"1D DP Problems — Fibonacci & Climbing Stairs","order":6,"contentType":"LEARNING","contentSlug":"1d-dp-problems","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_acd8f4c044d39bdfcbd50c0463e92563","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"2D Dynamic Programming — Grid Paths & Longest Common Subsequence","order":7,"contentType":"LEARNING","contentSlug":"2d-dp-problems-grid-paths-lcs","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_41abc1661aca4655af78308786d950e4","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Knapsack Problems — Resource-Constrained Optimization","order":8,"contentType":"LEARNING","contentSlug":"knapsack-problems","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_541f3eb4610f3224d2f1a9ff76e828e6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"String DP — Edit Distance","order":9,"contentType":"LEARNING","contentSlug":"string-dp-edit-distance","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_16f3f242ca5a943bbfdc06ba9907264c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"State Design & Transition Functions","order":10,"contentType":"LEARNING","contentSlug":"state-design-transition-functions","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_e7d18b8a6ad37bd55c4082184b21d9c6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Space Optimization Techniques in Dynamic Programming","order":11,"contentType":"LEARNING","contentSlug":"space-optimization-techniques","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_f0911da9884dabce9c2710eea0169061","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Common DP Patterns","order":12,"contentType":"LEARNING","contentSlug":"common-dp-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_915012cd4c03b3e4289cf4f8614975c8","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Dynamic Programming Problem-Solving Framework","order":13,"contentType":"LEARNING","contentSlug":"dp-problem-solving-framework","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_d489c1f7db34db54cafec247ca14eb74","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Staircase Ascent","order":14,"contentType":"VISUALIZER","contentSlug":"staircase-ascent","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_619d938d8f35348e78cf25fa2a8a2ec3","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Staircase Ascent","order":15,"contentType":"PROBLEM","contentSlug":"staircase-ascent","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_fbd48c168c39ac74efa5bf62c97a6c0c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Minimum Expense Staircase Traversal","order":16,"contentType":"PROBLEM","contentSlug":"minimum-expense-staircase-traversal","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_84eceab5bc01af81e4fd8270a031ad89","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Maximum Non-Adjacent Selection","order":17,"contentType":"PROBLEM","contentSlug":"maximum-non-adjacent-selection","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_8cb06fb2841b17e45c986d4d8baa182d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Grid Minimum Cost Traversal","order":18,"contentType":"PROBLEM","contentSlug":"grid-minimum-cost-traversal","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_9d619ff7ccda7c944dc83924c879b294","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"String Transformation Cost","order":19,"contentType":"PROBLEM","contentSlug":"string-transformation-cost","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_9251ed875cc7d82c9aa62dffd2e3d0b0","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"What Is Backtracking?","order":1,"contentType":"LEARNING","contentSlug":"what-is-backtracking","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_6e1ecd51b361795b19cdb8ceb7dae8ca","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Backtracking vs Brute Force: Understanding the Distinction","order":2,"contentType":"LEARNING","contentSlug":"backtracking-vs-brute-force","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_13e319dc2a0ef4d62c4d8e5257dd9202","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"The Backtracking Template — Choose, Explore, Unchoose","order":3,"contentType":"LEARNING","contentSlug":"the-backtracking-template","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_5660e77785876cc283050bb4aa5a9483","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Subsets & Subsequences","order":4,"contentType":"LEARNING","contentSlug":"subsets-subsequences","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_9b3543beba7dcf001709a429eac6503e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Permutations & Combinations","order":5,"contentType":"LEARNING","contentSlug":"permutations-and-combinations","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_591770c1dbd0e55258fbeaab4024700a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"N-Queens Problem — The Classic Backtracking Challenge","order":6,"contentType":"LEARNING","contentSlug":"n-queens-problem","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_e731051d5c4f13e51dc2d8069fd798e1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Sudoku Solver — Backtracking in Action","order":7,"contentType":"LEARNING","contentSlug":"sudoku-solver","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_d03dd2619c8e53c3df89e90d9a2677e7","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Constraint Satisfaction & Pruning","order":8,"contentType":"LEARNING","contentSlug":"constraint-satisfaction-pruning","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_36c92563964ae102c0883e5d4ea83ef0","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Common Backtracking Patterns","order":9,"contentType":"LEARNING","contentSlug":"common-backtracking-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_483215ba474b10ccdfe64294dc262e31","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Backtracking Time Complexity Analysis","order":10,"contentType":"LEARNING","contentSlug":"backtracking-time-complexity-analysis","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_9f0412f228ed6757d2c8fb31664a78e1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Generate All Arrangements","order":11,"contentType":"VISUALIZER","contentSlug":"generate-all-arrangements","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_f0c6891c689ebe8f55f2f68e930efa28","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Generate All Arrangements","order":12,"contentType":"PROBLEM","contentSlug":"generate-all-arrangements","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_1cd0689da49109e257fc1caff1daa106","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Target Sum Combinations","order":13,"contentType":"PROBLEM","contentSlug":"target-sum-combinations","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_59a6d330f58df3b4ea94d57161e008d5","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Palindrome Segmentation","order":14,"contentType":"PROBLEM","contentSlug":"palindrome-segmentation","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_e8acb6d85021dace8b4c51b7182f3c65","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Throne Arrangement","order":15,"contentType":"PROBLEM","contentSlug":"throne-arrangement","description":null,"estimatedMins":45,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_1fd20f4309b3045d6930ad0b8b1a9148","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Graph Traversal Overview","order":1,"contentType":"LEARNING","contentSlug":"graph-traversal-overview","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_4f7c4fa2328f0c408b28da11c83d968b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Depth-First Search (DFS) — Algorithm & Applications","order":2,"contentType":"LEARNING","contentSlug":"dfs-algorithm-and-applications","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_010b8adbda0c7331213ad4a7000c9319","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Breadth-First Search (BFS) — Algorithm & Applications","order":3,"contentType":"LEARNING","contentSlug":"bfs-algorithm-applications","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_b769bbb2ace5b504d2281f425125ee3b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Connected Components — Graph Decomposition","order":4,"contentType":"LEARNING","contentSlug":"connected-components","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_4efc4b9809dffdb3e18c9f87a6ccdd9d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Cycle Detection","order":5,"contentType":"LEARNING","contentSlug":"cycle-detection","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_e944ea27c6c7e8d9805c2b6a2b74dd5f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Topological Sorting","order":6,"contentType":"LEARNING","contentSlug":"topological-sorting","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_018ef935007ecbe0c6eb7beed2cc645a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Shortest Path — Unweighted Graphs (BFS)","order":7,"contentType":"LEARNING","contentSlug":"shortest-path-unweighted","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_15976621fc30ccea61146654059797df","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Shortest Path — Dijkstra's Algorithm","order":8,"contentType":"LEARNING","contentSlug":"dijkstras-algorithm","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_702cf2fbe224262ace21fd835955b955","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Shortest Path — Bellman-Ford Algorithm","order":9,"contentType":"LEARNING","contentSlug":"bellman-ford-algorithm","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_8431552e835bec36b2363f770319850d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"All-Pairs Shortest Path — Floyd-Warshall (Conceptual)","order":10,"contentType":"LEARNING","contentSlug":"floyd-warshall-algorithm","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_c754fa4e0994b61c3a4a76512029fa91","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Choosing the Right Shortest Path Algorithm","order":11,"contentType":"LEARNING","contentSlug":"choosing-shortest-path-algorithm","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_ad15793260ff016f6bd158d6e18ac2c6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Region Color Propagation","order":12,"contentType":"VISUALIZER","contentSlug":"region-color-propagation","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_aac648f49d381cfa5a92948a61e64c89","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Region Color Propagation","order":13,"contentType":"PROBLEM","contentSlug":"region-color-propagation","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_69c5d38f96632a79f57d2c5a92e213a2","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Task Dependency Validator","order":14,"contentType":"PROBLEM","contentSlug":"task-dependency-validator","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_e1f2c24b3187f8332c90a53439ef8146","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Task Execution Order","order":15,"contentType":"PROBLEM","contentSlug":"task-execution-order","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_1a366ebaa4e3b936cb67e30fa0bcb9e3","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Signal Propagation Time","order":16,"contentType":"PROBLEM","contentSlug":"signal-propagation-time","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_38251cb152886e07e3e06b42dbdc96ee","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Implement downstream impact across a drainage network","order":17,"contentType":"REPO","contentSlug":"drainage-inspections-network-impact","description":null,"estimatedMins":60,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_b34a0aef29d0102c891d6051ad257f1b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Track visited drainage assets while following downstream links","order":18,"contentType":"CODE_REVIEW","contentSlug":"drainage-inspections-review-network-impact","description":null,"estimatedMins":35,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_8a50add7f24ab68c391ae2e88fbc81b1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Minimum Spanning Trees — Understanding the Concept","order":1,"contentType":"LEARNING","contentSlug":"minimum-spanning-trees-concept","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z"},{"id":"seed_3ec91e19a0da769755849b0e78bf0d4c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Prim's Algorithm","order":2,"contentType":"LEARNING","contentSlug":"prims-algorithm","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_27c2717263274f44dcf0ced9a78a99e7","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Kruskal's Algorithm — Edge-Centric MST Construction","order":3,"contentType":"LEARNING","contentSlug":"kruskals-algorithm","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_23b831e6f72c45620abf1404980fc6c2","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Union-Find (Disjoint Set Union) — The Connectivity Powerhouse","order":4,"contentType":"LEARNING","contentSlug":"union-find","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_749db3fd9e7f05f0d39aa6365f772de7","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Strongly Connected Components — Deep Connectivity in Directed Graphs","order":5,"contentType":"LEARNING","contentSlug":"strongly-connected-components","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_b465cdbeb52e6c6e130fc17f6d149b01","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Articulation Points & Bridges","order":6,"contentType":"LEARNING","contentSlug":"articulation-points-and-bridges","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_f7e7955ce603fa019a79b2c10623e94a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Bipartite Graphs","order":7,"contentType":"LEARNING","contentSlug":"bipartite-graphs","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_7b3d7bc4911889c9b9bdd95c86fb6375","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Network Flow — Conceptual Introduction","order":8,"contentType":"LEARNING","contentSlug":"network-flow-conceptual-introduction","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_8e698b0e5dfcd181a922365e22cf2815","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Advanced Graph Patterns: Classical Problems & Computational Boundaries","order":9,"contentType":"LEARNING","contentSlug":"advanced-graph-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_ed93eaf5fba9d842d1090422ce3960e9","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Two-Set Graph Partition","order":10,"contentType":"PROBLEM","contentSlug":"two-set-graph-partition","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_8cc566d100d512f1fa25f56d1ccfa7c5","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Safe Destination Nodes","order":11,"contentType":"PROBLEM","contentSlug":"safe-destination-nodes","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_009125ea8ee07d70c348fb8c58bbf0f8","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"String Matching Problem Formalization","order":1,"contentType":"LEARNING","contentSlug":"string-matching-problem-formalization","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_5164caa78e75c936a8b5837fc35f9f4b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"Naive Pattern Matching — The Fundamental Algorithm","order":2,"contentType":"LEARNING","contentSlug":"naive-pattern-matching","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_3ba1bf24f30934722540301d1752773a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"KMP Algorithm — Failure Function & Matching","order":3,"contentType":"LEARNING","contentSlug":"kmp-algorithm","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_1f1fe291db13d38d24bbb70ecb74aef9","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"Rabin-Karp Algorithm — Rolling Hash","order":4,"contentType":"LEARNING","contentSlug":"rabin-karp-algorithm","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_5615e2232e79b8e522de03a4726e7a42","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"Z-Algorithm: Linear-Time Pattern Matching","order":5,"contentType":"LEARNING","contentSlug":"z-algorithm","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_f4edfa2a71a02dc75763e559db17dd03","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"String Hashing Techniques","order":6,"contentType":"LEARNING","contentSlug":"string-hashing-techniques","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_17f23655cc264f3d56f72c2cadfaedde","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"Longest Common Subsequence (Revisited)","order":7,"contentType":"LEARNING","contentSlug":"longest-common-subsequence-revisited","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_80d9dd76ecf031fb72b9b5901a612619","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"Longest Palindromic Substring","order":8,"contentType":"LEARNING","contentSlug":"longest-palindromic-substring","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_347c1f05f9dad4ecd79adb57d4378511","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"Suffix Arrays & Suffix Trees (Conceptual)","order":9,"contentType":"LEARNING","contentSlug":"suffix-arrays-and-suffix-trees","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_462d01934cd3278c40cf5023945ca632","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"Common String Algorithm Patterns","order":10,"contentType":"LEARNING","contentSlug":"common-string-algorithm-patterns","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_9de41d8eb0d31b2060e99b9d4d363a38","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"Pattern Text Matching","order":11,"contentType":"PROBLEM","contentSlug":"pattern-text-matching","description":null,"estimatedMins":45,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_c860be9a270dec4ac0f54a59f3c43112","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Binary Representation Revisited — The Language of Low-Level Optimization","order":1,"contentType":"LEARNING","contentSlug":"binary-representation-revisited","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_f58b01085f2d721028ff9aee22fdbdf7","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Bitwise Operators — AND, OR, XOR, NOT","order":2,"contentType":"LEARNING","contentSlug":"bitwise-operators","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_a647cdaa538324b6bcc3e0e169ed426e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Bit Shifting — Left & Right Shifts","order":3,"contentType":"LEARNING","contentSlug":"bit-shifting","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_4ea248c6e941b68cfae9679ae7f127f6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Common Bit Manipulation Tricks","order":4,"contentType":"LEARNING","contentSlug":"common-bit-manipulation-tricks","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_ad621bf64924d024f9031e8d90514fa3","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Checking, Setting, Clearing, Toggling Bits","order":5,"contentType":"LEARNING","contentSlug":"checking-setting-clearing-toggling-bits","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_7285eb0e418b48401e19e61def4abdf1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Power of Two & Counting Bits","order":6,"contentType":"LEARNING","contentSlug":"power-of-two-and-counting-bits","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_1e510442922f9ddbbe58c7e2cf6aa8a9","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Bitmasks for Subset Representation","order":7,"contentType":"LEARNING","contentSlug":"bitmasks-for-subset-representation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_0ca39e3cf199363ef68babfc1556bc05","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"XOR Patterns — Finding Missing & Duplicate Numbers","order":8,"contentType":"LEARNING","contentSlug":"xor-patterns-finding-missing-duplicate","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_c55f340ac11009c845d39fd178858e57","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Bit Manipulation Problem Types","order":9,"contentType":"LEARNING","contentSlug":"bit-manipulation-problem-types","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_2499b024c2f5091dfd97e46c9430147a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"When to Use Bit Manipulation","order":10,"contentType":"LEARNING","contentSlug":"when-to-use-bit-manipulation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_670f8692b1d1ba3088e20637093668db","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Unique Element Finder","order":11,"contentType":"VISUALIZER","contentSlug":"unique-element-finder","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_1bc6f67c14673ab9897df20cef6977d9","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Unique Element Finder","order":12,"contentType":"PROBLEM","contentSlug":"unique-element-finder","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_76f7cab03973016d4a8e3ee5f657d0fe","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Binary One Counter","order":13,"contentType":"PROBLEM","contentSlug":"binary-one-counter","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_a6867dd690b00846c548535c90433424","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Range Bitwise Conjunction","order":14,"contentType":"PROBLEM","contentSlug":"range-bitwise-conjunction","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_e6e84935538f036f185e78eb2ad55734","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"Segment Trees — Range Queries","order":1,"contentType":"LEARNING","contentSlug":"segment-trees-range-queries","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_dba29818398dbfa1cac4fec400dc3bc1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"Segment Tree Construction & Operations","order":2,"contentType":"LEARNING","contentSlug":"segment-tree-construction-operations","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_893d97872d03e6766d83510d0e9e4ef6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"Lazy Propagation — Efficient Range Updates","order":3,"contentType":"LEARNING","contentSlug":"lazy-propagation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_8cdae02d53ae686ad934018408835585","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"Fenwick Trees — Binary Indexed Trees","order":4,"contentType":"LEARNING","contentSlug":"fenwick-trees-binary-indexed-trees","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_4a658b9f40164f52ccbc04f09dce5292","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"Sparse Tables — Immutable Range Queries","order":5,"contentType":"LEARNING","contentSlug":"sparse-tables-immutable-range-queries","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_92c1e899f2dc7850824e79ceba3d8805","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"LRU Cache — Design & Implementation","order":6,"contentType":"LEARNING","contentSlug":"lru-cache-design-implementation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_e4046c444eaa858f9d5275b09bbcf6e2","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"Skip Lists — Probabilistic Alternative to Balanced Trees","order":7,"contentType":"LEARNING","contentSlug":"skip-lists","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_f533eefb9bdaa1cb6aa1aee55c2304b8","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"Bloom Filters — Probabilistic Set Membership","order":8,"contentType":"LEARNING","contentSlug":"bloom-filters","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_33bc744b2b7881d3037d84eaa8f3353f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"When to Use Advanced Data Structures","order":9,"contentType":"LEARNING","contentSlug":"when-to-use-advanced-data-structures","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_1856ee3f920cbba5a584ecd712b45f1e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"Completed deliveries still count against route capacity","order":10,"contentType":"REPO","contentSlug":"dispatch-planner-route-peak","description":null,"estimatedMins":60,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_bd790889cff6c87c366819036da34290","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"Measure peak load instead of total pickups","order":11,"contentType":"CODE_REVIEW","contentSlug":"dispatch-planner-review-route-peak","description":null,"estimatedMins":35,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_846e9824a7a20573e2e6bd910b4c1b67","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"The Problem-Solving Mindset","order":1,"contentType":"LEARNING","contentSlug":"the-problem-solving-mindset","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_92c1509afd8e93b93a3b6c6fc1c0498a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Identifying Problem Patterns","order":2,"contentType":"LEARNING","contentSlug":"identifying-problem-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_ff4bb48f7761a6d02389a59a18b95ded","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Pattern Recognition Framework","order":3,"contentType":"LEARNING","contentSlug":"pattern-recognition-framework","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_b0c9bd90115aa5277f828f114b2b7f7c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Constraint-Based Algorithm Selection","order":4,"contentType":"LEARNING","contentSlug":"constraint-based-algorithm-selection","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_66abc3487349e00ba55f22054a701a98","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Edge Cases & Testing Strategies","order":5,"contentType":"LEARNING","contentSlug":"edge-cases-and-testing-strategies","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_2634e6b8333d74de3b9ffec19d677609","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Debugging Algorithmic Code","order":6,"contentType":"LEARNING","contentSlug":"debugging-algorithmic-code","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_2b4068cae0c05cc74e0688d5bffd0ac6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Optimization Techniques","order":7,"contentType":"LEARNING","contentSlug":"optimization-techniques","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_de598a3b78743127f4f7224e874ecde2","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Time Management in Technical Interviews","order":8,"contentType":"LEARNING","contentSlug":"time-management-in-interviews","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_703f321bbc9490c78125158fd6a69663","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"From Solution to Clean Code","order":9,"contentType":"LEARNING","contentSlug":"from-solution-to-clean-code","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_4cb550b282b16fe56809c7b7766f9d47","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Building Long-Term DSA Fluency","order":10,"contentType":"LEARNING","contentSlug":"building-long-term-dsa-fluency","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_72b9696adc808bc1d2aa945fae5b49fd","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Rainfall Basin Accumulation","order":11,"contentType":"PROBLEM","contentSlug":"rainfall-basin-accumulation","description":null,"estimatedMins":45,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_430f390ffca7237b9b28a395e229d8b8","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Overlapping annotations leave fragments in redacted output","order":12,"contentType":"REPO","contentSlug":"redaction-gateway-overlap-union","description":null,"estimatedMins":60,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_46fb74ec44a28be69b7b0c33e8540df1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Merge overlapping spans while leaving the renderer cursor unchanged","order":13,"contentType":"CODE_REVIEW","contentSlug":"redaction-gateway-review-overlap-union","description":null,"estimatedMins":35,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_1d00c394451bdcc0ef0949062ef93f7c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Repeated translation placeholders disappear during review","order":14,"contentType":"REPO","contentSlug":"translation-workbench-placeholder-counts","description":null,"estimatedMins":60,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z"},{"id":"seed_31afb5c4af87239af8d6dd232a3788ab","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Count every occurrence of a translation placeholder","order":15,"contentType":"CODE_REVIEW","contentSlug":"translation-workbench-review-placeholder-counts","description":null,"estimatedMins":35,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z"}],"sections":[{"title":"Chapter 1: Algorithmic Thinking","order":1,"modules":["$46:props:state:queries:0:state:data:json:modules:0","$46:props:state:queries:0:state:data:json:modules:1","$46:props:state:queries:0:state:data:json:modules:2","$46:props:state:queries:0:state:data:json:modules:3","$46:props:state:queries:0:state:data:json:modules:4","$46:props:state:queries:0:state:data:json:modules:5","$46:props:state:queries:0:state:data:json:modules:6","$46:props:state:queries:0:state:data:json:modules:7"]},{"title":"Chapter 2: Data Structures Foundations","order":2,"modules":["$46:props:state:queries:0:state:data:json:modules:8","$46:props:state:queries:0:state:data:json:modules:9","$46:props:state:queries:0:state:data:json:modules:10","$46:props:state:queries:0:state:data:json:modules:11","$46:props:state:queries:0:state:data:json:modules:12","$46:props:state:queries:0:state:data:json:modules:13","$46:props:state:queries:0:state:data:json:modules:14","$46:props:state:queries:0:state:data:json:modules:15","$46:props:state:queries:0:state:data:json:modules:16"]},{"title":"Chapter 3: Primitive Data Structures","order":3,"modules":["$46:props:state:queries:0:state:data:json:modules:17","$46:props:state:queries:0:state:data:json:modules:18","$46:props:state:queries:0:state:data:json:modules:19","$46:props:state:queries:0:state:data:json:modules:20","$46:props:state:queries:0:state:data:json:modules:21","$46:props:state:queries:0:state:data:json:modules:22","$46:props:state:queries:0:state:data:json:modules:23","$46:props:state:queries:0:state:data:json:modules:24","$46:props:state:queries:0:state:data:json:modules:25"]},{"title":"Chapter 4: Strings","order":4,"modules":["$46:props:state:queries:0:state:data:json:modules:26","$46:props:state:queries:0:state:data:json:modules:27","$46:props:state:queries:0:state:data:json:modules:28","$46:props:state:queries:0:state:data:json:modules:29","$46:props:state:queries:0:state:data:json:modules:30","$46:props:state:queries:0:state:data:json:modules:31","$46:props:state:queries:0:state:data:json:modules:32","$46:props:state:queries:0:state:data:json:modules:33","$46:props:state:queries:0:state:data:json:modules:34","$46:props:state:queries:0:state:data:json:modules:35","$46:props:state:queries:0:state:data:json:modules:36","$46:props:state:queries:0:state:data:json:modules:37","$46:props:state:queries:0:state:data:json:modules:38","$46:props:state:queries:0:state:data:json:modules:39"]},{"title":"Chapter 5: Arrays","order":5,"modules":["$46:props:state:queries:0:state:data:json:modules:40","$46:props:state:queries:0:state:data:json:modules:41","$46:props:state:queries:0:state:data:json:modules:42","$46:props:state:queries:0:state:data:json:modules:43","$46:props:state:queries:0:state:data:json:modules:44","$46:props:state:queries:0:state:data:json:modules:45","$46:props:state:queries:0:state:data:json:modules:46","$46:props:state:queries:0:state:data:json:modules:47","$46:props:state:queries:0:state:data:json:modules:48","$46:props:state:queries:0:state:data:json:modules:49","$46:props:state:queries:0:state:data:json:modules:50","$46:props:state:queries:0:state:data:json:modules:51","$46:props:state:queries:0:state:data:json:modules:52","$46:props:state:queries:0:state:data:json:modules:53","$46:props:state:queries:0:state:data:json:modules:54","$46:props:state:queries:0:state:data:json:modules:55"]},{"title":"Chapter 6: Linked Lists","order":6,"modules":["$46:props:state:queries:0:state:data:json:modules:56","$46:props:state:queries:0:state:data:json:modules:57","$46:props:state:queries:0:state:data:json:modules:58","$46:props:state:queries:0:state:data:json:modules:59","$46:props:state:queries:0:state:data:json:modules:60","$46:props:state:queries:0:state:data:json:modules:61","$46:props:state:queries:0:state:data:json:modules:62","$46:props:state:queries:0:state:data:json:modules:63","$46:props:state:queries:0:state:data:json:modules:64","$46:props:state:queries:0:state:data:json:modules:65","$46:props:state:queries:0:state:data:json:modules:66","$46:props:state:queries:0:state:data:json:modules:67","$46:props:state:queries:0:state:data:json:modules:68","$46:props:state:queries:0:state:data:json:modules:69","$46:props:state:queries:0:state:data:json:modules:70","$46:props:state:queries:0:state:data:json:modules:71"]},{"title":"Chapter 7: Stacks","order":7,"modules":["$46:props:state:queries:0:state:data:json:modules:72","$46:props:state:queries:0:state:data:json:modules:73","$46:props:state:queries:0:state:data:json:modules:74","$46:props:state:queries:0:state:data:json:modules:75","$46:props:state:queries:0:state:data:json:modules:76","$46:props:state:queries:0:state:data:json:modules:77","$46:props:state:queries:0:state:data:json:modules:78","$46:props:state:queries:0:state:data:json:modules:79","$46:props:state:queries:0:state:data:json:modules:80","$46:props:state:queries:0:state:data:json:modules:81","$46:props:state:queries:0:state:data:json:modules:82","$46:props:state:queries:0:state:data:json:modules:83","$46:props:state:queries:0:state:data:json:modules:84","$46:props:state:queries:0:state:data:json:modules:85"]},{"title":"Chapter 8: Queues","order":8,"modules":["$46:props:state:queries:0:state:data:json:modules:86","$46:props:state:queries:0:state:data:json:modules:87","$46:props:state:queries:0:state:data:json:modules:88","$46:props:state:queries:0:state:data:json:modules:89","$46:props:state:queries:0:state:data:json:modules:90","$46:props:state:queries:0:state:data:json:modules:91","$46:props:state:queries:0:state:data:json:modules:92","$46:props:state:queries:0:state:data:json:modules:93","$46:props:state:queries:0:state:data:json:modules:94","$46:props:state:queries:0:state:data:json:modules:95"]},{"title":"Chapter 9: Recursion","order":9,"modules":["$46:props:state:queries:0:state:data:json:modules:96","$46:props:state:queries:0:state:data:json:modules:97","$46:props:state:queries:0:state:data:json:modules:98","$46:props:state:queries:0:state:data:json:modules:99","$46:props:state:queries:0:state:data:json:modules:100","$46:props:state:queries:0:state:data:json:modules:101","$46:props:state:queries:0:state:data:json:modules:102","$46:props:state:queries:0:state:data:json:modules:103","$46:props:state:queries:0:state:data:json:modules:104","$46:props:state:queries:0:state:data:json:modules:105","$46:props:state:queries:0:state:data:json:modules:106","$46:props:state:queries:0:state:data:json:modules:107","$46:props:state:queries:0:state:data:json:modules:108"]},{"title":"Chapter 10: Hash Tables","order":10,"modules":["$46:props:state:queries:0:state:data:json:modules:109","$46:props:state:queries:0:state:data:json:modules:110","$46:props:state:queries:0:state:data:json:modules:111","$46:props:state:queries:0:state:data:json:modules:112","$46:props:state:queries:0:state:data:json:modules:113","$46:props:state:queries:0:state:data:json:modules:114","$46:props:state:queries:0:state:data:json:modules:115","$46:props:state:queries:0:state:data:json:modules:116","$46:props:state:queries:0:state:data:json:modules:117","$46:props:state:queries:0:state:data:json:modules:118","$46:props:state:queries:0:state:data:json:modules:119","$46:props:state:queries:0:state:data:json:modules:120","$46:props:state:queries:0:state:data:json:modules:121"]},{"title":"Chapter 11: Trees","order":11,"modules":["$46:props:state:queries:0:state:data:json:modules:122","$46:props:state:queries:0:state:data:json:modules:123","$46:props:state:queries:0:state:data:json:modules:124","$46:props:state:queries:0:state:data:json:modules:125","$46:props:state:queries:0:state:data:json:modules:126","$46:props:state:queries:0:state:data:json:modules:127"]},{"title":"Chapter 11: Trees Hierarchical Data Structures","order":12,"modules":["$46:props:state:queries:0:state:data:json:modules:128","$46:props:state:queries:0:state:data:json:modules:129","$46:props:state:queries:0:state:data:json:modules:130","$46:props:state:queries:0:state:data:json:modules:131","$46:props:state:queries:0:state:data:json:modules:132","$46:props:state:queries:0:state:data:json:modules:133","$46:props:state:queries:0:state:data:json:modules:134","$46:props:state:queries:0:state:data:json:modules:135"]},{"title":"Chapter 12: Binary Search Trees","order":13,"modules":["$46:props:state:queries:0:state:data:json:modules:136","$46:props:state:queries:0:state:data:json:modules:137","$46:props:state:queries:0:state:data:json:modules:138","$46:props:state:queries:0:state:data:json:modules:139","$46:props:state:queries:0:state:data:json:modules:140","$46:props:state:queries:0:state:data:json:modules:141","$46:props:state:queries:0:state:data:json:modules:142","$46:props:state:queries:0:state:data:json:modules:143","$46:props:state:queries:0:state:data:json:modules:144","$46:props:state:queries:0:state:data:json:modules:145","$46:props:state:queries:0:state:data:json:modules:146","$46:props:state:queries:0:state:data:json:modules:147","$46:props:state:queries:0:state:data:json:modules:148"]},{"title":"Chapter 13: Balanced Search Trees","order":14,"modules":["$46:props:state:queries:0:state:data:json:modules:149","$46:props:state:queries:0:state:data:json:modules:150","$46:props:state:queries:0:state:data:json:modules:151","$46:props:state:queries:0:state:data:json:modules:152","$46:props:state:queries:0:state:data:json:modules:153","$46:props:state:queries:0:state:data:json:modules:154","$46:props:state:queries:0:state:data:json:modules:155","$46:props:state:queries:0:state:data:json:modules:156"]},{"title":"Chapter 14: Heaps And Priority Queues","order":15,"modules":["$46:props:state:queries:0:state:data:json:modules:157","$46:props:state:queries:0:state:data:json:modules:158","$46:props:state:queries:0:state:data:json:modules:159","$46:props:state:queries:0:state:data:json:modules:160","$46:props:state:queries:0:state:data:json:modules:161","$46:props:state:queries:0:state:data:json:modules:162","$46:props:state:queries:0:state:data:json:modules:163","$46:props:state:queries:0:state:data:json:modules:164","$46:props:state:queries:0:state:data:json:modules:165","$46:props:state:queries:0:state:data:json:modules:166","$46:props:state:queries:0:state:data:json:modules:167","$46:props:state:queries:0:state:data:json:modules:168","$46:props:state:queries:0:state:data:json:modules:169"]},{"title":"Chapter 14: Heaps Priority Queues","order":16,"modules":["$46:props:state:queries:0:state:data:json:modules:170"]},{"title":"Chapter 15: Tries","order":17,"modules":["$46:props:state:queries:0:state:data:json:modules:171","$46:props:state:queries:0:state:data:json:modules:172","$46:props:state:queries:0:state:data:json:modules:173","$46:props:state:queries:0:state:data:json:modules:174","$46:props:state:queries:0:state:data:json:modules:175","$46:props:state:queries:0:state:data:json:modules:176","$46:props:state:queries:0:state:data:json:modules:177","$46:props:state:queries:0:state:data:json:modules:178","$46:props:state:queries:0:state:data:json:modules:179","$46:props:state:queries:0:state:data:json:modules:180"]},{"title":"Chapter 16: Graphs","order":18,"modules":["$46:props:state:queries:0:state:data:json:modules:181","$46:props:state:queries:0:state:data:json:modules:182","$46:props:state:queries:0:state:data:json:modules:183","$46:props:state:queries:0:state:data:json:modules:184","$46:props:state:queries:0:state:data:json:modules:185","$46:props:state:queries:0:state:data:json:modules:186","$46:props:state:queries:0:state:data:json:modules:187","$46:props:state:queries:0:state:data:json:modules:188","$46:props:state:queries:0:state:data:json:modules:189","$46:props:state:queries:0:state:data:json:modules:190","$46:props:state:queries:0:state:data:json:modules:191","$46:props:state:queries:0:state:data:json:modules:192","$46:props:state:queries:0:state:data:json:modules:193"]},{"title":"Chapter 17: Searching Algorithms","order":19,"modules":["$46:props:state:queries:0:state:data:json:modules:194","$46:props:state:queries:0:state:data:json:modules:195","$46:props:state:queries:0:state:data:json:modules:196","$46:props:state:queries:0:state:data:json:modules:197","$46:props:state:queries:0:state:data:json:modules:198","$46:props:state:queries:0:state:data:json:modules:199","$46:props:state:queries:0:state:data:json:modules:200","$46:props:state:queries:0:state:data:json:modules:201","$46:props:state:queries:0:state:data:json:modules:202","$46:props:state:queries:0:state:data:json:modules:203","$46:props:state:queries:0:state:data:json:modules:204","$46:props:state:queries:0:state:data:json:modules:205","$46:props:state:queries:0:state:data:json:modules:206","$46:props:state:queries:0:state:data:json:modules:207"]},{"title":"Chapter 18: Sorting Algorithms","order":20,"modules":["$46:props:state:queries:0:state:data:json:modules:208","$46:props:state:queries:0:state:data:json:modules:209","$46:props:state:queries:0:state:data:json:modules:210","$46:props:state:queries:0:state:data:json:modules:211","$46:props:state:queries:0:state:data:json:modules:212","$46:props:state:queries:0:state:data:json:modules:213","$46:props:state:queries:0:state:data:json:modules:214","$46:props:state:queries:0:state:data:json:modules:215","$46:props:state:queries:0:state:data:json:modules:216","$46:props:state:queries:0:state:data:json:modules:217","$46:props:state:queries:0:state:data:json:modules:218","$46:props:state:queries:0:state:data:json:modules:219","$46:props:state:queries:0:state:data:json:modules:220","$46:props:state:queries:0:state:data:json:modules:221"]},{"title":"Chapter 19: Divide And Conquer","order":21,"modules":["$46:props:state:queries:0:state:data:json:modules:222","$46:props:state:queries:0:state:data:json:modules:223","$46:props:state:queries:0:state:data:json:modules:224","$46:props:state:queries:0:state:data:json:modules:225","$46:props:state:queries:0:state:data:json:modules:226","$46:props:state:queries:0:state:data:json:modules:227","$46:props:state:queries:0:state:data:json:modules:228","$46:props:state:queries:0:state:data:json:modules:229","$46:props:state:queries:0:state:data:json:modules:230","$46:props:state:queries:0:state:data:json:modules:231","$46:props:state:queries:0:state:data:json:modules:232"]},{"title":"Chapter 20: Greedy Algorithms","order":22,"modules":["$46:props:state:queries:0:state:data:json:modules:233","$46:props:state:queries:0:state:data:json:modules:234","$46:props:state:queries:0:state:data:json:modules:235","$46:props:state:queries:0:state:data:json:modules:236","$46:props:state:queries:0:state:data:json:modules:237","$46:props:state:queries:0:state:data:json:modules:238","$46:props:state:queries:0:state:data:json:modules:239","$46:props:state:queries:0:state:data:json:modules:240","$46:props:state:queries:0:state:data:json:modules:241","$46:props:state:queries:0:state:data:json:modules:242","$46:props:state:queries:0:state:data:json:modules:243","$46:props:state:queries:0:state:data:json:modules:244","$46:props:state:queries:0:state:data:json:modules:245","$46:props:state:queries:0:state:data:json:modules:246"]},{"title":"Chapter 21: Dynamic Programming","order":23,"modules":["$46:props:state:queries:0:state:data:json:modules:247","$46:props:state:queries:0:state:data:json:modules:248","$46:props:state:queries:0:state:data:json:modules:249","$46:props:state:queries:0:state:data:json:modules:250","$46:props:state:queries:0:state:data:json:modules:251","$46:props:state:queries:0:state:data:json:modules:252","$46:props:state:queries:0:state:data:json:modules:253","$46:props:state:queries:0:state:data:json:modules:254","$46:props:state:queries:0:state:data:json:modules:255","$46:props:state:queries:0:state:data:json:modules:256","$46:props:state:queries:0:state:data:json:modules:257","$46:props:state:queries:0:state:data:json:modules:258","$46:props:state:queries:0:state:data:json:modules:259","$46:props:state:queries:0:state:data:json:modules:260","$46:props:state:queries:0:state:data:json:modules:261","$46:props:state:queries:0:state:data:json:modules:262","$46:props:state:queries:0:state:data:json:modules:263","$46:props:state:queries:0:state:data:json:modules:264","$46:props:state:queries:0:state:data:json:modules:265"]},{"title":"Chapter 22: Backtracking","order":24,"modules":["$46:props:state:queries:0:state:data:json:modules:266","$46:props:state:queries:0:state:data:json:modules:267","$46:props:state:queries:0:state:data:json:modules:268","$46:props:state:queries:0:state:data:json:modules:269","$46:props:state:queries:0:state:data:json:modules:270","$46:props:state:queries:0:state:data:json:modules:271","$46:props:state:queries:0:state:data:json:modules:272","$46:props:state:queries:0:state:data:json:modules:273","$46:props:state:queries:0:state:data:json:modules:274","$46:props:state:queries:0:state:data:json:modules:275","$46:props:state:queries:0:state:data:json:modules:276","$46:props:state:queries:0:state:data:json:modules:277","$46:props:state:queries:0:state:data:json:modules:278","$46:props:state:queries:0:state:data:json:modules:279","$46:props:state:queries:0:state:data:json:modules:280"]},{"title":"Chapter 23: Graph Algorithms","order":25,"modules":["$46:props:state:queries:0:state:data:json:modules:281","$46:props:state:queries:0:state:data:json:modules:282","$46:props:state:queries:0:state:data:json:modules:283","$46:props:state:queries:0:state:data:json:modules:284","$46:props:state:queries:0:state:data:json:modules:285","$46:props:state:queries:0:state:data:json:modules:286","$46:props:state:queries:0:state:data:json:modules:287","$46:props:state:queries:0:state:data:json:modules:288","$46:props:state:queries:0:state:data:json:modules:289","$46:props:state:queries:0:state:data:json:modules:290","$46:props:state:queries:0:state:data:json:modules:291","$46:props:state:queries:0:state:data:json:modules:292","$46:props:state:queries:0:state:data:json:modules:293","$46:props:state:queries:0:state:data:json:modules:294","$46:props:state:queries:0:state:data:json:modules:295","$46:props:state:queries:0:state:data:json:modules:296","$46:props:state:queries:0:state:data:json:modules:297","$46:props:state:queries:0:state:data:json:modules:298"]},{"title":"Chapter 24: Advanced Graph Algorithms","order":26,"modules":["$46:props:state:queries:0:state:data:json:modules:299","$46:props:state:queries:0:state:data:json:modules:300","$46:props:state:queries:0:state:data:json:modules:301","$46:props:state:queries:0:state:data:json:modules:302","$46:props:state:queries:0:state:data:json:modules:303","$46:props:state:queries:0:state:data:json:modules:304","$46:props:state:queries:0:state:data:json:modules:305","$46:props:state:queries:0:state:data:json:modules:306","$46:props:state:queries:0:state:data:json:modules:307","$46:props:state:queries:0:state:data:json:modules:308","$46:props:state:queries:0:state:data:json:modules:309"]},{"title":"Chapter 25: String Algorithms","order":27,"modules":["$46:props:state:queries:0:state:data:json:modules:310","$46:props:state:queries:0:state:data:json:modules:311","$46:props:state:queries:0:state:data:json:modules:312","$46:props:state:queries:0:state:data:json:modules:313","$46:props:state:queries:0:state:data:json:modules:314","$46:props:state:queries:0:state:data:json:modules:315","$46:props:state:queries:0:state:data:json:modules:316","$46:props:state:queries:0:state:data:json:modules:317","$46:props:state:queries:0:state:data:json:modules:318","$46:props:state:queries:0:state:data:json:modules:319","$46:props:state:queries:0:state:data:json:modules:320"]},{"title":"Chapter 26: Bit Manipulation","order":28,"modules":["$46:props:state:queries:0:state:data:json:modules:321","$46:props:state:queries:0:state:data:json:modules:322","$46:props:state:queries:0:state:data:json:modules:323","$46:props:state:queries:0:state:data:json:modules:324","$46:props:state:queries:0:state:data:json:modules:325","$46:props:state:queries:0:state:data:json:modules:326","$46:props:state:queries:0:state:data:json:modules:327","$46:props:state:queries:0:state:data:json:modules:328","$46:props:state:queries:0:state:data:json:modules:329","$46:props:state:queries:0:state:data:json:modules:330","$46:props:state:queries:0:state:data:json:modules:331","$46:props:state:queries:0:state:data:json:modules:332","$46:props:state:queries:0:state:data:json:modules:333","$46:props:state:queries:0:state:data:json:modules:334"]},{"title":"Chapter 27: Advanced Data Structures","order":29,"modules":["$46:props:state:queries:0:state:data:json:modules:335","$46:props:state:queries:0:state:data:json:modules:336","$46:props:state:queries:0:state:data:json:modules:337","$46:props:state:queries:0:state:data:json:modules:338","$46:props:state:queries:0:state:data:json:modules:339","$46:props:state:queries:0:state:data:json:modules:340","$46:props:state:queries:0:state:data:json:modules:341","$46:props:state:queries:0:state:data:json:modules:342","$46:props:state:queries:0:state:data:json:modules:343","$46:props:state:queries:0:state:data:json:modules:344","$46:props:state:queries:0:state:data:json:modules:345"]},{"title":"Chapter 28: Problem Solving Strategies","order":30,"modules":["$46:props:state:queries:0:state:data:json:modules:346","$46:props:state:queries:0:state:data:json:modules:347","$46:props:state:queries:0:state:data:json:modules:348","$46:props:state:queries:0:state:data:json:modules:349","$46:props:state:queries:0:state:data:json:modules:350","$46:props:state:queries:0:state:data:json:modules:351","$46:props:state:queries:0:state:data:json:modules:352","$46:props:state:queries:0:state:data:json:modules:353","$46:props:state:queries:0:state:data:json:modules:354","$46:props:state:queries:0:state:data:json:modules:355","$46:props:state:queries:0:state:data:json:modules:356","$46:props:state:queries:0:state:data:json:modules:357","$46:props:state:queries:0:state:data:json:modules:358","$46:props:state:queries:0:state:data:json:modules:359","$46:props:state:queries:0:state:data:json:modules:360"]}]},"meta":{"values":{"createdAt":["Date"],"updatedAt":["Date"],"modules.0.createdAt":["Date"],"modules.0.updatedAt":["Date"],"modules.1.createdAt":["Date"],"modules.1.updatedAt":["Date"],"modules.2.createdAt":["Date"],"modules.2.updatedAt":["Date"],"modules.3.createdAt":["Date"],"modules.3.updatedAt":["Date"],"modules.4.createdAt":["Date"],"modules.4.updatedAt":["Date"],"modules.5.createdAt":["Date"],"modules.5.updatedAt":["Date"],"modules.6.createdAt":["Date"],"modules.6.updatedAt":["Date"],"modules.7.createdAt":["Date"],"modules.7.updatedAt":["Date"],"modules.8.createdAt":["Date"],"modules.8.updatedAt":["Date"],"modules.9.createdAt":["Date"],"modules.9.updatedAt":["Date"],"modules.10.createdAt":["Date"],"modules.10.updatedAt":["Date"],"modules.11.createdAt":["Date"],"modules.11.updatedAt":["Date"],"modules.12.createdAt":["Date"],"modules.12.updatedAt":["Date"],"modules.13.createdAt":["Date"],"modules.13.updatedAt":["Date"],"modules.14.createdAt":["Date"],"modules.14.updatedAt":["Date"],"modules.15.createdAt":["Date"],"modules.15.updatedAt":["Date"],"modules.16.createdAt":["Date"],"modules.16.updatedAt":["Date"],"modules.17.createdAt":["Date"],"modules.17.updatedAt":["Date"],"modules.18.createdAt":["Date"],"modules.18.updatedAt":["Date"],"modules.19.createdAt":["Date"],"modules.19.updatedAt":["Date"],"modules.20.createdAt":["Date"],"modules.20.updatedAt":["Date"],"modules.21.createdAt":["Date"],"modules.21.updatedAt":["Date"],"modules.22.createdAt":["Date"],"modules.22.updatedAt":["Date"],"modules.23.createdAt":["Date"],"modules.23.updatedAt":["Date"],"modules.24.createdAt":["Date"],"modules.24.updatedAt":["Date"],"modules.25.createdAt":["Date"],"modules.25.updatedAt":["Date"],"modules.26.createdAt":["Date"],"modules.26.updatedAt":["Date"],"modules.27.createdAt":["Date"],"modules.27.updatedAt":["Date"],"modules.28.createdAt":["Date"],"modules.28.updatedAt":["Date"],"modules.29.createdAt":["Date"],"modules.29.updatedAt":["Date"],"modules.30.createdAt":["Date"],"modules.30.updatedAt":["Date"],"modules.31.createdAt":["Date"],"modules.31.updatedAt":["Date"],"modules.32.createdAt":["Date"],"modules.32.updatedAt":["Date"],"modules.33.createdAt":["Date"],"modules.33.updatedAt":["Date"],"modules.34.createdAt":["Date"],"modules.34.updatedAt":["Date"],"modules.35.createdAt":["Date"],"modules.35.updatedAt":["Date"],"modules.36.createdAt":["Date"],"modules.36.updatedAt":["Date"],"modules.37.createdAt":["Date"],"modules.37.updatedAt":["Date"],"modules.38.createdAt":["Date"],"modules.38.updatedAt":["Date"],"modules.39.createdAt":["Date"],"modules.39.updatedAt":["Date"],"modules.40.createdAt":["Date"],"modules.40.updatedAt":["Date"],"modules.41.createdAt":["Date"],"modules.41.updatedAt":["Date"],"modules.42.createdAt":["Date"],"modules.42.updatedAt":["Date"],"modules.43.createdAt":["Date"],"modules.43.updatedAt":["Date"],"modules.44.createdAt":["Date"],"modules.44.updatedAt":["Date"],"modules.45.createdAt":["Date"],"modules.45.updatedAt":["Date"],"modules.46.createdAt":["Date"],"modules.46.updatedAt":["Date"],"modules.47.createdAt":["Date"],"modules.47.updatedAt":["Date"],"modules.48.createdAt":["Date"],"modules.48.updatedAt":["Date"],"modules.49.createdAt":["Date"],"modules.49.updatedAt":["Date"],"modules.50.createdAt":["Date"],"modules.50.updatedAt":["Date"],"modules.51.createdAt":["Date"],"modules.51.updatedAt":["Date"],"modules.52.createdAt":["Date"],"modules.52.updatedAt":["Date"],"modules.53.createdAt":["Date"],"modules.53.updatedAt":["Date"],"modules.54.createdAt":["Date"],"modules.54.updatedAt":["Date"],"modules.55.createdAt":["Date"],"modules.55.updatedAt":["Date"],"modules.56.createdAt":["Date"],"modules.56.updatedAt":["Date"],"modules.57.createdAt":["Date"],"modules.57.updatedAt":["Date"],"modules.58.createdAt":["Date"],"modules.58.updatedAt":["Date"],"modules.59.createdAt":["Date"],"modules.59.updatedAt":["Date"],"modules.60.createdAt":["Date"],"modules.60.updatedAt":["Date"],"modules.61.createdAt":["Date"],"modules.61.updatedAt":["Date"],"modules.62.createdAt":["Date"],"modules.62.updatedAt":["Date"],"modules.63.createdAt":["Date"],"modules.63.updatedAt":["Date"],"modules.64.createdAt":["Date"],"modules.64.updatedAt":["Date"],"modules.65.createdAt":["Date"],"modules.65.updatedAt":["Date"],"modules.66.createdAt":["Date"],"modules.66.updatedAt":["Date"],"modules.67.createdAt":["Date"],"modules.67.updatedAt":["Date"],"modules.68.createdAt":["Date"],"modules.68.updatedAt":["Date"],"modules.69.createdAt":["Date"],"modules.69.updatedAt":["Date"],"modules.70.createdAt":["Date"],"modules.70.updatedAt":["Date"],"modules.71.createdAt":["Date"],"modules.71.updatedAt":["Date"],"modules.72.createdAt":["Date"],"modules.72.updatedAt":["Date"],"modules.73.createdAt":["Date"],"modules.73.updatedAt":["Date"],"modules.74.createdAt":["Date"],"modules.74.updatedAt":["Date"],"modules.75.createdAt":["Date"],"modules.75.updatedAt":["Date"],"modules.76.createdAt":["Date"],"modules.76.updatedAt":["Date"],"modules.77.createdAt":["Date"],"modules.77.updatedAt":["Date"],"modules.78.createdAt":["Date"],"modules.78.updatedAt":["Date"],"modules.79.createdAt":["Date"],"modules.79.updatedAt":["Date"],"modules.80.createdAt":["Date"],"modules.80.updatedAt":["Date"],"modules.81.createdAt":["Date"],"modules.81.updatedAt":["Date"],"modules.82.createdAt":["Date"],"modules.82.updatedAt":["Date"],"modules.83.createdAt":["Date"],"modules.83.updatedAt":["Date"],"modules.84.createdAt":["Date"],"modules.84.updatedAt":["Date"],"modules.85.createdAt":["Date"],"modules.85.updatedAt":["Date"],"modules.86.createdAt":["Date"],"modules.86.updatedAt":["Date"],"modules.87.createdAt":["Date"],"modules.87.updatedAt":["Date"],"modules.88.createdAt":["Date"],"modules.88.updatedAt":["Date"],"modules.89.createdAt":["Date"],"modules.89.updatedAt":["Date"],"modules.90.createdAt":["Date"],"modules.90.updatedAt":["Date"],"modules.91.createdAt":["Date"],"modules.91.updatedAt":["Date"],"modules.92.createdAt":["Date"],"modules.92.updatedAt":["Date"],"modules.93.createdAt":["Date"],"modules.93.updatedAt":["Date"],"modules.94.createdAt":["Date"],"modules.94.updatedAt":["Date"],"modules.95.createdAt":["Date"],"modules.95.updatedAt":["Date"],"modules.96.createdAt":["Date"],"modules.96.updatedAt":["Date"],"modules.97.createdAt":["Date"],"modules.97.updatedAt":["Date"],"modules.98.createdAt":["Date"],"modules.98.updatedAt":["Date"],"modules.99.createdAt":["Date"],"modules.99.updatedAt":["Date"],"modules.100.createdAt":["Date"],"modules.100.updatedAt":["Date"],"modules.101.createdAt":["Date"],"modules.101.updatedAt":["Date"],"modules.102.createdAt":["Date"],"modules.102.updatedAt":["Date"],"modules.103.createdAt":["Date"],"modules.103.updatedAt":["Date"],"modules.104.createdAt":["Date"],"modules.104.updatedAt":["Date"],"modules.105.createdAt":["Date"],"modules.105.updatedAt":["Date"],"modules.106.createdAt":["Date"],"modules.106.updatedAt":["Date"],"modules.107.createdAt":["Date"],"modules.107.updatedAt":["Date"],"modules.108.createdAt":["Date"],"modules.108.updatedAt":["Date"],"modules.109.createdAt":["Date"],"modules.109.updatedAt":["Date"],"modules.110.createdAt":["Date"],"modules.110.updatedAt":["Date"],"modules.111.createdAt":["Date"],"modules.111.updatedAt":["Date"],"modules.112.createdAt":["Date"],"modules.112.updatedAt":["Date"],"modules.113.createdAt":["Date"],"modules.113.updatedAt":["Date"],"modules.114.createdAt":["Date"],"modules.114.updatedAt":["Date"],"modules.115.createdAt":["Date"],"modules.115.updatedAt":["Date"],"modules.116.createdAt":["Date"],"modules.116.updatedAt":["Date"],"modules.117.createdAt":["Date"],"modules.117.updatedAt":["Date"],"modules.118.createdAt":["Date"],"modules.118.updatedAt":["Date"],"modules.119.createdAt":["Date"],"modules.119.updatedAt":["Date"],"modules.120.createdAt":["Date"],"modules.120.updatedAt":["Date"],"modules.121.createdAt":["Date"],"modules.121.updatedAt":["Date"],"modules.122.createdAt":["Date"],"modules.122.updatedAt":["Date"],"modules.123.createdAt":["Date"],"modules.123.updatedAt":["Date"],"modules.124.createdAt":["Date"],"modules.124.updatedAt":["Date"],"modules.125.createdAt":["Date"],"modules.125.updatedAt":["Date"],"modules.126.createdAt":["Date"],"modules.126.updatedAt":["Date"],"modules.127.createdAt":["Date"],"modules.127.updatedAt":["Date"],"modules.128.createdAt":["Date"],"modules.128.updatedAt":["Date"],"modules.129.createdAt":["Date"],"modules.129.updatedAt":["Date"],"modules.130.createdAt":["Date"],"modules.130.updatedAt":["Date"],"modules.131.createdAt":["Date"],"modules.131.updatedAt":["Date"],"modules.132.createdAt":["Date"],"modules.132.updatedAt":["Date"],"modules.133.createdAt":["Date"],"modules.133.updatedAt":["Date"],"modules.134.createdAt":["Date"],"modules.134.updatedAt":["Date"],"modules.135.createdAt":["Date"],"modules.135.updatedAt":["Date"],"modules.136.createdAt":["Date"],"modules.136.updatedAt":["Date"],"modules.137.createdAt":["Date"],"modules.137.updatedAt":["Date"],"modules.138.createdAt":["Date"],"modules.138.updatedAt":["Date"],"modules.139.createdAt":["Date"],"modules.139.updatedAt":["Date"],"modules.140.createdAt":["Date"],"modules.140.updatedAt":["Date"],"modules.141.createdAt":["Date"],"modules.141.updatedAt":["Date"],"modules.142.createdAt":["Date"],"modules.142.updatedAt":["Date"],"modules.143.createdAt":["Date"],"modules.143.updatedAt":["Date"],"modules.144.createdAt":["Date"],"modules.144.updatedAt":["Date"],"modules.145.createdAt":["Date"],"modules.145.updatedAt":["Date"],"modules.146.createdAt":["Date"],"modules.146.updatedAt":["Date"],"modules.147.createdAt":["Date"],"modules.147.updatedAt":["Date"],"modules.148.createdAt":["Date"],"modules.148.updatedAt":["Date"],"modules.149.createdAt":["Date"],"modules.149.updatedAt":["Date"],"modules.150.createdAt":["Date"],"modules.150.updatedAt":["Date"],"modules.151.createdAt":["Date"],"modules.151.updatedAt":["Date"],"modules.152.createdAt":["Date"],"modules.152.updatedAt":["Date"],"modules.153.createdAt":["Date"],"modules.153.updatedAt":["Date"],"modules.154.createdAt":["Date"],"modules.154.updatedAt":["Date"],"modules.155.createdAt":["Date"],"modules.155.updatedAt":["Date"],"modules.156.createdAt":["Date"],"modules.156.updatedAt":["Date"],"modules.157.createdAt":["Date"],"modules.157.updatedAt":["Date"],"modules.158.createdAt":["Date"],"modules.158.updatedAt":["Date"],"modules.159.createdAt":["Date"],"modules.159.updatedAt":["Date"],"modules.160.createdAt":["Date"],"modules.160.updatedAt":["Date"],"modules.161.createdAt":["Date"],"modules.161.updatedAt":["Date"],"modules.162.createdAt":["Date"],"modules.162.updatedAt":["Date"],"modules.163.createdAt":["Date"],"modules.163.updatedAt":["Date"],"modules.164.createdAt":["Date"],"modules.164.updatedAt":["Date"],"modules.165.createdAt":["Date"],"modules.165.updatedAt":["Date"],"modules.166.createdAt":["Date"],"modules.166.updatedAt":["Date"],"modules.167.createdAt":["Date"],"modules.167.updatedAt":["Date"],"modules.168.createdAt":["Date"],"modules.168.updatedAt":["Date"],"modules.169.createdAt":["Date"],"modules.169.updatedAt":["Date"],"modules.170.createdAt":["Date"],"modules.170.updatedAt":["Date"],"modules.171.createdAt":["Date"],"modules.171.updatedAt":["Date"],"modules.172.createdAt":["Date"],"modules.172.updatedAt":["Date"],"modules.173.createdAt":["Date"],"modules.173.updatedAt":["Date"],"modules.174.createdAt":["Date"],"modules.174.updatedAt":["Date"],"modules.175.createdAt":["Date"],"modules.175.updatedAt":["Date"],"modules.176.createdAt":["Date"],"modules.176.updatedAt":["Date"],"modules.177.createdAt":["Date"],"modules.177.updatedAt":["Date"],"modules.178.createdAt":["Date"],"modules.178.updatedAt":["Date"],"modules.179.createdAt":["Date"],"modules.179.updatedAt":["Date"],"modules.180.createdAt":["Date"],"modules.180.updatedAt":["Date"],"modules.181.createdAt":["Date"],"modules.181.updatedAt":["Date"],"modules.182.createdAt":["Date"],"modules.182.updatedAt":["Date"],"modules.183.createdAt":["Date"],"modules.183.updatedAt":["Date"],"modules.184.createdAt":["Date"],"modules.184.updatedAt":["Date"],"modules.185.createdAt":["Date"],"modules.185.updatedAt":["Date"],"modules.186.createdAt":["Date"],"modules.186.updatedAt":["Date"],"modules.187.createdAt":["Date"],"modules.187.updatedAt":["Date"],"modules.188.createdAt":["Date"],"modules.188.updatedAt":["Date"],"modules.189.createdAt":["Date"],"modules.189.updatedAt":["Date"],"modules.190.createdAt":["Date"],"modules.190.updatedAt":["Date"],"modules.191.createdAt":["Date"],"modules.191.updatedAt":["Date"],"modules.192.createdAt":["Date"],"modules.192.updatedAt":["Date"],"modules.193.createdAt":["Date"],"modules.193.updatedAt":["Date"],"modules.194.createdAt":["Date"],"modules.194.updatedAt":["Date"],"modules.195.createdAt":["Date"],"modules.195.updatedAt":["Date"],"modules.196.createdAt":["Date"],"modules.196.updatedAt":["Date"],"modules.197.createdAt":["Date"],"modules.197.updatedAt":["Date"],"modules.198.createdAt":["Date"],"modules.198.updatedAt":["Date"],"modules.199.createdAt":["Date"],"modules.199.updatedAt":["Date"],"modules.200.createdAt":["Date"],"modules.200.updatedAt":["Date"],"modules.201.createdAt":["Date"],"modules.201.updatedAt":["Date"],"modules.202.createdAt":["Date"],"modules.202.updatedAt":["Date"],"modules.203.createdAt":["Date"],"modules.203.updatedAt":["Date"],"modules.204.createdAt":["Date"],"modules.204.updatedAt":["Date"],"modules.205.createdAt":["Date"],"modules.205.updatedAt":["Date"],"modules.206.createdAt":["Date"],"modules.206.updatedAt":["Date"],"modules.207.createdAt":["Date"],"modules.207.updatedAt":["Date"],"modules.208.createdAt":["Date"],"modules.208.updatedAt":["Date"],"modules.209.createdAt":["Date"],"modules.209.updatedAt":["Date"],"modules.210.createdAt":["Date"],"modules.210.updatedAt":["Date"],"modules.211.createdAt":["Date"],"modules.211.updatedAt":["Date"],"modules.212.createdAt":["Date"],"modules.212.updatedAt":["Date"],"modules.213.createdAt":["Date"],"modules.213.updatedAt":["Date"],"modules.214.createdAt":["Date"],"modules.214.updatedAt":["Date"],"modules.215.createdAt":["Date"],"modules.215.updatedAt":["Date"],"modules.216.createdAt":["Date"],"modules.216.updatedAt":["Date"],"modules.217.createdAt":["Date"],"modules.217.updatedAt":["Date"],"modules.218.createdAt":["Date"],"modules.218.updatedAt":["Date"],"modules.219.createdAt":["Date"],"modules.219.updatedAt":["Date"],"modules.220.createdAt":["Date"],"modules.220.updatedAt":["Date"],"modules.221.createdAt":["Date"],"modules.221.updatedAt":["Date"],"modules.222.createdAt":["Date"],"modules.222.updatedAt":["Date"],"modules.223.createdAt":["Date"],"modules.223.updatedAt":["Date"],"modules.224.createdAt":["Date"],"modules.224.updatedAt":["Date"],"modules.225.createdAt":["Date"],"modules.225.updatedAt":["Date"],"modules.226.createdAt":["Date"],"modules.226.updatedAt":["Date"],"modules.227.createdAt":["Date"],"modules.227.updatedAt":["Date"],"modules.228.createdAt":["Date"],"modules.228.updatedAt":["Date"],"modules.229.createdAt":["Date"],"modules.229.updatedAt":["Date"],"modules.230.createdAt":["Date"],"modules.230.updatedAt":["Date"],"modules.231.createdAt":["Date"],"modules.231.updatedAt":["Date"],"modules.232.createdAt":["Date"],"modules.232.updatedAt":["Date"],"modules.233.createdAt":["Date"],"modules.233.updatedAt":["Date"],"modules.234.createdAt":["Date"],"modules.234.updatedAt":["Date"],"modules.235.createdAt":["Date"],"modules.235.updatedAt":["Date"],"modules.236.createdAt":["Date"],"modules.236.updatedAt":["Date"],"modules.237.createdAt":["Date"],"modules.237.updatedAt":["Date"],"modules.238.createdAt":["Date"],"modules.238.updatedAt":["Date"],"modules.239.createdAt":["Date"],"modules.239.updatedAt":["Date"],"modules.240.createdAt":["Date"],"modules.240.updatedAt":["Date"],"modules.241.createdAt":["Date"],"modules.241.updatedAt":["Date"],"modules.242.createdAt":["Date"],"modules.242.updatedAt":["Date"],"modules.243.createdAt":["Date"],"modules.243.updatedAt":["Date"],"modules.244.createdAt":["Date"],"modules.244.updatedAt":["Date"],"modules.245.createdAt":["Date"],"modules.245.updatedAt":["Date"],"modules.246.createdAt":["Date"],"modules.246.updatedAt":["Date"],"modules.247.createdAt":["Date"],"modules.247.updatedAt":["Date"],"modules.248.createdAt":["Date"],"modules.248.updatedAt":["Date"],"modules.249.createdAt":["Date"],"modules.249.updatedAt":["Date"],"modules.250.createdAt":["Date"],"modules.250.updatedAt":["Date"],"modules.251.createdAt":["Date"],"modules.251.updatedAt":["Date"],"modules.252.createdAt":["Date"],"modules.252.updatedAt":["Date"],"modules.253.createdAt":["Date"],"modules.253.updatedAt":["Date"],"modules.254.createdAt":["Date"],"modules.254.updatedAt":["Date"],"modules.255.createdAt":["Date"],"modules.255.updatedAt":["Date"],"modules.256.createdAt":["Date"],"modules.256.updatedAt":["Date"],"modules.257.createdAt":["Date"],"modules.257.updatedAt":["Date"],"modules.258.createdAt":["Date"],"modules.258.updatedAt":["Date"],"modules.259.createdAt":["Date"],"modules.259.updatedAt":["Date"],"modules.260.createdAt":["Date"],"modules.260.updatedAt":["Date"],"modules.261.createdAt":["Date"],"modules.261.updatedAt":["Date"],"modules.262.createdAt":["Date"],"modules.262.updatedAt":["Date"],"modules.263.createdAt":["Date"],"modules.263.updatedAt":["Date"],"modules.264.createdAt":["Date"],"modules.264.updatedAt":["Date"],"modules.265.createdAt":["Date"],"modules.265.updatedAt":["Date"],"modules.266.createdAt":["Date"],"modules.266.updatedAt":["Date"],"modules.267.createdAt":["Date"],"modules.267.updatedAt":["Date"],"modules.268.createdAt":["Date"],"modules.268.updatedAt":["Date"],"modules.269.createdAt":["Date"],"modules.269.updatedAt":["Date"],"modules.270.createdAt":["Date"],"modules.270.updatedAt":["Date"],"modules.271.createdAt":["Date"],"modules.271.updatedAt":["Date"],"modules.272.createdAt":["Date"],"modules.272.updatedAt":["Date"],"modules.273.createdAt":["Date"],"modules.273.updatedAt":["Date"],"modules.274.createdAt":["Date"],"modules.274.updatedAt":["Date"],"modules.275.createdAt":["Date"],"modules.275.updatedAt":["Date"],"modules.276.createdAt":["Date"],"modules.276.updatedAt":["Date"],"modules.277.createdAt":["Date"],"modules.277.updatedAt":["Date"],"modules.278.createdAt":["Date"],"modules.278.updatedAt":["Date"],"modules.279.createdAt":["Date"],"modules.279.updatedAt":["Date"],"modules.280.createdAt":["Date"],"modules.280.updatedAt":["Date"],"modules.281.createdAt":["Date"],"modules.281.updatedAt":["Date"],"modules.282.createdAt":["Date"],"modules.282.updatedAt":["Date"],"modules.283.createdAt":["Date"],"modules.283.updatedAt":["Date"],"modules.284.createdAt":["Date"],"modules.284.updatedAt":["Date"],"modules.285.createdAt":["Date"],"modules.285.updatedAt":["Date"],"modules.286.createdAt":["Date"],"modules.286.updatedAt":["Date"],"modules.287.createdAt":["Date"],"modules.287.updatedAt":["Date"],"modules.288.createdAt":["Date"],"modules.288.updatedAt":["Date"],"modules.289.createdAt":["Date"],"modules.289.updatedAt":["Date"],"modules.290.createdAt":["Date"],"modules.290.updatedAt":["Date"],"modules.291.createdAt":["Date"],"modules.291.updatedAt":["Date"],"modules.292.createdAt":["Date"],"modules.292.updatedAt":["Date"],"modules.293.createdAt":["Date"],"modules.293.updatedAt":["Date"],"modules.294.createdAt":["Date"],"modules.294.updatedAt":["Date"],"modules.295.createdAt":["Date"],"modules.295.updatedAt":["Date"],"modules.296.createdAt":["Date"],"modules.296.updatedAt":["Date"],"modules.297.createdAt":["Date"],"modules.297.updatedAt":["Date"],"modules.298.createdAt":["Date"],"modules.298.updatedAt":["Date"],"modules.299.createdAt":["Date"],"modules.299.updatedAt":["Date"],"modules.300.createdAt":["Date"],"modules.300.updatedAt":["Date"],"modules.301.createdAt":["Date"],"modules.301.updatedAt":["Date"],"modules.302.createdAt":["Date"],"modules.302.updatedAt":["Date"],"modules.303.createdAt":["Date"],"modules.303.updatedAt":["Date"],"modules.304.createdAt":["Date"],"modules.304.updatedAt":["Date"],"modules.305.createdAt":["Date"],"modules.305.updatedAt":["Date"],"modules.306.createdAt":["Date"],"modules.306.updatedAt":["Date"],"modules.307.createdAt":["Date"],"modules.307.updatedAt":["Date"],"modules.308.createdAt":["Date"],"modules.308.updatedAt":["Date"],"modules.309.createdAt":["Date"],"modules.309.updatedAt":["Date"],"modules.310.createdAt":["Date"],"modules.310.updatedAt":["Date"],"modules.311.createdAt":["Date"],"modules.311.updatedAt":["Date"],"modules.312.createdAt":["Date"],"modules.312.updatedAt":["Date"],"modules.313.createdAt":["Date"],"modules.313.updatedAt":["Date"],"modules.314.createdAt":["Date"],"modules.314.updatedAt":["Date"],"modules.315.createdAt":["Date"],"modules.315.updatedAt":["Date"],"modules.316.createdAt":["Date"],"modules.316.updatedAt":["Date"],"modules.317.createdAt":["Date"],"modules.317.updatedAt":["Date"],"modules.318.createdAt":["Date"],"modules.318.updatedAt":["Date"],"modules.319.createdAt":["Date"],"modules.319.updatedAt":["Date"],"modules.320.createdAt":["Date"],"modules.320.updatedAt":["Date"],"modules.321.createdAt":["Date"],"modules.321.updatedAt":["Date"],"modules.322.createdAt":["Date"],"modules.322.updatedAt":["Date"],"modules.323.createdAt":["Date"],"modules.323.updatedAt":["Date"],"modules.324.createdAt":["Date"],"modules.324.updatedAt":["Date"],"modules.325.createdAt":["Date"],"modules.325.updatedAt":["Date"],"modules.326.createdAt":["Date"],"modules.326.updatedAt":["Date"],"modules.327.createdAt":["Date"],"modules.327.updatedAt":["Date"],"modules.328.createdAt":["Date"],"modules.328.updatedAt":["Date"],"modules.329.createdAt":["Date"],"modules.329.updatedAt":["Date"],"modules.330.createdAt":["Date"],"modules.330.updatedAt":["Date"],"modules.331.createdAt":["Date"],"modules.331.updatedAt":["Date"],"modules.332.createdAt":["Date"],"modules.332.updatedAt":["Date"],"modules.333.createdAt":["Date"],"modules.333.updatedAt":["Date"],"modules.334.createdAt":["Date"],"modules.334.updatedAt":["Date"],"modules.335.createdAt":["Date"],"modules.335.updatedAt":["Date"],"modules.336.createdAt":["Date"],"modules.336.updatedAt":["Date"],"modules.337.createdAt":["Date"],"modules.337.updatedAt":["Date"],"modules.338.createdAt":["Date"],"modules.338.updatedAt":["Date"],"modules.339.createdAt":["Date"],"modules.339.updatedAt":["Date"],"modules.340.createdAt":["Date"],"modules.340.updatedAt":["Date"],"modules.341.createdAt":["Date"],"modules.341.updatedAt":["Date"],"modules.342.createdAt":["Date"],"modules.342.updatedAt":["Date"],"modules.343.createdAt":["Date"],"modules.343.updatedAt":["Date"],"modules.344.createdAt":["Date"],"modules.344.updatedAt":["Date"],"modules.345.createdAt":["Date"],"modules.345.updatedAt":["Date"],"modules.346.createdAt":["Date"],"modules.346.updatedAt":["Date"],"modules.347.createdAt":["Date"],"modules.347.updatedAt":["Date"],"modules.348.createdAt":["Date"],"modules.348.updatedAt":["Date"],"modules.349.createdAt":["Date"],"modules.349.updatedAt":["Date"],"modules.350.createdAt":["Date"],"modules.350.updatedAt":["Date"],"modules.351.createdAt":["Date"],"modules.351.updatedAt":["Date"],"modules.352.createdAt":["Date"],"modules.352.updatedAt":["Date"],"modules.353.createdAt":["Date"],"modules.353.updatedAt":["Date"],"modules.354.createdAt":["Date"],"modules.354.updatedAt":["Date"],"modules.355.createdAt":["Date"],"modules.355.updatedAt":["Date"],"modules.356.createdAt":["Date"],"modules.356.updatedAt":["Date"],"modules.357.createdAt":["Date"],"modules.357.updatedAt":["Date"],"modules.358.createdAt":["Date"],"modules.358.updatedAt":["Date"],"modules.359.createdAt":["Date"],"modules.359.updatedAt":["Date"],"modules.360.createdAt":["Date"],"modules.360.updatedAt":["Date"],"sections.0.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.0.createdAt","sections.0.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.0.updatedAt","sections.0.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.1.createdAt","sections.0.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.1.updatedAt","sections.0.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.2.createdAt","sections.0.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.2.updatedAt","sections.0.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.3.createdAt","sections.0.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.3.updatedAt","sections.0.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.4.createdAt","sections.0.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.4.updatedAt","sections.0.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.5.createdAt","sections.0.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.5.updatedAt","sections.0.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.6.createdAt","sections.0.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.6.updatedAt","sections.0.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.7.createdAt","sections.0.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.7.updatedAt","sections.1.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.8.createdAt","sections.1.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.8.updatedAt","sections.1.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.9.createdAt","sections.1.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.9.updatedAt","sections.1.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.10.createdAt","sections.1.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.10.updatedAt","sections.1.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.11.createdAt","sections.1.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.11.updatedAt","sections.1.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.12.createdAt","sections.1.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.12.updatedAt","sections.1.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.13.createdAt","sections.1.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.13.updatedAt","sections.1.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.14.createdAt","sections.1.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.14.updatedAt","sections.1.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.15.createdAt","sections.1.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.15.updatedAt","sections.1.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.16.createdAt","sections.1.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.16.updatedAt","sections.2.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.17.createdAt","sections.2.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.17.updatedAt","sections.2.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.18.createdAt","sections.2.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.18.updatedAt","sections.2.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.19.createdAt","sections.2.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.19.updatedAt","sections.2.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.20.createdAt","sections.2.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.20.updatedAt","sections.2.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.21.createdAt","sections.2.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.21.updatedAt","sections.2.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.22.createdAt","sections.2.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.22.updatedAt","sections.2.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.23.createdAt","sections.2.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.23.updatedAt","sections.2.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.24.createdAt","sections.2.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.24.updatedAt","sections.2.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.25.createdAt","sections.2.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.25.updatedAt","sections.3.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.26.createdAt","sections.3.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.26.updatedAt","sections.3.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.27.createdAt","sections.3.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.27.updatedAt","sections.3.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.28.createdAt","sections.3.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.28.updatedAt","sections.3.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.29.createdAt","sections.3.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.29.updatedAt","sections.3.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.30.createdAt","sections.3.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.30.updatedAt","sections.3.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.31.createdAt","sections.3.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.31.updatedAt","sections.3.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.32.createdAt","sections.3.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.32.updatedAt","sections.3.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.33.createdAt","sections.3.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.33.updatedAt","sections.3.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.34.createdAt","sections.3.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.34.updatedAt","sections.3.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.35.createdAt","sections.3.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.35.updatedAt","sections.3.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.36.createdAt","sections.3.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.36.updatedAt","sections.3.modules.11.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.37.createdAt","sections.3.modules.11.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.37.updatedAt","sections.3.modules.12.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.38.createdAt","sections.3.modules.12.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.38.updatedAt","sections.3.modules.13.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.39.createdAt","sections.3.modules.13.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.39.updatedAt","sections.4.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.40.createdAt","sections.4.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.40.updatedAt","sections.4.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.41.createdAt","sections.4.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.41.updatedAt","sections.4.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.42.createdAt","sections.4.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.42.updatedAt","sections.4.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.43.createdAt","sections.4.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.43.updatedAt","sections.4.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.44.createdAt","sections.4.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.44.updatedAt","sections.4.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.45.createdAt","sections.4.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.45.updatedAt","sections.4.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.46.createdAt","sections.4.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.46.updatedAt","sections.4.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.47.createdAt","sections.4.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.47.updatedAt","sections.4.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.48.createdAt","sections.4.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.48.updatedAt","sections.4.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.49.createdAt","sections.4.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.49.updatedAt","sections.4.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.50.createdAt","sections.4.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.50.updatedAt","sections.4.modules.11.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.51.createdAt","sections.4.modules.11.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.51.updatedAt","sections.4.modules.12.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.52.createdAt","sections.4.modules.12.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.52.updatedAt","sections.4.modules.13.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.53.createdAt","sections.4.modules.13.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.53.updatedAt","sections.4.modules.14.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.54.createdAt","sections.4.modules.14.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.54.updatedAt","sections.4.modules.15.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.55.createdAt","sections.4.modules.15.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.55.updatedAt","sections.5.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.56.createdAt","sections.5.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.56.updatedAt","sections.5.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.57.createdAt","sections.5.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.57.updatedAt","sections.5.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.58.createdAt","sections.5.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.58.updatedAt","sections.5.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.59.createdAt","sections.5.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.59.updatedAt","sections.5.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.60.createdAt","sections.5.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.60.updatedAt","sections.5.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.61.createdAt","sections.5.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.61.updatedAt","sections.5.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.62.createdAt","sections.5.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.62.updatedAt","sections.5.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.63.createdAt","sections.5.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.63.updatedAt","sections.5.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.64.createdAt","sections.5.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.64.updatedAt","sections.5.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.65.createdAt","sections.5.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.65.updatedAt","sections.5.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.66.createdAt","sections.5.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.66.updatedAt","sections.5.modules.11.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.67.createdAt","sections.5.modules.11.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.67.updatedAt","sections.5.modules.12.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.68.createdAt","sections.5.modules.12.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.68.updatedAt","sections.5.modules.13.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.69.createdAt","sections.5.modules.13.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.69.updatedAt","sections.5.modules.14.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.70.createdAt","sections.5.modules.14.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.70.updatedAt","sections.5.modules.15.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.71.createdAt","sections.5.modules.15.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.71.updatedAt","sections.6.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.72.createdAt","sections.6.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.72.updatedAt","sections.6.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.73.createdAt","sections.6.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.73.updatedAt","sections.6.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.74.createdAt","sections.6.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.74.updatedAt","sections.6.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.75.createdAt","sections.6.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.75.updatedAt","sections.6.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.76.createdAt","sections.6.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.76.updatedAt","sections.6.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.77.createdAt","sections.6.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.77.updatedAt","sections.6.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.78.createdAt","sections.6.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.78.updatedAt","sections.6.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.79.createdAt","sections.6.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.79.updatedAt","sections.6.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.80.createdAt","sections.6.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.80.updatedAt","sections.6.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.81.createdAt","sections.6.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.81.updatedAt","sections.6.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.82.createdAt","sections.6.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.82.updatedAt","sections.6.modules.11.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.83.createdAt","sections.6.modules.11.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.83.updatedAt","sections.6.modules.12.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.84.createdAt","sections.6.modules.12.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.84.updatedAt","sections.6.modules.13.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.85.createdAt","sections.6.modules.13.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.85.updatedAt","sections.7.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.86.createdAt","sections.7.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.86.updatedAt","sections.7.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.87.createdAt","sections.7.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.87.updatedAt","sections.7.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.88.createdAt","sections.7.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.88.updatedAt","sections.7.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.89.createdAt","sections.7.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.89.updatedAt","sections.7.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.90.createdAt","sections.7.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.90.updatedAt","sections.7.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.91.createdAt","sections.7.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.91.updatedAt","sections.7.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.92.createdAt","sections.7.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.92.updatedAt","sections.7.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.93.createdAt","sections.7.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.93.updatedAt","sections.7.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.94.createdAt","sections.7.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.94.updatedAt","sections.7.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.95.createdAt","sections.7.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.95.updatedAt","sections.8.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.96.createdAt","sections.8.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.96.updatedAt","sections.8.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.97.createdAt","sections.8.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.97.updatedAt","sections.8.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.98.createdAt","sections.8.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.98.updatedAt","sections.8.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.99.createdAt","sections.8.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.99.updatedAt","sections.8.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.100.createdAt","sections.8.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.100.updatedAt","sections.8.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.101.createdAt","sections.8.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.101.updatedAt","sections.8.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.102.createdAt","sections.8.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.102.updatedAt","sections.8.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.103.createdAt","sections.8.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.103.updatedAt","sections.8.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.104.createdAt","sections.8.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.104.updatedAt","sections.8.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.105.createdAt","sections.8.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.105.updatedAt","sections.8.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.106.createdAt","sections.8.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.106.updatedAt","sections.8.modules.11.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.107.createdAt","sections.8.modules.11.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.107.updatedAt","sections.8.modules.12.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.108.createdAt","sections.8.modules.12.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.108.updatedAt","sections.9.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.109.createdAt","sections.9.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.109.updatedAt","sections.9.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.110.createdAt","sections.9.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.110.updatedAt","sections.9.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.111.createdAt","sections.9.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.111.updatedAt","sections.9.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.112.createdAt","sections.9.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.112.updatedAt","sections.9.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.113.createdAt","sections.9.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.113.updatedAt","sections.9.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.114.createdAt","sections.9.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.114.updatedAt","sections.9.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.115.createdAt","sections.9.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.115.updatedAt","sections.9.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.116.createdAt","sections.9.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.116.updatedAt","sections.9.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.117.createdAt","sections.9.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.117.updatedAt","sections.9.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.118.createdAt","sections.9.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.118.updatedAt","sections.9.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.119.createdAt","sections.9.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.119.updatedAt","sections.9.modules.11.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.120.createdAt","sections.9.modules.11.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.120.updatedAt","sections.9.modules.12.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.121.createdAt","sections.9.modules.12.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.121.updatedAt","sections.10.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.122.createdAt","sections.10.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.122.updatedAt","sections.10.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.123.createdAt","sections.10.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.123.updatedAt","sections.10.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.124.createdAt","sections.10.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.124.updatedAt","sections.10.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.125.createdAt","sections.10.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.125.updatedAt","sections.10.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.126.createdAt","sections.10.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.126.updatedAt","sections.10.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.127.createdAt","sections.10.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.127.updatedAt","sections.11.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.128.createdAt","sections.11.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.128.updatedAt","sections.11.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.129.createdAt","sections.11.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.129.updatedAt","sections.11.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.130.createdAt","sections.11.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.130.updatedAt","sections.11.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.131.createdAt","sections.11.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.131.updatedAt","sections.11.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.132.createdAt","sections.11.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.132.updatedAt","sections.11.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.133.createdAt","sections.11.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.133.updatedAt","sections.11.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.134.createdAt","sections.11.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.134.updatedAt","sections.11.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.135.createdAt","sections.11.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.135.updatedAt","sections.12.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.136.createdAt","sections.12.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.136.updatedAt","sections.12.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.137.createdAt","sections.12.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.137.updatedAt","sections.12.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.138.createdAt","sections.12.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.138.updatedAt","sections.12.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.139.createdAt","sections.12.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.139.updatedAt","sections.12.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.140.createdAt","sections.12.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.140.updatedAt","sections.12.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.141.createdAt","sections.12.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.141.updatedAt","sections.12.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.142.createdAt","sections.12.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.142.updatedAt","sections.12.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.143.createdAt","sections.12.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.143.updatedAt","sections.12.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.144.createdAt","sections.12.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.144.updatedAt","sections.12.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.145.createdAt","sections.12.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.145.updatedAt","sections.12.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.146.createdAt","sections.12.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.146.updatedAt","sections.12.modules.11.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.147.createdAt","sections.12.modules.11.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.147.updatedAt","sections.12.modules.12.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.148.createdAt","sections.12.modules.12.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.148.updatedAt","sections.13.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.149.createdAt","sections.13.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.149.updatedAt","sections.13.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.150.createdAt","sections.13.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.150.updatedAt","sections.13.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.151.createdAt","sections.13.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.151.updatedAt","sections.13.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.152.createdAt","sections.13.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.152.updatedAt","sections.13.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.153.createdAt","sections.13.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.153.updatedAt","sections.13.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.154.createdAt","sections.13.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.154.updatedAt","sections.13.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.155.createdAt","sections.13.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.155.updatedAt","sections.13.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.156.createdAt","sections.13.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.156.updatedAt","sections.14.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.157.createdAt","sections.14.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.157.updatedAt","sections.14.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.158.createdAt","sections.14.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.158.updatedAt","sections.14.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.159.createdAt","sections.14.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.159.updatedAt","sections.14.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.160.createdAt","sections.14.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.160.updatedAt","sections.14.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.161.createdAt","sections.14.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.161.updatedAt","sections.14.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.162.createdAt","sections.14.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.162.updatedAt","sections.14.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.163.createdAt","sections.14.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.163.updatedAt","sections.14.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.164.createdAt","sections.14.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.164.updatedAt","sections.14.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.165.createdAt","sections.14.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.165.updatedAt","sections.14.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.166.createdAt","sections.14.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.166.updatedAt","sections.14.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.167.createdAt","sections.14.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.167.updatedAt","sections.14.modules.11.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.168.createdAt","sections.14.modules.11.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.168.updatedAt","sections.14.modules.12.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.169.createdAt","sections.14.modules.12.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.169.updatedAt","sections.15.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.170.createdAt","sections.15.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.170.updatedAt","sections.16.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.171.createdAt","sections.16.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.171.updatedAt","sections.16.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.172.createdAt","sections.16.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.172.updatedAt","sections.16.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.173.createdAt","sections.16.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.173.updatedAt","sections.16.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.174.createdAt","sections.16.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.174.updatedAt","sections.16.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.175.createdAt","sections.16.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.175.updatedAt","sections.16.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.176.createdAt","sections.16.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.176.updatedAt","sections.16.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.177.createdAt","sections.16.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.177.updatedAt","sections.16.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.178.createdAt","sections.16.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.178.updatedAt","sections.16.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.179.createdAt","sections.16.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.179.updatedAt","sections.16.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.180.createdAt","sections.16.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.180.updatedAt","sections.17.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.181.createdAt","sections.17.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.181.updatedAt","sections.17.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.182.createdAt","sections.17.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.182.updatedAt","sections.17.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.183.createdAt","sections.17.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.183.updatedAt","sections.17.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.184.createdAt","sections.17.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.184.updatedAt","sections.17.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.185.createdAt","sections.17.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.185.updatedAt","sections.17.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.186.createdAt","sections.17.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.186.updatedAt","sections.17.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.187.createdAt","sections.17.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.187.updatedAt","sections.17.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.188.createdAt","sections.17.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.188.updatedAt","sections.17.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.189.createdAt","sections.17.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.189.updatedAt","sections.17.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.190.createdAt","sections.17.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.190.updatedAt","sections.17.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.191.createdAt","sections.17.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.191.updatedAt","sections.17.modules.11.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.192.createdAt","sections.17.modules.11.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.192.updatedAt","sections.17.modules.12.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.193.createdAt","sections.17.modules.12.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.193.updatedAt","sections.18.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.194.createdAt","sections.18.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.194.updatedAt","sections.18.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.195.createdAt","sections.18.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.195.updatedAt","sections.18.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.196.createdAt","sections.18.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.196.updatedAt","sections.18.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.197.createdAt","sections.18.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.197.updatedAt","sections.18.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.198.createdAt","sections.18.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.198.updatedAt","sections.18.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.199.createdAt","sections.18.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.199.updatedAt","sections.18.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.200.createdAt","sections.18.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.200.updatedAt","sections.18.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.201.createdAt","sections.18.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.201.updatedAt","sections.18.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.202.createdAt","sections.18.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.202.updatedAt","sections.18.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.203.createdAt","sections.18.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.203.updatedAt","sections.18.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.204.createdAt","sections.18.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.204.updatedAt","sections.18.modules.11.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.205.createdAt","sections.18.modules.11.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.205.updatedAt","sections.18.modules.12.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.206.createdAt","sections.18.modules.12.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.206.updatedAt","sections.18.modules.13.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.207.createdAt","sections.18.modules.13.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.207.updatedAt","sections.19.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.208.createdAt","sections.19.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.208.updatedAt","sections.19.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.209.createdAt","sections.19.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.209.updatedAt","sections.19.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.210.createdAt","sections.19.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.210.updatedAt","sections.19.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.211.createdAt","sections.19.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.211.updatedAt","sections.19.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.212.createdAt","sections.19.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.212.updatedAt","sections.19.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.213.createdAt","sections.19.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.213.updatedAt","sections.19.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.214.createdAt","sections.19.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.214.updatedAt","sections.19.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.215.createdAt","sections.19.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.215.updatedAt","sections.19.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.216.createdAt","sections.19.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.216.updatedAt","sections.19.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.217.createdAt","sections.19.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.217.updatedAt","sections.19.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.218.createdAt","sections.19.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.218.updatedAt","sections.19.modules.11.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.219.createdAt","sections.19.modules.11.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.219.updatedAt","sections.19.modules.12.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.220.createdAt","sections.19.modules.12.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.220.updatedAt","sections.19.modules.13.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.221.createdAt","sections.19.modules.13.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.221.updatedAt","sections.20.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.222.createdAt","sections.20.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.222.updatedAt","sections.20.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.223.createdAt","sections.20.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.223.updatedAt","sections.20.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.224.createdAt","sections.20.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.224.updatedAt","sections.20.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.225.createdAt","sections.20.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.225.updatedAt","sections.20.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.226.createdAt","sections.20.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.226.updatedAt","sections.20.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.227.createdAt","sections.20.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.227.updatedAt","sections.20.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.228.createdAt","sections.20.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.228.updatedAt","sections.20.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.229.createdAt","sections.20.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.229.updatedAt","sections.20.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.230.createdAt","sections.20.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.230.updatedAt","sections.20.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.231.createdAt","sections.20.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.231.updatedAt","sections.20.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.232.createdAt","sections.20.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.232.updatedAt","sections.21.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.233.createdAt","sections.21.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.233.updatedAt","sections.21.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.234.createdAt","sections.21.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.234.updatedAt","sections.21.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.235.createdAt","sections.21.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.235.updatedAt","sections.21.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.236.createdAt","sections.21.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.236.updatedAt","sections.21.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.237.createdAt","sections.21.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.237.updatedAt","sections.21.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.238.createdAt","sections.21.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.238.updatedAt","sections.21.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.239.createdAt","sections.21.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.239.updatedAt","sections.21.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.240.createdAt","sections.21.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.240.updatedAt","sections.21.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.241.createdAt","sections.21.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.241.updatedAt","sections.21.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.242.createdAt","sections.21.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.242.updatedAt","sections.21.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.243.createdAt","sections.21.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.243.updatedAt","sections.21.modules.11.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.244.createdAt","sections.21.modules.11.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.244.updatedAt","sections.21.modules.12.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.245.createdAt","sections.21.modules.12.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.245.updatedAt","sections.21.modules.13.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.246.createdAt","sections.21.modules.13.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.246.updatedAt","sections.22.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.247.createdAt","sections.22.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.247.updatedAt","sections.22.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.248.createdAt","sections.22.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.248.updatedAt","sections.22.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.249.createdAt","sections.22.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.249.updatedAt","sections.22.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.250.createdAt","sections.22.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.250.updatedAt","sections.22.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.251.createdAt","sections.22.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.251.updatedAt","sections.22.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.252.createdAt","sections.22.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.252.updatedAt","sections.22.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.253.createdAt","sections.22.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.253.updatedAt","sections.22.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.254.createdAt","sections.22.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.254.updatedAt","sections.22.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.255.createdAt","sections.22.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.255.updatedAt","sections.22.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.256.createdAt","sections.22.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.256.updatedAt","sections.22.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.257.createdAt","sections.22.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.257.updatedAt","sections.22.modules.11.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.258.createdAt","sections.22.modules.11.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.258.updatedAt","sections.22.modules.12.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.259.createdAt","sections.22.modules.12.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.259.updatedAt","sections.22.modules.13.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.260.createdAt","sections.22.modules.13.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.260.updatedAt","sections.22.modules.14.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.261.createdAt","sections.22.modules.14.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.261.updatedAt","sections.22.modules.15.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.262.createdAt","sections.22.modules.15.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.262.updatedAt","sections.22.modules.16.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.263.createdAt","sections.22.modules.16.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.263.updatedAt","sections.22.modules.17.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.264.createdAt","sections.22.modules.17.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.264.updatedAt","sections.22.modules.18.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.265.createdAt","sections.22.modules.18.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.265.updatedAt","sections.23.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.266.createdAt","sections.23.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.266.updatedAt","sections.23.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.267.createdAt","sections.23.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.267.updatedAt","sections.23.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.268.createdAt","sections.23.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.268.updatedAt","sections.23.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.269.createdAt","sections.23.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.269.updatedAt","sections.23.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.270.createdAt","sections.23.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.270.updatedAt","sections.23.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.271.createdAt","sections.23.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.271.updatedAt","sections.23.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.272.createdAt","sections.23.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.272.updatedAt","sections.23.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.273.createdAt","sections.23.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.273.updatedAt","sections.23.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.274.createdAt","sections.23.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.274.updatedAt","sections.23.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.275.createdAt","sections.23.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.275.updatedAt","sections.23.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.276.createdAt","sections.23.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.276.updatedAt","sections.23.modules.11.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.277.createdAt","sections.23.modules.11.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.277.updatedAt","sections.23.modules.12.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.278.createdAt","sections.23.modules.12.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.278.updatedAt","sections.23.modules.13.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.279.createdAt","sections.23.modules.13.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.279.updatedAt","sections.23.modules.14.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.280.createdAt","sections.23.modules.14.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.280.updatedAt","sections.24.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.281.createdAt","sections.24.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.281.updatedAt","sections.24.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.282.createdAt","sections.24.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.282.updatedAt","sections.24.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.283.createdAt","sections.24.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.283.updatedAt","sections.24.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.284.createdAt","sections.24.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.284.updatedAt","sections.24.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.285.createdAt","sections.24.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.285.updatedAt","sections.24.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.286.createdAt","sections.24.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.286.updatedAt","sections.24.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.287.createdAt","sections.24.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.287.updatedAt","sections.24.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.288.createdAt","sections.24.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.288.updatedAt","sections.24.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.289.createdAt","sections.24.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.289.updatedAt","sections.24.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.290.createdAt","sections.24.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.290.updatedAt","sections.24.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.291.createdAt","sections.24.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.291.updatedAt","sections.24.modules.11.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.292.createdAt","sections.24.modules.11.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.292.updatedAt","sections.24.modules.12.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.293.createdAt","sections.24.modules.12.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.293.updatedAt","sections.24.modules.13.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.294.createdAt","sections.24.modules.13.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.294.updatedAt","sections.24.modules.14.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.295.createdAt","sections.24.modules.14.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.295.updatedAt","sections.24.modules.15.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.296.createdAt","sections.24.modules.15.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.296.updatedAt","sections.24.modules.16.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.297.createdAt","sections.24.modules.16.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.297.updatedAt","sections.24.modules.17.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.298.createdAt","sections.24.modules.17.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.298.updatedAt","sections.25.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.299.createdAt","sections.25.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.299.updatedAt","sections.25.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.300.createdAt","sections.25.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.300.updatedAt","sections.25.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.301.createdAt","sections.25.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.301.updatedAt","sections.25.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.302.createdAt","sections.25.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.302.updatedAt","sections.25.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.303.createdAt","sections.25.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.303.updatedAt","sections.25.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.304.createdAt","sections.25.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.304.updatedAt","sections.25.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.305.createdAt","sections.25.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.305.updatedAt","sections.25.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.306.createdAt","sections.25.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.306.updatedAt","sections.25.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.307.createdAt","sections.25.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.307.updatedAt","sections.25.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.308.createdAt","sections.25.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.308.updatedAt","sections.25.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.309.createdAt","sections.25.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.309.updatedAt","sections.26.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.310.createdAt","sections.26.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.310.updatedAt","sections.26.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.311.createdAt","sections.26.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.311.updatedAt","sections.26.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.312.createdAt","sections.26.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.312.updatedAt","sections.26.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.313.createdAt","sections.26.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.313.updatedAt","sections.26.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.314.createdAt","sections.26.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.314.updatedAt","sections.26.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.315.createdAt","sections.26.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.315.updatedAt","sections.26.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.316.createdAt","sections.26.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.316.updatedAt","sections.26.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.317.createdAt","sections.26.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.317.updatedAt","sections.26.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.318.createdAt","sections.26.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.318.updatedAt","sections.26.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.319.createdAt","sections.26.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.319.updatedAt","sections.26.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.320.createdAt","sections.26.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.320.updatedAt","sections.27.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.321.createdAt","sections.27.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.321.updatedAt","sections.27.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.322.createdAt","sections.27.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.322.updatedAt","sections.27.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.323.createdAt","sections.27.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.323.updatedAt","sections.27.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.324.createdAt","sections.27.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.324.updatedAt","sections.27.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.325.createdAt","sections.27.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.325.updatedAt","sections.27.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.326.createdAt","sections.27.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.326.updatedAt","sections.27.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.327.createdAt","sections.27.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.327.updatedAt","sections.27.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.328.createdAt","sections.27.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.328.updatedAt","sections.27.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.329.createdAt","sections.27.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.329.updatedAt","sections.27.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.330.createdAt","sections.27.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.330.updatedAt","sections.27.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.331.createdAt","sections.27.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.331.updatedAt","sections.27.modules.11.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.332.createdAt","sections.27.modules.11.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.332.updatedAt","sections.27.modules.12.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.333.createdAt","sections.27.modules.12.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.333.updatedAt","sections.27.modules.13.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.334.createdAt","sections.27.modules.13.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.334.updatedAt","sections.28.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.335.createdAt","sections.28.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.335.updatedAt","sections.28.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.336.createdAt","sections.28.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.336.updatedAt","sections.28.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.337.createdAt","sections.28.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.337.updatedAt","sections.28.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.338.createdAt","sections.28.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.338.updatedAt","sections.28.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.339.createdAt","sections.28.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.339.updatedAt","sections.28.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.340.createdAt","sections.28.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.340.updatedAt","sections.28.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.341.createdAt","sections.28.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.341.updatedAt","sections.28.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.342.createdAt","sections.28.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.342.updatedAt","sections.28.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.343.createdAt","sections.28.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.343.updatedAt","sections.28.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.344.createdAt","sections.28.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.344.updatedAt","sections.28.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.345.createdAt","sections.28.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.345.updatedAt","sections.29.modules.0.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.346.createdAt","sections.29.modules.0.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.346.updatedAt","sections.29.modules.1.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.347.createdAt","sections.29.modules.1.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.347.updatedAt","sections.29.modules.2.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.348.createdAt","sections.29.modules.2.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.348.updatedAt","sections.29.modules.3.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.349.createdAt","sections.29.modules.3.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.349.updatedAt","sections.29.modules.4.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.350.createdAt","sections.29.modules.4.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.350.updatedAt","sections.29.modules.5.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.351.createdAt","sections.29.modules.5.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.351.updatedAt","sections.29.modules.6.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.352.createdAt","sections.29.modules.6.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.352.updatedAt","sections.29.modules.7.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.353.createdAt","sections.29.modules.7.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.353.updatedAt","sections.29.modules.8.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.354.createdAt","sections.29.modules.8.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.354.updatedAt","sections.29.modules.9.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.355.createdAt","sections.29.modules.9.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.355.updatedAt","sections.29.modules.10.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.356.createdAt","sections.29.modules.10.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.356.updatedAt","sections.29.modules.11.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.357.createdAt","sections.29.modules.11.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.357.updatedAt","sections.29.modules.12.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.358.createdAt","sections.29.modules.12.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.358.updatedAt","sections.29.modules.13.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.359.createdAt","sections.29.modules.13.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.359.updatedAt","sections.29.modules.14.createdAt":"$46:props:state:queries:0:state:data:meta:values:modules.360.createdAt","sections.29.modules.14.updatedAt":"$46:props:state:queries:0:state:data:meta:values:modules.360.updatedAt"},"referentialEqualities":{"modules.0":["sections.0.modules.0"],"modules.1":["sections.0.modules.1"],"modules.2":["sections.0.modules.2"],"modules.3":["sections.0.modules.3"],"modules.4":["sections.0.modules.4"],"modules.5":["sections.0.modules.5"],"modules.6":["sections.0.modules.6"],"modules.7":["sections.0.modules.7"],"modules.8":["sections.1.modules.0"],"modules.9":["sections.1.modules.1"],"modules.10":["sections.1.modules.2"],"modules.11":["sections.1.modules.3"],"modules.12":["sections.1.modules.4"],"modules.13":["sections.1.modules.5"],"modules.14":["sections.1.modules.6"],"modules.15":["sections.1.modules.7"],"modules.16":["sections.1.modules.8"],"modules.17":["sections.2.modules.0"],"modules.18":["sections.2.modules.1"],"modules.19":["sections.2.modules.2"],"modules.20":["sections.2.modules.3"],"modules.21":["sections.2.modules.4"],"modules.22":["sections.2.modules.5"],"modules.23":["sections.2.modules.6"],"modules.24":["sections.2.modules.7"],"modules.25":["sections.2.modules.8"],"modules.26":["sections.3.modules.0"],"modules.27":["sections.3.modules.1"],"modules.28":["sections.3.modules.2"],"modules.29":["sections.3.modules.3"],"modules.30":["sections.3.modules.4"],"modules.31":["sections.3.modules.5"],"modules.32":["sections.3.modules.6"],"modules.33":["sections.3.modules.7"],"modules.34":["sections.3.modules.8"],"modules.35":["sections.3.modules.9"],"modules.36":["sections.3.modules.10"],"modules.37":["sections.3.modules.11"],"modules.38":["sections.3.modules.12"],"modules.39":["sections.3.modules.13"],"modules.40":["sections.4.modules.0"],"modules.41":["sections.4.modules.1"],"modules.42":["sections.4.modules.2"],"modules.43":["sections.4.modules.3"],"modules.44":["sections.4.modules.4"],"modules.45":["sections.4.modules.5"],"modules.46":["sections.4.modules.6"],"modules.47":["sections.4.modules.7"],"modules.48":["sections.4.modules.8"],"modules.49":["sections.4.modules.9"],"modules.50":["sections.4.modules.10"],"modules.51":["sections.4.modules.11"],"modules.52":["sections.4.modules.12"],"modules.53":["sections.4.modules.13"],"modules.54":["sections.4.modules.14"],"modules.55":["sections.4.modules.15"],"modules.56":["sections.5.modules.0"],"modules.57":["sections.5.modules.1"],"modules.58":["sections.5.modules.2"],"modules.59":["sections.5.modules.3"],"modules.60":["sections.5.modules.4"],"modules.61":["sections.5.modules.5"],"modules.62":["sections.5.modules.6"],"modules.63":["sections.5.modules.7"],"modules.64":["sections.5.modules.8"],"modules.65":["sections.5.modules.9"],"modules.66":["sections.5.modules.10"],"modules.67":["sections.5.modules.11"],"modules.68":["sections.5.modules.12"],"modules.69":["sections.5.modules.13"],"modules.70":["sections.5.modules.14"],"modules.71":["sections.5.modules.15"],"modules.72":["sections.6.modules.0"],"modules.73":["sections.6.modules.1"],"modules.74":["sections.6.modules.2"],"modules.75":["sections.6.modules.3"],"modules.76":["sections.6.modules.4"],"modules.77":["sections.6.modules.5"],"modules.78":["sections.6.modules.6"],"modules.79":["sections.6.modules.7"],"modules.80":["sections.6.modules.8"],"modules.81":["sections.6.modules.9"],"modules.82":["sections.6.modules.10"],"modules.83":["sections.6.modules.11"],"modules.84":["sections.6.modules.12"],"modules.85":["sections.6.modules.13"],"modules.86":["sections.7.modules.0"],"modules.87":["sections.7.modules.1"],"modules.88":["sections.7.modules.2"],"modules.89":["sections.7.modules.3"],"modules.90":["sections.7.modules.4"],"modules.91":["sections.7.modules.5"],"modules.92":["sections.7.modules.6"],"modules.93":["sections.7.modules.7"],"modules.94":["sections.7.modules.8"],"modules.95":["sections.7.modules.9"],"modules.96":["sections.8.modules.0"],"modules.97":["sections.8.modules.1"],"modules.98":["sections.8.modules.2"],"modules.99":["sections.8.modules.3"],"modules.100":["sections.8.modules.4"],"modules.101":["sections.8.modules.5"],"modules.102":["sections.8.modules.6"],"modules.103":["sections.8.modules.7"],"modules.104":["sections.8.modules.8"],"modules.105":["sections.8.modules.9"],"modules.106":["sections.8.modules.10"],"modules.107":["sections.8.modules.11"],"modules.108":["sections.8.modules.12"],"modules.109":["sections.9.modules.0"],"modules.110":["sections.9.modules.1"],"modules.111":["sections.9.modules.2"],"modules.112":["sections.9.modules.3"],"modules.113":["sections.9.modules.4"],"modules.114":["sections.9.modules.5"],"modules.115":["sections.9.modules.6"],"modules.116":["sections.9.modules.7"],"modules.117":["sections.9.modules.8"],"modules.118":["sections.9.modules.9"],"modules.119":["sections.9.modules.10"],"modules.120":["sections.9.modules.11"],"modules.121":["sections.9.modules.12"],"modules.122":["sections.10.modules.0"],"modules.123":["sections.10.modules.1"],"modules.124":["sections.10.modules.2"],"modules.125":["sections.10.modules.3"],"modules.126":["sections.10.modules.4"],"modules.127":["sections.10.modules.5"],"modules.128":["sections.11.modules.0"],"modules.129":["sections.11.modules.1"],"modules.130":["sections.11.modules.2"],"modules.131":["sections.11.modules.3"],"modules.132":["sections.11.modules.4"],"modules.133":["sections.11.modules.5"],"modules.134":["sections.11.modules.6"],"modules.135":["sections.11.modules.7"],"modules.136":["sections.12.modules.0"],"modules.137":["sections.12.modules.1"],"modules.138":["sections.12.modules.2"],"modules.139":["sections.12.modules.3"],"modules.140":["sections.12.modules.4"],"modules.141":["sections.12.modules.5"],"modules.142":["sections.12.modules.6"],"modules.143":["sections.12.modules.7"],"modules.144":["sections.12.modules.8"],"modules.145":["sections.12.modules.9"],"modules.146":["sections.12.modules.10"],"modules.147":["sections.12.modules.11"],"modules.148":["sections.12.modules.12"],"modules.149":["sections.13.modules.0"],"modules.150":["sections.13.modules.1"],"modules.151":["sections.13.modules.2"],"modules.152":["sections.13.modules.3"],"modules.153":["sections.13.modules.4"],"modules.154":["sections.13.modules.5"],"modules.155":["sections.13.modules.6"],"modules.156":["sections.13.modules.7"],"modules.157":["sections.14.modules.0"],"modules.158":["sections.14.modules.1"],"modules.159":["sections.14.modules.2"],"modules.160":["sections.14.modules.3"],"modules.161":["sections.14.modules.4"],"modules.162":["sections.14.modules.5"],"modules.163":["sections.14.modules.6"],"modules.164":["sections.14.modules.7"],"modules.165":["sections.14.modules.8"],"modules.166":["sections.14.modules.9"],"modules.167":["sections.14.modules.10"],"modules.168":["sections.14.modules.11"],"modules.169":["sections.14.modules.12"],"modules.170":["sections.15.modules.0"],"modules.171":["sections.16.modules.0"],"modules.172":["sections.16.modules.1"],"modules.173":["sections.16.modules.2"],"modules.174":["sections.16.modules.3"],"modules.175":["sections.16.modules.4"],"modules.176":["sections.16.modules.5"],"modules.177":["sections.16.modules.6"],"modules.178":["sections.16.modules.7"],"modules.179":["sections.16.modules.8"],"modules.180":["sections.16.modules.9"],"modules.181":["sections.17.modules.0"],"modules.182":["sections.17.modules.1"],"modules.183":["sections.17.modules.2"],"modules.184":["sections.17.modules.3"],"modules.185":["sections.17.modules.4"],"modules.186":["sections.17.modules.5"],"modules.187":["sections.17.modules.6"],"modules.188":["sections.17.modules.7"],"modules.189":["sections.17.modules.8"],"modules.190":["sections.17.modules.9"],"modules.191":["sections.17.modules.10"],"modules.192":["sections.17.modules.11"],"modules.193":["sections.17.modules.12"],"modules.194":["sections.18.modules.0"],"modules.195":["sections.18.modules.1"],"modules.196":["sections.18.modules.2"],"modules.197":["sections.18.modules.3"],"modules.198":["sections.18.modules.4"],"modules.199":["sections.18.modules.5"],"modules.200":["sections.18.modules.6"],"modules.201":["sections.18.modules.7"],"modules.202":["sections.18.modules.8"],"modules.203":["sections.18.modules.9"],"modules.204":["sections.18.modules.10"],"modules.205":["sections.18.modules.11"],"modules.206":["sections.18.modules.12"],"modules.207":["sections.18.modules.13"],"modules.208":["sections.19.modules.0"],"modules.209":["sections.19.modules.1"],"modules.210":["sections.19.modules.2"],"modules.211":["sections.19.modules.3"],"modules.212":["sections.19.modules.4"],"modules.213":["sections.19.modules.5"],"modules.214":["sections.19.modules.6"],"modules.215":["sections.19.modules.7"],"modules.216":["sections.19.modules.8"],"modules.217":["sections.19.modules.9"],"modules.218":["sections.19.modules.10"],"modules.219":["sections.19.modules.11"],"modules.220":["sections.19.modules.12"],"modules.221":["sections.19.modules.13"],"modules.222":["sections.20.modules.0"],"modules.223":["sections.20.modules.1"],"modules.224":["sections.20.modules.2"],"modules.225":["sections.20.modules.3"],"modules.226":["sections.20.modules.4"],"modules.227":["sections.20.modules.5"],"modules.228":["sections.20.modules.6"],"modules.229":["sections.20.modules.7"],"modules.230":["sections.20.modules.8"],"modules.231":["sections.20.modules.9"],"modules.232":["sections.20.modules.10"],"modules.233":["sections.21.modules.0"],"modules.234":["sections.21.modules.1"],"modules.235":["sections.21.modules.2"],"modules.236":["sections.21.modules.3"],"modules.237":["sections.21.modules.4"],"modules.238":["sections.21.modules.5"],"modules.239":["sections.21.modules.6"],"modules.240":["sections.21.modules.7"],"modules.241":["sections.21.modules.8"],"modules.242":["sections.21.modules.9"],"modules.243":["sections.21.modules.10"],"modules.244":["sections.21.modules.11"],"modules.245":["sections.21.modules.12"],"modules.246":["sections.21.modules.13"],"modules.247":["sections.22.modules.0"],"modules.248":["sections.22.modules.1"],"modules.249":["sections.22.modules.2"],"modules.250":["sections.22.modules.3"],"modules.251":["sections.22.modules.4"],"modules.252":["sections.22.modules.5"],"modules.253":["sections.22.modules.6"],"modules.254":["sections.22.modules.7"],"modules.255":["sections.22.modules.8"],"modules.256":["sections.22.modules.9"],"modules.257":["sections.22.modules.10"],"modules.258":["sections.22.modules.11"],"modules.259":["sections.22.modules.12"],"modules.260":["sections.22.modules.13"],"modules.261":["sections.22.modules.14"],"modules.262":["sections.22.modules.15"],"modules.263":["sections.22.modules.16"],"modules.264":["sections.22.modules.17"],"modules.265":["sections.22.modules.18"],"modules.266":["sections.23.modules.0"],"modules.267":["sections.23.modules.1"],"modules.268":["sections.23.modules.2"],"modules.269":["sections.23.modules.3"],"modules.270":["sections.23.modules.4"],"modules.271":["sections.23.modules.5"],"modules.272":["sections.23.modules.6"],"modules.273":["sections.23.modules.7"],"modules.274":["sections.23.modules.8"],"modules.275":["sections.23.modules.9"],"modules.276":["sections.23.modules.10"],"modules.277":["sections.23.modules.11"],"modules.278":["sections.23.modules.12"],"modules.279":["sections.23.modules.13"],"modules.280":["sections.23.modules.14"],"modules.281":["sections.24.modules.0"],"modules.282":["sections.24.modules.1"],"modules.283":["sections.24.modules.2"],"modules.284":["sections.24.modules.3"],"modules.285":["sections.24.modules.4"],"modules.286":["sections.24.modules.5"],"modules.287":["sections.24.modules.6"],"modules.288":["sections.24.modules.7"],"modules.289":["sections.24.modules.8"],"modules.290":["sections.24.modules.9"],"modules.291":["sections.24.modules.10"],"modules.292":["sections.24.modules.11"],"modules.293":["sections.24.modules.12"],"modules.294":["sections.24.modules.13"],"modules.295":["sections.24.modules.14"],"modules.296":["sections.24.modules.15"],"modules.297":["sections.24.modules.16"],"modules.298":["sections.24.modules.17"],"modules.299":["sections.25.modules.0"],"modules.300":["sections.25.modules.1"],"modules.301":["sections.25.modules.2"],"modules.302":["sections.25.modules.3"],"modules.303":["sections.25.modules.4"],"modules.304":["sections.25.modules.5"],"modules.305":["sections.25.modules.6"],"modules.306":["sections.25.modules.7"],"modules.307":["sections.25.modules.8"],"modules.308":["sections.25.modules.9"],"modules.309":["sections.25.modules.10"],"modules.310":["sections.26.modules.0"],"modules.311":["sections.26.modules.1"],"modules.312":["sections.26.modules.2"],"modules.313":["sections.26.modules.3"],"modules.314":["sections.26.modules.4"],"modules.315":["sections.26.modules.5"],"modules.316":["sections.26.modules.6"],"modules.317":["sections.26.modules.7"],"modules.318":["sections.26.modules.8"],"modules.319":["sections.26.modules.9"],"modules.320":["sections.26.modules.10"],"modules.321":["sections.27.modules.0"],"modules.322":["sections.27.modules.1"],"modules.323":["sections.27.modules.2"],"modules.324":["sections.27.modules.3"],"modules.325":["sections.27.modules.4"],"modules.326":["sections.27.modules.5"],"modules.327":["sections.27.modules.6"],"modules.328":["sections.27.modules.7"],"modules.329":["sections.27.modules.8"],"modules.330":["sections.27.modules.9"],"modules.331":["sections.27.modules.10"],"modules.332":["sections.27.modules.11"],"modules.333":["sections.27.modules.12"],"modules.334":["sections.27.modules.13"],"modules.335":["sections.28.modules.0"],"modules.336":["sections.28.modules.1"],"modules.337":["sections.28.modules.2"],"modules.338":["sections.28.modules.3"],"modules.339":["sections.28.modules.4"],"modules.340":["sections.28.modules.5"],"modules.341":["sections.28.modules.6"],"modules.342":["sections.28.modules.7"],"modules.343":["sections.28.modules.8"],"modules.344":["sections.28.modules.9"],"modules.345":["sections.28.modules.10"],"modules.346":["sections.29.modules.0"],"modules.347":["sections.29.modules.1"],"modules.348":["sections.29.modules.2"],"modules.349":["sections.29.modules.3"],"modules.350":["sections.29.modules.4"],"modules.351":["sections.29.modules.5"],"modules.352":["sections.29.modules.6"],"modules.353":["sections.29.modules.7"],"modules.354":["sections.29.modules.8"],"modules.355":["sections.29.modules.9"],"modules.356":["sections.29.modules.10"],"modules.357":["sections.29.modules.11"],"modules.358":["sections.29.modules.12"],"modules.359":["sections.29.modules.13"],"modules.360":["sections.29.modules.14"]},"v":1}},"dataUpdateCount":1,"dataUpdatedAt":1792315781037,"error":null,"errorUpdateCount":0,"errorUpdatedAt":0,"fetchFailureCount":0,"fetchFailureReason":null,"fetchMeta":null,"isInvalidated":false,"status":"success","fetchStatus":"idle"},"queryKey":[["learningPaths","getBySlug"],{"input":{"slug":"data-structures-algorithms"},"type":"query"}],"queryHash":"[[\"learningPaths\",\"getBySlug\"],{\"input\":{\"slug\":\"data-structures-algorithms\"},\"type\":\"query\"}]"},{"dehydratedAt":1792315781643,"state":{"data":{"json":{"path":{"archivedAt":null,"id":"seed_a45eefd7ace053183db2aca078e8dfbc","slug":"data-structures-algorithms","title":"Data Structures & Algorithms","description":"Build strong algorithmic foundations, trace algorithms visually, solve progressive DSA problems, and apply invariants in real repository and code-review exercises.","image":null,"color":"#10B981","keyTopics":["Arrays & Strings","Linked Lists","Trees & Graphs","Sorting & Searching","Dynamic Programming","Recursion & Backtracking","Bit Manipulation","Advanced Data Structures"],"estimatedHours":231.7,"problemCount":67,"visualizerCount":15,"quizCount":0,"learningCount":279,"difficulty":"BEGINNER","idealFor":["Students preparing for coding interviews","Developers building strong CS fundamentals","Competitive programming aspirants","Anyone wanting to master problem-solving"],"prerequisites":["Basic programming in any language","Understanding of variables, loops, and functions","Basic math and logical reasoning"],"skillsGained":["Algorithmic problem-solving","Data structure selection","Complexity analysis","Pattern-based thinking","Optimization techniques","Interview readiness"],"outcomes":["Build strong DSA fundamentals","Apply advanced algorithmic techniques","Write efficient and maintainable solutions","Prepare for technical interviews","Gain confidence in competitive coding"],"overview":"This complete DSA learning path covers core and advanced concepts in a structured chapter-wise flow.\n\n**What you'll learn:**\n• Algorithmic thinking and complexity\n• Core linear and non-linear data structures\n• Searching and sorting strategies\n• Recursion, divide-and-conquer, and greedy design\n• Dynamic programming and graph algorithms\n• Bit manipulation and advanced structures","createdAt":"2026-10-15T17:47:45.111Z","updatedAt":"2026-10-17T16:28:34.019Z","modules":[{"id":"seed_ec47a4bb5266da55f622094ae1965719","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 1: Algorithmic Thinking","sectionOrder":1,"title":"Why Data Structures and Algorithms Matter","order":1,"contentType":"LEARNING","contentSlug":"why-dsa-matters","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_1c0a1da8142a2a569f6a7ac4012cddef","title":"Why Study Data Structures and Algorithms at All","order":0},{"id":"seed_ace6f082e9ddd2f4582bd5a3a7f5d107","title":"DSA in the Real World","order":1},{"id":"seed_23d334634a7469332e218ebda96ed0d8","title":"DSA for Interviews","order":2},{"id":"seed_80cf79d276575bb31b0d879a04db6d76","title":"Bridging the Gap: Interviews and Real Engineering","order":3}]},{"id":"seed_bc7b30a01cbf1e3e4f9092cd27e03529","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 1: Algorithmic Thinking","sectionOrder":1,"title":"Computational Thinking & Problem-Solving","order":2,"contentType":"LEARNING","contentSlug":"computational-thinking","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_4cc5e1467abb1cbf93928e8ced7a9820","title":"What is Computational Thinking","order":0},{"id":"seed_c2e9e2b8cfcab6c19170a4299587df40","title":"Breaking Problems into Steps, Patterns, and Abstractions","order":1},{"id":"seed_d8990df511292f5ee28df7f0298f6ff4","title":"Thinking in Terms of Inputs, Outputs, Constraints, and Trade-offs","order":2},{"id":"seed_4031c59a91e438a8cb5bec47b4c1be0b","title":"Translating Real-World Problems into Solvable Computational Models","order":3}]},{"id":"seed_d472e8c0da31753f90e19b7e562f0175","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 1: Algorithmic Thinking","sectionOrder":1,"title":"Algorithms — Core Concepts","order":3,"contentType":"LEARNING","contentSlug":"algorithms-core-concepts","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_47c5cdb68b75596183e572c9d9bd2786","title":"What is an Algorithm","order":0},{"id":"seed_122c677dfb7609deac1b987feb10aceb","title":"Characteristics of a Good Algorithm","order":1},{"id":"seed_2573a1f4d7a88d35be854b3dafeaf677","title":"Deterministic vs Non-Deterministic Intuition","order":2},{"id":"seed_8b8084109d84fe9e7c512b211e06ebc9","title":"Algorithm vs Program — The Conceptual Difference","order":3}]},{"id":"seed_9d97f837d8ea7f1d93a5d97e385f5bed","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 1: Algorithmic Thinking","sectionOrder":1,"title":"Measuring Algorithm Efficiency","order":4,"contentType":"LEARNING","contentSlug":"measuring-algorithm-efficiency","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_fa01e0d19f2e10a9818515a51abf7bb5","title":"Why We Analyze Algorithms Instead of Just Running Them","order":0},{"id":"seed_7a00d97c48422ce959097e36dbb19647","title":"Time Complexity vs Space Complexity — High-Level Intuition","order":1},{"id":"seed_0f992be09d297035b0340bb5ce1174cb","title":"Growth Rates and Why Constants Eventually Don't Matter","order":2}]},{"id":"seed_0c2dbc69fc841f5d4df7bfb2f7c0eda4","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 1: Algorithmic Thinking","sectionOrder":1,"title":"Asymptotic Notation — Formalizing Algorithm Efficiency","order":5,"contentType":"LEARNING","contentSlug":"asymptotic-notation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_d9cf03c4ba26556611c48afd3d8613a0","title":"Big-O Notation — The Upper Bound","order":0},{"id":"seed_fd7a3639c7c66cb3f91c273195acd4d9","title":"Big-Theta and Big-Omega Notation — Tight and Lower Bounds","order":1},{"id":"seed_f48e189329e0e34301fd9cdb62cf35c8","title":"Common Complexity Classes — The Landscape of Efficiency","order":2},{"id":"seed_84b32b97ca2e246d21d0510fae6d9dab","title":"Visual Intuition and Real-World Context","order":3}]},{"id":"seed_f87754143842e84cde091ec02d2554d3","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 1: Algorithmic Thinking","sectionOrder":1,"title":"Case Analysis & Cost Models","order":6,"contentType":"LEARNING","contentSlug":"case-analysis","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_4642e0bbd562aab55d95ecbe6051612a","title":"Best-Case, Average-Case, and Worst-Case Analysis","order":0},{"id":"seed_fe756227080bbfbe17e729dd680bfe89","title":"Why Worst-Case Analysis Dominates Engineering","order":1},{"id":"seed_e4b9243093d7bd1259a50ee55958a049","title":"Introduction to Amortized Analysis","order":2},{"id":"seed_043f815e339e0df08454605914919343","title":"Real-World Amortized Analysis Examples","order":3}]},{"id":"seed_be33845e3deee5c135dae1b7baed6691","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 1: Algorithmic Thinking","sectionOrder":1,"title":"Problem Constraints & Algorithmic Trade-offs","order":7,"contentType":"LEARNING","contentSlug":"problem-constraints-tradeoffs","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_99c41dda40a44c114d060e4282291824","title":"Understanding Problem Constraints — Input Size, Time Limits, Memory Limits","order":0},{"id":"seed_2e4ee2099e534d22317a43c31d577c02","title":"How Constraints Guide Algorithm Selection","order":1},{"id":"seed_4e5ac667f0f5a42141ac951381a50c2b","title":"Time vs Space Trade-offs — Conceptual Foundations","order":2},{"id":"seed_542d87baa493d635c6f4845bab9fb02a","title":"When a Slower Algorithm Is Actually the Right Choice","order":3},{"id":"seed_667c0a2b23651f7e8fb362d4936df7b5","title":"Reading a Problem Statement Like an Engineer","order":4}]},{"id":"seed_74dcdca395126fa1e82a858c9b7cab06","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 1: Algorithmic Thinking","sectionOrder":1,"title":"Expressing Algorithms Clearly","order":8,"contentType":"LEARNING","contentSlug":"expressing-algorithms-clearly","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_0d0eae1ac9d6f4ab14d8724fa7d84d2f","title":"What is Pseudocode and Why We Use It","order":0},{"id":"seed_c399dfb89a5168dd011807e231bdbcef","title":"Writing Language-Agnostic Algorithms","order":1},{"id":"seed_3381353f355ff2b9917d682921d5d341","title":"Dry Running an Algorithm Step by Step","order":2},{"id":"seed_0dd403aa8e73e4070e1d5c0b70775d63","title":"Tracing Time and Space During a Dry Run","order":3},{"id":"seed_95e4615c5caa8a8b53a29a09c15c34fb","title":"Communicating Algorithm Logic Before Implementation","order":4}]},{"id":"seed_305b71a8f038fa683d75ff59ef6be233","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 2: Data Structures Foundations","sectionOrder":2,"title":"What Is a Data Structure?","order":1,"contentType":"LEARNING","contentSlug":"what-is-data-structure","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_bf7f3fbe21b5aef82d44a9a2b9c559b8","title":"Definition of a Data Structure — First Principles","order":0},{"id":"seed_0865aa5e59c62898bccc34fa6a4fc84d","title":"Data vs Data Structure vs Algorithm — The Conceptual Trinity","order":1},{"id":"seed_e1ab40eb22b7c38f4df764686d197ef6","title":"Why Data Structures Exist — Organizing Data for Efficient Operations","order":2},{"id":"seed_3ef16ca7dd16279f0f8713f940dbdc06","title":"Relationship Between Data Structures and Algorithms","order":3}]},{"id":"seed_90613c04c3ee2f691d93359544c55f2d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 2: Data Structures Foundations","sectionOrder":2,"title":"Why We Need Different Data Structures","order":2,"contentType":"LEARNING","contentSlug":"why-different-data-structures","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_b3d24b6f5a5eeb3e8eaa340507fd324a","title":"The Fundamental Question — Why Can't One Data Structure Do Everything?","order":0},{"id":"seed_52ad463e249cd5a86b84055fa9267466","title":"Understanding Data Operations — The Building Blocks of Analysis","order":1},{"id":"seed_a52197b3d397c8cae28c8ff251d75f19","title":"How Operation Costs Change with Structure Choice","order":2},{"id":"seed_fabfdb401998f88824eb49b9fc0c77b2","title":"One Problem, Multiple Data Structure Choices","order":3}]},{"id":"seed_e66901148bc09c635f5ec45e7accc266","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 2: Data Structures Foundations","sectionOrder":2,"title":"Classification of Data Structures (High-Level View)","order":3,"contentType":"LEARNING","contentSlug":"data-structure-classification","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_5f859f92be36e87545f82d7cb9d63620","title":"The Big Picture — Why Classification Matters","order":0},{"id":"seed_b3cb2e6ddea9eb2c241acacbb56e93be","title":"Primitive vs Non-Primitive Data Structures","order":1},{"id":"seed_9af557c2c91d7a52e98e8785e7fdb6ed","title":"Linear vs Non-Linear Data Structures","order":2},{"id":"seed_8ea9e8e51db60e51ef678a49bd964fd0","title":"Static vs Dynamic and Homogeneous vs Heterogeneous","order":3}]},{"id":"seed_9afca0fcfcb96f13b2a5221c73b51d67","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 2: Data Structures Foundations","sectionOrder":2,"title":"Primitive Data Structures — Conceptual Overview","order":4,"contentType":"LEARNING","contentSlug":"primitive-data-structures","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_d08dfb9265b6c7210d3edfa8a6fcf147","title":"What Are Primitive Data Structures","order":0},{"id":"seed_680c2db0b4041e0fa541fb64cc599be0","title":"Basic Characteristics: Simplicity, Fixed Size, Direct Value Storage","order":1},{"id":"seed_febd046bfa125cc48cb67de7aeca1daf","title":"Examples: Integers, Floating-Point Numbers, Characters, Booleans","order":2},{"id":"seed_52bed1ca7808da6a6b49eafd79084cd4","title":"Limitations of Primitives for Complex Problems","order":3}]},{"id":"seed_b7fff935e12745c9528c3027c69255a4","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 2: Data Structures Foundations","sectionOrder":2,"title":"Non-Primitive Data Structures (Conceptual Overview)","order":5,"contentType":"LEARNING","contentSlug":"non-primitive-data-structures","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_15c498e0afab1f13b3a355345b1804ed","title":"What Makes a Data Structure Non-Primitive","order":0},{"id":"seed_1de1462ecba3e17e8ae2ecba1bb75c88","title":"Logical Grouping and Relationships Between Data","order":1},{"id":"seed_8558ba18e186e2f7b89a8f514cf1a5df","title":"Why Abstraction Becomes Necessary","order":2},{"id":"seed_bd44f8f6c956a1340181ba1983cab1fe","title":"Examples: Arrays, Strings, Linked Lists, Stacks, Queues, Trees, Graphs","order":3}]},{"id":"seed_5677d865a9e711a5687475f94d8e0550","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 2: Data Structures Foundations","sectionOrder":2,"title":"Linear Data Structures","order":6,"contentType":"LEARNING","contentSlug":"linear-data-structures","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_8546efbbe89815b473e525ed50764c4b","title":"Definition of Linear Data Structures","order":0},{"id":"seed_637368ecd3eb9e37b553476680b99663","title":"Sequential Organization of Elements","order":1},{"id":"seed_4897aa89366daa19a2185132f69b9ba9","title":"One-to-One Relationships","order":2},{"id":"seed_a43df478847decf74e0594a018527266","title":"Examples and Intuition: Arrays, Linked Lists, Stacks, Queues","order":3}]},{"id":"seed_b61de70f398ecffce2e32da0979a9fd6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 2: Data Structures Foundations","sectionOrder":2,"title":"Non-Linear Data Structures","order":7,"contentType":"LEARNING","contentSlug":"non-linear-data-structures","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_8148d2366a32bd5a0565d37243afc76a","title":"Definition of Non-Linear Data Structures","order":0},{"id":"seed_b41f69f99cb3c2ec0bf48422c285d59a","title":"Hierarchical and Network-Based Relationships","order":1},{"id":"seed_685427042abf7c9849b781c16f4e8eee","title":"One-to-Many and Many-to-Many Relationships","order":2},{"id":"seed_388abcad44bc17d25524fe09daf07e87","title":"Examples — Trees, Graphs, Heaps, and Tries","order":3}]},{"id":"seed_40b70bf1e868be36fbd65686619eff19","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 2: Data Structures Foundations","sectionOrder":2,"title":"Abstract Data Types (ADT) — The Missing Mental Model","order":8,"contentType":"LEARNING","contentSlug":"abstract-data-types","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_b0ace68846c481fd00d2a94488cc0c9a","title":"What is an Abstract Data Type","order":0},{"id":"seed_34920d21ae9b21de6e76e852b39e3f7b","title":"Difference between ADT and Data Structure","order":1},{"id":"seed_d4c238ecdcca23c25221d6783312b0a8","title":"Interface vs Implementation","order":2},{"id":"seed_ae168104c3a3d62b18453726823ece5d","title":"Example: List ADT — Operations Define the 'What'","order":3},{"id":"seed_0e2c55f4841948dbe801469d1e878206","title":"Multiple Implementations Possible for the Same ADT","order":4}]},{"id":"seed_f4d72aeb8b948dace4adb0d7848ae14f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 2: Data Structures Foundations","sectionOrder":2,"title":"Choosing the Right Data Structure (Decision Framework)","order":9,"contentType":"LEARNING","contentSlug":"choosing-the-right-data-structure","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_53a8205d7e3a246acedfa25d2698c5b0","title":"Mapping Problem Requirements to Data Structure Choice","order":0},{"id":"seed_972a40a5a047c86794b4171ebe3fc374","title":"Role of Constraints — Time, Space, Mutability","order":1},{"id":"seed_b76059b1bc0b16173799cf2ff46faa9b","title":"Common Beginner Mistakes in DS Selection","order":2},{"id":"seed_c6fde80792d5080729a108066a8cff7c","title":"How This Chapter Connects to Upcoming Deep Dives","order":3}]},{"id":"seed_c29a232b747c650e448b2bbc56cde715","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 3: Primitive Data Structures","sectionOrder":3,"title":"What Are Primitive Data Structures (Revisited, But Deeper)","order":1,"contentType":"LEARNING","contentSlug":"what-are-primitives-revisited","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_083e96d4280de98c841fcd7d08f4198d","title":"Definition of Primitive Data Structures (Deep Dive)","order":0},{"id":"seed_18ff3d57da79509cd43fcc8d835d5c98","title":"Why They Are Called 'Primitive'","order":1},{"id":"seed_0b162a6f5460dcef4b8359dd227da689","title":"Role of Primitives as Building Blocks","order":2},{"id":"seed_f3f3b2fd662c7d0d73b37f2072a2bd53","title":"Value-Based Storage vs Reference-Based Intuition","order":3}]},{"id":"seed_daf3aab5b505af86927efaae465ece85","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 3: Primitive Data Structures","sectionOrder":3,"title":"Binary Representation & Number Systems (Essential)","order":2,"contentType":"LEARNING","contentSlug":"binary-representation-number-systems","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_94ccb900c05da38828a2f337be3d7662","title":"Why Computers Use Binary","order":0},{"id":"seed_d77f0ec954698204659fa543c7bd6b4a","title":"Bits and Bytes","order":1},{"id":"seed_fe0c088c30c626916cd4ac2290fea4fa","title":"Binary, Decimal, and Hexadecimal","order":2},{"id":"seed_a4d65531bb2d7ee5932b52e16872ea80","title":"How Data Is Ultimately Stored as Bits","order":3}]},{"id":"seed_e9380d82385109bfbab5d010a699ce1c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 3: Primitive Data Structures","sectionOrder":3,"title":"Integer Data Types","order":3,"contentType":"LEARNING","contentSlug":"integer-data-types","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_e15f419aed6ba12ca3c3ce513ea0319f","title":"Signed vs Unsigned Integers","order":0},{"id":"seed_997da6807d345a52e7393f00b17fe06a","title":"Range of Integers and Overflow","order":1},{"id":"seed_a22d6bdcc1ec34501932dc08d149104b","title":"Fixed-Size Storage (32-bit, 64-bit intuition)","order":2},{"id":"seed_8857727ed6e92039dc05dcd63e01e294","title":"Common Integer Operations and Their Cost Model","order":3},{"id":"seed_79041b8d62f5a603e78f10f7a43193a7","title":"Integer Overflow and Real-World Bugs","order":4}]},{"id":"seed_bf103cadf004bff26b99e9c6ce453a9d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 3: Primitive Data Structures","sectionOrder":3,"title":"Floating-Point Data Types","order":4,"contentType":"LEARNING","contentSlug":"floating-point-data-types","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_d1be8a6882dc625467a9fb02a376f634","title":"Why Floating-Point Numbers Exist","order":0},{"id":"seed_08724a652b0dcab03f41c77a09b1d833","title":"Fixed-Point vs Floating-Point (Intuition)","order":1},{"id":"seed_5a0f75072b5d1d107e5cbbeeca96bcd9","title":"IEEE 754 High-Level Overview (No Bit Math)","order":2},{"id":"seed_c5460f59135743033ca0936b53b13232","title":"Precision Errors and Rounding Issues","order":3},{"id":"seed_1b66740be8e0689a9df7ee81e19267f6","title":"Why 0.1 + 0.2 ≠ 0.3","order":4}]},{"id":"seed_4b6d2f1fd78c5c11d5e7b3b5e37b43c4","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 3: Primitive Data Structures","sectionOrder":3,"title":"Character Data Types","order":5,"contentType":"LEARNING","contentSlug":"character-data-types","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_2d40bc3199ede78d15023a1011fababd","title":"Characters vs Numbers","order":0},{"id":"seed_c1352bc526725279314f9a7525d69812","title":"ASCII vs Unicode (Conceptual)","order":1},{"id":"seed_e80fe35237013d87052023656a7e017d","title":"Why Unicode Matters in Modern Systems","order":2},{"id":"seed_a1da42e283064cd8c685b5e05ac9e516","title":"Character Size and Encoding Intuition","order":3}]},{"id":"seed_3d2da65e566120794edb4472b78eb781","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 3: Primitive Data Structures","sectionOrder":3,"title":"Boolean Data Type","order":6,"contentType":"LEARNING","contentSlug":"boolean-data-type","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_b51c8acc8019a92142c240f8cbcff839","title":"Boolean Values and Logical States","order":0},{"id":"seed_f93611669b0779d28f20db55155799a6","title":"Role of Booleans in Control Flow","order":1},{"id":"seed_41a969789aca6732bd1bd76cc8990cb9","title":"Cost and Representation Intuition","order":2},{"id":"seed_2d62bf6906a9914c3b0a143f8561f9e5","title":"Truth Tables at a High Level","order":3}]},{"id":"seed_3ac9771e45f281b42f799f865bab140c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 3: Primitive Data Structures","sectionOrder":3,"title":"Primitive Operations & Cost Model","order":7,"contentType":"LEARNING","contentSlug":"primitive-operations-cost-model","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_75a933136ed307532025b6c837225c6d","title":"What Operations Are Allowed on Primitive Data Types","order":0},{"id":"seed_d5f94d7f9903e6470ff8aaa4f47b32a6","title":"Constant-Time Operations and Why They're Usually O(1)","order":1},{"id":"seed_72a06c3fa8f5eb053e555f96cac665a1","title":"Assumptions Behind the RAM Model","order":2},{"id":"seed_e0c9ebe71462f44b10683e4d394e8144","title":"When 'Constant Time' Can Still Matter","order":3}]},{"id":"seed_84049afe827bf684f8f8ad3ba4b6b18a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 3: Primitive Data Structures","sectionOrder":3,"title":"Limitations of Primitive Data Structures","order":8,"contentType":"LEARNING","contentSlug":"limitations-of-primitive-data-structures","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_18cd1a3e4806ba8282b991f1f8c3c2fb","title":"Fixed Size and Lack of Structure","order":0},{"id":"seed_5431f4e207d87d25ec79a06cd2b10a6a","title":"Inability to Model Collections and Relationships","order":1},{"id":"seed_664fa4ee73308a96b116cb61add2bc11","title":"Difficulty in Handling Dynamic or Hierarchical Data","order":2},{"id":"seed_044b16de4a6353c2f83c53af40756bc9","title":"Why Primitives Alone Don't Scale","order":3}]},{"id":"seed_75a1d9f48b63332b701e6ac137c75029","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 3: Primitive Data Structures","sectionOrder":3,"title":"Language-Level View of Primitives (Bridge Module)","order":9,"contentType":"LEARNING","contentSlug":"language-level-view","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_183993124210b2452c40dd5000ddd09b","title":"How Primitives Appear in Common Languages","order":0},{"id":"seed_b33b10f63592ffb95b361b05420f2028","title":"Differences in Abstraction Level","order":1},{"id":"seed_c30ee8df8f8090754aa306c57897009d","title":"Value Semantics vs Abstraction Overhead","order":2}]},{"id":"seed_d3442d96b469393feb173f2fdad1fb1c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"What Is a String?","order":1,"contentType":"LEARNING","contentSlug":"what-is-a-string","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_bcb680c6c4547920ff0346d03da85c07","title":"Definition of a String as a Sequence of Characters","order":0},{"id":"seed_b4dcd8828c97b4f450ebe267adbbf832","title":"Why Strings Are Classified as Non-Primitive Data Structures","order":1},{"id":"seed_ef726b4c4fc5a95a135a09173e378c6e","title":"Strings vs Characters: Understanding the Distinction","order":2},{"id":"seed_621545831205501c1940b2e9c479f106","title":"Why Text Deserves a Dedicated Data Structure","order":3}]},{"id":"seed_49b75783e00cf698880fa4882e2c8373","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"How Strings Are Represented (Conceptual View)","order":2,"contentType":"LEARNING","contentSlug":"how-strings-are-represented","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_525aea615be8efc31af9fb4ba3fc368e","title":"Logical View of a String as an Ordered Sequence","order":0},{"id":"seed_2043f5a923935ff9403d02ec85992be1","title":"Physical Storage Intuition","order":1},{"id":"seed_fe9d6afc734a0eb624dcf5357124b886","title":"Length, Indexing, and Immutability vs Mutability","order":2}]},{"id":"seed_94daed2204782b3fb6552fdc75631630","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"Basic String Operations & Their Cost Model","order":3,"contentType":"LEARNING","contentSlug":"basic-string-operations","description":null,"estimatedMins":60,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_c63b701969ca74711d346e744daf151f","title":"Accessing Characters","order":0},{"id":"seed_0472942331ee8dd5d5bdb9e5411824cf","title":"String Traversal","order":1},{"id":"seed_1a32bc93b9b95c38adc3ad87ef70e2fc","title":"String Concatenation","order":2},{"id":"seed_bc0e10954fa0911323ab912836ad86bf","title":"Substring Extraction","order":3},{"id":"seed_0983ca0e2dcb85b7739b9733d643cdca","title":"String Comparison","order":4},{"id":"seed_095ae9d4af5a2f58d756673a597c6c38","title":"Time and Space Intuition for String Operations","order":5}]},{"id":"seed_909a61505bdd7254f6e02829a4838a5b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"String Immutability & Its Implications","order":4,"contentType":"LEARNING","contentSlug":"string-immutability","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_4f62b353b3718f5d83eeb4c66e449869","title":"What Immutability Means","order":0},{"id":"seed_18019c83fee9e4fff0c7205b64b52f05","title":"Why Many Languages Make Strings Immutable","order":1},{"id":"seed_8bb764842c2a6bf7389fd1f11b3e117a","title":"Performance and Safety Trade-offs","order":2},{"id":"seed_c6cf3af611dd259d2a79b34cf295f7d9","title":"When Immutability Helps and When It Hurts","order":3}]},{"id":"seed_4236a14fc8b41ccbb666c6a70cdc7792","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"Common String Patterns & Problem-Solving Techniques","order":5,"contentType":"LEARNING","contentSlug":"common-string-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_ba9cb9d57fc7410b0edd662289cc564e","title":"Character Frequency Counting","order":0},{"id":"seed_5c6f52f41ceae01d501812b7ce2c6922","title":"Prefixes, Suffixes, and Substrings","order":1},{"id":"seed_2e6f6993e21fda43436be788898c144d","title":"Two-Pointer Intuition on Strings","order":2},{"id":"seed_1002ef774a6d5b475e260390d9b8e0c9","title":"Sliding Window Intuition","order":3}]},{"id":"seed_07399ed78256c46a827d2122b4232080","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"String Comparison, Ordering & Equality","order":6,"contentType":"LEARNING","contentSlug":"string-comparison-ordering-equality","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_45c8826883c1cb89c6afb3e20ec785f3","title":"Lexicographical Ordering","order":0},{"id":"seed_4a44b71ddb77ac492e4a779fd9fb5fa4","title":"Case Sensitivity","order":1},{"id":"seed_2ae08e52e5bbd60f5c34b418f940a4fd","title":"Locale vs Binary Comparison","order":2},{"id":"seed_1656a38a0e1e6842316d5c74c57ca156","title":"Equality vs Identity","order":3}]},{"id":"seed_0063fbe3ee1cf27cc487e8b2ef3f8f20","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"Memory & Space Behavior of Strings (Conceptual)","order":7,"contentType":"LEARNING","contentSlug":"strings-memory-and-space-behavior","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_1285c789c906363f937d6278323e1810","title":"How String Length Impacts Memory","order":0},{"id":"seed_e4979c1def164aa9fdf3ce2edd2f54c0","title":"Copy vs Reference Semantics (Conceptual)","order":1},{"id":"seed_a0e2b066e3df6093d2652a8f07702829","title":"Hidden Costs in String-Heavy Algorithms","order":2}]},{"id":"seed_190e23bffb8a289708eaff8e4b702513","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"Real-World Applications of Strings","order":8,"contentType":"LEARNING","contentSlug":"strings-real-world-applications","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_53265948f90827cfb2183f1918b3249c","title":"Text Processing and Parsing","order":0},{"id":"seed_23a9d889cf216337afb43e97ad3687b2","title":"Search Engines and Indexing","order":1},{"id":"seed_3f8a35688767abc706242790700aed7f","title":"User Input Validation","order":2},{"id":"seed_9414dd9d321a127b62be3c8f7c87daae","title":"Logs, Configuration, and Data Exchange Formats","order":3}]},{"id":"seed_eae113ad799cfc1acf2d27b5de59e148","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"Limitations of Strings as a Data Structure","order":9,"contentType":"LEARNING","contentSlug":"limitations-of-strings","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_772de4aabb0319a89679880af861e587","title":"Fixed or Expensive Resizing","order":0},{"id":"seed_9d0a40eb8973f16f6b70a5773fc5b78f","title":"Inefficient Random Updates in Many Models","order":1},{"id":"seed_e33a532a463f31a4fa51bb70b10bd330","title":"Poor Fit for Numeric or Homogeneous Data","order":2},{"id":"seed_d9e5d051fe8dc3c02795ea784595b0a7","title":"Need for a More General Collection Structure","order":3}]},{"id":"seed_d05df03b99d8e482599d97336abc98c1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"Strings as a Gateway to Arrays","order":10,"contentType":"LEARNING","contentSlug":"strings-as-gateway-to-arrays","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_cf7bf98a851036ffbca257126501f23d","title":"Conceptual Relationship Between Strings and Arrays","order":0},{"id":"seed_a3226efb68f3aff22633d6b92d91f210","title":"How String Ideas Generalize","order":1},{"id":"seed_1a036124cfc4c336ef968ec20356b8a7","title":"What Arrays Solve That Strings Don't","order":2}]},{"id":"seed_853f8f8a6de8e303becd34f3d1d7a79e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"Substring Position Finder","order":11,"contentType":"VISUALIZER","contentSlug":"substring-position-finder","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_37e8c79fad34a50b13b93a8926e9bfc9","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"Substring Position Finder","order":12,"contentType":"PROBLEM","contentSlug":"substring-position-finder","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_2a01c2759211e37c7dc7aef19b3ae036","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"Maximum Symmetric Substring","order":13,"contentType":"PROBLEM","contentSlug":"maximum-symmetric-substring","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_5147b0436d5a822524f8430361eee234","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 4: Strings","sectionOrder":4,"title":"Maximum Unique Substring Length","order":14,"contentType":"PROBLEM","contentSlug":"max-unique-substring-length","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_befd5884506278b2bcd4e492bb5da891","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"What Is an Array? — The Fundamental Collection","order":1,"contentType":"LEARNING","contentSlug":"what-is-an-array","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_9bdc6a2cbea855443435c9c76d7e85cc","title":"Definition of an Array as a Fixed-Size, Ordered Collection","order":0},{"id":"seed_5221e7fb6c51b562b932292e8feba7d1","title":"Arrays as the Most Fundamental Data Structure","order":1},{"id":"seed_0c1c6ad0caa52252f584e687f75c24c2","title":"Why Arrays Are So Prevalent in Programming","order":2},{"id":"seed_110f1a4714c95051c329fa085dfc77c8","title":"Arrays as the Underlying Structure for Many Other Data Structures","order":3}]},{"id":"seed_6182b2c4dadea21131520dd3e981eb2c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Array Memory Model & Contiguous Storage","order":2,"contentType":"LEARNING","contentSlug":"array-memory-model","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_0888eaaa3f8eabef9d98a6f8dceba202","title":"How Arrays Are Stored in Memory","order":0},{"id":"seed_6f53baf43497b57cd664f878631e09a5","title":"Contiguous Memory Allocation and Its Implications","order":1},{"id":"seed_8f4e11eb2c4c14b1ff16af369a95bf9a","title":"Index-Based Access and Address Calculation","order":2},{"id":"seed_e033135b585dd68d777c206e1bfcc3c0","title":"Why Random Access is O(1)","order":3}]},{"id":"seed_8c3c8de9e95eb9a635aec5120fb6de8e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Static vs Dynamic Arrays","order":3,"contentType":"LEARNING","contentSlug":"static-vs-dynamic-arrays","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_28918455a922cad4bbdee5bde01f6cea","title":"Static Arrays — Fixed Size at Creation","order":0},{"id":"seed_47198eecf04cb54eb437d52780196671","title":"Dynamic Arrays — Automatic Resizing","order":1},{"id":"seed_dab0ce2a24a73933f43339b3e7f42449","title":"Resizing Strategy and Amortized Cost","order":2},{"id":"seed_67ca93591df359697da57d52dd9e1009","title":"Trade-offs Between Static and Dynamic Arrays","order":3}]},{"id":"seed_b1bbb2c6a9454ace1b3115e5a4f6bb7e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Core Array Operations & Cost Model","order":4,"contentType":"LEARNING","contentSlug":"core-array-operations","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_af29c2395e5aac7f0d01bc7f4b261f41","title":"Access by Index — Constant Time Access (O(1))","order":0},{"id":"seed_ea6b8915182b3eb954719d2ed1f22238","title":"Search (Unsorted) — O(n) Linear Search","order":1},{"id":"seed_9dadbc550687b6f53b8fdb0f4e66d44d","title":"Search (Sorted) — O(log n) Binary Search Preview","order":2},{"id":"seed_1eba85cf3b2534d48500aae9a0766b96","title":"Insertion and Deletion — O(n) and Why","order":3},{"id":"seed_1fb6ab856b0b544f9ef6409cbbebd040","title":"Append — O(1) Amortized for Dynamic Arrays","order":4}]},{"id":"seed_7f0e51c6ae1cce67caf9968ac084052d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Array Traversal Patterns","order":5,"contentType":"LEARNING","contentSlug":"array-traversal-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_f458c39a5eae56ce24dc471045939f2c","title":"Linear Traversal (Forward and Backward)","order":0},{"id":"seed_98cb230de0afe37755466341b7c5e4cc","title":"Traversal with Early Termination","order":1},{"id":"seed_ad672001e177f9dd311e2490a5081318","title":"Collecting and Transforming During Traversal","order":2},{"id":"seed_9a0e0265f37ae6a2da73b5a2779fd955","title":"Building Output Arrays During Traversal","order":3}]},{"id":"seed_ea95dcd14ec38ec21f8712e028e0edc7","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"The Two-Pointer Technique","order":6,"contentType":"LEARNING","contentSlug":"two-pointer-technique","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_7f6885304035f2a2f9365cb2ee4c0fe1","title":"What is the Two-Pointer Technique","order":0},{"id":"seed_593d12981caebe5ec8c4bfe4a75cedf8","title":"Same-Direction Pointers (Fast and Slow)","order":1},{"id":"seed_61c71d89c8399d9029fbdb1fd6e3c493","title":"Opposite-Direction Pointers (Converging)","order":2},{"id":"seed_4b5a6f1e06e5d13cf458b74c5b1a8eed","title":"Classic Problems: Pair Sum, Removing Duplicates, Partitioning","order":3},{"id":"seed_16ecc2a847288c316210ff2fde6ee6b4","title":"When Two-Pointer Applies and When It Doesn't","order":4}]},{"id":"seed_9fd991af7e14f0940f563e068b81473e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Sliding Window Technique","order":7,"contentType":"LEARNING","contentSlug":"sliding-window-technique","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_a89c6d1e5d0efe0079ab8628f8088d77","title":"What is the Sliding Window Technique","order":0},{"id":"seed_e3d01fd892bf53974aabaa1252c49cdc","title":"Fixed-Size Sliding Windows","order":1},{"id":"seed_30ddd5e245af7b7522aecd2bee6318ba","title":"Variable-Size Sliding Windows","order":2},{"id":"seed_e57af2d78bead3b967eaec746cbe0808","title":"Classic Problems & Pattern Recognition","order":3}]},{"id":"seed_248cdd279c1cb9a09350ecca2a81779a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Common Array Patterns & Problem Types","order":8,"contentType":"LEARNING","contentSlug":"common-array-patterns","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_315a026aee1495c0e6892a778e561ff8","title":"Prefix Sums and Cumulative Arrays","order":0},{"id":"seed_bf19d8342c0b6cad76cafe726518d556","title":"Kadane's Algorithm Intuition — Maximum Subarray","order":1},{"id":"seed_48bbc1e153640e8466c5a625fc750e93","title":"Rotating and Reversing Arrays","order":2},{"id":"seed_c761b6df6280b46483ccda4bcfc85336","title":"Merging Sorted Arrays","order":3},{"id":"seed_d7d53ce8888bdd581301da7db29cb44c","title":"In-Place Transformations","order":4}]},{"id":"seed_b833c299acfd509c1fa33a4735e51f47","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Multi-Dimensional Arrays — Extending Arrays to Grids and Beyond","order":9,"contentType":"LEARNING","contentSlug":"multi-dimensional-arrays","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_1d2e475473d473ef377784767dd219ef","title":"2D Arrays (Matrices) — Conceptual Model","order":0},{"id":"seed_9e3de155536707046656c34645e0d7cb","title":"Row-Major vs Column-Major Storage Intuition","order":1},{"id":"seed_5f3757ad17de5627eb7835d1475a8376","title":"Traversing Matrices — Row-wise, Column-wise, Diagonal","order":2},{"id":"seed_f5a7abfc2f7048811524b8493c80d6fa","title":"Common Matrix Operations and Patterns","order":3}]},{"id":"seed_6bbf0f61e00e935ad06b0fb4698a604a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Array Limitations & Need for Linked Structures","order":10,"contentType":"LEARNING","contentSlug":"array-limitations-and-need-for-linked-structures","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_2804c413d1ce4a3f57f233dd6aaaee4e","title":"Fixed Size (Static Arrays) as a Constraint","order":0},{"id":"seed_df2a01d2a568c2f740e5036aaee7d696","title":"Expensive Insertions and Deletions","order":1},{"id":"seed_ff43384f4de706cc5d2b589fe1475cbc","title":"Memory Fragmentation in Very Large Arrays","order":2},{"id":"seed_d20a489a3111ceb50fb1a60019c4d9b9","title":"What Arrays Can't Do Efficiently","order":3}]},{"id":"seed_52ab95686cef6c922d0ac7f83787fbf5","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Filter Array By Value","order":11,"contentType":"VISUALIZER","contentSlug":"filter-array-by-value","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_fd8bc4d876254b556fb491a1544ee92e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Filter Array By Value","order":12,"contentType":"PROBLEM","contentSlug":"filter-array-by-value","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_853ab7fe55cdc7b4141f430b30c5e209","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"In-Place Unique Elements","order":13,"contentType":"PROBLEM","contentSlug":"inplace-unique-elements","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_39a124b4356d93429f3ede0729a958b0","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Pair Target Sum","order":14,"contentType":"PROBLEM","contentSlug":"pair-target-sum","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_48de12458d19943500080fa1ce29fb10","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Maximum Water Container","order":15,"contentType":"PROBLEM","contentSlug":"maximum-water-container","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_05313c690a2efb13b67da99bec5a7dc6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 5: Arrays","sectionOrder":5,"title":"Optimal Contiguous Subarray Sum","order":16,"contentType":"PROBLEM","contentSlug":"optimal-contiguous-subarray-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_2cd056c25a55635ca40264e86d5c46d1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Why Linked Lists? Limitations of Arrays","order":1,"contentType":"LEARNING","contentSlug":"why-linked-lists","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_895e15733667d660b7bed987d9916928","title":"Revisiting Array Limitations","order":0},{"id":"seed_8eff5d24d5d3e64bf4fea80a087771ed","title":"The Cost of Insertion and Deletion in Arrays","order":1},{"id":"seed_5532f822bb3ebd044742a14bb30a022f","title":"The Need for Dynamic, Flexible Structures","order":2},{"id":"seed_3cbb195adffd5a9198d3673c04143c75","title":"How Linked Lists Address These Limitations","order":3}]},{"id":"seed_3457e9a42c714365d1ff6a283b70380a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"What Is a Linked List?","order":2,"contentType":"LEARNING","contentSlug":"what-is-a-linked-list","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_686a4349ba95a1624cb6276a699cf5cd","title":"Definition of a Linked List","order":0},{"id":"seed_7eee302a9124ad42824ad9f34d1bfd4f","title":"Nodes, Data, and Pointers","order":1},{"id":"seed_5a64649f98ea383097896d7cdb1088c7","title":"Sequential Access vs Random Access","order":2},{"id":"seed_81ebee6f4e8c93a953f0f911bda38613","title":"Logical Order vs Physical Memory Order","order":3}]},{"id":"seed_997d58ea2dd9296634eab85e0e08c9bb","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Singly Linked List — Structure & Intuition","order":3,"contentType":"LEARNING","contentSlug":"singly-linked-list","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_4f66c62067db326f33b092889d5e4a57","title":"The Singly Linked List Structure","order":0},{"id":"seed_71936fa409a9cc1ce20b02facfbf8697","title":"Head, Tail, and Null Termination","order":1},{"id":"seed_f03639b8662b5a5b0bc078bb5e487180","title":"Visual Representation","order":2},{"id":"seed_2ead254f12f9bc808e60464a09fe4e5b","title":"Why We Need a Head Pointer","order":3}]},{"id":"seed_6bb7932ae26b4cd64b7e9d5034d13c59","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Node-Based Thinking: Pointers and References","order":4,"contentType":"LEARNING","contentSlug":"node-based-thinking","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_4746ea62f21bb431febb1b421c748b56","title":"What is a Node","order":0},{"id":"seed_f7946623f309e7f19da75bf55daca1de","title":"Pointers and References Explained","order":1},{"id":"seed_1a170a3d46d58162c9ef40a3eb2ec82e","title":"Following Links to Traverse","order":2},{"id":"seed_687193171b6eb0dc33b0725cdd28c9fd","title":"Null as the End Marker","order":3}]},{"id":"seed_be574ad4030fea98180351795970f7c7","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Core Linked List Operations & Cost Model","order":5,"contentType":"LEARNING","contentSlug":"core-linked-list-operations-cost-model","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_2575f7ef1f2a2b864332efbf674770a5","title":"Traversal: O(n)","order":0},{"id":"seed_e451f630c73a8fd54c31e9c790e26af0","title":"Access by Index: O(n) — Critical Difference from Arrays","order":1},{"id":"seed_a5b4f835a8d1e701716a6ed5335a50ba","title":"Insertion at Head: O(1)","order":2},{"id":"seed_8ab47c464cdc9e39f75bc0c775211160","title":"Insertion at Tail: O(1) with tail pointer, O(n) without","order":3},{"id":"seed_5cba1e3fcabcb91274aebcc0df0144a7","title":"Deletion: O(1) if node is known, O(n) to find","order":4}]},{"id":"seed_5ef1addbdcef38a7935aea7625d6e682","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Traversal, Insertion, and Deletion Patterns","order":6,"contentType":"LEARNING","contentSlug":"traversal-insertion-deletion-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_f18df79e9994385e86ce0252b83e37ad","title":"Traversing with a Current Pointer","order":0},{"id":"seed_46d3e6dbef5c49e97c5bde33cbf0c40c","title":"Inserting at Beginning, Middle, and End","order":1},{"id":"seed_3840a69df129409cfa523403fa613872","title":"Deleting from Beginning, Middle, and End","order":2},{"id":"seed_384b9bcffdecebbd07b4b2d513bed434","title":"Edge Cases: Empty List, Single Element, Last Element","order":3}]},{"id":"seed_990fc3655b8be6e3c1ca87f07efb5ae0","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Doubly Linked Lists — Bidirectional Navigation","order":7,"contentType":"LEARNING","contentSlug":"doubly-linked-lists","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_5a275848efecf10617ffef656556b4ef","title":"Structure of a Doubly Linked List","order":0},{"id":"seed_8f57bde7f5022af729b183a69c4a1343","title":"Previous and Next Pointers — The Mechanics of Bidirectional Links","order":1},{"id":"seed_8f450f113343c95b61a90ce3df93372b","title":"Advantages — Bidirectional Traversal and Easier Deletion","order":2},{"id":"seed_ed177cdd0566957e3b4e1f90a03f3ee2","title":"Disadvantages — Extra Memory and More Pointer Maintenance","order":3}]},{"id":"seed_06de6d84d5c0dfdd04929ef427f5b20d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Circular Linked Lists","order":8,"contentType":"LEARNING","contentSlug":"circular-linked-lists","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_f56c2c4eaaa2e9a24a62d5834b88f200","title":"What Is a Circular Linked List","order":0},{"id":"seed_236be2549a062cdc1cd9dffe74fb802e","title":"Singly Circular and Doubly Circular Variants","order":1},{"id":"seed_73ae45648726dbc460e784aba887558a","title":"Use Cases — Round-Robin Scheduling, Circular Buffers","order":2},{"id":"seed_fef3aef3337a02274057aa6b0a4ae69d","title":"Detecting the End Condition","order":3}]},{"id":"seed_a0075693236da58a762629b3dbb04c2e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Two-Pointer Techniques for Linked Lists","order":9,"contentType":"LEARNING","contentSlug":"two-pointer-techniques-linked-lists","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_538fd42cdf49a9ada2cbc6da6f9903d8","title":"Slow and Fast Pointer Technique","order":0},{"id":"seed_cdf156f629436ae70b91431c0be140c9","title":"Cycle Detection — Floyd's Algorithm","order":1},{"id":"seed_6ec3bc08b2f9fc32fd107b8843c96065","title":"Finding the Middle Element","order":2},{"id":"seed_57fec1c43d290d11275d0dd855b8d895","title":"Detecting Intersection of Two Lists","order":3}]},{"id":"seed_b9780a03b6f7d14f59b5c4a16b1fe8a0","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Common Linked List Patterns & Problem Types","order":10,"contentType":"LEARNING","contentSlug":"common-linked-list-patterns","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_2f7f1864ee8444d6df44846da3fc6cc0","title":"Reversing a Linked List","order":0},{"id":"seed_ca989f303dbd007ec83edd03c5038f34","title":"Merging Sorted Linked Lists","order":1},{"id":"seed_5e15504e8ad6d6fa2272cdb20389b0ec","title":"Removing Nth Node from End","order":2},{"id":"seed_c4f9c8b37e5deab847949f362d9d1ed7","title":"Partitioning Around a Value","order":3},{"id":"seed_eec61f7b9ed273a6337457680a215378","title":"Palindrome Detection","order":4}]},{"id":"seed_5c42891c22f72753cb49fa1195906248","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Linked Lists vs Arrays — When to Use Which","order":11,"contentType":"LEARNING","contentSlug":"linked-lists-vs-arrays","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_9c75d9e236b0c085ff2ef7fcff487180","title":"Summary Comparison Table — Arrays vs Linked Lists","order":0},{"id":"seed_2cdb462f51fd2aaa5b46830334dac162","title":"Criteria for Choosing Linked Lists","order":1},{"id":"seed_42a2ec084261fe07303b02d19ddd5a7e","title":"Criteria for Choosing Arrays","order":2},{"id":"seed_dc8043a289d684b930725ab064e75f88","title":"Hybrid Approaches — Combining Arrays and Linked Lists","order":3}]},{"id":"seed_086e895b3d9cf842c4b182a1c2146fe1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Combine Ordered Sequences","order":12,"contentType":"VISUALIZER","contentSlug":"combine-ordered-sequences","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_10336bedc316a5565343dff2a35fe8a4","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Combine Ordered Sequences","order":13,"contentType":"PROBLEM","contentSlug":"combine-ordered-sequences","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_368d00e9f4c7e6ebf13c6f376ffb9ed2","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Linked List Center Node","order":14,"contentType":"PROBLEM","contentSlug":"linked-list-center-node","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_f7a6d7d01a24ae5d158f9bc85c94383e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Cyclic Chain Detection","order":15,"contentType":"PROBLEM","contentSlug":"cyclic-chain-detection","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_8949b8bebcf8700fcdf15b20c85e683f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 6: Linked Lists","sectionOrder":6,"title":"Linked List Number Addition","order":16,"contentType":"PROBLEM","contentSlug":"linked-list-number-addition","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_00011cd8f2ed5781cef6a1b2bb81e7bd","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"What Is a Stack? Real-World Intuition","order":1,"contentType":"LEARNING","contentSlug":"what-is-a-stack","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_e9fea90b04b363385b2cc3a4f2ad02cb","title":"Stack as a Pile of Items — The Fundamental Mental Model","order":0},{"id":"seed_63b5129a3e523f4a6c5298c1e40c6b0f","title":"Real-World Analogies — Plate Stack, Browser Back Button, Undo Operation","order":1},{"id":"seed_c1ef554c4476925f93617994011379f5","title":"The LIFO (Last-In, First-Out) Principle","order":2},{"id":"seed_775e1b85e0fce4b9f36057cc6bdc98d9","title":"Why LIFO Matters in Computing","order":3}]},{"id":"seed_b86092b1e6123e2c8e20e97ef1a0e9cf","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Stack as an Abstract Data Type (ADT)","order":2,"contentType":"LEARNING","contentSlug":"stack-as-abstract-data-type","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_f3ae14810e3959831406bb0cd7996016","title":"Stack Defined by Its Operations, Not Its Implementation","order":0},{"id":"seed_510a388ea2f684c9b9212b5e568839a5","title":"The Stack Interface — Push, Pop, Peek, isEmpty","order":1},{"id":"seed_b07eaaff56ad8ecf6bc0f59ebdf098fa","title":"Why ADT Thinking Matters for Stacks","order":2},{"id":"seed_ba4a7459ab64084143f4e134994dc779","title":"Implementation Independence","order":3}]},{"id":"seed_072fd86b0ab33ef91775e76a170c0a50","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Stack Operations & Interface","order":3,"contentType":"LEARNING","contentSlug":"stack-operations-interface","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_4ebf54525c79888660dcbd901de22e07","title":"Push — Adding Elements to the Top","order":0},{"id":"seed_d04f21f25ee635b258885e1e00005481","title":"Pop — Removing Elements from the Top","order":1},{"id":"seed_ecf305c854d38e09f60505421d12e4d8","title":"Peek/Top — Viewing Without Removing","order":2},{"id":"seed_8ef738572adca2f7c759b4dc4af11cde","title":"isEmpty — Checking if the Stack is Empty","order":3},{"id":"seed_c3f82b274f60559e9e6b1784c813a5c4","title":"Size — Number of Elements","order":4}]},{"id":"seed_e7bea9be9a42685c95a7a45c6424de1e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Array-Based Stack Implementation","order":4,"contentType":"LEARNING","contentSlug":"array-based-stack-implementation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_909d75e038663693d09d5d38e4b9980f","title":"Using an Array to Implement a Stack","order":0},{"id":"seed_3e5c74c1835ec5ad80270a5958b7a4d4","title":"Top Pointer Management","order":1},{"id":"seed_ace2b679fab93cb7b41a49b54966dfb9","title":"Push and Pop in O(1)","order":2},{"id":"seed_6e71407af9b1e0dffd8da9bc0eb23b86","title":"Handling Overflow (Static) vs Resizing (Dynamic)","order":3}]},{"id":"seed_900e404b9123e780a7aab330b643a98e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Linked List-Based Stack Implementation","order":5,"contentType":"LEARNING","contentSlug":"linked-list-based-stack-implementation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_0187adb494205faa7d9d78029a0a95bd","title":"Using a Singly Linked List to Implement a Stack","order":0},{"id":"seed_2ae656982473177ab6ace16d955ce000","title":"Head as the Top of the Stack","order":1},{"id":"seed_59db695548bc6011b05704e0b0a87ebb","title":"Push and Pop in O(1)","order":2},{"id":"seed_71e928f912a7fa361ce27c0fca79865f","title":"No Overflow with Dynamic Memory","order":3}]},{"id":"seed_e72a9f4b697eca7e4d9f812e733bcddc","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Implementation Trade-offs: Array vs Linked List","order":6,"contentType":"LEARNING","contentSlug":"stacks-implementation-tradeoffs","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_9b071666adabc5b1c725154d361847b0","title":"Memory Efficiency — Array vs Linked List","order":0},{"id":"seed_6179f9461c9e1d1cd2feff2a270ac24a","title":"Cache Locality Considerations","order":1},{"id":"seed_0548891808b00c24007d1ebcfde6d129","title":"Ease of Implementation","order":2},{"id":"seed_edd6daf7e6380294cd94243a0051b377","title":"When to Choose Which","order":3}]},{"id":"seed_b1315d2c1461e3d1abc0342349c03a5c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Common Stack Patterns & Problem Types","order":7,"contentType":"LEARNING","contentSlug":"common-stack-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_2b1bcdc18ae5dab46f20529d99383fef","title":"Reversing Sequences","order":0},{"id":"seed_643dadef2046dff79c5ba5b2fbdb8afd","title":"Tracking State During Traversal","order":1},{"id":"seed_7fd94a5455de7ea6a135f74f48dfcebc","title":"Function Call Simulation","order":2},{"id":"seed_ee9c67d41b7291c7d0381806136cfd2c","title":"Expression Evaluation Intuition","order":3}]},{"id":"seed_3c5890f524be925b7cda7c55e0ba276c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Parentheses Matching & Expression Problems","order":8,"contentType":"LEARNING","contentSlug":"parentheses-matching-expression-problems","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_a84b732174304740fd06e1a70abc64a1","title":"Balanced Parentheses Checking","order":0},{"id":"seed_fdcdcfd027e8ea3c9301ae1cfdc0a21d","title":"Valid Bracket Sequences","order":1},{"id":"seed_8af764504527902b0f6624230d76613e","title":"Evaluating Postfix Expressions","order":2},{"id":"seed_0f13d291230e824c9107ef8ddb7a7914","title":"Converting Infix to Postfix (Shunting-Yard Intuition)","order":3}]},{"id":"seed_5da79dfc3742bc27973f7b54fed2406d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Monotonic Stacks — Advanced Pattern","order":9,"contentType":"LEARNING","contentSlug":"monotonic-stacks","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_8ae0a7e68812e9cc83592f97c724e031","title":"What is a Monotonic Stack","order":0},{"id":"seed_daf929974d8432cfe63a1c8f04e98097","title":"Monotonically Increasing vs Decreasing","order":1},{"id":"seed_b1294c2b7c70943904fec8f13af17dff","title":"Next Greater Element Problem","order":2},{"id":"seed_4d59992867137a1c959cdc973ce3ae3b","title":"Histogram Area and Related Problems","order":3}]},{"id":"seed_d7f1096aa8cc269e45f5da33a8144919","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Call Stack & Execution Contexts","order":10,"contentType":"LEARNING","contentSlug":"call-stack-execution-contexts","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_cc0cb93d8a9c2f713b5d953270c9efa4","title":"How Programming Languages Use Stacks","order":0},{"id":"seed_b25c77d4b4683d610fc82ea60c73a5bb","title":"Function Call and Return Mechanism","order":1},{"id":"seed_bd5aee14926ea169d6c3f810ae355f70","title":"Stack Frames and Local Variables","order":2},{"id":"seed_cd506aa9bbe6833d29ade0a2171028c3","title":"Understanding Stack Overflow Errors","order":3}]},{"id":"seed_321c8aa7e9d37fd4419638f296271687","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Smallest Element Tracker Stack","order":11,"contentType":"VISUALIZER","contentSlug":"smallest-element-tracker-stack","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_029932385269f0b333f338ec2d51de29","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Smallest Element Tracker Stack","order":12,"contentType":"PROBLEM","contentSlug":"smallest-element-tracker-stack","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_f9d990fcc41114231b95cd752d4b3a1a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Next Warmer Day Distance","order":13,"contentType":"PROBLEM","contentSlug":"next-warmer-day-distance","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_c303d30428b083f49a2d93b36e334213","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 7: Stacks","sectionOrder":7,"title":"Nested Bracket Scoring","order":14,"contentType":"PROBLEM","contentSlug":"nested-bracket-scoring","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_ae9908924fd229e50f39cd72883e6bf4","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 8: Queues","sectionOrder":8,"title":"What Is a Queue? Real-World Intuition","order":1,"contentType":"LEARNING","contentSlug":"what-is-a-queue","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_cd985adece7b85a7bf22e394626f0faa","title":"Queue as a Line of People","order":0},{"id":"seed_74d5dc472203da7a8b7fae6f47de12be","title":"Real-World Analogies — Checkout Lines, Print Queues, Task Scheduling","order":1},{"id":"seed_605ca4d1d50c35f8b68f1ada987a3ef3","title":"The FIFO (First-In, First-Out) Principle","order":2},{"id":"seed_d74faadf1ee352167142ecdf346d6a06","title":"Why FIFO Matters in Computing","order":3}]},{"id":"seed_ac252916796107b155c577fa1fe0828d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 8: Queues","sectionOrder":8,"title":"Queue as an Abstract Data Type (ADT)","order":2,"contentType":"LEARNING","contentSlug":"queue-as-abstract-data-type","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_4916cdbd889c359c4a6ebaedc6f378a0","title":"Queue Defined by Its Operations, Not Its Implementation","order":0},{"id":"seed_4e9da4c091f867da1254f363ad6aaf9d","title":"The Queue Interface — enqueue, dequeue, front, isEmpty","order":1},{"id":"seed_176dbb657ad0dbf8e9cc7c99a8cd2cff","title":"Contrast with Stack ADT","order":2},{"id":"seed_4bea7c54b721d6595da2875f885afd17","title":"Implementation Independence","order":3}]},{"id":"seed_99bb2238f2039202e2df4814a35ca537","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 8: Queues","sectionOrder":8,"title":"Queue Operations & Interface","order":3,"contentType":"LEARNING","contentSlug":"queue-operations-interface","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_909a54bc87e6ee67470b90eb97b29f93","title":"Enqueue — Adding Elements to the Rear","order":0},{"id":"seed_0a127fd73e9e3fa2f7cc532cc665eaef","title":"Dequeue — Removing Elements from the Front","order":1},{"id":"seed_a02e575d619cab5c1e7100a15ae2e693","title":"Front/Peek — Viewing Without Removing","order":2},{"id":"seed_445d5a85874809ac1e8e9237a0e8dc77","title":"isEmpty — Check If Queue Is Empty","order":3},{"id":"seed_97569dc4bf02abd7f0fff8811a09b14c","title":"Size — Number of Elements","order":4}]},{"id":"seed_2577a6e5d10fd88a0be966c3945cfe76","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 8: Queues","sectionOrder":8,"title":"Array-Based Queue & Circular Queue Implementation","order":4,"contentType":"LEARNING","contentSlug":"array-based-circular-queue","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_6a8f5c9da042660b378e1097021700b9","title":"Linear Array Implementation and Its Problem (Wasted Space)","order":0},{"id":"seed_74f10e003f26bbfb6d74c7ecec2081d0","title":"Circular Queue: Wrapping Around the Array","order":1},{"id":"seed_b50bc661d2229a9842fb65f1f72ad9ec","title":"Front and Rear Pointer Management","order":2},{"id":"seed_9d12cfcded8339e0f07a4d12b8d06f06","title":"Full vs Empty Detection","order":3}]},{"id":"seed_5413826bfe0e9c8c6d8117b6ff62efdb","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 8: Queues","sectionOrder":8,"title":"Linked List-Based Queue Implementation","order":5,"contentType":"LEARNING","contentSlug":"linked-list-queue-implementation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_395d0d596ce828fda5abfdf4058f55c5","title":"Using a Singly Linked List to Implement a Queue","order":0},{"id":"seed_301018e8d422acbd7d28df89028fa346","title":"Head as Front, Tail as Rear","order":1},{"id":"seed_6e37b49540433c43342ed61bd58e5278","title":"Enqueue and Dequeue in O(1)","order":2},{"id":"seed_b29abc1ed19c8a55e68b181fea8f5749","title":"Tail Pointer Necessity","order":3}]},{"id":"seed_7ed3f9abb607f5d9398d31b61e06e8e7","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 8: Queues","sectionOrder":8,"title":"Double-Ended Queue (Deque) — Flexible Two-End Access","order":6,"contentType":"LEARNING","contentSlug":"double-ended-queue","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_9f9f4c890c2fb37e5f3c2141629119ed","title":"What Is a Deque?","order":0},{"id":"seed_21ad14f856814d3891f748a2ea458543","title":"Operations — Add and Remove at Both Ends","order":1},{"id":"seed_d7c71da90528c15301ab4d381d4e1181","title":"Deque as a Generalization of Stack and Queue","order":2},{"id":"seed_053e3705b7314d0418cf20058fe034d6","title":"Implementation Considerations","order":3}]},{"id":"seed_3c4667eec06a910438ec5510e017495e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 8: Queues","sectionOrder":8,"title":"Priority Queue — Conceptual Introduction","order":7,"contentType":"LEARNING","contentSlug":"priority-queue-conceptual-introduction","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_b4e543572127ca3865c92e2dc91a9574","title":"What is a Priority Queue","order":0},{"id":"seed_d7812c6d199e13ffd54eb9525298fc8b","title":"Priority-Based Ordering vs Arrival-Based Ordering","order":1},{"id":"seed_403af4488bf31e760ba6006afec5f32a","title":"Interface — Insert with Priority, Remove Highest Priority","order":2},{"id":"seed_79458c0da91feb094a48a4013151691b","title":"Implementation Preview — Heaps (Coming Later)","order":3}]},{"id":"seed_58fa2a9f6e58f97e28fe9d90e01169bb","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 8: Queues","sectionOrder":8,"title":"Common Queue Patterns & Problem Types","order":8,"contentType":"LEARNING","contentSlug":"common-queue-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_9d576dc9cc00e3397414e6764293688a","title":"Level-Order Processing","order":0},{"id":"seed_67706a3d949fb9c3780ff8d429dfa570","title":"BFS Intuition (Without Full Graph Context)","order":1},{"id":"seed_7fb54bbc795c0a62ecfcee97ac71c696","title":"Task Scheduling Simulation","order":2},{"id":"seed_f654fe49c6f7ebe983ee917ed2788e48","title":"First-Come-First-Serve Processing","order":3}]},{"id":"seed_62b13177ff47e69056be078acf083bbc","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 8: Queues","sectionOrder":8,"title":"Sliding Window Maximum — Monotonic Deque","order":9,"contentType":"LEARNING","contentSlug":"sliding-window-maximum","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_bca4b76852bfd51c6bddd73cd71f5f1d","title":"The Sliding Window Maximum Problem","order":0},{"id":"seed_1042511ede8f7268f4d0023e6471e32b","title":"Using a Deque to Maintain Candidates","order":1},{"id":"seed_903c68d4c427056eaaf7ae1307242ac3","title":"Monotonic Deque Technique","order":2},{"id":"seed_c7a07f7dae9ce2e0a75bf1bff3dc6de7","title":"Time Complexity Optimization","order":3}]},{"id":"seed_8dcf61a06b537b2e9e0f6caa061cf803","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 8: Queues","sectionOrder":8,"title":"Stacks vs Queues — Comparison & Use Cases","order":10,"contentType":"LEARNING","contentSlug":"stacks-vs-queues-comparison","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_3d1f7a07cedc0cbc46024a2266bc444f","title":"LIFO vs FIFO Summary","order":0},{"id":"seed_7e9f3c5f4c238eba213a6fa52915d5e3","title":"When to Use Stacks","order":1},{"id":"seed_7dccc9306eb09250de2465f7fe60a823","title":"When to Use Queues","order":2},{"id":"seed_6ad686ba540ad35c1c6ceeecc85e4267","title":"Recognizing the Right Structure for the Problem","order":3}]},{"id":"seed_dbd6f55864bb9ee18410b2885d743c7b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"What Is Recursion? Conceptual Foundation","order":1,"contentType":"LEARNING","contentSlug":"what-is-recursion","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_1d03483f8a769a179041b78abe699dac","title":"Definition of Recursion","order":0},{"id":"seed_da5be2aae3f4275569cf5d86dc9d5f38","title":"Self-Referential Problem Solving","order":1},{"id":"seed_45df8fd1c3ce974b65669fd0f49e7a2f","title":"Real-World Analogies: Russian Nesting Dolls, Mirrors Facing Each Other","order":2},{"id":"seed_16cd6657574d73634f440972b24ee9cd","title":"Recursion as a Way of Thinking, Not Just a Technique","order":3}]},{"id":"seed_3ce33a85c0099383a2f9c858d2dba016","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"The Anatomy of a Recursive Function","order":2,"contentType":"LEARNING","contentSlug":"anatomy-of-recursive-function","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_0450df58b90e89d0810850a5a876f715","title":"Structure of a Recursive Function","order":0},{"id":"seed_5961908bcc70e1afbcb2560b2e3c77a6","title":"The Base Case — When to Stop","order":1},{"id":"seed_0522f06acc0d078b667d1f26c5e363d4","title":"The Recursive Case — How to Reduce","order":2},{"id":"seed_fe38e460e5150fd368762e27e290af39","title":"The 'Leap of Faith' — Trusting Smaller Solutions","order":3}]},{"id":"seed_15e967e95406b186ffe565b88a894542","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"Base Cases & Recursive Cases","order":3,"contentType":"LEARNING","contentSlug":"base-cases-and-recursive-cases","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_bfb81dcd009211e189123ff87aaa308c","title":"Identifying Correct Base Cases","order":0},{"id":"seed_fb48fd576bf6abeddfa9cb355246b9f0","title":"Multiple Base Cases","order":1},{"id":"seed_f7f4e2fe54e975965ac84813f0556817","title":"Ensuring Progress Toward the Base Case","order":2},{"id":"seed_04f6b28d28da1b8f331574f2e66ce53e","title":"Common Mistakes: Missing or Wrong Base Cases","order":3}]},{"id":"seed_f0921a5f62daa63700cfd53a1a524349","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"The Call Stack & Recursion Execution","order":4,"contentType":"LEARNING","contentSlug":"call-stack-and-recursion-execution","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_5dcf7f9403d667d0bb1687a5a28459bb","title":"How Recursive Calls Are Managed","order":0},{"id":"seed_abd24236b1c1b7bd84458dc6d72bb7fc","title":"Stack Frames for Each Call","order":1},{"id":"seed_74c7276a0375375b2ff582b447e3de6e","title":"Order of Execution and Return","order":2},{"id":"seed_4706fa5690782614ef92b750713ea55e","title":"Visualizing the Call Stack","order":3}]},{"id":"seed_588264e971eb8707423bb447a86222a9","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"Visualizing Recursion Trees","order":5,"contentType":"LEARNING","contentSlug":"visualizing-recursion-trees","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_555640348c5e57ee1bbcd85a567322b9","title":"What is a Recursion Tree","order":0},{"id":"seed_1fae09282cab953107ee19c1727d5570","title":"How to Draw Recursion Trees","order":1},{"id":"seed_1c534204f08a4781c02090a7742eaa79","title":"Using Trees to Understand Time Complexity","order":2},{"id":"seed_af47e423cc15912fe0d97bcc48d5a3a8","title":"Identifying Redundant Computations","order":3}]},{"id":"seed_cac105a44dd128c2d5db809818374528","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"Recursion vs Iteration","order":6,"contentType":"LEARNING","contentSlug":"recursion-vs-iteration","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_295cef24f312bf614112989d7481756d","title":"Any Recursion Can Be Converted to Iteration (With Explicit Stack)","order":0},{"id":"seed_9634d8e4869f440824a20c37f7a41355","title":"When Recursion is Clearer","order":1},{"id":"seed_67016336ac1039c9682d68f4bff1b635","title":"When Iteration is More Efficient","order":2},{"id":"seed_c24dab7be883b30e1ccf1dde9ccfd6c2","title":"Making the Right Choice","order":3}]},{"id":"seed_0f8e119f6976597efe3f0ebc1f79f24d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"Time & Space Complexity of Recursive Algorithms","order":7,"contentType":"LEARNING","contentSlug":"recursion-time-space-complexity","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_c37ced8fa86779004dc827a26e7fe1b5","title":"Time Complexity from Recurrence Relations","order":0},{"id":"seed_75bb6a24d6d6a125273af7a60b1ae4f3","title":"Space Complexity — Call Stack Depth","order":1},{"id":"seed_7322a1801589016ab1fc03f6547e7e9c","title":"Recognizing Exponential vs Polynomial Recursion","order":2},{"id":"seed_af24ce7472498b71e8c2b54329303c57","title":"Master Theorem Intuition (Conceptual)","order":3}]},{"id":"seed_c9878cbb3c96179f7b3bd1d1d1bd314f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"Common Recursive Patterns","order":8,"contentType":"LEARNING","contentSlug":"common-recursive-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_14fc723bb20aa2a3120336765577dbed","title":"Factorial and Simple Calculations","order":0},{"id":"seed_f04a29b18a072c4aa14816576714fe7b","title":"Fibonacci and Overlapping Subproblems","order":1},{"id":"seed_2aa4438d2e219086f7ddb582b31649f1","title":"Binary Recursion (Two Calls)","order":2},{"id":"seed_e4ba744843fd69eff10d1e6ddabdaf1d","title":"Divide and Conquer Preview","order":3}]},{"id":"seed_487e0c70d28192e69344202ba9d38a7d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"Tail Recursion & Optimization","order":9,"contentType":"LEARNING","contentSlug":"tail-recursion-optimization","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_508db35ae608ae87c2f4941bb3baded5","title":"What is Tail Recursion","order":0},{"id":"seed_d80055391b3786bc4a17d52a516a4ebd","title":"Tail Call Optimization (TCO)","order":1},{"id":"seed_2a67b629bf454c7ff175379208d43940","title":"Converting Non-Tail to Tail Recursion","order":2},{"id":"seed_2a3e6f8812b9cdf03c3968b5dbe5cef9","title":"Language Support for TCO","order":3}]},{"id":"seed_f95f337bf01a11c812481b87014ff41f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"When Recursion Goes Wrong","order":10,"contentType":"LEARNING","contentSlug":"when-recursion-goes-wrong","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_d2526324001240728fc2433eba870311","title":"Stack Overflow Errors","order":0},{"id":"seed_7040c53945417d22ed9e59c5ae0df549","title":"Infinite Recursion Causes","order":1},{"id":"seed_88a3bb92d2396f825021a246dcc252d3","title":"Debugging Recursive Functions","order":2},{"id":"seed_5a16ac86144f35718100f908657d119e","title":"Maximum Recursion Depth Considerations","order":3}]},{"id":"seed_89bd77daca96b399038980a43bab217c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"Recursive Problem-Solving Strategies","order":11,"contentType":"LEARNING","contentSlug":"recursive-problem-solving-strategies","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_9d5bfb7ed02568bac3e39efa592dbe8d","title":"Identifying Recursive Structure in Problems","order":0},{"id":"seed_3cfa7942492642e4c577d0f6dc71eff8","title":"Breaking Down Problems into Smaller Instances","order":1},{"id":"seed_8fc6efd88cd5c9b964e3150b59b6d16e","title":"Building Solutions from Smaller Solutions","order":2},{"id":"seed_745d355f8858c4971f9b2b16c684dc35","title":"Practice Problems and Patterns","order":3}]},{"id":"seed_e5b36e1e163274fba090d76b7fbcfa24","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"Binary Power Verification","order":12,"contentType":"PROBLEM","contentSlug":"binary-power-verification","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_c8777fb5843efe7cf79f97d83fce4a76","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 9: Recursion","sectionOrder":9,"title":"Tree Root-to-Leaf Paths","order":13,"contentType":"PROBLEM","contentSlug":"tree-root-to-leaf-paths","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_d6d5efcf1c12e807580ba7475fb858cf","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"The Limitation Problem — Why O(1) Access Matters","order":1,"contentType":"LEARNING","contentSlug":"the-limitation-problem","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_430c31a7d5db5af1fca6b1cb42c901d9","title":"Revisiting Array Access by Index — O(1)","order":0},{"id":"seed_a78c48c5b79865d6890670279ba5a4de","title":"Searching for a Value — O(n) or O(log n)","order":1},{"id":"seed_df3328d3e754a2aae03dbd77ad114729","title":"What If We Could Search in O(1)?","order":2},{"id":"seed_aa8ac2e2002cf296870dbc5004ea4e91","title":"The Key Insight — Use the Value to Compute the Location","order":3}]},{"id":"seed_9854d64ee5cd353cb999650dc29ebf5c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"What Is Hashing? Core Intuition","order":2,"contentType":"LEARNING","contentSlug":"what-is-hashing-core-intuition","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_59ad1fb7e5720e03d114c4b47d3caad1","title":"The Concept of a Hash Function","order":0},{"id":"seed_457fea3f83d47c3613a7f84554081d63","title":"Mapping Keys to Indices","order":1},{"id":"seed_300bc9acce8e594e7c0d84c79c393ff7","title":"From Arbitrary Data to Array Positions","order":2},{"id":"seed_01526e6aa0ca5f151cbb60c5b6b3b439","title":"The 'Magic' of Hashing Demystified","order":3}]},{"id":"seed_974f334ce9021fd3caee42dde840c011","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"Hash Functions: Properties & Design","order":3,"contentType":"LEARNING","contentSlug":"hash-functions-properties-and-design","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_ad5afd2f7ebe90879d2cd20fb2a65998","title":"Determinism — Same Input, Same Output","order":0},{"id":"seed_721ef7a0fac8db7d2edb4f5eb471ef95","title":"Uniformity — Spread Outputs Evenly","order":1},{"id":"seed_c58c772c9bb2e2426bcd49c947ac211a","title":"Efficiency — Fast to Compute","order":2},{"id":"seed_75e4756c986ac768d1138185a8df636e","title":"Common Hash Function Examples","order":3}]},{"id":"seed_250575993027f3a236c740e1b65dd2a3","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"Hash Tables — Structure & Mechanism","order":4,"contentType":"LEARNING","contentSlug":"hash-table-structure-mechanism","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_fc6bd1518655e5844127340d9af084dd","title":"What is a Hash Table","order":0},{"id":"seed_cec4feaf1167965b71e1eb4aa7b217b9","title":"Buckets and Slots","order":1},{"id":"seed_28b05f3a47b2750ecf1da87b1c3dcae3","title":"How Insertion Works","order":2},{"id":"seed_2f70fb6c6e189b63569923912ec641fb","title":"How Lookup Works","order":3}]},{"id":"seed_ee56eebd83f5a561ca446a0364fcabd1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"Collision Handling: Chaining","order":5,"contentType":"LEARNING","contentSlug":"collision-handling-chaining","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_a042f3f62f2d05aec29623eea563c60a","title":"What Happens When Two Keys Hash to the Same Index","order":0},{"id":"seed_fe09091638e80ad4f58d0a161637f901","title":"Chaining with Linked Lists","order":1},{"id":"seed_ea77073623c01cdaf319541c87cbfb0b","title":"Pros and Cons of Chaining","order":2},{"id":"seed_6c3acf9b0855fd263147bf8fc00ed1d8","title":"Performance Implications","order":3}]},{"id":"seed_95bc6695b5ce2139439e2c60de139484","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"Collision Handling — Open Addressing","order":6,"contentType":"LEARNING","contentSlug":"collision-handling-open-addressing","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_37bf1eae6c1a07fd5cbbbc21df46a788","title":"Probing Strategies — Linear, Quadratic, Double Hashing","order":0},{"id":"seed_df17fc1141a0facf7da345fa1bd859fe","title":"How Searching Works with Open Addressing","order":1},{"id":"seed_9eeb818ef6e82cfe375a73e60fde8191","title":"Deletion Challenges with Open Addressing","order":2},{"id":"seed_1ef7c642449266ce6a4ec18b069bc760","title":"Comparison with Chaining","order":3}]},{"id":"seed_31f53e8206d2aa6d307ca144914742fd","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"Load Factor & Rehashing","order":7,"contentType":"LEARNING","contentSlug":"load-factor-and-rehashing","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_293812263c2b8a195a143652ce3d2fc1","title":"What Is Load Factor","order":0},{"id":"seed_84d4509b59da5a4630038b4b77ca4796","title":"Impact of Load Factor on Performance","order":1},{"id":"seed_582cbf650e4e60ee14f3654ee3c8e7b3","title":"When and How to Rehash","order":2},{"id":"seed_59f127001c90bc4ee33a32bd2b48978c","title":"Amortized Cost of Dynamic Resizing","order":3}]},{"id":"seed_d46a68c8c761e1be94ff0dbf86756209","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"Hash Table Operations & Amortized Cost Model","order":8,"contentType":"LEARNING","contentSlug":"hash-table-operations-amortized-cost","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_a20ab229a00504e4d98cfe4ce48d6892","title":"Hash Table Insert Operation — O(1) Average, O(n) Worst Case","order":0},{"id":"seed_27a4283d8040c1a71a2b7436e1f63cb2","title":"Hash Table Lookup Operation — O(1) Average, O(n) Worst Case","order":1},{"id":"seed_2570889e8d537bed740d7053aeaeafcd","title":"Hash Table Delete Operation — O(1) Average, O(n) Worst Case","order":2},{"id":"seed_71eff3d6702fe2faf427073d66ab67ea","title":"When Worst Case Matters — Production Realities of Hash Table Performance","order":3}]},{"id":"seed_a8a3df7be9bad969259f97c54c579191","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"Hash Sets vs Hash Maps","order":9,"contentType":"LEARNING","contentSlug":"hash-sets-vs-hash-maps","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_af2674dd5ccdd78fb2bfd022fef46f34","title":"Hash Set — Just Keys, No Values","order":0},{"id":"seed_530cf32e3c832d3d769c9b9d5cbaef2e","title":"Hash Map — Key-Value Pairs","order":1},{"id":"seed_d906848a78d0133418d4f3ceee5f1e90","title":"Use Cases for Each","order":2},{"id":"seed_3dde37bbd2459ea4ced79f23c38a172e","title":"Language-Specific Names (Dictionary, Map, Set)","order":3}]},{"id":"seed_5e4ef2b17b888c2d0c8549c82cab47f4","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"Common Hashing Patterns & Problem Types","order":10,"contentType":"LEARNING","contentSlug":"common-hashing-patterns","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_12cd5e3b34c983ad4bff5f1dddf64511","title":"Frequency Counting","order":0},{"id":"seed_3c321751a64f3e6299da6eed3e0f150d","title":"Two-Sum and Pair Problems","order":1},{"id":"seed_9c268293dca19d7931f62c288b48c5d6","title":"Duplicate Detection","order":2},{"id":"seed_f993da89f57f0e52968d4f2e8e02fd2d","title":"Grouping by Characteristic","order":3},{"id":"seed_12722e04aa049949c33d3bcefd630893","title":"Caching and Memoization","order":4}]},{"id":"seed_d1cb8a898a05388c59576e3da2a115aa","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"When Hashing Fails — Pathological Cases & Alternatives","order":11,"contentType":"LEARNING","contentSlug":"when-hashing-fails","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_c8d7bc980e59af8ef7bdc580350f048a","title":"Hash Collision Attacks","order":0},{"id":"seed_c3e91e05aa2832e24b76838459301290","title":"Poor Hash Function Choices","order":1},{"id":"seed_8cb04818ec3e1eae720bb9af9a97a2be","title":"Ordered Data Requirements — When to Use BST Instead","order":2},{"id":"seed_b2a0691ddcad5214ee88e174ad033ae2","title":"Space Overhead Considerations","order":3}]},{"id":"seed_5b0bc8690c1bc38c23e4794a81a4bc43","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"Anagram Clustering","order":12,"contentType":"PROBLEM","contentSlug":"anagram-clustering","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_2a343ddc8134da748992081a4862aabd","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 10: Hash Tables","sectionOrder":10,"title":"Duplicate Linked List with Arbitrary Links","order":13,"contentType":"PROBLEM","contentSlug":"duplicate-linked-list-with-arbitrary-links","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_4857b4c744f2fff1dca9d3953831d8f2","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees","sectionOrder":11,"title":"What Is a Tree? Definition & Terminology","order":1,"contentType":"LEARNING","contentSlug":"what-is-a-tree","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_0b144008cc7885c25aa081501943818e","title":"Definition — Connected Acyclic Graph","order":0},{"id":"seed_9e7deb6b4fb5c534c2a49b0a29e714c2","title":"Root, Parent, Child, Sibling, Ancestor, Descendant","order":1},{"id":"seed_858e44ba6f605b586b5c7a70acc3b494","title":"Leaf Nodes and Internal Nodes","order":2},{"id":"seed_528bfede36f72f5d6978b7d0fb112309","title":"Subtrees and Tree Structure Recursion","order":3}]},{"id":"seed_ce3c1c32ea6bf85fe5d37bf0fae716fe","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees","sectionOrder":11,"title":"Binary Trees — Structure & Representation","order":2,"contentType":"LEARNING","contentSlug":"binary-trees-structure-representation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_4ce12fffa8b16e8ce2b2de0be144f345","title":"What is a Binary Tree","order":0},{"id":"seed_6695107818f61f8fb76746fc473bd918","title":"At Most Two Children Per Node","order":1},{"id":"seed_3645d305e4ad47333d0e7a7897de7a18","title":"Left and Right Child Distinction","order":2},{"id":"seed_1a58b35e3d7acd427410c844078fc5eb","title":"Node-Based Representation in Code","order":3}]},{"id":"seed_960a98b48958c887000cd94fd350f46f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees","sectionOrder":11,"title":"Recursive Tree Algorithms","order":3,"contentType":"LEARNING","contentSlug":"recursive-tree-algorithms","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_fdb008dc5c1496566fa535a1371ea17e","title":"Why Trees and Recursion Fit Naturally","order":0},{"id":"seed_99bc5dd7274653b0bfa74c4c12ae6c6d","title":"Recursive Structure of Trees","order":1},{"id":"seed_867ba5f6512c955627aad6fb2c8e447c","title":"Computing Height, Size, and Properties Recursively","order":2},{"id":"seed_7a0a712f5c784fc11eb844c8fcac1125","title":"Thinking with Subtrees","order":3}]},{"id":"seed_8057739a78818e8057389c7d405df0e6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees","sectionOrder":11,"title":"Tree Construction & Serialization","order":4,"contentType":"LEARNING","contentSlug":"tree-construction-serialization","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_57d6f340db69b8019cb7ed55a637419f","title":"Building Trees from Traversal Sequences","order":0},{"id":"seed_fce0c92b40d132f1bf608da42aac6ab9","title":"Unique Reconstruction Conditions","order":1},{"id":"seed_184c01efb63dc3759c039608c6091577","title":"Serializing Trees to Strings","order":2},{"id":"seed_e16e96342680547171b706e0675940a5","title":"Deserializing Strings to Trees","order":3}]},{"id":"seed_cb1ce4cc8ce58d8e3219f51e6f274507","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees","sectionOrder":11,"title":"Common Tree Patterns & Problem Types","order":5,"contentType":"LEARNING","contentSlug":"common-tree-patterns","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_f7ee7b16f0932fd89288611c9a237160","title":"Path Sum Problems","order":0},{"id":"seed_5b9009ea26cd6c2035584b54397661ae","title":"Lowest Common Ancestor (LCA)","order":1},{"id":"seed_c9ec27fa596daa961c91d92e2510f668","title":"Tree Symmetry and Comparison","order":2},{"id":"seed_1fdf74ebb0e08f043f237adc59dfb453","title":"Diameter of a Tree","order":3},{"id":"seed_64092ce5e3f603e7fb98f00ddb608b47","title":"Maximum Depth and Width","order":4}]},{"id":"seed_15657fae45c408f612eae20f510a3b44","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees","sectionOrder":11,"title":"N-ary Trees & General Tree Structures","order":6,"contentType":"LEARNING","contentSlug":"nary-trees-general-structures","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_5de840f500918987eb27cd5dcc0171c8","title":"Beyond Binary — Multiple Children","order":0},{"id":"seed_681fe280c3391d49e0cb38a8e7dee30f","title":"N-ary Tree Representation","order":1},{"id":"seed_f5fd7772bb55e5761c4e79717582cae9","title":"Traversals for N-ary Trees","order":2},{"id":"seed_dd04efb6d0e7f825a5ff16ead651d5e0","title":"Use Cases — File Systems, Expression Trees, and Beyond","order":3}]},{"id":"seed_a155191d52f63cc021dabdadd3f477c5","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees Hierarchical Data Structures","sectionOrder":12,"title":"Why Trees? Limitations of Linear Structures","order":1,"contentType":"LEARNING","contentSlug":"why-trees-limitations-of-linear-structures","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_601479d8018d9f8b0d9ebea18bf9bc3e","title":"When Linear Structures Fall Short","order":0},{"id":"seed_2b59e9b75e5823893e3f5742408eb855","title":"Hierarchical Data Examples: File Systems, Org Charts, HTML DOM","order":1},{"id":"seed_779fd01123447504bd4dd36f25e8de56","title":"The Need for Parent-Child Relationships","order":2},{"id":"seed_b53f636b7d70bb46f220328fcd3d398a","title":"Why Trees Unlock New Problem Categories","order":3}]},{"id":"seed_edaf4def2b1a62c78b8b5b67be1aa4e2","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees Hierarchical Data Structures","sectionOrder":12,"title":"Tree Properties — Height, Depth, Levels","order":2,"contentType":"LEARNING","contentSlug":"tree-properties-height-depth-levels","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_eab2b0e02c33b824fa6b98f822bf5c37","title":"Depth of a Node — Distance from Root","order":0},{"id":"seed_496f69cba4054b28a3cc4d12063f6e0e","title":"Height of a Node — Distance to Deepest Descendant","order":1},{"id":"seed_6181636917f43ff0e361aa7b92b64d49","title":"Height of the Tree — The Critical Metric","order":2},{"id":"seed_7ff069eabaad6a2f9ef2ea0ea549371f","title":"Levels and Level-Based Thinking","order":3}]},{"id":"seed_050c2f27cd1a0141aceeaf233c5a4312","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees Hierarchical Data Structures","sectionOrder":12,"title":"Tree Traversals — Inorder, Preorder, Postorder","order":3,"contentType":"LEARNING","contentSlug":"tree-traversals-inorder-preorder-postorder","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_fce4fd020f1af1b6b76717e62e2c820c","title":"What is Tree Traversal","order":0},{"id":"seed_3ecbad939fe885ff72cc4703abb83d42","title":"Preorder Traversal — Root → Left → Right","order":1},{"id":"seed_8163e408d096845ba08de44542d1d010","title":"Inorder Traversal — Left → Root → Right","order":2},{"id":"seed_8c937a57488c073ae37c8494dd4ec0b2","title":"Postorder Traversal — Left → Right → Root","order":3},{"id":"seed_e7d11ce047edee9a462aacfefc11a7b1","title":"Use Cases for Each Traversal Order","order":4}]},{"id":"seed_20bd2ded6e638213c1ef8978d8d6d46c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees Hierarchical Data Structures","sectionOrder":12,"title":"Level-Order Traversal — BFS on Trees","order":4,"contentType":"LEARNING","contentSlug":"level-order-traversal-bfs-on-trees","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_dd3ab6fcd79b454b42a13a9b0dd4da40","title":"What is Level-Order Traversal","order":0},{"id":"seed_c8d694fafa72f414806bf10fb06c06f9","title":"Using a Queue for Traversal","order":1},{"id":"seed_8a374184d1bd2123fad96a203c23cff7","title":"Processing Nodes Level by Level","order":2},{"id":"seed_1fa7073a44e78fcc9e592f032962cccd","title":"Applications: Shortest Path in Unweighted Trees","order":3}]},{"id":"seed_05f265eeb0dfed1fd7e0980327e6404b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees Hierarchical Data Structures","sectionOrder":12,"title":"Layer-by-Layer Binary Tree Values","order":5,"contentType":"VISUALIZER","contentSlug":"layer-by-layer-binary-tree-values","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_5fb8e6de8606b084de49b5e7935104ae","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees Hierarchical Data Structures","sectionOrder":12,"title":"Layer-by-Layer Binary Tree Values","order":6,"contentType":"PROBLEM","contentSlug":"layer-by-layer-binary-tree-values","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_ab41cf44e1ead2b2535328535b594742","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees Hierarchical Data Structures","sectionOrder":12,"title":"Aggregate Path Numbers in Binary Tree","order":7,"contentType":"PROBLEM","contentSlug":"aggregate-path-numbers","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_2e121b410eb1ba14677adbcaae3a4a3a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 11: Trees Hierarchical Data Structures","sectionOrder":12,"title":"Rightmost Level Nodes","order":8,"contentType":"PROBLEM","contentSlug":"rightmost-level-nodes","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_3dd93c5f36ee7b45683792d91f4ab9d7","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"What Is a Binary Search Tree (BST)?","order":1,"contentType":"LEARNING","contentSlug":"what-is-bst","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_1c79baa8c71d7832cfea47e55ea4fdc1","title":"Definition of a BST","order":0},{"id":"seed_bbeba7f48303ea71fe942873a62d74dd","title":"The BST Property: left < root < right","order":1},{"id":"seed_b9bc4b8c9d8821bb42e65ee57d819339","title":"Why This Ordering Enables Efficient Operations","order":2},{"id":"seed_beafe3d5bba8ca10d8605cda76e05794","title":"BST vs Binary Tree","order":3}]},{"id":"seed_92d367431efe0e48a0395a842ac31034","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"The BST Property & Its Power","order":2,"contentType":"LEARNING","contentSlug":"bst-property-power","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_eed1569872b3efc1509c2ebe9fe4113f","title":"How the Property Enables Binary Search","order":0},{"id":"seed_90cd9bf035ae5df676c63f0ea10edee8","title":"Why Every Subtree is Also a BST","order":1},{"id":"seed_57768413f2469d8757a93a6b1390a8b3","title":"Invariant Thinking for BSTs","order":2},{"id":"seed_df58c475d7be22045c6ece779eb01a0c","title":"What Breaks the BST Property","order":3}]},{"id":"seed_6a640c4e06b5a406b2eaf33025387fde","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"BST Search Operation","order":3,"contentType":"LEARNING","contentSlug":"bst-search-operation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_44342f02169fc90f4ce63a4804edab38","title":"Searching for a Value in a BST","order":0},{"id":"seed_0071b11ea5038fa30d22f25ee7e4e51e","title":"Algorithmic Steps","order":1},{"id":"seed_f02442ad16281205163924bb6e5b83e5","title":"Time Complexity: O(h)","order":2},{"id":"seed_785e8dc963cfdcc8a3258f646dd238bb","title":"Why Height Matters","order":3}]},{"id":"seed_d6aa91371e334271b04531d1352ffec9","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"BST Insertion Operation","order":4,"contentType":"LEARNING","contentSlug":"bst-insertion","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_3a48b1ca1f466f2a6ea5daf491cdb720","title":"Inserting a Value While Maintaining Order","order":0},{"id":"seed_3b90b44d465b2861038f3d6d337abaeb","title":"Finding the Correct Position","order":1},{"id":"seed_16c1a5ed08d4672b50b1be74706647f5","title":"Algorithmic Steps","order":2},{"id":"seed_71506b74fca9ac405e5827077fd77f91","title":"Time Complexity: O(h)","order":3}]},{"id":"seed_920c11e41491f80f090838aa95f6f4a8","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"BST Deletion Operation — The Complete Guide","order":5,"contentType":"LEARNING","contentSlug":"bst-deletion-operation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_a63c320adada0ea9307e33d84a681064","title":"Introduction to BST Deletion — The Three Cases","order":0},{"id":"seed_cf610ba48e34a037c33adc2474214449","title":"Inorder Successor and Predecessor Replacement","order":1},{"id":"seed_5dbafc16e299eb563d6f0fecd7f61562","title":"Maintaining the BST Property After Deletion","order":2},{"id":"seed_6683e43968983045475537a80963f399","title":"Time Complexity Analysis — O(h)","order":3}]},{"id":"seed_3cd2d257466b1520fba526b163da448d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"BST Time Complexity Analysis","order":6,"contentType":"LEARNING","contentSlug":"bst-time-complexity-analysis","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_9f29c5cdbb71f114186dce6c0957c917","title":"Best Case — Balanced Tree, O(log n)","order":0},{"id":"seed_a3eebb1cb26c3f6378d215d49dc7ce77","title":"Worst Case — Degenerate Tree, O(n)","order":1},{"id":"seed_e57dd103b628c319476da856ce434876","title":"Average Case Considerations","order":2},{"id":"seed_dac14b59040b920d7f393806adc880a1","title":"Why Balance Matters So Much","order":3}]},{"id":"seed_6ec8c6961d846b57f9381f90d0e56ae9","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"The Balance Problem — Degenerate BSTs","order":7,"contentType":"LEARNING","contentSlug":"bst-balance-problem","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_cfa0afd4f50f34565fa774035c5b81ae","title":"What Is a Degenerate (Skewed) Tree","order":0},{"id":"seed_791bcc13a96240128557132b7b7b55e2","title":"How Insertion Order Affects Shape","order":1},{"id":"seed_5152a88a3d7d7e5f56af78693b2d61b5","title":"Worst-Case Degradation to Linked List","order":2},{"id":"seed_cc73e41f08873b9b91f12e8de6e4b60a","title":"Motivation for Self-Balancing Trees","order":3}]},{"id":"seed_d0bf08acd360a770ea2b478668a2a227","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"Inorder Traversal & Sorted Output","order":8,"contentType":"LEARNING","contentSlug":"bst-inorder-traversal-sorted-output","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_2cbfe13e42fac803a5e7db9fbcd73274","title":"Inorder Traversal of BST Produces Sorted Order","order":0},{"id":"seed_83b9fbf686362e2d618633c820b3b728","title":"Why This Is True — Proof by Invariant","order":1},{"id":"seed_dce635bf738dbe28f301b79eef9b7621","title":"Applications: K-th Smallest, Range Queries","order":2},{"id":"seed_74e6a76976af6d5ab53d3464021a82d1","title":"Sorted Iteration Without Explicit Sorting","order":3}]},{"id":"seed_c8b75c39a5bfa2e0faba8750f8088d67","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"Common BST Patterns & Problem Types","order":9,"contentType":"LEARNING","contentSlug":"common-bst-patterns","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_54b2058790999608fdd4213bdfe048b1","title":"Validating a BST","order":0},{"id":"seed_9474058ad52855b6ead36f40fcd2e10b","title":"Finding Floor and Ceiling","order":1},{"id":"seed_36b1bce4787484e46222ec5c7852d841","title":"Range Queries in BST","order":2},{"id":"seed_3086bef33cdaa962aea33881750f189b","title":"Converting Sorted Array to BST","order":3},{"id":"seed_926265ffd5676102c7a304eab4b8069a","title":"Balancing an Existing BST","order":4}]},{"id":"seed_5bd75643c2325ae0224d05cea0324385","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"BST Variants & Extensions","order":10,"contentType":"LEARNING","contentSlug":"bst-variants-extensions","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_7faf386437db48bef3b9753ffa5072e0","title":"BST with Duplicate Handling","order":0},{"id":"seed_ac68a0f11c42f1a69a2efffa08d5c16e","title":"Order Statistics Trees (Conceptual)","order":1},{"id":"seed_fcb8d8e79ae65ec99eeb2c8f97f8f245","title":"Augmented BSTs","order":2},{"id":"seed_a5898f61698f50636e57f0e8b449ade5","title":"Connection to Other Balanced Trees","order":3}]},{"id":"seed_440c9e8e53e7d615451ee18db116a35e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"Smallest Value Gap in Binary Search Tree","order":11,"contentType":"VISUALIZER","contentSlug":"smallest-value-gap-in-binary-search-tree","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_788176cee356968f900e7c3b310d6b04","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"Smallest Value Gap in Binary Search Tree","order":12,"contentType":"PROBLEM","contentSlug":"smallest-value-gap-in-binary-search-tree","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_d73250fa23f86ee1d96568318a3522cf","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 12: Binary Search Trees","sectionOrder":13,"title":"BST Rank Finder","order":13,"contentType":"PROBLEM","contentSlug":"bst-rank-finder","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_a8a015e3626bca9c5848b605327a0e14","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 13: Balanced Search Trees","sectionOrder":14,"title":"Why Balance Matters — Motivation","order":1,"contentType":"LEARNING","contentSlug":"balanced-trees-why-balance-matters","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_0fb2fa365cad348c75fb59bc49f6f939","title":"Revisiting the Degenerate BST Problem","order":0},{"id":"seed_172e7e4324a72620fedae3c21b92b18f","title":"Why O(n) Worst Case is Unacceptable","order":1},{"id":"seed_878992984d2dffd6d42b08700309dba5","title":"The Goal — Guaranteed O(log n)","order":2},{"id":"seed_7fca96df171d66b690ffe678852f537d","title":"Self-Balancing as Automatic Maintenance","order":3}]},{"id":"seed_5bcdf0227abde1db6bac54aeb0ec13dc","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 13: Balanced Search Trees","sectionOrder":14,"title":"Height-Balanced Trees — Concept & Invariants","order":2,"contentType":"LEARNING","contentSlug":"height-balanced-trees","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_5bd2d675bea85afa3a1da88e43a10a9a","title":"Definition of Height Balance","order":0},{"id":"seed_96f486f33275c28ca0b5939343dece34","title":"Balance Factor Concept","order":1},{"id":"seed_3aafa73cd3bd8a40bba0ff93ea84ab56","title":"What Invariants Balanced Trees Maintain","order":2},{"id":"seed_31df13bec990286f7216b03c859f8fda","title":"How Invariants Guarantee Height Bounds","order":3}]},{"id":"seed_3178dd74c3074857971c1ec07fee3aaa","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 13: Balanced Search Trees","sectionOrder":14,"title":"AVL Trees — Rotations & Balancing","order":3,"contentType":"LEARNING","contentSlug":"avl-trees-rotations-balancing","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_b7ecc1c766fd1cc66a959e9805ddd7b4","title":"What is an AVL Tree","order":0},{"id":"seed_0262df18e2afa34736adf91d8711cf49","title":"Balance Factor — Height Difference Analysis","order":1},{"id":"seed_edf173622dce7f51b149b886d1515e52","title":"Single and Double Rotations","order":2},{"id":"seed_87ac44af89976e1031f2524ecdbac3c7","title":"How Rotations Restore Balance","order":3},{"id":"seed_bba1d4fcf39bad71f7334530b11a527a","title":"Time Complexity of AVL Operations","order":4}]},{"id":"seed_07408caed080b87b5f5d6f09106e4941","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 13: Balanced Search Trees","sectionOrder":14,"title":"Red-Black Trees — Conceptual Overview","order":4,"contentType":"LEARNING","contentSlug":"red-black-trees-conceptual-overview","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_fe5c22a201bc3d3698c228bd0fbf3de3","title":"What is a Red-Black Tree","order":0},{"id":"seed_f2b03cba20163a8615cb035fd20c85b5","title":"The Five Red-Black Properties","order":1},{"id":"seed_584b4305e6b48b46d24853c40baffca2","title":"Why Red-Black Trees Are Often Preferred in Practice","order":2},{"id":"seed_3d36eb70fbae0ec97a17eea93e824cda","title":"Comparison with AVL Trees","order":3}]},{"id":"seed_ec4ef5fb0429c365ddd396c7a3d6fb68","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 13: Balanced Search Trees","sectionOrder":14,"title":"2-3 Trees & B-Trees — Conceptual Introduction","order":5,"contentType":"LEARNING","contentSlug":"2-3-trees-and-b-trees","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_58389989884119e3045ea50c214688e7","title":"Beyond Binary — Multi-Way Search Trees","order":0},{"id":"seed_7babc76436dfd0cbd20756b07450a879","title":"2-3 Trees as a Simpler Model","order":1},{"id":"seed_d9a8315c830f3cf20079ee46f5190e62","title":"B-Trees for Disk-Based Storage","order":2},{"id":"seed_29c0d4ca21830f88d07f2b925eadc68f","title":"Why Databases Use B-Trees","order":3}]},{"id":"seed_34492f1ec7ca178537272c7e3f6a044c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 13: Balanced Search Trees","sectionOrder":14,"title":"Balanced Tree Operations & Guarantees","order":6,"contentType":"LEARNING","contentSlug":"balanced-tree-operations","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_9d9f33e3717e8293adef5056c63d4c26","title":"Insert with Rebalancing","order":0},{"id":"seed_1c5030bdf24a85f5343cd4a496dda233","title":"Delete with Rebalancing","order":1},{"id":"seed_bb3188b7dbdfd147f9bf992a8b3093c4","title":"Search (Unchanged from BST)","order":2},{"id":"seed_68abccc3ddebdbe3942d7c6ddf1d516e","title":"Guaranteed O(log n) for All Operations","order":3}]},{"id":"seed_2da1f964846ef177f53361d7392d1c6f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 13: Balanced Search Trees","sectionOrder":14,"title":"Self-Balancing Trees in Practice","order":7,"contentType":"LEARNING","contentSlug":"self-balancing-trees-in-practice","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_31d3cc38e76a32370f56092e6942cd3c","title":"Standard Library Implementations","order":0},{"id":"seed_df5d3fef441eaf13926f8aa1945ddc93","title":"Trade-offs Between Tree Types","order":1},{"id":"seed_886b07678b1d10919976a9fecfa0165e","title":"When to Use Library Trees vs Custom Implementation","order":2},{"id":"seed_93835a6ba0cfcb1c650ba68457c23fed","title":"Real-World Applications","order":3}]},{"id":"seed_7f62edb3e4ee48ea25aceb63a3095d7f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 13: Balanced Search Trees","sectionOrder":14,"title":"When to Use Balanced Trees vs Hash Tables","order":8,"contentType":"LEARNING","contentSlug":"balanced-trees-vs-hash-tables","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_dc3f1bc5f5e4acb6578530b8e3c04075","title":"Ordered vs Unordered Access","order":0},{"id":"seed_2ee78592f11d797df074c93ebdc524e6","title":"Range Queries and Iteration","order":1},{"id":"seed_b6a88576d3c82d518a1a73ee934d362e","title":"Worst-Case Guarantees","order":2},{"id":"seed_17c2336a30cf077243e0264c6e295189","title":"Memory Overhead Comparison","order":3}]},{"id":"seed_f8fc19670c47b20cba220dc3afb75d72","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Priority Queues Revisited — Now with Implementation","order":1,"contentType":"LEARNING","contentSlug":"priority-queues-revisited","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_dbd7b5ceac9de89ddd84a33fa0dee42c","title":"Recalling Priority Queues from Chapter 8","order":0},{"id":"seed_2bcc9975f0a645a3d1bd803bd87e88ef","title":"Interface: insert, extractMax/extractMin","order":1},{"id":"seed_7eaca6102ce1eb20e3bae40077e63d7c","title":"Why Naive Implementations Are Insufficient","order":2},{"id":"seed_8c9420021456f8d57f18ac9728847529","title":"The Heap as an Efficient Implementation","order":3}]},{"id":"seed_be434bbd4790118206b208824e0f57f4","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Complete Binary Trees — The Foundation of Array-Based Heaps","order":2,"contentType":"LEARNING","contentSlug":"complete-binary-tree-representation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_bae04fbf372e9adf0b798ce722c80bab","title":"What is a Complete Binary Tree","order":0},{"id":"seed_80dcb5feba6126beb2de975cf77a0548","title":"Level-by-Level Filling","order":1},{"id":"seed_da15e5eba4bd215f31bd9ec3a01e927d","title":"Why Completeness Enables Array Storage","order":2},{"id":"seed_e50d02618d26659052f068b8d27cb9f4","title":"Height Guarantees — O(log n)","order":3}]},{"id":"seed_d98892eab7c3a52deff7ffbaee2bb00e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Array-Based Heap Implementation","order":3,"contentType":"LEARNING","contentSlug":"array-based-heap-implementation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_b2f8c01637362f17f4d8396a86bdcbea","title":"Implicit Tree Structure in an Array","order":0},{"id":"seed_1dd576ce9197a0a1cdf7b5698b1427ca","title":"Parent and Child Index Formulas","order":1},{"id":"seed_f44b8dec8649ec5d3c8264ae28677635","title":"No Pointers Needed","order":2},{"id":"seed_a6b2f61b0b88892a8f40f4330dcd390d","title":"Memory Efficiency and Cache Locality","order":3}]},{"id":"seed_9a042880a113ac091ae21d4617378ab8","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Heap Operations — Insert & Extract","order":4,"contentType":"LEARNING","contentSlug":"heap-operations-insert-and-extract","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_ff5097215e34eaa453054b33fadc270b","title":"Insert Operation — Add at End, Bubble Up (Heapify Up)","order":0},{"id":"seed_3efcee9725446bfaab38136a4a1275cd","title":"ExtractMax/ExtractMin — Remove Root, Bubble Down (Heapify Down)","order":1},{"id":"seed_b7d21ce8c74498568ef7bcadef55742d","title":"Time Complexity — O(log n) for Both Insert and Extract","order":2},{"id":"seed_3062645c98ea12323bd446003d78b9bb","title":"Maintaining the Heap Property","order":3}]},{"id":"seed_611895eb8bb1110d9163be084c7a3990","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Heapify — Building a Heap Efficiently","order":5,"contentType":"LEARNING","contentSlug":"heapify-building-a-heap-efficiently","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_c007e80e7706e2633549508c616f572e","title":"Building a Heap from an Array","order":0},{"id":"seed_06766209f0779d800eec1e148b909061","title":"Naive Approach — N Insertions, O(n log n)","order":1},{"id":"seed_fb9eb394398bab9a62a8c5a7fb4f18f9","title":"Optimal Approach — Bottom-Up Heapify, O(n)","order":2},{"id":"seed_20773f7f7d35ede157be974caaaffcb9","title":"Why Bottom-Up Is Faster — Analysis Intuition","order":3}]},{"id":"seed_96837e7f1bcdf90075337cb13330b5b1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Heap Time Complexity Analysis","order":6,"contentType":"LEARNING","contentSlug":"heap-time-complexity-analysis","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_fcbdd64790e3cb30285de0bd3003c300","title":"Insert Complexity — O(log n) Analysis","order":0},{"id":"seed_2cda910d22510de8e7c548e5da365f33","title":"Extract Complexity — O(log n) Analysis","order":1},{"id":"seed_e425209b9c4711a62f1148222af9a0d9","title":"Build Heap Complexity — O(n) Analysis","order":2},{"id":"seed_09c53b390d13882cb8319ae1a820e19d","title":"Why Heaps Are Efficient for Priority Queues","order":3}]},{"id":"seed_1d4ea250922c1dab1f4f82b30b337a85","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Min-Heap vs Max-Heap","order":7,"contentType":"LEARNING","contentSlug":"min-heap-vs-max-heap","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_bbbb7f707c6d8524d87a7ee6c3161180","title":"When to Use Min-Heap","order":0},{"id":"seed_cd3990da5f16b790b4930db260d55a55","title":"When to Use Max-Heap","order":1},{"id":"seed_5716001a26aa6d7384f96b510b030538","title":"Converting Between Min-Heap and Max-Heap","order":2},{"id":"seed_15c01d748a7f00b6a477c9b4b7996e1a","title":"Language-Specific Defaults","order":3}]},{"id":"seed_4a73c2e9a477a6ae62c53370410d571c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Common Heap Patterns & Problem Types","order":8,"contentType":"LEARNING","contentSlug":"common-heap-patterns","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_8b245136d7f61f10e4a1da90b3eee5ed","title":"Finding the K-th Largest/Smallest","order":0},{"id":"seed_69b9abb105a5fe13a8035d6288c7ca2a","title":"Merge K Sorted Lists","order":1},{"id":"seed_09751837d0045698ca1ab21bcefb15b6","title":"Median Maintenance","order":2},{"id":"seed_dcff8290bb52391e7b1fdfba024744ae","title":"Task Scheduling with Priorities","order":3},{"id":"seed_a099f0797a03cc47769669e02c26875e","title":"Event-Driven Simulation","order":4}]},{"id":"seed_fafd67a9de3860a6b0859ccd61eb5664","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Top-K Problems & Heap Applications","order":9,"contentType":"LEARNING","contentSlug":"top-k-problems-and-heap-applications","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_aa5716dee188a66da55a8749c96a6249","title":"Top-K Pattern with Heaps","order":0},{"id":"seed_171c22c90d30b054d6f2cd383305cb46","title":"Space-Efficient K Element Tracking","order":1},{"id":"seed_3df052493ce09444cb0b3cfd127d96a1","title":"Stream Processing with Heaps","order":2},{"id":"seed_c17876cf27520936b0b99c920c6ddef1","title":"Real-World Applications","order":3}]},{"id":"seed_71626bb08417031c4ca34715e53a5064","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Streaming Kth Highest Tracker","order":10,"contentType":"VISUALIZER","contentSlug":"streaming-kth-highest-tracker","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_ed4fe84a214dd0186313b9d39b41e0b9","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Streaming Kth Highest Tracker","order":11,"contentType":"PROBLEM","contentSlug":"streaming-kth-highest-tracker","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_86cbc16cc78ba1799ff5a717459630b8","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Find Kth Ranked Element","order":12,"contentType":"PROBLEM","contentSlug":"find-kth-ranked-element","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_4f3706fc1c19f79adeb46071e1b1a3ca","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps And Priority Queues","sectionOrder":15,"title":"Adjacent Character Separator","order":13,"contentType":"PROBLEM","contentSlug":"adjacent-character-separator","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_5dad5ef459494facedf6b9f997dfe19b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 14: Heaps Priority Queues","sectionOrder":16,"title":"What Is a Heap? Structure & Properties","order":1,"contentType":"LEARNING","contentSlug":"what-is-a-heap","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_b0e8194f037bae390659d3aa0541cd3c","title":"Definition of a Binary Heap","order":0},{"id":"seed_5cfb6a99b0d4db9ef6da6d623a2896df","title":"The Heap Property — Max-Heap vs Min-Heap","order":1},{"id":"seed_26a69f594f1137bb14c4843666bc7085","title":"Complete Binary Tree Structure","order":2},{"id":"seed_16d39f2fb5d7cc11564a64c0f1010698","title":"Why Shape Matters for Heaps","order":3}]},{"id":"seed_b27888c6bfde04bc95ca786881d416cc","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 15: Tries","sectionOrder":17,"title":"String Search Problems — Motivation for Tries","order":1,"contentType":"LEARNING","contentSlug":"string-search-problems","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_e97038c2abb104080ccc035da785363d","title":"Searching for Strings in a Collection","order":0},{"id":"seed_c3de5c83d4c73e290166df5ac918cd86","title":"Prefix Matching Requirements","order":1},{"id":"seed_70bcc5eec951270d45d383577f84eb75","title":"Limitations of Hash Tables for Prefix Queries","order":2},{"id":"seed_fee5d369bddaade3a35aa80fdb46a24e","title":"Why a Specialized Structure Helps","order":3}]},{"id":"seed_d3c526857682c7c26951df7bb266b9e8","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 15: Tries","sectionOrder":17,"title":"What Is a Trie? Structure & Intuition","order":2,"contentType":"LEARNING","contentSlug":"what-is-a-trie","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_cd06bd2667ec676e19b9511add5b78dd","title":"Trie as a Prefix Tree","order":0},{"id":"seed_e0d3a40ad3e4aaa41d5822fae4befc98","title":"Shared Prefixes, Shared Paths","order":1},{"id":"seed_ef6b49d23e498f43a2ee474b1a457579","title":"Character-by-Character Navigation","order":2},{"id":"seed_d479d93147136f59ca77b9568566a978","title":"Visual Representation","order":3}]},{"id":"seed_983a4767ad51e5bef32a495e700a202a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 15: Tries","sectionOrder":17,"title":"Trie Node Representation","order":3,"contentType":"LEARNING","contentSlug":"trie-node-representation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_4cc95d283e0fdd85be3dba6fdfc01b67","title":"Node Structure — Children Map/Array and End-of-Word Flag","order":0},{"id":"seed_659a2dd00a292e3cc5de8b604d37f23c","title":"Alphabet Size Considerations","order":1},{"id":"seed_d7861097d510d3ab2e895aeb4c790814","title":"Space-Time Trade-offs in Node Design","order":2},{"id":"seed_23c332b1b6658d8df2281c7579042f14","title":"Array vs Hash Map for Children","order":3}]},{"id":"seed_b529f1662c3f4c6894e9cb75ad252036","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 15: Tries","sectionOrder":17,"title":"Trie Operations — Insert, Search, StartsWith","order":4,"contentType":"LEARNING","contentSlug":"trie-operations-insert-search-startswith","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_a56f26833054c4880191b47698c30751","title":"Insert — Create Path for Each Character","order":0},{"id":"seed_66b19b593c536e418148af6f119a5a14","title":"Search — Follow Path, Check End-of-Word","order":1},{"id":"seed_727ebe23b0b29ca525cfb537cd57634f","title":"StartsWith — Follow Path, Don't Require End-of-Word","order":2},{"id":"seed_fa1aa33215d807e06a281d7a02f6b04a","title":"Time Complexity — O(m) Where m Is String Length","order":3}]},{"id":"seed_a6225fbaba1615a527e94c2698d8fbc7","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 15: Tries","sectionOrder":17,"title":"Trie Time & Space Complexity","order":5,"contentType":"LEARNING","contentSlug":"trie-time-and-space-complexity","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_40cbd4c22b19745ced58d37f62c5746a","title":"Time Complexity — O(m) for All Operations","order":0},{"id":"seed_f8fece0a4e4dcb78c3cf859c438ad80d","title":"Space Complexity — Potentially O(n × m × Alphabet) Worst Case","order":1},{"id":"seed_5779dc6276c32fcf92b5e4ef33c82945","title":"When Space Is Problematic","order":2},{"id":"seed_55be347e4cd9f41729d546dec652f25b","title":"Trade-offs vs Hash Sets","order":3}]},{"id":"seed_0d58d320c343a004b4f754a49fe7c730","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 15: Tries","sectionOrder":17,"title":"Word Dictionary & Autocomplete Systems","order":6,"contentType":"LEARNING","contentSlug":"word-dictionary-and-autocomplete-systems","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_891298338031b1fe30971caf042f3a4d","title":"Building an Autocomplete System","order":0},{"id":"seed_acb12aa9339be0f51d2b2d73efe6bf33","title":"Suggesting All Words with a Prefix","order":1},{"id":"seed_22fbe9a28fc18ce1ef73ef2eca734b38","title":"DFS from Prefix Node","order":2},{"id":"seed_8c372aa742c6fd451cec0fa4e4db9ef7","title":"Ranking Suggestions","order":3}]},{"id":"seed_5020e6c5c7cf72d894e3eeed9e686ea3","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 15: Tries","sectionOrder":17,"title":"Common Trie Patterns & Problem Types","order":7,"contentType":"LEARNING","contentSlug":"common-trie-patterns","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_5839f70632fd777b017656f0688642a7","title":"Word Search in Grid with Trie Optimization","order":0},{"id":"seed_197336799fb6674af9d77dcc6734122b","title":"Longest Common Prefix","order":1},{"id":"seed_d33f815a276de8fe0df0226632b3d54b","title":"Word Break Problems","order":2},{"id":"seed_33cd694574a1f4457fafaaed37112d6b","title":"Spell Checkers","order":3},{"id":"seed_38d11893e343750ab11d8b8a784a7ce7","title":"IP Routing (Conceptual)","order":4}]},{"id":"seed_cd857951ac94f10ec3cbdd6afa095c60","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 15: Tries","sectionOrder":17,"title":"Compressed Tries — Patricia/Radix Trees (Conceptual)","order":8,"contentType":"LEARNING","contentSlug":"compressed-tries-patricia-radix-trees","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_2b50b257975320fd4a58e189cb1fe554","title":"What is Trie Compression","order":0},{"id":"seed_1ecc8ae00d312eb62d5b78f8b09e7c07","title":"Compacting Single-Child Chains","order":1},{"id":"seed_aabbbef139c7a3b1758c8c9802815e88","title":"Radix Trees Overview","order":2},{"id":"seed_8f0a45e80e1e9ccedcc3293f9b8853b8","title":"When Compression Helps","order":3}]},{"id":"seed_ae48e0369a209554eff2cd6b8560854b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 15: Tries","sectionOrder":17,"title":"String Segmentation","order":9,"contentType":"PROBLEM","contentSlug":"string-segmentation","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_11134c60cc01262c39b95bffb9b125c7","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 15: Tries","sectionOrder":17,"title":"Dictionary Sentence Formation","order":10,"contentType":"PROBLEM","contentSlug":"dictionary-sentence-formation","description":null,"estimatedMins":45,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_ee56984e01c6945156735038f4364bad","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Why Graphs? Real-World Networks","order":1,"contentType":"LEARNING","contentSlug":"why-graphs","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_2320cd77c7584d291955afa3bc8e5e93","title":"Relationships That Aren't Hierarchical","order":0},{"id":"seed_a1f4c6267624b2c31834a99147598351","title":"Examples — Social Networks, Road Maps, Dependencies","order":1},{"id":"seed_dcbcbd8e20e2fd8511ec4027a69026d5","title":"When Trees Aren't Enough","order":2},{"id":"seed_342e7a161b0c37585aada3ef1ae67afc","title":"The Graph as the Most General Structure","order":3}]},{"id":"seed_b5a2d327cf997f8db1ef578ac79e2b4b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"What Is a Graph? Definition & Terminology","order":2,"contentType":"LEARNING","contentSlug":"graph-definition-terminology","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_e84859920b162370cdcf09a2fa0d310f","title":"Vertices (Nodes) and Edges","order":0},{"id":"seed_341798d4fe3fe679f730d31d9d0a8c1f","title":"Formal Definition: G = (V, E)","order":1},{"id":"seed_cb4a4143b735d708eae8266c46910f2a","title":"Endpoints, Adjacency, and Neighbors","order":2},{"id":"seed_7e08eb6c099a26c23b39d4625798a8d6","title":"Self-Loops and Multi-Edges","order":3}]},{"id":"seed_09bd9ba5e2136b3930873b87b10ebaa4","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Graph Types — Directed, Undirected, Weighted","order":3,"contentType":"LEARNING","contentSlug":"graph-types","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_39900c5f4b5eb13204af69f71fe25bc5","title":"Directed Graphs — One-Way Edges","order":0},{"id":"seed_08844767eaa71447c8c6ba0ed1eaaacf","title":"Undirected Graphs — Two-Way Edges","order":1},{"id":"seed_cc1a1f48d555ba848029305702223131","title":"Weighted Graphs — Edges with Costs","order":2},{"id":"seed_e2c3be1cb66dce84529350ffcc164783","title":"Mixed and Special Graph Types","order":3}]},{"id":"seed_e17908acfcd0ef41acb19711781924c8","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Graph Representation — Adjacency Matrix","order":4,"contentType":"LEARNING","contentSlug":"graph-representation-adjacency-matrix","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_d8d840c3475a87ef5aa017567f60c225","title":"2D Array Representation","order":0},{"id":"seed_f52cc8ee4c6c351cc8090f5f3981d364","title":"Space Complexity — O(V²)","order":1},{"id":"seed_8f1928972542e3eaa876f0fcf42e30fd","title":"Edge Lookup — O(1)","order":2},{"id":"seed_f3376e5ee9aca2eb0ed5afe059cbaadb","title":"When Matrices Are Appropriate","order":3}]},{"id":"seed_0376d05c1b751ded8db6fc67e0321a68","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Graph Representation — Adjacency List","order":5,"contentType":"LEARNING","contentSlug":"graph-representation-adjacency-list","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_d7ec08c729bd868c7ccaf8c31cbc4127","title":"List of Neighbors for Each Vertex","order":0},{"id":"seed_8b140fba90acda011dd350b10cf360cb","title":"Space Complexity — O(V + E)","order":1},{"id":"seed_1c717310064d21d97f6c63eeb741e8fc","title":"Edge Lookup — O(degree) Time Complexity","order":2},{"id":"seed_b4134cfb115c1ac627a76154349c7f00","title":"When Lists Are Appropriate","order":3}]},{"id":"seed_cd4175bc0590e7a7032db8b3d4ae7268","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Graph Representation Trade-offs","order":6,"contentType":"LEARNING","contentSlug":"graph-representation-tradeoffs","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_e9d8300892280248f73402cf369143b6","title":"Space Comparison — Matrix vs List","order":0},{"id":"seed_945124270b1b80a5b40bc0aca8081759","title":"Time Comparison for Common Operations","order":1},{"id":"seed_a628875429f27ca0b40a93de045416d6","title":"Sparse vs Dense Graphs","order":2},{"id":"seed_1b43d3d34a0cf258f0b15a70287961c3","title":"Choosing the Right Representation","order":3}]},{"id":"seed_6303a37730125b6a899a615ca7c81e93","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Graph Properties — Connectivity, Cycles, Degree","order":7,"contentType":"LEARNING","contentSlug":"graph-properties","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_9005f58786c2555916f6bf71c09f8e17","title":"Connected vs Disconnected Graphs","order":0},{"id":"seed_92e37251a5df3e4169d4431cc14fec27","title":"Paths and Cycles","order":1},{"id":"seed_2d3984514bdd0220a176314855dc90ee","title":"Degree of a Vertex (In-Degree, Out-Degree)","order":2},{"id":"seed_aa94abf03d8eebc395780fc4dba92c48","title":"Complete Graphs and Subgraphs","order":3}]},{"id":"seed_be02d56047bbe40184523ec74ad8f819","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Trees as Special Graphs","order":8,"contentType":"LEARNING","contentSlug":"trees-as-special-graphs","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_c16c9ed0eda4f7b1bf4344477249a997","title":"A Tree is a Connected Acyclic Graph","order":0},{"id":"seed_f4f4538f888491c7d2bccbbc5526d5e9","title":"Rooted vs Unrooted Trees","order":1},{"id":"seed_51fdfd690579bc750ecaa01543cd518f","title":"Tree Properties in Graph Terms","order":2},{"id":"seed_c29ab5acd817199c64e369ce9ba05fcd","title":"Forest: Multiple Disconnected Trees","order":3}]},{"id":"seed_634dd69b7179703868265f39d3962e89","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Common Graph Modeling Patterns","order":9,"contentType":"LEARNING","contentSlug":"common-graph-modeling-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_cbd3feea5a7fc4c0c8a2e228659951ef","title":"Converting Problems to Graphs","order":0},{"id":"seed_c9b938f22bd821103f3f663dace04cac","title":"Implicit Graphs (State Space)","order":1},{"id":"seed_80888c56198e44dd1d77332a7a06aa92","title":"Grid as Graph","order":2},{"id":"seed_797ccce929bcb1cfbdc14ed2b80b98b0","title":"Modeling Dependencies and Constraints","order":3}]},{"id":"seed_4cb87105d1cf017d678fdf9e032f68f6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Introduction to Graph Algorithms","order":10,"contentType":"LEARNING","contentSlug":"intro-to-graph-algorithms","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_adff988138ca5720186f0413eea4a480","title":"Overview of Upcoming Algorithms","order":0},{"id":"seed_2c40b18e5880523bf53b60e21e27b2de","title":"Traversal — BFS and DFS","order":1},{"id":"seed_c2cb5b568d2ad37e5639a14a35501ff8","title":"Shortest Paths — Dijkstra and Bellman-Ford","order":2},{"id":"seed_4f0f7259e6a1edd945ad76c902a439a9","title":"Minimum Spanning Trees — Prim and Kruskal","order":3},{"id":"seed_8091c8c93a27f6bd82ec8e7d06b7f234","title":"What's Next in Chapter 23-24","order":4}]},{"id":"seed_25bb2e8b5415253b3c1868a9490a3f73","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Count Connected Landmasses","order":11,"contentType":"VISUALIZER","contentSlug":"count-connected-landmasses","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_620cae0ca8d40eba680512b8d15fbd48","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Deep Copy Network","order":12,"contentType":"PROBLEM","contentSlug":"deep-copy-network","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_e1cbe167ba313e56ac9b143e98eedb63","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 16: Graphs","sectionOrder":18,"title":"Count Connected Landmasses","order":13,"contentType":"PROBLEM","contentSlug":"count-connected-landmasses","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_d73a4e35cfacaebb23ce2765ec9a83c8","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"The Search Problem — Formalization","order":1,"contentType":"LEARNING","contentSlug":"search-problem-formalization","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_7c31d1ba65db0d65ee159a6f24ba72d1","title":"Defining the Search Problem Precisely","order":0},{"id":"seed_30aea5cfec0d5b6d3b65fb1524063dc3","title":"Search Space and Target","order":1},{"id":"seed_d1cb693ae124ccc235ad19ee7431b34f","title":"Existence vs Location vs All Occurrences","order":2},{"id":"seed_2831a9bb411d9135d6221ec01ac5e7c8","title":"Success and Failure Conditions","order":3}]},{"id":"seed_1c7d3f00fed06ed61d390302bcb4d1ea","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Linear Search — The Baseline Search Algorithm","order":2,"contentType":"LEARNING","contentSlug":"linear-search-baseline","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_842efe723ee138832262d00acc458cea","title":"The Simplest Search Algorithm","order":0},{"id":"seed_3b44c5c8b86c93016762ca8c4126312a","title":"Algorithmic Steps","order":1},{"id":"seed_12a66329a6f4ea81dca7d9f749e30827","title":"Time Complexity — O(n)","order":2},{"id":"seed_be0d4c13c39aad0cb060f7cc937502dd","title":"When Linear Search Is Acceptable","order":3}]},{"id":"seed_0441c25f2e21af90b7f2ab5b4e854318","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Binary Search — Core Algorithm","order":3,"contentType":"LEARNING","contentSlug":"binary-search-core-algorithm","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_d6468c6a55f5df4ae81f22ad8a5e1d63","title":"Prerequisite — Sorted Data","order":0},{"id":"seed_696cbd8084785ad881d91a6d54ada2a1","title":"The Divide-and-Eliminate Strategy","order":1},{"id":"seed_69d9dda4e0ce40b7d1b11ba80f1debc2","title":"Algorithmic Steps — Iterative and Recursive","order":2},{"id":"seed_6573ab4638fb00619216b77cd193b93a","title":"Time Complexity — O(log n)","order":3}]},{"id":"seed_cbaf1c318052d5255fec68f0d024ee21","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Binary Search Variations & Edge Cases","order":4,"contentType":"LEARNING","contentSlug":"binary-search-variations","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_dbe0e6719e15bda98aa1b096249f6a8b","title":"Finding First Occurrence","order":0},{"id":"seed_2fb7406306e4cf4d332a6150814aef22","title":"Finding Last Occurrence","order":1},{"id":"seed_7ca71fbe222cafdc8cb8bde13dce21ce","title":"Finding Insertion Position","order":2},{"id":"seed_32ae5ae4520533e7c823111e8537e09c","title":"Handling Duplicates Correctly","order":3},{"id":"seed_fab6cff794f2f6174e413070ed8e88df","title":"Off-by-One Errors and How to Avoid Them","order":4}]},{"id":"seed_26c868e59b097b51270fa329ccc9f544","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Binary Search on Answer Space","order":5,"contentType":"LEARNING","contentSlug":"binary-search-on-answer-space","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_aed76c65cb1d5b4e52c60b6f97dd7fb9","title":"When the Search Target Is an Answer, Not an Element","order":0},{"id":"seed_1504ac3e7cbc70dc2de82b39f2e42b87","title":"Monotonic Functions and Decision Problems","order":1},{"id":"seed_26be73aa76eb6c203850bc65ee7fbfd1","title":"Minimizing the Maximum / Maximizing the Minimum","order":2},{"id":"seed_849a8afc770e5788e7ea56afdae34dcd","title":"Classic Problems — Capacity to Ship, Split Array","order":3}]},{"id":"seed_ece15e4cd7b5f47a7e52fb655ec30566","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Search in Rotated Arrays","order":6,"contentType":"LEARNING","contentSlug":"search-in-rotated-arrays","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_fbdfda811d61a7a26dc606c968145d75","title":"Identifying the Sorted Portion","order":0},{"id":"seed_cd988168be773f2a1fc38d5cddaeaebc","title":"Modified Binary Search Strategy","order":1},{"id":"seed_2f73391dbef432969a9795faed9c0853","title":"Handling Duplicates in Rotated Arrays","order":2},{"id":"seed_062477c7726063301203bf1c06a8051f","title":"Time Complexity Analysis","order":3}]},{"id":"seed_20d10beaed510af721397e63cd462d6e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Search Space Reduction Patterns","order":7,"contentType":"LEARNING","contentSlug":"search-space-reduction-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_a98ab615b3ded68418f3769ffc552ebf","title":"Eliminating Impossible Regions","order":0},{"id":"seed_ea192d8f6b0b03a5802bf83e3ec3b8b7","title":"Maintaining Invariants During Search","order":1},{"id":"seed_66bcdd540062bf1d3bd2b14262151ea2","title":"Half-Interval Elimination","order":2},{"id":"seed_e001987d3cdf8bb04425a991d92fac2d","title":"General Problem-Solving with Search Reduction","order":3}]},{"id":"seed_6a4bca0c588a77ca5241c81a0eb3b6f1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Ternary Search — Finding Extrema in Unimodal Functions","order":8,"contentType":"LEARNING","contentSlug":"ternary-search","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_4938f82ef4bb7378c5784cf258839120","title":"When Binary Search Doesn't Apply","order":0},{"id":"seed_3dabc4b4ecaf7831900282520179412d","title":"Unimodal Functions","order":1},{"id":"seed_20cbf46fd6945cf50144cd94aea0a8df","title":"Finding Maximum/Minimum of Unimodal Functions","order":2},{"id":"seed_078046ee82aa6d8cd79fabd5ab429018","title":"Comparison with Binary Search","order":3}]},{"id":"seed_678a4667c12f3a2d832463f166888057","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Interpolation Search — Intelligent Probing Based on Value Distribution","order":9,"contentType":"LEARNING","contentSlug":"interpolation-search","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_1344ac256d613e9abfc756beaeebe14b","title":"Using Value Distribution for Better Guesses","order":0},{"id":"seed_3f4b9acd9aad992515f53691bec7fe3d","title":"When Interpolation Beats Binary Search","order":1},{"id":"seed_9ad50a5c5cf5114307530a8e19d90b89","title":"Worst-Case Degradation to O(n)","order":2},{"id":"seed_b674bcd03f99f5b015575336ba885422","title":"Practical Applicability","order":3}]},{"id":"seed_707b3c0a50b78b7066f62276107372e3","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Searching in 2D Matrices","order":10,"contentType":"LEARNING","contentSlug":"searching-in-2d-matrices","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_136afe7cba5b5e3120b4a1c4d94339d2","title":"Row-sorted and Column-sorted Matrices","order":0},{"id":"seed_924715487c32e21045e71e930d1387aa","title":"Staircase Search Algorithm","order":1},{"id":"seed_8a84be737f2f7588486b7fb8f7d674b0","title":"Fully Sorted Matrix as 1D Array","order":2},{"id":"seed_1cd0b57601a094a5bbba1dae57a1f614","title":"Time Complexity for Each Approach","order":3}]},{"id":"seed_6735663376c0d45646eef775690744fe","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Sorted Array Position Finder","order":11,"contentType":"VISUALIZER","contentSlug":"sorted-array-position-finder","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_34ad240ac4e0dd90fbac46290b1e4538","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Sorted Array Position Finder","order":12,"contentType":"PROBLEM","contentSlug":"sorted-array-position-finder","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_60336d74208914ac7e3ab7866d92aa6d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Rotated Array Search","order":13,"contentType":"PROBLEM","contentSlug":"rotated-array-search","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_aafdeaecf0576050fd12f8839b014179","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 17: Searching Algorithms","sectionOrder":19,"title":"Target Element Range","order":14,"contentType":"PROBLEM","contentSlug":"target-element-range","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_466d99ce09958c4be88ef165d384365d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Why Sorting Matters","order":1,"contentType":"LEARNING","contentSlug":"why-sorting-matters","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_e379ce51eea8f3942ab33cf76c485d96","title":"Sorting as a Fundamental Operation","order":0},{"id":"seed_d867d913766ad3f686cf070f9120d037","title":"Problems That Become Easier After Sorting","order":1},{"id":"seed_6c9dfb6b03c2444c04bc9a39c8b6a68d","title":"Sorting as Preprocessing","order":2},{"id":"seed_f1a125b82a6366ebb49bde80f7022008","title":"Real-World Sorting Applications","order":3}]},{"id":"seed_9d2015878733633a39d0439dbd8d3b6e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Sorting Problem Formalization & Stability","order":2,"contentType":"LEARNING","contentSlug":"sorting-problem-formalization-stability","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_abfd5c0aebdb1e58ab2c532433dad6fe","title":"Formal Definition of Sorting","order":0},{"id":"seed_9c0f0d594ba83a02be27f1ad91ff54cf","title":"Ascending vs Descending Order","order":1},{"id":"seed_eb575f81f739b08d91516fbae4948bd2","title":"Comparison-Based vs Non-Comparison Sorting","order":2},{"id":"seed_5e8fc1c3b92f49a3dc1bf575bbbdb1de","title":"Stability — Preserving Relative Order of Equal Elements","order":3}]},{"id":"seed_a90b45407dcce62ce76e6337d793f4d5","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Bubble Sort — Understanding the Simplest Sorting Algorithm","order":3,"contentType":"LEARNING","contentSlug":"bubble-sort-intuition-analysis","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_c53711f29f633d59a2cf398585509d3a","title":"The Bubble Sort Algorithm","order":0},{"id":"seed_ef7e8ea6d060a509f09a1ae1b8dea499","title":"Swapping Adjacent Elements","order":1},{"id":"seed_9327f581cc491a2116a23fb780871030","title":"Time Complexity — O(n²) Average and Worst","order":2},{"id":"seed_0a9547cd2cccac0d8d5d1927f83f28d1","title":"When Bubble Sort Is Acceptable (Hint: Rarely)","order":3}]},{"id":"seed_efdbfee73be37b7a74d3595da1b34dc5","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Selection Sort — Intuition & Analysis","order":4,"contentType":"LEARNING","contentSlug":"selection-sort-intuition-analysis","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_04648338816d0c21097b992d53bacd6f","title":"The Selection Sort Algorithm","order":0},{"id":"seed_b45bcffc015c359e15693083230f120c","title":"Finding Minimum and Moving to Position","order":1},{"id":"seed_36e78c0887ae6c457de4c362522f020d","title":"Time Complexity: O(n²)","order":2},{"id":"seed_e0e0f892361694f53ad7bbcf42d311c6","title":"Comparison with Bubble Sort","order":3}]},{"id":"seed_6725d2977df6562e1abe4c072c61bb15","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Insertion Sort — Intuition & Analysis","order":5,"contentType":"LEARNING","contentSlug":"insertion-sort-intuition-analysis","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_cbcac3f35aca13e1292cd6298f56f707","title":"The Insertion Sort Algorithm","order":0},{"id":"seed_e21d3debfcd06f641d4c90dcb71fd14a","title":"Building Sorted Portion Incrementally","order":1},{"id":"seed_83e038769f436429156c36916eaffbf2","title":"Time Complexity: O(n²) Worst, O(n) Best","order":2},{"id":"seed_09426d4a0cc8d1978213d9e73386f20c","title":"Why Insertion Sort is Good for Nearly-Sorted Data","order":3}]},{"id":"seed_012f9c65fc1f17173043ceeae0833d4d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Merge Sort — Divide & Conquer Sorting","order":6,"contentType":"LEARNING","contentSlug":"merge-sort-divide-conquer","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_f39afc1d9dc9584792e2749e8087922d","title":"The Merge Sort Algorithm","order":0},{"id":"seed_2e06110649931e52a760d2363d91ecd1","title":"Divide, Sort Halves, Merge","order":1},{"id":"seed_4bd5b29f0143b6f7f177dec5dd5b11d7","title":"The Merge Operation in Detail","order":2},{"id":"seed_d27e981cb7a6279c2cb4c00b94063b3c","title":"Time Complexity — O(n log n) Guaranteed","order":3},{"id":"seed_f8e9c22f7a41afdb89e9ce90210e8389","title":"Space Complexity — O(n)","order":4}]},{"id":"seed_d750a16393ea1734bb9dd5f405cd5b7c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Quick Sort — Partition-Based Sorting","order":7,"contentType":"LEARNING","contentSlug":"quick-sort","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_0ca9b8fe9825389ca2bf5f62f2e7c221","title":"The Quick Sort Algorithm","order":0},{"id":"seed_339003806900f14fa15de0324259066e","title":"Pivot Selection and Partitioning","order":1},{"id":"seed_8cbd8249985b4f418c1874ed46de1107","title":"Lomuto vs Hoare Partition Schemes","order":2},{"id":"seed_eb49518600f2f6f6b69a81194f406770","title":"Time Complexity: O(n log n) Average, O(n²) Worst","order":3},{"id":"seed_f76d803d497e8d2c2fc61742b5944182","title":"Why Quick Sort is Fast in Practice","order":4}]},{"id":"seed_afce62f58f760432621f09364c4cbe5f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Heap Sort — Heap-Based Sorting","order":8,"contentType":"LEARNING","contentSlug":"heap-sort","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_93164d136dc2b75c32b64da19cab8988","title":"Using a Heap for Sorting","order":0},{"id":"seed_12e57fdb2d5d8f54320d1ab1b7fb4141","title":"Build Heap, Repeatedly Extract Max","order":1},{"id":"seed_fbe29921b3003d91e76393d4cc03f51e","title":"Time Complexity: O(n log n) Guaranteed","order":2},{"id":"seed_3b1a9a5e95dd8000314be32def3456ee","title":"In-Place Sorting with Heaps","order":3}]},{"id":"seed_cf850f76b5bae77ac59966e6a4dfdc46","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Counting Sort: Breaking the Comparison-Based Barrier","order":9,"contentType":"LEARNING","contentSlug":"counting-sort","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_bf97e9a34112ba3ffc833821ecb3f376","title":"When Values Have Limited Range","order":0},{"id":"seed_20b0c174766c9295ab2f2dd71fe89a05","title":"Counting Occurrences","order":1},{"id":"seed_f8da985acc8746ce033e12b7ca343e4e","title":"Time Complexity: O(n + k)","order":2},{"id":"seed_87ef9743ecc4f31af921060c338a321f","title":"When Counting Sort Is Appropriate","order":3}]},{"id":"seed_f6c849b8966ba724cd6e3341ac4fb8ba","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Radix Sort — Digit-Based Sorting","order":10,"contentType":"LEARNING","contentSlug":"radix-sort","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_51fff7023e79f88cd9a7f33f04f9eaf8","title":"Sorting by Digits (LSD or MSD)","order":0},{"id":"seed_de1ff39663cce624ccbde4777bf86a6e","title":"Using Counting Sort as Subroutine","order":1},{"id":"seed_d534dff16e4f61779fadf8bc5b458c8b","title":"Time Complexity: O(d × (n + k))","order":2},{"id":"seed_4401064e50eebe4512151b8722dffe70","title":"When Radix Sort Excels","order":3}]},{"id":"seed_df891407ca3a4b80cd77c8888cad5af6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Sorting Algorithm Comparison & Selection","order":11,"contentType":"LEARNING","contentSlug":"sorting-algorithm-comparison-selection","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_dd2007ebae2fb970dd288824ed1607c2","title":"Summary Comparison Table","order":0},{"id":"seed_bc3ed722d1002dd3299a18a6e60799f2","title":"Time Complexity Comparison","order":1},{"id":"seed_54eadf03da0048420c221a33f9549a16","title":"Space Complexity Comparison","order":2},{"id":"seed_acebdb74161408f9476c3b826022c404","title":"Stability Considerations","order":3},{"id":"seed_e21c20884bcb919cd121460a01396804","title":"Choosing the Right Algorithm","order":4}]},{"id":"seed_d7ee717f97775c22a5ceab878ba67188","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Sorting in Practice — Library Functions","order":12,"contentType":"LEARNING","contentSlug":"sorting-in-practice","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_deb4e16720f80a7676a62d43909ef266","title":"Built-in Sort Functions","order":0},{"id":"seed_69cb674b6cec1f7985feb4b760305ec8","title":"Customizing Comparison Functions","order":1},{"id":"seed_c50a3686cb06bdb749a6431949d14eb6","title":"Stability Guarantees in Libraries","order":2},{"id":"seed_b1826c1313bce59964ea0dcee8c63d53","title":"When to Implement vs Use Library","order":3}]},{"id":"seed_457c9c34fc01e0043e2f40f1a24abf82","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Linked List Sort","order":13,"contentType":"VISUALIZER","contentSlug":"linked-list-sort","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_1f735e6e916da2982e63f89036e9d43a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 18: Sorting Algorithms","sectionOrder":20,"title":"Linked List Sort","order":14,"contentType":"PROBLEM","contentSlug":"linked-list-sort","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_4d501d9328bf70e8992d38f3e61f880e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"What Is Divide and Conquer?","order":1,"contentType":"LEARNING","contentSlug":"what-is-divide-and-conquer","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_2e6dea0604e0d2726a132131f6b2fce4","title":"The D&C Paradigm Defined","order":0},{"id":"seed_82693e979aa6490b3f335b51871cdfee","title":"Breaking a Problem into Subproblems","order":1},{"id":"seed_e9e4a2396ff486860cf841744a823b95","title":"Solving Subproblems Independently","order":2},{"id":"seed_084b040aca217acb2f49b9e3767acc48","title":"Combining Solutions","order":3}]},{"id":"seed_ee00ad087998653706c17138c1fab68c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"The D&C Pattern — Divide, Conquer, Combine","order":2,"contentType":"LEARNING","contentSlug":"dc-pattern","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_0613207512209600440be4198e12c6e8","title":"The Three Phases in Detail","order":0},{"id":"seed_9d442130c483d72b809c356666ff221d","title":"Subproblem Independence","order":1},{"id":"seed_bea5de8cecd1417ad73a4fe58f8aaf3e","title":"Base Cases in D&C","order":2},{"id":"seed_a9042477eeef9a64391410598edd5b30","title":"Recursive Structure","order":3}]},{"id":"seed_5129e34914db429dc5d01f01b50cfff4","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"Recurrence Relations & Master Theorem","order":3,"contentType":"LEARNING","contentSlug":"recurrence-relations-master-theorem","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_d6954d7030a72d119f914147b280b466","title":"Expressing D&C Runtime as Recurrence","order":0},{"id":"seed_5c4d343bfcbd284cda00a3f0f57e7ae8","title":"Common Recurrence Patterns","order":1},{"id":"seed_9ffafe50e5b55fc1bf453e8470bf1fcb","title":"Master Theorem for Solving Recurrences","order":2},{"id":"seed_91f6ced3f7d772c286d08dc612e5de75","title":"Intuition Without Formal Proofs","order":3}]},{"id":"seed_d1520258738dd00094941d767dddfe33","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"Merge Sort as Divide and Conquer — Deep Dive","order":4,"contentType":"LEARNING","contentSlug":"merge-sort-as-dc","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_1eb432105243dcd4fe7ad3fea694a5e0","title":"Merge Sort Revisited as D&C Example","order":0},{"id":"seed_1a591ae17036d555039d87d46b622338","title":"Divide — Split in Half","order":1},{"id":"seed_5a40c4887dcd51869fa7db32da198844","title":"Conquer — Sort Each Half","order":2},{"id":"seed_24f7122e2ae4df2d3d7d06c4b95b40fc","title":"Combine — Merge Sorted Halves","order":3}]},{"id":"seed_5a52e438285669df8cab51e53bb66c1b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"Quick Sort as Divide and Conquer — Deep Dive","order":5,"contentType":"LEARNING","contentSlug":"quick-sort-as-dc","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_51a733e0300546c3014d4c296f6b3675","title":"Quick Sort Revisited as D&C","order":0},{"id":"seed_9e1a78e5c300b262dc491f774fcc9b8c","title":"Divide: Partition Around Pivot","order":1},{"id":"seed_1b493fce78a3bb6fcee5409c0e9ee540","title":"Conquer: Sort Partitions","order":2},{"id":"seed_1a8a5ba582435a3002a8491aa51c4cd6","title":"Combine: Concatenate (Trivial)","order":3}]},{"id":"seed_802b16803e3fc00aeafa5cd2ab42e7d3","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"Binary Search as Divide and Conquer","order":6,"contentType":"LEARNING","contentSlug":"binary-search-as-dc","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_1f6cc6af552fa7140209311df76ea143","title":"Binary Search Through the D&C Lens","order":0},{"id":"seed_3b70672b06ea1b52330da357b36f4996","title":"Divide — Split Search Space","order":1},{"id":"seed_cd60ec75c78fdc261d420a355035b292","title":"Conquer — Search One Half","order":2},{"id":"seed_19ae59f15580aaa8893ebacf269597b2","title":"Combine — Return Result","order":3}]},{"id":"seed_4a51da15ec66ceef1c35c175cb7f9470","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"Maximum Subarray — Divide & Conquer Approach","order":7,"contentType":"LEARNING","contentSlug":"maximum-subarray-dc","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_838f39d408e48c0e7bb1f9d4e16d9bd6","title":"The Maximum Subarray Problem","order":0},{"id":"seed_61847784dcdbf100f4f3d5cc94e548ca","title":"D&C Approach — Cross-Boundary Handling","order":1},{"id":"seed_322b98df388bf1785e660e72c7256874","title":"Time Complexity — O(n log n) Analysis","order":2},{"id":"seed_d4b408f44a0fc1ca2d44f623e12e9438","title":"Comparison with Kadane's O(n) Approach","order":3}]},{"id":"seed_edf850c997f310312ee940da2e00d83a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"Matrix Multiplication & Strassen's Algorithm","order":8,"contentType":"LEARNING","contentSlug":"matrix-multiplication-strassen","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_f88654224b6618e2820105a5974dc5b3","title":"Standard Matrix Multiplication — O(n³)","order":0},{"id":"seed_91238e108ad85169aa31706c9c0e5cf9","title":"Strassen's Algorithm Overview","order":1},{"id":"seed_784b10d27cac92408f85ecf7506afec7","title":"Reducing Multiplications Through D&C","order":2},{"id":"seed_e5f1498649ed767ef47287b7ab01ef75","title":"Practical Considerations","order":3}]},{"id":"seed_a69f40a81837e25e371c0c4e8acf35a1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"Common Divide and Conquer Patterns","order":9,"contentType":"LEARNING","contentSlug":"common-dc-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_43abde7e7efac2a49f52b9bd756c1402","title":"Finding the Closest Pair of Points","order":0},{"id":"seed_1e8b76a4c7db9d9a234d134be2ebd9f3","title":"Counting Inversions","order":1},{"id":"seed_398338af17f84ddbbfb39aa7c12fad3b","title":"Karatsuba Multiplication (Conceptual)","order":2},{"id":"seed_fd7e7bf2c11af94b2ecf2ed894390fc6","title":"Pattern Recognition for D&C","order":3}]},{"id":"seed_f017f364c243e7411109dfc053f056f1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"When to Apply Divide and Conquer","order":10,"contentType":"LEARNING","contentSlug":"when-to-apply-dc","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_10dcec25fee8429876e24feb9f7d51d8","title":"Identifying D&C-Suitable Problems","order":0},{"id":"seed_432a1d1f9446d9fcefb2ec944c760533","title":"Subproblem Overlap Consideration","order":1},{"id":"seed_63d97943176b2eba5aa798ac5bb499b7","title":"D&C vs Dynamic Programming","order":2},{"id":"seed_abaa4b7d245fa62752299533cb3c951f","title":"Making the Right Choice","order":3}]},{"id":"seed_933c329ee59eb40405e4b19559dd9ec9","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 19: Divide And Conquer","sectionOrder":21,"title":"Combine Sorted Sequences","order":11,"contentType":"PROBLEM","contentSlug":"combine-sorted-sequences","description":null,"estimatedMins":45,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_7c64d637794589a1abad8666faa8ccdb","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"What Is a Greedy Algorithm?","order":1,"contentType":"LEARNING","contentSlug":"what-is-greedy-algorithm","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_b2d97984a62d9f6e237df12b9709c477","title":"The Greedy Paradigm Defined","order":0},{"id":"seed_d05284b4bafb2dbbf93212d369ddd60a","title":"Making the Best Local Choice at Each Step","order":1},{"id":"seed_d1df155e9570f1c488a40a8156df4bab","title":"No Backtracking, No Looking Ahead","order":2},{"id":"seed_467d2a9cc402fa3e73149f64c33570c6","title":"Intuition and Examples","order":3}]},{"id":"seed_1cb406da7d4f568218720f7c7c1cff3d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"The Greedy Choice Property — Foundation of Greedy Algorithms","order":2,"contentType":"LEARNING","contentSlug":"greedy-choice-property","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_7d7f05dc2f8418d045b2acdcd1eb991d","title":"What Makes a Greedy Choice 'Safe'","order":0},{"id":"seed_abd49fba7cca021149c9802517fc09b2","title":"Proving a Choice Is Part of an Optimal Solution","order":1},{"id":"seed_b5822ea96ea878da1f72a948d6a6bcc3","title":"Exchange Argument Intuition","order":2},{"id":"seed_83024c00ce425932d9f901a75565fd80","title":"When Greedy Choices Can Be Trusted","order":3}]},{"id":"seed_7054f5f082e645d97af6786199e735e2","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Optimal Substructure for Greedy Algorithms","order":3,"contentType":"LEARNING","contentSlug":"optimal-substructure-for-greedy","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_76eed070e78f871cc60b92da873d6798","title":"Remaining Problem After Greedy Choice","order":0},{"id":"seed_2f3f6a39ff9ea93b72da9030005ee30b","title":"Subproblem is Similar but Smaller","order":1},{"id":"seed_33e91553339d0e6413a5730b6abd7a69","title":"Connection to D&C and DP","order":2},{"id":"seed_14c501a137f0f1d2c24f246d0512608b","title":"Why Optimal Substructure Matters","order":3}]},{"id":"seed_fc7fa285d5adc56bb80410f73ee35398","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Proving Greedy Algorithm Correctness","order":4,"contentType":"LEARNING","contentSlug":"proving-greedy-correctness","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_2c4fe1407c2b3a28b0887ebec3125641","title":"The Challenge of Proving Greedy Works","order":0},{"id":"seed_066301f08cb3ba8a452739d23f3d8184","title":"Greedy Stays Ahead Argument","order":1},{"id":"seed_ab795d25e0120d7dfd17317bfa834fc0","title":"Exchange Argument","order":2},{"id":"seed_c19424c110b52c509bd088cf0f60f4e4","title":"When Proof Is Essential vs Intuitive","order":3}]},{"id":"seed_bfcfd0b611edbb63eef52c99e335770d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Activity Selection Problem","order":5,"contentType":"LEARNING","contentSlug":"activity-selection-problem","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_af10e546a35f94bf54f88b9805a6a3f1","title":"Classic Greedy Problem","order":0},{"id":"seed_1310fc611f52adc88921b71d085b19c5","title":"Maximize Non-Overlapping Activities","order":1},{"id":"seed_11a2e74c9e5b6980e08a6337894013d4","title":"Sort by End Time Strategy","order":2},{"id":"seed_2c3e55f398b7ec3ba090d03c06fe2299","title":"Proof of Optimality","order":3}]},{"id":"seed_9220eca6c3a37d32cdcb27fb8d9d1ee2","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Fractional Knapsack — When Greedy Achieves Optimality","order":6,"contentType":"LEARNING","contentSlug":"greedy-fractional-knapsack","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_51c2d4b0fa28283a29b3a44f73da838c","title":"Items with Weight and Value","order":0},{"id":"seed_7523e250e59f9380bbef84398c0e65e5","title":"Taking Fractions Allowed","order":1},{"id":"seed_4703c7d2593d38081b9ff8c0d40d0b40","title":"Greedy by Value-to-Weight Ratio","order":2},{"id":"seed_e40023f831d39707026bc095fb8bbc2c","title":"Contrast with 0/1 Knapsack (DP Required)","order":3}]},{"id":"seed_3fd9e3bcbb8b59b2b239e8f74ded4e5a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Huffman Coding — Optimal Prefix Codes","order":7,"contentType":"LEARNING","contentSlug":"huffman-coding","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_859413f231bf173be463038513547e19","title":"Variable-length Encoding Problem","order":0},{"id":"seed_7efe1cbb8caed03c9d69f02088632e7b","title":"Building the Huffman Tree","order":1},{"id":"seed_c20070184839b0acf4a6bf2f78635df6","title":"Greedy Selection of Minimum Frequencies","order":2},{"id":"seed_3730d2310c56a95a6da80e1dc24a139a","title":"Optimality of Huffman Coding","order":3}]},{"id":"seed_085003c44a0cbb1d9860e09769fa94b3","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Interval Scheduling Patterns","order":8,"contentType":"LEARNING","contentSlug":"interval-scheduling-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_02941fef50f95f4265019692c7c43ede","title":"Interval Covering Problems","order":0},{"id":"seed_f6eee3d27c52479e47983ae420550f6f","title":"Meeting Rooms Problems","order":1},{"id":"seed_3419b33ab85ea4f3c932d95496a8eada","title":"Minimum Platforms / Resources","order":2},{"id":"seed_f8a71a1c650e428a8e793ad0cb6511d4","title":"Event-Based Sweeping","order":3}]},{"id":"seed_eb84aa55e14a86ee373b3587226ee95d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Common Greedy Patterns","order":9,"contentType":"LEARNING","contentSlug":"common-greedy-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_8a79c8bd3457eb54ced7182de8075194","title":"Job Scheduling with Deadlines","order":0},{"id":"seed_66e895dfa4e67089edf50956c726ecad","title":"Minimum Coins (When Greedy Works)","order":1},{"id":"seed_10695a16126b8ccfc5464bee12ec4770","title":"Gas Station Problem","order":2},{"id":"seed_0d050157cb4c07a4b802a65546985e02","title":"Jump Game Variations","order":3}]},{"id":"seed_acba27b372711d4dfc1044a0f5fd3a6a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"When Greedy Fails vs When It Works","order":10,"contentType":"LEARNING","contentSlug":"when-greedy-fails-vs-works","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_aa5e0c44c2d7ad81e93d879ed8fe518e","title":"Classic Failure Cases","order":0},{"id":"seed_7a4d7f3d0e316b12d8ab95e30cc2b944","title":"Counterexamples for Wrong Greedy","order":1},{"id":"seed_4b0ea3f671ccdf6c5cc551add08c6715","title":"Recognizing Greedy Applicability","order":2},{"id":"seed_fafcedcf4a80755973aee54de626c2a5","title":"Fallback to DP or Other Approaches","order":3}]},{"id":"seed_89eac737965eda25a704dee4a1f6c26f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Circular Route Fuel Station","order":11,"contentType":"VISUALIZER","contentSlug":"circular-route-fuel-station","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_a4460f888b3d40284456f9863afe3e28","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Circular Route Fuel Station","order":12,"contentType":"PROBLEM","contentSlug":"circular-route-fuel-station","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_c67d56ddc77429e09fbdc728c7abeca2","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Destination Reachability","order":13,"contentType":"PROBLEM","contentSlug":"destination-reachability","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_d3a399318602027f64ce9fd6693ae18c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 20: Greedy Algorithms","sectionOrder":22,"title":"Minimum Hops to Destination","order":14,"contentType":"PROBLEM","contentSlug":"minimum-hops-to-destination","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_4ba51f8c0e7b0f74ad512fda2a18e63f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"What Is Dynamic Programming?","order":1,"contentType":"LEARNING","contentSlug":"what-is-dynamic-programming","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_a5733c036c88359e625508a23bbed8e0","title":"DP as an Optimization Technique","order":0},{"id":"seed_d0ae2ba85c0b3ac34170839c961b05c4","title":"Breaking Problems into Subproblems","order":1},{"id":"seed_27afffb5d9148ecbcc871ec827fbe6d2","title":"Storing Solutions to Avoid Recomputation","order":2},{"id":"seed_61ecd9531c202ff8695a0905353b43ed","title":"DP vs Recursion vs Greedy","order":3}]},{"id":"seed_41334efce624cf929981f8009916e6bb","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Overlapping Subproblems — The Heart of Dynamic Programming","order":2,"contentType":"LEARNING","contentSlug":"overlapping-subproblems","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_df6d331d2af7694a978ea24974add80c","title":"What Makes Subproblems \"Overlapping\"","order":0},{"id":"seed_b51feff37ad232a771f9c4a1ae9fd047","title":"Redundant Computation in Naive Recursion","order":1},{"id":"seed_3675e0c9a720f1d0b529fc14d3fd8d4f","title":"Why Overlapping Enables Optimization","order":2},{"id":"seed_9a92eb100f43846307ed2774dad77367","title":"Identifying Overlap in Problems","order":3}]},{"id":"seed_068bf9eb83f9d28861a601b610d437bf","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Optimal Substructure — The Foundation of Dynamic Programming","order":3,"contentType":"LEARNING","contentSlug":"dynamic-programming-optimal-substructure","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.121Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_c3cac1e57df8eee38275741223bf0fa9","title":"Optimal Solution Contains Optimal Subsolutions","order":0},{"id":"seed_da39dbd3a3fff3b369acef7a83919e43","title":"Building Optimal From Optimal Subproblems","order":1},{"id":"seed_1f8eac22b6b4833c391e63301ee6b810","title":"Connection to Greedy Optimal Substructure","order":2},{"id":"seed_f28e8f4937e588626ac7c2517f0fc2fe","title":"Verifying Optimal Substructure","order":3}]},{"id":"seed_802bef85a0929f1dd2f27bbbf0f22ebe","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Memoization — Top-Down Dynamic Programming","order":4,"contentType":"LEARNING","contentSlug":"memoization-top-down-dp","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_ad2b2f6cfdcfca218968bcf61d93b996","title":"Recursive Approach with Caching","order":0},{"id":"seed_46efd550200e6335ba466e2c7459a54b","title":"Adding a Memo Dictionary/Array","order":1},{"id":"seed_e60db757cf165d1b783e36e2c5002720","title":"Avoiding Recomputation","order":2},{"id":"seed_e1df55bb3ee09b7cebbe717b90448832","title":"When Top-Down is Natural","order":3}]},{"id":"seed_309f97c0785c5f308780d999533dee35","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Tabulation — Bottom-Up Dynamic Programming","order":5,"contentType":"LEARNING","contentSlug":"tabulation-bottom-up-dp","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_1e49744f7f0c11b5b9ce11125105715c","title":"Iterative Approach with Table","order":0},{"id":"seed_3d7129d35cadbf083a08ab371949de2e","title":"Filling Table in Dependency Order","order":1},{"id":"seed_64261765eece0c34bc917f83ae7c3c00","title":"No Recursion Overhead","order":2},{"id":"seed_e9db3eca90ca1b97eec452ab91e9d39d","title":"When Bottom-Up Is Preferred","order":3}]},{"id":"seed_c6aa1d5596e2379db52b8e03fbcd8a25","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"1D DP Problems — Fibonacci & Climbing Stairs","order":6,"contentType":"LEARNING","contentSlug":"1d-dp-problems","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_9bd3e65138e9c5186f8d51dcdb59f499","title":"Fibonacci Sequence as DP","order":0},{"id":"seed_4e828544417c0056941a42bd7a294f4a","title":"Climbing Stairs Variations","order":1},{"id":"seed_8620b9de48a351a36de561d2b76179d1","title":"House Robber Problem","order":2},{"id":"seed_c36652009be05e2b34ba274f278cea25","title":"State: Single Index — The Unifying Framework","order":3}]},{"id":"seed_acd8f4c044d39bdfcbd50c0463e92563","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"2D Dynamic Programming — Grid Paths & Longest Common Subsequence","order":7,"contentType":"LEARNING","contentSlug":"2d-dp-problems-grid-paths-lcs","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_a5765ff73f51d290bb8c86694c119ccc","title":"Unique Paths in Grid","order":0},{"id":"seed_511f2659be82bd47f8c5e22c1426c93a","title":"Longest Common Subsequence","order":1},{"id":"seed_c3184a839ed181305ab6972d522ff960","title":"State: Two Indices","order":2},{"id":"seed_cd2797a6a0041e6a7e07e2079d10ee07","title":"Table Interpretation","order":3}]},{"id":"seed_41abc1661aca4655af78308786d950e4","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Knapsack Problems — Resource-Constrained Optimization","order":8,"contentType":"LEARNING","contentSlug":"knapsack-problems","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_0856ed7ab5272611ad2052cc8239959d","title":"0/1 Knapsack — The Classic Resource Allocation Problem","order":0},{"id":"seed_d3f489cd5beb9feb4d74117f78db05df","title":"State Design — Capacity Remaining as the Key Dimension","order":1},{"id":"seed_d4b90894ae8dd4f108f4d750df2b29d3","title":"Unbounded Knapsack — Unlimited Item Selections","order":2},{"id":"seed_73963174cbedfe180de8feab7ea2eafb","title":"Subset Sum — A Specialized Knapsack Problem","order":3}]},{"id":"seed_541f3eb4610f3224d2f1a9ff76e828e6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"String DP — Edit Distance","order":9,"contentType":"LEARNING","contentSlug":"string-dp-edit-distance","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_e9879255e9004c21e430df2933cf56b4","title":"Edit Distance (Levenshtein Distance)","order":0},{"id":"seed_d9999b0152f5bbe3748ef163c2d2d8b1","title":"Insert, Delete, Replace Operations","order":1},{"id":"seed_a1e2c55f98db0e2688cef6d4d4ab6733","title":"Table Construction and Reconstruction","order":2},{"id":"seed_6a53bcff5270137c773ad0456811a7e1","title":"Applications in Spell Checking","order":3}]},{"id":"seed_16f3f242ca5a943bbfdc06ba9907264c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"State Design & Transition Functions","order":10,"contentType":"LEARNING","contentSlug":"state-design-transition-functions","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_7589df9359fc6b0a1a03ab64e3737965","title":"Defining DP State Precisely","order":0},{"id":"seed_8aa68b90298a76268060bee6c54225f2","title":"What Information to Track","order":1},{"id":"seed_c4389b810aa45051aef12b2856518ee3","title":"Writing Transition Equations","order":2},{"id":"seed_3e0c5955376149269acb5a2c4758ed7a","title":"Handling Edge Cases","order":3}]},{"id":"seed_e7d18b8a6ad37bd55c4082184b21d9c6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Space Optimization Techniques in Dynamic Programming","order":11,"contentType":"LEARNING","contentSlug":"space-optimization-techniques","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_873ac79bbc71567791a3b87a2106c252","title":"Reducing 2D DP to 1D","order":0},{"id":"seed_5e21e38b985875889c5685f074a20ccb","title":"Rolling Array Technique","order":1},{"id":"seed_c8f33402cca427839da6b2190911ffd7","title":"When Space Optimization Applies","order":2},{"id":"seed_74ca86f360b0d4dad9656c5e5547b1da","title":"Trade-offs with Complexity","order":3}]},{"id":"seed_f0911da9884dabce9c2710eea0169061","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Common DP Patterns","order":12,"contentType":"LEARNING","contentSlug":"common-dp-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_4d816f31b7a584bf81437bc227b458e4","title":"Interval DP","order":0},{"id":"seed_e856d7a691d49a4e55ad3f8a86e01111","title":"Bitmask DP (Conceptual)","order":1},{"id":"seed_11af8d080eb81bb4d43e9dc7756e7ec8","title":"DP on Trees (Conceptual)","order":2},{"id":"seed_485d13bdd13fd74b5958d33003621f1f","title":"DP with Multiple Constraints","order":3}]},{"id":"seed_915012cd4c03b3e4289cf4f8614975c8","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Dynamic Programming Problem-Solving Framework","order":13,"contentType":"LEARNING","contentSlug":"dp-problem-solving-framework","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_e541ef8fcd3963c35528ddabf2f2a878","title":"Identifying DP Problems","order":0},{"id":"seed_51524d0ed243b9562402bb4fe2fe4239","title":"Defining State and Transitions","order":1},{"id":"seed_14d64b665e253317ad17435921c53009","title":"Choosing Top-Down vs Bottom-Up","order":2},{"id":"seed_3061b0a5d4763d8d5325f7d703e55869","title":"Debugging DP Solutions","order":3}]},{"id":"seed_d489c1f7db34db54cafec247ca14eb74","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Staircase Ascent","order":14,"contentType":"VISUALIZER","contentSlug":"staircase-ascent","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_619d938d8f35348e78cf25fa2a8a2ec3","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Staircase Ascent","order":15,"contentType":"PROBLEM","contentSlug":"staircase-ascent","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_fbd48c168c39ac74efa5bf62c97a6c0c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Minimum Expense Staircase Traversal","order":16,"contentType":"PROBLEM","contentSlug":"minimum-expense-staircase-traversal","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_84eceab5bc01af81e4fd8270a031ad89","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Maximum Non-Adjacent Selection","order":17,"contentType":"PROBLEM","contentSlug":"maximum-non-adjacent-selection","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_8cb06fb2841b17e45c986d4d8baa182d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"Grid Minimum Cost Traversal","order":18,"contentType":"PROBLEM","contentSlug":"grid-minimum-cost-traversal","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_9d619ff7ccda7c944dc83924c879b294","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 21: Dynamic Programming","sectionOrder":23,"title":"String Transformation Cost","order":19,"contentType":"PROBLEM","contentSlug":"string-transformation-cost","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_9251ed875cc7d82c9aa62dffd2e3d0b0","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"What Is Backtracking?","order":1,"contentType":"LEARNING","contentSlug":"what-is-backtracking","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_cdc99897b33a762c95dc9d3be20440fe","title":"Backtracking as Controlled Exploration","order":0},{"id":"seed_0a0d12c7560c6ca643f72db4ab19c6ac","title":"Building Solutions Incrementally","order":1},{"id":"seed_dfa21137660962959cf22e5e9778bc93","title":"Abandoning Paths That Can't Lead to Solutions","order":2},{"id":"seed_7cbd72f3fc43591db6abc262d604ac07","title":"Relationship to Recursion","order":3}]},{"id":"seed_6e1ecd51b361795b19cdb8ceb7dae8ca","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Backtracking vs Brute Force: Understanding the Distinction","order":2,"contentType":"LEARNING","contentSlug":"backtracking-vs-brute-force","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_3bd09c3e6b65991087675102bcd6e4dc","title":"Brute Force — Generate All, Then Filter","order":0},{"id":"seed_7435ea7c5489af181161632c70c93583","title":"Backtracking — Prune During Generation","order":1},{"id":"seed_d51ee85a80daaafd81238dbea804b92c","title":"Efficiency Gains from Early Termination","order":2},{"id":"seed_584aba96cfed0757f2c6667da427404c","title":"When Backtracking Helps Most","order":3}]},{"id":"seed_13e319dc2a0ef4d62c4d8e5257dd9202","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"The Backtracking Template — Choose, Explore, Unchoose","order":3,"contentType":"LEARNING","contentSlug":"the-backtracking-template","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_50a3295fcb6d74325a5db445ddc2d901","title":"Choose — Make a Decision","order":0},{"id":"seed_c1103b3fdcef9775f7131e65fa0b6026","title":"Explore — Recurse with the Decision","order":1},{"id":"seed_e86f3447d97922056797330e4b9ea8fa","title":"Unchoose — Undo the Decision","order":2},{"id":"seed_3f48c65744d9557ef20755939254a473","title":"The Universal Template Structure","order":3}]},{"id":"seed_5660e77785876cc283050bb4aa5a9483","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Subsets & Subsequences","order":4,"contentType":"LEARNING","contentSlug":"subsets-subsequences","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_fea0ba9c3eee513b330c9c15ee42aa32","title":"Generating All Subsets","order":0},{"id":"seed_8e11cbfbef51a049f521a7d556e1244c","title":"Include/Exclude Decision at Each Element","order":1},{"id":"seed_5533806cd84949a6d4b77cac92388534","title":"Power Set Generation","order":2},{"id":"seed_688cb491a873f7b634b12e421905e147","title":"Subsets with Constraints","order":3}]},{"id":"seed_9b3543beba7dcf001709a429eac6503e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Permutations & Combinations","order":5,"contentType":"LEARNING","contentSlug":"permutations-and-combinations","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_06fc6e63bfa40d011e8269db32ac6acc","title":"Generating All Permutations","order":0},{"id":"seed_2ce6cc52a00ec64b8b55bd5e13a48d4c","title":"Generating K-Combinations","order":1},{"id":"seed_0177683f233d6604b5f0a837310b8937","title":"Swapping vs Inserting Approaches","order":2},{"id":"seed_7ae9ac2031098e335ca54cb8a35ce1ea","title":"Handling Duplicates","order":3}]},{"id":"seed_591770c1dbd0e55258fbeaab4024700a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"N-Queens Problem — The Classic Backtracking Challenge","order":6,"contentType":"LEARNING","contentSlug":"n-queens-problem","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_9be3b140aab9e958dda926d1d50c04bd","title":"Classic Backtracking Problem","order":0},{"id":"seed_d0160d16085da7b31bfa1d6e71afa500","title":"Placing Queens Safely","order":1},{"id":"seed_6ef55000b90756639cb9a63a9f14d251","title":"Constraint Checking","order":2},{"id":"seed_a014187b91d94b36634dd952d571e623","title":"Counting vs Finding All Solutions","order":3}]},{"id":"seed_e731051d5c4f13e51dc2d8069fd798e1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Sudoku Solver — Backtracking in Action","order":7,"contentType":"LEARNING","contentSlug":"sudoku-solver","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_1de35f0691ad08f86434ad446acb8786","title":"Constraint Satisfaction in Sudoku","order":0},{"id":"seed_7c1f55a4c92e7248b30be9040a7f587f","title":"Cell-by-Cell Exploration","order":1},{"id":"seed_c3519d00595b46dede6c1e8c26ab08ed","title":"Validity Checking","order":2},{"id":"seed_01b462a72b9312dfc0fbfd29e9bf341d","title":"Optimization Strategies","order":3}]},{"id":"seed_d03dd2619c8e53c3df89e90d9a2677e7","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Constraint Satisfaction & Pruning","order":8,"contentType":"LEARNING","contentSlug":"constraint-satisfaction-pruning","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_3c474c7449471d9650e780c51a0de4fa","title":"General Constraint Satisfaction Framework","order":0},{"id":"seed_4c6dd593013eb1154467aeddb9390406","title":"Pruning Techniques to Reduce Search","order":1},{"id":"seed_86c04caad114233d27e73ea946a4ec6d","title":"Forward Checking (Conceptual)","order":2},{"id":"seed_415fb021430ca742e9971b8cb789f2fb","title":"Arc Consistency (Conceptual)","order":3}]},{"id":"seed_36c92563964ae102c0883e5d4ea83ef0","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Common Backtracking Patterns","order":9,"contentType":"LEARNING","contentSlug":"common-backtracking-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_d373497adb9d5a81a233ef2dbe489c89","title":"Word Search in Grid","order":0},{"id":"seed_91f6ebb10da81c599d62270011efcf20","title":"Combination Sum Problems","order":1},{"id":"seed_86d5c3d63355914886a1c08b3bfd3e56","title":"Palindrome Partitioning","order":2},{"id":"seed_61bc6053e76859d46b45ba09b9b44904","title":"Valid Parentheses Generation","order":3}]},{"id":"seed_483215ba474b10ccdfe64294dc262e31","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Backtracking Time Complexity Analysis","order":10,"contentType":"LEARNING","contentSlug":"backtracking-time-complexity-analysis","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_b33f1cb2874f7e97122ab97c149185b1","title":"Exponential and Factorial Bounds","order":0},{"id":"seed_5116fd4684a03fe414c2fb7e7b07e5d3","title":"Estimating Tree Size","order":1},{"id":"seed_ee757e563f201611a31a4cb0be4e2d9d","title":"Impact of Pruning","order":2},{"id":"seed_da6ca898bcd3b965c8c4887586720e06","title":"Practical Performance Considerations","order":3}]},{"id":"seed_9f0412f228ed6757d2c8fb31664a78e1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Generate All Arrangements","order":11,"contentType":"VISUALIZER","contentSlug":"generate-all-arrangements","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_f0c6891c689ebe8f55f2f68e930efa28","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Generate All Arrangements","order":12,"contentType":"PROBLEM","contentSlug":"generate-all-arrangements","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_1cd0689da49109e257fc1caff1daa106","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Target Sum Combinations","order":13,"contentType":"PROBLEM","contentSlug":"target-sum-combinations","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_59a6d330f58df3b4ea94d57161e008d5","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Palindrome Segmentation","order":14,"contentType":"PROBLEM","contentSlug":"palindrome-segmentation","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_e8acb6d85021dace8b4c51b7182f3c65","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 22: Backtracking","sectionOrder":24,"title":"Throne Arrangement","order":15,"contentType":"PROBLEM","contentSlug":"throne-arrangement","description":null,"estimatedMins":45,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_1fd20f4309b3045d6930ad0b8b1a9148","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Graph Traversal Overview","order":1,"contentType":"LEARNING","contentSlug":"graph-traversal-overview","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_588142b121a3793e8ba7f8590a014991","title":"Why We Traverse Graphs","order":0},{"id":"seed_a9fb6fe441188f26d9df62061a65a065","title":"Visiting All Reachable Vertices","order":1},{"id":"seed_58a6a193c197dfdacfd23342c86c9cec","title":"Traversal as Foundation for Other Algorithms","order":2},{"id":"seed_57a35059b7f0027ad5d13ffb32fc8362","title":"DFS vs BFS Comparison Preview","order":3}]},{"id":"seed_4f7c4fa2328f0c408b28da11c83d968b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Depth-First Search (DFS) — Algorithm & Applications","order":2,"contentType":"LEARNING","contentSlug":"dfs-algorithm-and-applications","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_6f4fdb158f3bef5b7734fdb141ddd6a5","title":"DFS Algorithm — Recursive and Iterative Implementations","order":0},{"id":"seed_c4cc61fdbe9b008615fe3c31188cdfa6","title":"Stack-Based Exploration — The Heart of DFS","order":1},{"id":"seed_5c8a1a02c6fcac4396fadb1037644a52","title":"Pre-Order and Post-Order Traversal","order":2},{"id":"seed_b0ae6afe8886e82d1fdd581cd66d1812","title":"Time Complexity — O(V + E) Analysis","order":3},{"id":"seed_ef8d5907a656fe6932a58628a378d717","title":"Applications — Connectivity and Cycle Detection","order":4}]},{"id":"seed_010b8adbda0c7331213ad4a7000c9319","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Breadth-First Search (BFS) — Algorithm & Applications","order":3,"contentType":"LEARNING","contentSlug":"bfs-algorithm-applications","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_8e6d03b20be741e2b5bd7225b45b5127","title":"BFS Algorithm — The Mechanics of Level-Order Exploration","order":0},{"id":"seed_278367f6f5ed1dcd380afb2cc24a1c16","title":"Queue-Based Exploration — The Engine Behind Level-Order Traversal","order":1},{"id":"seed_c96248ef149c6c2ab0e70c929697bf5a","title":"Level-by-Level Traversal — The Power of Layered Exploration","order":2},{"id":"seed_1b13ce0c76166f761ac7e271c8cc3473","title":"Time Complexity O(V + E) — Understanding Why BFS Is Efficient","order":3},{"id":"seed_8be4db65c11696eba341104728d5839f","title":"BFS Applications — Shortest Path (Unweighted) and Beyond","order":4}]},{"id":"seed_b769bbb2ace5b504d2281f425125ee3b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Connected Components — Graph Decomposition","order":4,"contentType":"LEARNING","contentSlug":"connected-components","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_2d466d14cce7203b19053f006241cc1f","title":"Finding Connected Components in Undirected Graphs","order":0},{"id":"seed_d1a14e2027778d14a0b1941d3bb5f590","title":"DFS/BFS-Based Approach for Finding Connected Components","order":1},{"id":"seed_38f4c6719936c57522f5fcc3d5627007","title":"Counting and Labeling Components","order":2},{"id":"seed_2aa2d337dc0af3b370c9eb330e84f2e5","title":"Applications — Network Analysis and Beyond","order":3}]},{"id":"seed_4efc4b9809dffdb3e18c9f87a6ccdd9d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Cycle Detection","order":5,"contentType":"LEARNING","contentSlug":"cycle-detection","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_0aa958aaca5532c4a46748b444cbcd11","title":"Cycle Detection in Undirected Graphs","order":0},{"id":"seed_2850872d188d9cd3456babef945e701e","title":"Cycle Detection in Directed Graphs","order":1},{"id":"seed_c72923e3c2efa7986d2807a6d7c245e6","title":"Using DFS with Color/State Marking","order":2},{"id":"seed_6804eb856835bd839ba6e45a3dedcb9a","title":"Applications: Deadlock Detection","order":3}]},{"id":"seed_e944ea27c6c7e8d9805c2b6a2b74dd5f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Topological Sorting","order":6,"contentType":"LEARNING","contentSlug":"topological-sorting","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_a24ed48eb50aedfefb6e3f1a921c8b7f","title":"What is Topological Sort","order":0},{"id":"seed_66862619604917af1412fa151a8be297","title":"Directed Acyclic Graph (DAG) Requirement","order":1},{"id":"seed_b5a4ec36b6c3ca960356c2c72fed2d98","title":"Kahn's Algorithm (BFS-Based)","order":2},{"id":"seed_5ffbf68bb05839ba8e9de0d5ca6684fc","title":"DFS-Based Approach","order":3},{"id":"seed_1c3b2c5d1e0ccee3c5abbfd93d32b338","title":"Applications: Task Scheduling & Build Systems","order":4}]},{"id":"seed_018ef935007ecbe0c6eb7beed2cc645a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Shortest Path — Unweighted Graphs (BFS)","order":7,"contentType":"LEARNING","contentSlug":"shortest-path-unweighted","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_805f5f2a016130cbbcff4baca5c58aac","title":"BFS Finds Shortest Path in Unweighted Graphs","order":0},{"id":"seed_63fed9fe8c246e58ff31969369ba33b8","title":"Parent Tracking for Path Reconstruction","order":1},{"id":"seed_b843a80dc0998805438721e5c4b157b2","title":"The Distance Array","order":2},{"id":"seed_19f33a0b6b288ba3d1fd078e3defc16c","title":"Why BFS Works for This","order":3}]},{"id":"seed_15976621fc30ccea61146654059797df","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Shortest Path — Dijkstra's Algorithm","order":8,"contentType":"LEARNING","contentSlug":"dijkstras-algorithm","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_faf1ae64d83d7074c0bcc6b68254a873","title":"Shortest Paths in Weighted Graphs (Non-Negative Weights)","order":0},{"id":"seed_76b577c9a849ca8770c363ce2f2de763","title":"Priority Queue-Based Approach","order":1},{"id":"seed_23a2e3207f220c97c47cbbbd53354f97","title":"The Relaxation Process","order":2},{"id":"seed_92f4822be98c353108652eb72a39b356","title":"Time Complexity — O((V + E) log V)","order":3},{"id":"seed_17793886673c021178d4ae7d241ee7c2","title":"Proof of Correctness Intuition","order":4}]},{"id":"seed_702cf2fbe224262ace21fd835955b955","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Shortest Path — Bellman-Ford Algorithm","order":9,"contentType":"LEARNING","contentSlug":"bellman-ford-algorithm","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_d5352a668c22bc1af33d217fbbb9689f","title":"Handling Negative Edge Weights — Why Dijkstra Breaks and Bellman-Ford Prevails","order":0},{"id":"seed_3e2bb3c15b0c42acf53b9e7efd3c0911","title":"Relaxation Over All Edges, V-1 Times — The Heart of Bellman-Ford","order":1},{"id":"seed_cec3750e4bc87ae8ec57403bdde95998","title":"Negative Cycle Detection — Bellman-Ford's Superpower","order":2},{"id":"seed_bebab43db6d10a5df29b4f8c686494b1","title":"Time Complexity O(V × E) — Understanding Bellman-Ford's Performance","order":3},{"id":"seed_28bad74bd40f36df9e5ecd20ba460e97","title":"When to Use Bellman-Ford Over Dijkstra — A Decision Framework","order":4}]},{"id":"seed_8431552e835bec36b2363f770319850d","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"All-Pairs Shortest Path — Floyd-Warshall (Conceptual)","order":10,"contentType":"LEARNING","contentSlug":"floyd-warshall-algorithm","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_17fa2cd6937cc8101f501a6731ca1ca6","title":"Finding Shortest Paths Between All Pairs","order":0},{"id":"seed_7020fe4e90ba2e551b4f8f1515fed48b","title":"Dynamic Programming Approach","order":1},{"id":"seed_a114bd8305c8c466d6d0f35e9faa5ab5","title":"Time Complexity: O(V³)","order":2},{"id":"seed_073f85259f1d29d2c71f892d9301e028","title":"When Floyd-Warshall is Appropriate","order":3}]},{"id":"seed_c754fa4e0994b61c3a4a76512029fa91","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Choosing the Right Shortest Path Algorithm","order":11,"contentType":"LEARNING","contentSlug":"choosing-shortest-path-algorithm","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_4300b73833a684ba36268ecc2a0a128f","title":"Algorithm Comparison Table — A Comprehensive Reference for Shortest Path Selection","order":0},{"id":"seed_8f900afbfaea0013f24d86a9b7e9a7e5","title":"Non-Negative Weights — When Dijkstra's Algorithm Is the Optimal Choice","order":1},{"id":"seed_9bffd82667e5128d523eb159d67e7647","title":"Negative Weights — When Bellman-Ford Algorithm Is Essential","order":2},{"id":"seed_75bf8918392a6e6fe1cc914511ffbc73","title":"All Pairs — When Floyd-Warshall Algorithm Is the Right Choice","order":3},{"id":"seed_a7d3c9b0a4c087afcea2fe55106bd9d3","title":"Decision Framework — A Systematic Approach to Shortest Path Algorithm Selection","order":4}]},{"id":"seed_ad15793260ff016f6bd158d6e18ac2c6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Region Color Propagation","order":12,"contentType":"VISUALIZER","contentSlug":"region-color-propagation","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_aac648f49d381cfa5a92948a61e64c89","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Region Color Propagation","order":13,"contentType":"PROBLEM","contentSlug":"region-color-propagation","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_69c5d38f96632a79f57d2c5a92e213a2","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Task Dependency Validator","order":14,"contentType":"PROBLEM","contentSlug":"task-dependency-validator","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_e1f2c24b3187f8332c90a53439ef8146","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Task Execution Order","order":15,"contentType":"PROBLEM","contentSlug":"task-execution-order","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_1a366ebaa4e3b936cb67e30fa0bcb9e3","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Signal Propagation Time","order":16,"contentType":"PROBLEM","contentSlug":"signal-propagation-time","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_38251cb152886e07e3e06b42dbdc96ee","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Implement downstream impact across a drainage network","order":17,"contentType":"REPO","contentSlug":"drainage-inspections-network-impact","description":null,"estimatedMins":60,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_b34a0aef29d0102c891d6051ad257f1b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 23: Graph Algorithms","sectionOrder":25,"title":"Track visited drainage assets while following downstream links","order":18,"contentType":"CODE_REVIEW","contentSlug":"drainage-inspections-review-network-impact","description":null,"estimatedMins":35,"createdAt":"2026-10-17T16:02:58.702Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[]},{"id":"seed_8a50add7f24ab68c391ae2e88fbc81b1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Minimum Spanning Trees — Understanding the Concept","order":1,"contentType":"LEARNING","contentSlug":"minimum-spanning-trees-concept","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.538Z","pages":[{"id":"seed_9c829249974db6611e122201f83469c0","title":"What Is a Spanning Tree — The Backbone of Graph Connectivity","order":0},{"id":"seed_377e95b89e02b76c9ee972b4012c60ee","title":"Minimum Spanning Tree (MST) — The Optimal Backbone","order":1},{"id":"seed_a06e279d5a30877054871d5009816a2b","title":"Properties of Minimum Spanning Trees — Deep Mathematical Insights","order":2},{"id":"seed_494ef2c268d89722402d5e1e9a9be439","title":"Applications of MSTs — Network Design, Clustering, and Beyond","order":3}]},{"id":"seed_3ec91e19a0da769755849b0e78bf0d4c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Prim's Algorithm","order":2,"contentType":"LEARNING","contentSlug":"prims-algorithm","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_1a078d18e307f30b8aeb12e61d8b72f3","title":"Greedy MST Construction — The Foundation of Prim's Algorithm","order":0},{"id":"seed_a32785c178663868504f946dc694e874","title":"Growing the Tree from a Vertex — Prim's Vertex-Centric Expansion","order":1},{"id":"seed_5a93eae16dbcae5fbdb978984dd873a3","title":"Priority Queue Implementation — The Engine of Efficient Prim's","order":2},{"id":"seed_b301039fcfa7c60ae87d51aa2b89405e","title":"Time Complexity O((V + E) log V) — Rigorous Analysis of Prim's Algorithm","order":3}]},{"id":"seed_27c2717263274f44dcf0ced9a78a99e7","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Kruskal's Algorithm — Edge-Centric MST Construction","order":3,"contentType":"LEARNING","contentSlug":"kruskals-algorithm","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_41ece7f9cebcd1b4df8049263d3086f2","title":"Edge-Based MST Construction","order":0},{"id":"seed_ce77ba214d487e120656edfec38012d8","title":"Sorting Edges by Weight","order":1},{"id":"seed_775d5df29ab42a707a329c3bb1128d49","title":"Union-Find for Cycle Detection","order":2},{"id":"seed_1cf36cbbc0215da492d4b4734ce08df1","title":"Time Complexity: O(E log E)","order":3}]},{"id":"seed_23b831e6f72c45620abf1404980fc6c2","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Union-Find (Disjoint Set Union) — The Connectivity Powerhouse","order":4,"contentType":"LEARNING","contentSlug":"union-find","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_61b3663e581c003d5af86e5e30a5a779","title":"The Union-Find Data Structure","order":0},{"id":"seed_592bb72539fba96cecc8aa07f7fa55ad","title":"Union and Find Operations","order":1},{"id":"seed_f01aa80b1a0942978762b0285a5592d0","title":"Path Compression Optimization","order":2},{"id":"seed_0f7aea16aae77d4b20681ee0ae4919ef","title":"Union by Rank Optimization","order":3},{"id":"seed_551957aeec1bf647ee5efbd2d71d4b5c","title":"Nearly O(1) Amortized Operations","order":4}]},{"id":"seed_749db3fd9e7f05f0d39aa6365f772de7","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Strongly Connected Components — Deep Connectivity in Directed Graphs","order":5,"contentType":"LEARNING","contentSlug":"strongly-connected-components","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_8b9e8d849fcfb91631d846c1f5a94884","title":"Definition of Strongly Connected Components in Directed Graphs","order":0},{"id":"seed_5505ac22672b05d80f96941f6d48d25f","title":"Every Vertex Reachable from Every Other in Component — The Power of Mutual Reachability","order":1},{"id":"seed_5ed24331bb9525a988b3abe554415919","title":"Kosaraju's Algorithm — An Elegant Two-Pass Approach to Finding SCCs","order":2},{"id":"seed_06f2ce2a396cb69a33ce99a648598340","title":"Tarjan's Algorithm — Single-Pass SCC Detection with Low-Link Values","order":3},{"id":"seed_6ff65b90ce28f7a064c36c9e2606536d","title":"Applications of SCCs — Real-World Component Analysis","order":4}]},{"id":"seed_b465cdbeb52e6c6e130fc17f6d149b01","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Articulation Points & Bridges","order":6,"contentType":"LEARNING","contentSlug":"articulation-points-and-bridges","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_f7b6b426ccf7b23f83e652b6a948a309","title":"Understanding Articulation Points (Cut Vertices)","order":0},{"id":"seed_efaab2baac91eb6cb2b52e927a54818a","title":"Understanding Bridges (Cut Edges)","order":1},{"id":"seed_b6b8c08e3735f82cae68db6ebf73d11f","title":"Finding Articulation Points and Bridges with DFS","order":2},{"id":"seed_6b96af2a23d84582b06feb3decfcc1ec","title":"Applications — Network Reliability and Beyond","order":3}]},{"id":"seed_f7e7955ce603fa019a79b2c10623e94a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Bipartite Graphs","order":7,"contentType":"LEARNING","contentSlug":"bipartite-graphs","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_eef4f9d9290accab2cf660490b9b1b9f","title":"Definition of Bipartite Graphs","order":0},{"id":"seed_7642940b33721b5a5d95ebec429c1228","title":"Two-Coloring Test","order":1},{"id":"seed_1142e9a0044f18eadddb84f5d0ba2d87","title":"BFS/DFS-Based Detection","order":2},{"id":"seed_c5ac5f4f0bc23e58ae69454b67afa4a2","title":"Applications — Matching Problems","order":3}]},{"id":"seed_7b3d7bc4911889c9b9bdd95c86fb6375","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Network Flow — Conceptual Introduction","order":8,"contentType":"LEARNING","contentSlug":"network-flow-conceptual-introduction","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_df71f7c21192facf8c1c6905d43c94fb","title":"The Maximum Flow Problem — Optimizing Resource Distribution","order":0},{"id":"seed_019f40a85847691cb16af76001a8a352","title":"Flow Networks — Source, Sink, and Capacity","order":1},{"id":"seed_1221b3ef512ef1f7517c58b5db55cb2a","title":"Ford-Fulkerson Method — The Augmenting Path Framework","order":2},{"id":"seed_204e775cfe0a25dbf4588665472250ce","title":"The Max-Flow Min-Cut Theorem — Duality in Optimization","order":3},{"id":"seed_42dae3e0d303bb6096a241d1c133172a","title":"Applications — Resource Allocation, Matching, and Beyond","order":4}]},{"id":"seed_8e698b0e5dfcd181a922365e22cf2815","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Advanced Graph Patterns: Classical Problems & Computational Boundaries","order":9,"contentType":"LEARNING","contentSlug":"advanced-graph-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_0f6eb64dfed4eaee027ba195ff7bb187","title":"Eulerian and Hamiltonian Paths: Two Sides of Graph Traversal","order":0},{"id":"seed_a1b23f1742587a46b86d344b9da9716b","title":"Graph Coloring: The Art of Conflict-Free Assignment","order":1},{"id":"seed_d3839125e14ac1a20f8803dd74d7f380","title":"The Traveling Salesman Problem: Icon of Computational Complexity","order":2},{"id":"seed_915c2634f2240784130407cbd11e3fad","title":"Recognizing Intractable Problems: The Limits of Efficient Computation","order":3}]},{"id":"seed_ed93eaf5fba9d842d1090422ce3960e9","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Two-Set Graph Partition","order":10,"contentType":"PROBLEM","contentSlug":"two-set-graph-partition","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[]},{"id":"seed_8cc566d100d512f1fa25f56d1ccfa7c5","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 24: Advanced Graph Algorithms","sectionOrder":26,"title":"Safe Destination Nodes","order":11,"contentType":"PROBLEM","contentSlug":"safe-destination-nodes","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[]},{"id":"seed_009125ea8ee07d70c348fb8c58bbf0f8","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"String Matching Problem Formalization","order":1,"contentType":"LEARNING","contentSlug":"string-matching-problem-formalization","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_a3732ea7c49f4e7b9f315ec7fa0c07c5","title":"The Pattern Matching Problem Defined","order":0},{"id":"seed_135e4efc68a7977916227954e6e5e081","title":"Text, Pattern, and Occurrence — The Core Elements","order":1},{"id":"seed_5373b438191f947e0ea38c8e56006c30","title":"Single vs Multiple Pattern Matching","order":2},{"id":"seed_1b571028d57dcdca8fcdc4bceb7c8d40","title":"Applications: Search Engines, Bioinformatics, Text Editors","order":3}]},{"id":"seed_5164caa78e75c936a8b5837fc35f9f4b","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"Naive Pattern Matching — The Fundamental Algorithm","order":2,"contentType":"LEARNING","contentSlug":"naive-pattern-matching","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_b6c99ce1b7c9b8c2f8382df77fb3d87d","title":"Brute Force Approach — The Foundation of Pattern Matching","order":0},{"id":"seed_819471e63de679a4bc5881da3f1d03ad","title":"Sliding the Pattern Over the Text — Visualization and Mechanics","order":1},{"id":"seed_22ca79e7e297ef6d5444c4194140f147","title":"Time Complexity O(n × m) — A Rigorous Analysis","order":2},{"id":"seed_d887dd630b98f883518416da9126c28e","title":"Why Improvement Is Needed — The Case for Smarter Algorithms","order":3}]},{"id":"seed_3ba1bf24f30934722540301d1752773a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"KMP Algorithm — Failure Function & Matching","order":3,"contentType":"LEARNING","contentSlug":"kmp-algorithm","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_c14f7c7b6456ec1cbb4dd008029b6a6d","title":"Key Insight — Avoiding Redundant Comparisons","order":0},{"id":"seed_de0bc1168f3f44dfcb6e060b9b00a099","title":"The Failure (LPS) Array","order":1},{"id":"seed_54bb8b3d8348c891f979ff096d3cec6a","title":"How the Failure Function Enables Skipping","order":2},{"id":"seed_adaf0af9f39963b528e6cd96a00726d7","title":"Time Complexity: O(n + m)","order":3},{"id":"seed_0922453cbe70ffb0bf7a952abe6024dc","title":"Building the Failure Function","order":4}]},{"id":"seed_1f1fe291db13d38d24bbb70ecb74aef9","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"Rabin-Karp Algorithm — Rolling Hash","order":4,"contentType":"LEARNING","contentSlug":"rabin-karp-algorithm","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_21b37044531d5cb69dab709d7d27dc62","title":"Using Hashing for Pattern Matching","order":0},{"id":"seed_b4432926c42a8510b9000f037d3949f1","title":"Rolling Hash Technique","order":1},{"id":"seed_f8449b75e0933093f32c57f9dab984a0","title":"Handling Hash Collisions","order":2},{"id":"seed_03d8cbb2c553dc61b425bb1a9b90f8be","title":"Time Complexity: O(n + m) Average, O(n × m) Worst","order":3},{"id":"seed_0135544d6540f8fcaac61864a9c4bc54","title":"Multiple Pattern Searching Advantage","order":4}]},{"id":"seed_5615e2232e79b8e522de03a4726e7a42","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"Z-Algorithm: Linear-Time Pattern Matching","order":5,"contentType":"LEARNING","contentSlug":"z-algorithm","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_0e2b0ab2bb7e4be38e58e727ea4bb788","title":"The Z-Array Definition","order":0},{"id":"seed_b3f4da6bc8e3175ece0387d2fdd97f08","title":"Computing Z-Values in O(n)","order":1},{"id":"seed_18959e1f36be0b06cc4df38e8c4343a7","title":"Application to Pattern Matching","order":2},{"id":"seed_dc5dbc83a465e3e65fc164c912de6374","title":"Comparison with KMP","order":3}]},{"id":"seed_f4edfa2a71a02dc75763e559db17dd03","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"String Hashing Techniques","order":6,"contentType":"LEARNING","contentSlug":"string-hashing-techniques","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_a5b1dab7620037bc3fafd79813447793","title":"Polynomial Rolling Hash","order":0},{"id":"seed_0f2206959dfdbe9255d4111bd589fd9c","title":"Choosing Hash Base and Modulus","order":1},{"id":"seed_40f030748a4ba9cd3a22562b65978c94","title":"Handling Collisions with Multiple Hashes","order":2},{"id":"seed_f0378b95cf85889e09c2b9346336bb51","title":"Applications Beyond Exact Matching","order":3}]},{"id":"seed_17f23655cc264f3d56f72c2cadfaedde","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"Longest Common Subsequence (Revisited)","order":7,"contentType":"LEARNING","contentSlug":"longest-common-subsequence-revisited","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_73431732fc7f85bbed71fa6ed55c6f4b","title":"LCS with Full Implementation Detail","order":0},{"id":"seed_debd081286a594e94d6c79883fdfd8c0","title":"DP Table Construction","order":1},{"id":"seed_f11558eee65196179065792f4be05bff","title":"Reconstructing the LCS","order":2},{"id":"seed_eeecef35753fb42961dbed020e7c7b74","title":"Variations: Longest Common Substring","order":3}]},{"id":"seed_80d9dd76ecf031fb72b9b5901a612619","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"Longest Palindromic Substring","order":8,"contentType":"LEARNING","contentSlug":"longest-palindromic-substring","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_f5d68c8dc84826ac9f9a41facdb50972","title":"Brute Force Approach","order":0},{"id":"seed_eef3269cf8931cca965f5fa051fde164","title":"Expand Around Center Technique","order":1},{"id":"seed_cafe96772c3930641854dd843f2a856a","title":"Manacher's Algorithm (Conceptual)","order":2},{"id":"seed_ac64ce25b299d78b166e0f9c9990b7d1","title":"Time Complexity Comparison","order":3}]},{"id":"seed_347c1f05f9dad4ecd79adb57d4378511","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"Suffix Arrays & Suffix Trees (Conceptual)","order":9,"contentType":"LEARNING","contentSlug":"suffix-arrays-and-suffix-trees","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_da71d39c87b2ccadb18519d7308615c8","title":"What is a Suffix Array","order":0},{"id":"seed_c68679cf61243eb7c362171036627a7b","title":"Building Suffix Arrays","order":1},{"id":"seed_fa406a07e80a2f6a2b52e67e46c89547","title":"Applications: Pattern Searching, LCP Queries","order":2},{"id":"seed_d86c68f65355ad6a23db808f6e6e1200","title":"Suffix Trees Overview","order":3},{"id":"seed_f3a16f8962c7c573b1e5967b3884f35e","title":"When to Use These Structures","order":4}]},{"id":"seed_462d01934cd3278c40cf5023945ca632","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"Common String Algorithm Patterns","order":10,"contentType":"LEARNING","contentSlug":"common-string-algorithm-patterns","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_74e654241a7f1db80cdb6a3c6b4be6d5","title":"Anagram Detection and Grouping","order":0},{"id":"seed_deef88ee8d8ff50308377de60cc4c6b7","title":"String Compression and Run-Length Encoding","order":1},{"id":"seed_f00cba15f335051a073014bccedfaeb7","title":"Minimum Window Substring","order":2},{"id":"seed_f6010aa850851181b8473142575be2f8","title":"Distinct Subsequences","order":3},{"id":"seed_26ad27f5ef073d44795e5008c1e7f505","title":"Edit Distance Variations","order":4}]},{"id":"seed_9de41d8eb0d31b2060e99b9d4d363a38","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 25: String Algorithms","sectionOrder":27,"title":"Pattern Text Matching","order":11,"contentType":"PROBLEM","contentSlug":"pattern-text-matching","description":null,"estimatedMins":45,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[]},{"id":"seed_c860be9a270dec4ac0f54a59f3c43112","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Binary Representation Revisited — The Language of Low-Level Optimization","order":1,"contentType":"LEARNING","contentSlug":"binary-representation-revisited","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_9c5685c73ab3e7c8a1db5d773d989f49","title":"Connecting Back to Chapter 3 — The Foundation Continues","order":0},{"id":"seed_8c914b861a8817b7665941df34460d01","title":"Bits as the Foundation of Computation","order":1},{"id":"seed_95f26ba0308f4b3f2d6c4daba013b249","title":"Positive and Negative Number Representation","order":2},{"id":"seed_91cece8727208178586b0733b099eca2","title":"Two's Complement Intuition — The Universal Standard","order":3}]},{"id":"seed_f58b01085f2d721028ff9aee22fdbdf7","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Bitwise Operators — AND, OR, XOR, NOT","order":2,"contentType":"LEARNING","contentSlug":"bitwise-operators","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_866a3e05667d6b926c5b0698a627b817","title":"AND — Both Bits Must Be 1","order":0},{"id":"seed_3ebc4e3e5fd19ab42af4ff1f023e33e0","title":"OR — At Least One Bit Must Be 1","order":1},{"id":"seed_f2b89b20157c335386a33c2b61618bd0","title":"XOR — Exactly One Bit Must Be 1","order":2},{"id":"seed_6cf9c1e502ac0c8f750c200163234e22","title":"NOT — Flip All Bits","order":3},{"id":"seed_887e8b052ed4cca827ccc7949276a00d","title":"Truth Tables and Examples","order":4}]},{"id":"seed_a647cdaa538324b6bcc3e0e169ed426e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Bit Shifting — Left & Right Shifts","order":3,"contentType":"LEARNING","contentSlug":"bit-shifting","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_eb72d21a43a1c82c1341689b5c9fa344","title":"Left Shift — Multiply by 2","order":0},{"id":"seed_aacab455ee64e5f5e3831048d20e5366","title":"Right Shift — Divide by 2","order":1},{"id":"seed_04b5a41807a95fe37141a2290fb44959","title":"Logical vs Arithmetic Right Shift","order":2},{"id":"seed_758697df565a250c724aff928542c2b8","title":"Shift Overflow and Loss of Bits","order":3}]},{"id":"seed_4ea248c6e941b68cfae9679ae7f127f6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Common Bit Manipulation Tricks","order":4,"contentType":"LEARNING","contentSlug":"common-bit-manipulation-tricks","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_ee938085f8c4539afb4e989188d6ed3d","title":"Check if a Number is Even or Odd","order":0},{"id":"seed_3ce480c797bed4d841d392d131777a6b","title":"Extract the Rightmost Set Bit","order":1},{"id":"seed_a26f8dfbb04a59b5b4cc6107e7cf8390","title":"Clear the Rightmost Set Bit","order":2},{"id":"seed_236af14adad88e1a72f32c4e66186c9e","title":"Isolate a Specific Bit","order":3},{"id":"seed_a18023f9c3db5638e632da1be55b27fb","title":"Turn Off/On Specific Bits","order":4}]},{"id":"seed_ad621bf64924d024f9031e8d90514fa3","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Checking, Setting, Clearing, Toggling Bits","order":5,"contentType":"LEARNING","contentSlug":"checking-setting-clearing-toggling-bits","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_1ede4063783c3706b7b22d6d807bcb18","title":"Check Bit at Position i","order":0},{"id":"seed_384c514783eaf1542a9d1073eeca562f","title":"Set Bit at Position i","order":1},{"id":"seed_570221b69ff4bafcba6ca9d0a96f23b1","title":"Clear Bit at Position i","order":2},{"id":"seed_a700abce97b54c102e60d41e9a3b4ab0","title":"Toggle Bit at Position i","order":3},{"id":"seed_7ca19a300096bb1770281c73aeffc355","title":"Combining Operations","order":4}]},{"id":"seed_7285eb0e418b48401e19e61def4abdf1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Power of Two & Counting Bits","order":6,"contentType":"LEARNING","contentSlug":"power-of-two-and-counting-bits","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_5080c866ec2943802ed04ddc295b4263","title":"Check if n is a Power of Two: n & (n-1) == 0","order":0},{"id":"seed_6f01f8b222d80e61a965825b5f5e2a2e","title":"Count Set Bits (Popcount)","order":1},{"id":"seed_8176aa881eb36b5b44cfc59747584b22","title":"Brian Kernighan's Algorithm","order":2},{"id":"seed_7ce0cce3eb68b3e7bdf95edc99d0f006","title":"Built-in Functions for Counting Bits","order":3}]},{"id":"seed_1e510442922f9ddbbe58c7e2cf6aa8a9","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Bitmasks for Subset Representation","order":7,"contentType":"LEARNING","contentSlug":"bitmasks-for-subset-representation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_71915742b25847ca7a0defbb7a7bd93c","title":"Representing Subsets as Integers","order":0},{"id":"seed_a7afe573423d3505b00ba77c6b2fcc01","title":"Iterating Through All Subsets","order":1},{"id":"seed_8821b9567910738f4459b54bb8133846","title":"Subset Operations with Bitwise Ops","order":2},{"id":"seed_02c8eb701860780c8db2ce1f627f6b32","title":"Bitmask DP Introduction","order":3}]},{"id":"seed_0ca39e3cf199363ef68babfc1556bc05","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"XOR Patterns — Finding Missing & Duplicate Numbers","order":8,"contentType":"LEARNING","contentSlug":"xor-patterns-finding-missing-duplicate","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_6d75d0083a5517056298b4b12b2616e1","title":"XOR Properties — Self-Cancellation","order":0},{"id":"seed_e0f5a40af02aa96851f5e03ad904ba5e","title":"Find the Single Non-Duplicate Number","order":1},{"id":"seed_33b21624ad7f697903517de330c0d4db","title":"Find Two Single Numbers","order":2},{"id":"seed_de7d1297a8e5b43f3d3f1d61debbc30c","title":"Find Missing Number in Sequence","order":3}]},{"id":"seed_c55f340ac11009c845d39fd178858e57","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Bit Manipulation Problem Types","order":9,"contentType":"LEARNING","contentSlug":"bit-manipulation-problem-types","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_70f2a9656ab6973217f9e6dd7b5f24ce","title":"Swap Without Temporary Variable","order":0},{"id":"seed_da5874cd00748227a23629f8de6e66c8","title":"Reverse Bits","order":1},{"id":"seed_e26d8ed2caf38b7a5134e4c71453f9a7","title":"Add Without Plus Operator","order":2},{"id":"seed_4a8628eeda41eed69aa6baf0c623798a","title":"Maximum XOR Pair","order":3},{"id":"seed_be17041e90e3a3e6c5f1769e852f793e","title":"Gray Code","order":4}]},{"id":"seed_2499b024c2f5091dfd97e46c9430147a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"When to Use Bit Manipulation","order":10,"contentType":"LEARNING","contentSlug":"when-to-use-bit-manipulation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_b7e7722999c2dbc89ff50af0d0d4602d","title":"Identifying Problems Suited for Bits","order":0},{"id":"seed_1e8620f9b9f1b89cca684ed5af158ac1","title":"Space Optimization with Bits","order":1},{"id":"seed_f1183405dc9646e425b61e868dbfb8b5","title":"Performance Considerations","order":2},{"id":"seed_92aca2d0e7dde13e5d55cfebc83a5dab","title":"When Bit Manipulation Adds Complexity","order":3}]},{"id":"seed_670f8692b1d1ba3088e20637093668db","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Unique Element Finder","order":11,"contentType":"VISUALIZER","contentSlug":"unique-element-finder","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[]},{"id":"seed_1bc6f67c14673ab9897df20cef6977d9","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Unique Element Finder","order":12,"contentType":"PROBLEM","contentSlug":"unique-element-finder","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[]},{"id":"seed_76f7cab03973016d4a8e3ee5f657d0fe","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Binary One Counter","order":13,"contentType":"PROBLEM","contentSlug":"binary-one-counter","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[]},{"id":"seed_a6867dd690b00846c548535c90433424","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 26: Bit Manipulation","sectionOrder":28,"title":"Range Bitwise Conjunction","order":14,"contentType":"PROBLEM","contentSlug":"range-bitwise-conjunction","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[]},{"id":"seed_e6e84935538f036f185e78eb2ad55734","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"Segment Trees — Range Queries","order":1,"contentType":"LEARNING","contentSlug":"segment-trees-range-queries","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_cad1cc7089856f7769d9c1a5d8e5b3c7","title":"The Range Query Problem","order":0},{"id":"seed_47db2322169e82d6cb0e9a48242b8412","title":"Why Arrays and Prefix Sums Aren't Enough","order":1},{"id":"seed_d761375a5e5b140a34dcff2f390bd05f","title":"Segment Tree Concept: Divide Intervals","order":2},{"id":"seed_aaa8b59d2e93590e4240c58c16351385","title":"Query Types: Sum, Min, Max, GCD","order":3}]},{"id":"seed_dba29818398dbfa1cac4fec400dc3bc1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"Segment Tree Construction & Operations","order":2,"contentType":"LEARNING","contentSlug":"segment-tree-construction-operations","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_d0d8709a35bcba6284b7f5feab61d2b4","title":"Building a Segment Tree from Array","order":0},{"id":"seed_1a48fc2e1e5a850a023d245bcd04abec","title":"Array-Based Segment Tree Representation","order":1},{"id":"seed_61acf24ca8a8340defd06e95fb587be2","title":"Query Operation: Combining Ranges","order":2},{"id":"seed_cfdc4ebaae3fc13a6e062f5036932f8e","title":"Update Operation: Point Updates","order":3},{"id":"seed_d22b2c02a6d76723dede2229a1f4e20f","title":"Time Complexity: O(log n) per Operation","order":4}]},{"id":"seed_893d97872d03e6766d83510d0e9e4ef6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"Lazy Propagation — Efficient Range Updates","order":3,"contentType":"LEARNING","contentSlug":"lazy-propagation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_a35d4ae0e48d9dafa790075f625c48c9","title":"The Challenge of Range Updates","order":0},{"id":"seed_77f460510ae44bf03214b2b419dbdabf","title":"Lazy Propagation Concept","order":1},{"id":"seed_5dc26507bd6f6b3901a1ce36591d18d7","title":"Deferring Updates Until Needed","order":2},{"id":"seed_ea756589be9bc7c76a4318b91ae86dda","title":"Time Complexity: O(log n) for Range Updates","order":3}]},{"id":"seed_8cdae02d53ae686ad934018408835585","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"Fenwick Trees — Binary Indexed Trees","order":4,"contentType":"LEARNING","contentSlug":"fenwick-trees-binary-indexed-trees","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_6b105881bcc74d00410fe49ac5824828","title":"Simpler Alternative to Segment Trees","order":0},{"id":"seed_2945561d4c1738733b2709b5058aa5f3","title":"BIT Structure and Representation","order":1},{"id":"seed_4ebaa3f2c5d034350063a6480ba4fae8","title":"Prefix Sum Queries","order":2},{"id":"seed_52d711a94610157988c5990b0e94ade5","title":"Point Updates","order":3},{"id":"seed_be71da421af1bd99410b168cee265cf2","title":"Time and Space Efficiency","order":4}]},{"id":"seed_4a658b9f40164f52ccbc04f09dce5292","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"Sparse Tables — Immutable Range Queries","order":5,"contentType":"LEARNING","contentSlug":"sparse-tables-immutable-range-queries","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_457d94b4076a85a2b089ab784f1a4abd","title":"When Data Doesn't Change","order":0},{"id":"seed_c2c0b2e5d32720b3988648223e091d93","title":"Preprocessing for O(1) Queries","order":1},{"id":"seed_eff0c684c5591064ba3aa3d3ab55d508","title":"Idempotent Operations (min, max, GCD)","order":2},{"id":"seed_475b275073d925ad5cbac11034822302","title":"Space: O(n log n)","order":3}]},{"id":"seed_92c1e899f2dc7850824e79ceba3d8805","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"LRU Cache — Design & Implementation","order":6,"contentType":"LEARNING","contentSlug":"lru-cache-design-implementation","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_d8c0824e2f37d703d24910c04fab73a1","title":"Least Recently Used Eviction Policy","order":0},{"id":"seed_624c22d5a64a63e35684c38b9edf2857","title":"Requirements: O(1) get and put","order":1},{"id":"seed_779b172069b08d00b5af98df4a992916","title":"Hash map + doubly linked list design","order":2},{"id":"seed_e883ea1b8f1f299dbf7bfcfa80fb682c","title":"Implementation Details","order":3}]},{"id":"seed_e4046c444eaa858f9d5275b09bbcf6e2","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"Skip Lists — Probabilistic Alternative to Balanced Trees","order":7,"contentType":"LEARNING","contentSlug":"skip-lists","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_f79cfcc0fa34bbc243f20be71b25f6a9","title":"Probabilistic Alternative to Balanced Trees","order":0},{"id":"seed_bf79a33095a88d763ac3d6a61ae00c80","title":"Multiple Levels of Linked Lists","order":1},{"id":"seed_edbf897e10bda21ed2d3adb065005065","title":"Expected O(log n) Operations","order":2},{"id":"seed_f00f9b24dfa92f51c394520662bc09c6","title":"Comparison with Balanced Trees","order":3}]},{"id":"seed_f533eefb9bdaa1cb6aa1aee55c2304b8","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"Bloom Filters — Probabilistic Set Membership","order":8,"contentType":"LEARNING","contentSlug":"bloom-filters","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_8c260f0011b40b4aad5f597651ef05b2","title":"Probabilistic Set Membership","order":0},{"id":"seed_986f7cb5de0d56cf603d2446e780146d","title":"False Positives, No False Negatives","order":1},{"id":"seed_8ed13b8bd16cce8b42a8cf3bad70ceb6","title":"Multiple Hash Functions","order":2},{"id":"seed_079a26f396a53a841da3ac2d96160eae","title":"Applications: Caching, Spell Checking, and Beyond","order":3}]},{"id":"seed_33bc744b2b7881d3037d84eaa8f3353f","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"When to Use Advanced Data Structures","order":9,"contentType":"LEARNING","contentSlug":"when-to-use-advanced-data-structures","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_2de92a2b90ae043fd9b1b7fe3bc4e368","title":"Identifying Range Query Needs","order":0},{"id":"seed_370128df51b9fd84edc6f0306bb1265f","title":"Segment Tree vs Fenwick Tree Decision","order":1},{"id":"seed_cb94ac47144eb5ea590dfbbd3d83edc1","title":"Cache Design Considerations","order":2},{"id":"seed_a4fb26c4e47b92fd0fc072023ab35e75","title":"Balancing Implementation Complexity","order":3}]},{"id":"seed_1856ee3f920cbba5a584ecd712b45f1e","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"Completed deliveries still count against route capacity","order":10,"contentType":"REPO","contentSlug":"dispatch-planner-route-peak","description":null,"estimatedMins":60,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[]},{"id":"seed_bd790889cff6c87c366819036da34290","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 27: Advanced Data Structures","sectionOrder":29,"title":"Measure peak load instead of total pickups","order":11,"contentType":"CODE_REVIEW","contentSlug":"dispatch-planner-review-route-peak","description":null,"estimatedMins":35,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[]},{"id":"seed_846e9824a7a20573e2e6bd910b4c1b67","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"The Problem-Solving Mindset","order":1,"contentType":"LEARNING","contentSlug":"the-problem-solving-mindset","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_78ba6fb83c8b2fdabff3102974edf6c7","title":"Growth Mindset for Problem-Solving","order":0},{"id":"seed_bf66d133d7cbe9334f5b651fec662d2e","title":"Embracing Struggle as Learning","order":1},{"id":"seed_72be5f3114a2a1c9fca264e4168d1d67","title":"Deliberate Practice Principles","order":2},{"id":"seed_7632d5a7a779f13dcaf4c5e378103e3a","title":"Building Intuition Over Time","order":3}]},{"id":"seed_92c1509afd8e93b93a3b6c6fc1c0498a","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Identifying Problem Patterns","order":2,"contentType":"LEARNING","contentSlug":"identifying-problem-patterns","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_6a7a20e99baf31c70e162e92d8f3e725","title":"Recognizing Problem Categories","order":0},{"id":"seed_8b47c8bc4653d39f40e829ab825bbac1","title":"Mapping Problems to Data Structures","order":1},{"id":"seed_fae5f16f4d497562dccf8770bf5adb18","title":"Mapping Problems to Algorithms","order":2},{"id":"seed_4e8c0933c971358f97f65c21e707e217","title":"Building a Pattern Recognition Muscle","order":3}]},{"id":"seed_ff4bb48f7761a6d02389a59a18b95ded","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Pattern Recognition Framework","order":3,"contentType":"LEARNING","contentSlug":"pattern-recognition-framework","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_8842f0c5a251ca1851d9b28076bfe7a6","title":"Questions to Ask When Seeing a Problem","order":0},{"id":"seed_d923f527442ee98709e8254b8000304b","title":"Constraints as Hints","order":1},{"id":"seed_3ac585b1ee57cc49aaab8189c6f3bf53","title":"Input/Output Structure Analysis","order":2},{"id":"seed_f30b1ed570b4c880afa515cb49fcc51c","title":"Relating to Known Problems","order":3}]},{"id":"seed_b0c9bd90115aa5277f828f114b2b7f7c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Constraint-Based Algorithm Selection","order":4,"contentType":"LEARNING","contentSlug":"constraint-based-algorithm-selection","description":null,"estimatedMins":40,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_c0c4528d4770e8d61db787ab4a336c41","title":"Reading Constraints Carefully","order":0},{"id":"seed_7f77343e464526b36c8d9fc6e44266ba","title":"Estimating Required Time Complexity","order":1},{"id":"seed_9ea1e5ea62de65d05974ea554c380fb2","title":"Common Constraint → Complexity Mappings","order":2},{"id":"seed_0491256965512a2d3e3a03ca42c16e8c","title":"Using Constraints to Eliminate Approaches","order":3}]},{"id":"seed_66abc3487349e00ba55f22054a701a98","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Edge Cases & Testing Strategies","order":5,"contentType":"LEARNING","contentSlug":"edge-cases-and-testing-strategies","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_8418b996dd9b7fb53f406c78dbad24a2","title":"Common Edge Cases by Data Structure","order":0},{"id":"seed_57ee5c4ed72b71853abe1aadd6e70464","title":"Empty Inputs, Single Elements","order":1},{"id":"seed_9f87f7f7fa9347e54fcf5b5561115ee8","title":"Minimum/Maximum Values","order":2},{"id":"seed_336c0d7ca8e4626c11058c18a41a342d","title":"Duplicates and Special Characters","order":3},{"id":"seed_dc6a9ab60f5568627353905ad217fe64","title":"Generating Test Cases","order":4}]},{"id":"seed_2634e6b8333d74de3b9ffec19d677609","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Debugging Algorithmic Code","order":6,"contentType":"LEARNING","contentSlug":"debugging-algorithmic-code","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_e0558633b7fa4d79528ae48088333736","title":"Common Bug Patterns in DSA","order":0},{"id":"seed_ab7adc3f24c8d9e4bbb6fe542dc505fb","title":"Off-by-One Errors","order":1},{"id":"seed_2800adc37dc680b44d856c09c7389d7e","title":"Integer Overflow","order":2},{"id":"seed_fe26f0d0c4cc4404d87c5f57e4cd3eed","title":"Incorrect Base Cases","order":3},{"id":"seed_963326e19521e0b5fa77a51b668f3348","title":"Systematic Debugging Approach","order":4}]},{"id":"seed_2b4068cae0c05cc74e0688d5bffd0ac6","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Optimization Techniques","order":7,"contentType":"LEARNING","contentSlug":"optimization-techniques","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_bd4b9bd02dada8f20d91cefbc7416da5","title":"Recognizing Optimization Opportunities","order":0},{"id":"seed_0a05415685af7474f018a3c2ee448651","title":"Preprocessing Data","order":1},{"id":"seed_03681d9305f8f9200fb2413753b8606f","title":"Early Termination","order":2},{"id":"seed_c623b350cdd545fb42e89b67569e5dbd","title":"Pruning Search Space","order":3},{"id":"seed_14f52b66a61a7033cd2611712d868d50","title":"Space-Time Trade-offs","order":4}]},{"id":"seed_de598a3b78743127f4f7224e874ecde2","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Time Management in Technical Interviews","order":8,"contentType":"LEARNING","contentSlug":"time-management-in-interviews","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_3787125e01f331ed6aa135c5810a2db1","title":"Reading and Understanding (5 min)","order":0},{"id":"seed_e647e12f63675d93c076d313e6581d92","title":"Clarifying Questions","order":1},{"id":"seed_804c8a1b782e3c7fac26b5cf1521b147","title":"Designing Approach Before Coding","order":2},{"id":"seed_4290ddfba226363b99c77f6922e77668","title":"Coding with Communication","order":3},{"id":"seed_f7c5439e27b7a654b25cdfba334cadbd","title":"Testing and Verification","order":4}]},{"id":"seed_703f321bbc9490c78125158fd6a69663","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"From Solution to Clean Code","order":9,"contentType":"LEARNING","contentSlug":"from-solution-to-clean-code","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_69ec483a0f4bcc9ea8df4097c842dfb4","title":"Writing Readable Algorithmic Code","order":0},{"id":"seed_eda0d358bf6a9d54721da9462f69f77e","title":"Naming Variables Meaningfully","order":1},{"id":"seed_15c2a95b2e04cea69573cde518050f01","title":"Extracting Helper Functions","order":2},{"id":"seed_1f64713b8a87a50ef19c2bd984e68d5b","title":"Commenting Non-Obvious Logic","order":3},{"id":"seed_138eabf0bf1c224594810a9d3db7c2ac","title":"Code Review Readiness","order":4}]},{"id":"seed_4cb550b282b16fe56809c7b7766f9d47","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Building Long-Term DSA Fluency","order":10,"contentType":"LEARNING","contentSlug":"building-long-term-dsa-fluency","description":null,"estimatedMins":50,"createdAt":"2026-10-15T17:47:45.144Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[{"id":"seed_c349ffb70d17dbfd0b861146061ad58b","title":"Spaced Repetition for Retention","order":0},{"id":"seed_9c4292ffe6d70cd60bfe81761624208d","title":"Problem Quantity vs Quality","order":1},{"id":"seed_13616b8ef5c71432ebabd7d591b40c11","title":"Building a Problem Log","order":2},{"id":"seed_c6b7621c6821867f107ac205fb2ec9e5","title":"Revisiting Old Problems","order":3},{"id":"seed_0e1735f54844ca9776b3d19b0a1ddb5c","title":"Continuous Learning Path","order":4}]},{"id":"seed_72b9696adc808bc1d2aa945fae5b49fd","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Rainfall Basin Accumulation","order":11,"contentType":"PROBLEM","contentSlug":"rainfall-basin-accumulation","description":null,"estimatedMins":45,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[]},{"id":"seed_430f390ffca7237b9b28a395e229d8b8","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Overlapping annotations leave fragments in redacted output","order":12,"contentType":"REPO","contentSlug":"redaction-gateway-overlap-union","description":null,"estimatedMins":60,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[]},{"id":"seed_46fb74ec44a28be69b7b0c33e8540df1","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Merge overlapping spans while leaving the renderer cursor unchanged","order":13,"contentType":"CODE_REVIEW","contentSlug":"redaction-gateway-review-overlap-union","description":null,"estimatedMins":35,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[]},{"id":"seed_1d00c394451bdcc0ef0949062ef93f7c","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Repeated translation placeholders disappear during review","order":14,"contentType":"REPO","contentSlug":"translation-workbench-placeholder-counts","description":null,"estimatedMins":60,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[]},{"id":"seed_31afb5c4af87239af8d6dd232a3788ab","learningPathId":"seed_a45eefd7ace053183db2aca078e8dfbc","section":"Chapter 28: Problem Solving Strategies","sectionOrder":30,"title":"Count every occurrence of a translation placeholder","order":15,"contentType":"CODE_REVIEW","contentSlug":"translation-workbench-review-placeholder-counts","description":null,"estimatedMins":35,"createdAt":"2026-10-17T16:02:58.773Z","updatedAt":"2026-10-17T16:28:29.834Z","pages":[]}]},"currentModule":"$46:props:state:queries:1:state:data:json:path:modules:106","prevModule":"$46:props:state:queries:1:state:data:json:path:modules:105","nextModule":"$46:props:state:queries:1:state:data:json:path:modules:107","allModules":"$46:props:state:queries:1:state:data:json:path:modules"},"meta":{"values":{"path.createdAt":["Date"],"path.updatedAt":["Date"],"path.modules.0.createdAt":["Date"],"path.modules.0.updatedAt":["Date"],"path.modules.1.createdAt":["Date"],"path.modules.1.updatedAt":["Date"],"path.modules.2.createdAt":["Date"],"path.modules.2.updatedAt":["Date"],"path.modules.3.createdAt":["Date"],"path.modules.3.updatedAt":["Date"],"path.modules.4.createdAt":["Date"],"path.modules.4.updatedAt":["Date"],"path.modules.5.createdAt":["Date"],"path.modules.5.updatedAt":["Date"],"path.modules.6.createdAt":["Date"],"path.modules.6.updatedAt":["Date"],"path.modules.7.createdAt":["Date"],"path.modules.7.updatedAt":["Date"],"path.modules.8.createdAt":["Date"],"path.modules.8.updatedAt":["Date"],"path.modules.9.createdAt":["Date"],"path.modules.9.updatedAt":["Date"],"path.modules.10.createdAt":["Date"],"path.modules.10.updatedAt":["Date"],"path.modules.11.createdAt":["Date"],"path.modules.11.updatedAt":["Date"],"path.modules.12.createdAt":["Date"],"path.modules.12.updatedAt":["Date"],"path.modules.13.createdAt":["Date"],"path.modules.13.updatedAt":["Date"],"path.modules.14.createdAt":["Date"],"path.modules.14.updatedAt":["Date"],"path.modules.15.createdAt":["Date"],"path.modules.15.updatedAt":["Date"],"path.modules.16.createdAt":["Date"],"path.modules.16.updatedAt":["Date"],"path.modules.17.createdAt":["Date"],"path.modules.17.updatedAt":["Date"],"path.modules.18.createdAt":["Date"],"path.modules.18.updatedAt":["Date"],"path.modules.19.createdAt":["Date"],"path.modules.19.updatedAt":["Date"],"path.modules.20.createdAt":["Date"],"path.modules.20.updatedAt":["Date"],"path.modules.21.createdAt":["Date"],"path.modules.21.updatedAt":["Date"],"path.modules.22.createdAt":["Date"],"path.modules.22.updatedAt":["Date"],"path.modules.23.createdAt":["Date"],"path.modules.23.updatedAt":["Date"],"path.modules.24.createdAt":["Date"],"path.modules.24.updatedAt":["Date"],"path.modules.25.createdAt":["Date"],"path.modules.25.updatedAt":["Date"],"path.modules.26.createdAt":["Date"],"path.modules.26.updatedAt":["Date"],"path.modules.27.createdAt":["Date"],"path.modules.27.updatedAt":["Date"],"path.modules.28.createdAt":["Date"],"path.modules.28.updatedAt":["Date"],"path.modules.29.createdAt":["Date"],"path.modules.29.updatedAt":["Date"],"path.modules.30.createdAt":["Date"],"path.modules.30.updatedAt":["Date"],"path.modules.31.createdAt":["Date"],"path.modules.31.updatedAt":["Date"],"path.modules.32.createdAt":["Date"],"path.modules.32.updatedAt":["Date"],"path.modules.33.createdAt":["Date"],"path.modules.33.updatedAt":["Date"],"path.modules.34.createdAt":["Date"],"path.modules.34.updatedAt":["Date"],"path.modules.35.createdAt":["Date"],"path.modules.35.updatedAt":["Date"],"path.modules.36.createdAt":["Date"],"path.modules.36.updatedAt":["Date"],"path.modules.37.createdAt":["Date"],"path.modules.37.updatedAt":["Date"],"path.modules.38.createdAt":["Date"],"path.modules.38.updatedAt":["Date"],"path.modules.39.createdAt":["Date"],"path.modules.39.updatedAt":["Date"],"path.modules.40.createdAt":["Date"],"path.modules.40.updatedAt":["Date"],"path.modules.41.createdAt":["Date"],"path.modules.41.updatedAt":["Date"],"path.modules.42.createdAt":["Date"],"path.modules.42.updatedAt":["Date"],"path.modules.43.createdAt":["Date"],"path.modules.43.updatedAt":["Date"],"path.modules.44.createdAt":["Date"],"path.modules.44.updatedAt":["Date"],"path.modules.45.createdAt":["Date"],"path.modules.45.updatedAt":["Date"],"path.modules.46.createdAt":["Date"],"path.modules.46.updatedAt":["Date"],"path.modules.47.createdAt":["Date"],"path.modules.47.updatedAt":["Date"],"path.modules.48.createdAt":["Date"],"path.modules.48.updatedAt":["Date"],"path.modules.49.createdAt":["Date"],"path.modules.49.updatedAt":["Date"],"path.modules.50.createdAt":["Date"],"path.modules.50.updatedAt":["Date"],"path.modules.51.createdAt":["Date"],"path.modules.51.updatedAt":["Date"],"path.modules.52.createdAt":["Date"],"path.modules.52.updatedAt":["Date"],"path.modules.53.createdAt":["Date"],"path.modules.53.updatedAt":["Date"],"path.modules.54.createdAt":["Date"],"path.modules.54.updatedAt":["Date"],"path.modules.55.createdAt":["Date"],"path.modules.55.updatedAt":["Date"],"path.modules.56.createdAt":["Date"],"path.modules.56.updatedAt":["Date"],"path.modules.57.createdAt":["Date"],"path.modules.57.updatedAt":["Date"],"path.modules.58.createdAt":["Date"],"path.modules.58.updatedAt":["Date"],"path.modules.59.createdAt":["Date"],"path.modules.59.updatedAt":["Date"],"path.modules.60.createdAt":["Date"],"path.modules.60.updatedAt":["Date"],"path.modules.61.createdAt":["Date"],"path.modules.61.updatedAt":["Date"],"path.modules.62.createdAt":["Date"],"path.modules.62.updatedAt":["Date"],"path.modules.63.createdAt":["Date"],"path.modules.63.updatedAt":["Date"],"path.modules.64.createdAt":["Date"],"path.modules.64.updatedAt":["Date"],"path.modules.65.createdAt":["Date"],"path.modules.65.updatedAt":["Date"],"path.modules.66.createdAt":["Date"],"path.modules.66.updatedAt":["Date"],"path.modules.67.createdAt":["Date"],"path.modules.67.updatedAt":["Date"],"path.modules.68.createdAt":["Date"],"path.modules.68.updatedAt":["Date"],"path.modules.69.createdAt":["Date"],"path.modules.69.updatedAt":["Date"],"path.modules.70.createdAt":["Date"],"path.modules.70.updatedAt":["Date"],"path.modules.71.createdAt":["Date"],"path.modules.71.updatedAt":["Date"],"path.modules.72.createdAt":["Date"],"path.modules.72.updatedAt":["Date"],"path.modules.73.createdAt":["Date"],"path.modules.73.updatedAt":["Date"],"path.modules.74.createdAt":["Date"],"path.modules.74.updatedAt":["Date"],"path.modules.75.createdAt":["Date"],"path.modules.75.updatedAt":["Date"],"path.modules.76.createdAt":["Date"],"path.modules.76.updatedAt":["Date"],"path.modules.77.createdAt":["Date"],"path.modules.77.updatedAt":["Date"],"path.modules.78.createdAt":["Date"],"path.modules.78.updatedAt":["Date"],"path.modules.79.createdAt":["Date"],"path.modules.79.updatedAt":["Date"],"path.modules.80.createdAt":["Date"],"path.modules.80.updatedAt":["Date"],"path.modules.81.createdAt":["Date"],"path.modules.81.updatedAt":["Date"],"path.modules.82.createdAt":["Date"],"path.modules.82.updatedAt":["Date"],"path.modules.83.createdAt":["Date"],"path.modules.83.updatedAt":["Date"],"path.modules.84.createdAt":["Date"],"path.modules.84.updatedAt":["Date"],"path.modules.85.createdAt":["Date"],"path.modules.85.updatedAt":["Date"],"path.modules.86.createdAt":["Date"],"path.modules.86.updatedAt":["Date"],"path.modules.87.createdAt":["Date"],"path.modules.87.updatedAt":["Date"],"path.modules.88.createdAt":["Date"],"path.modules.88.updatedAt":["Date"],"path.modules.89.createdAt":["Date"],"path.modules.89.updatedAt":["Date"],"path.modules.90.createdAt":["Date"],"path.modules.90.updatedAt":["Date"],"path.modules.91.createdAt":["Date"],"path.modules.91.updatedAt":["Date"],"path.modules.92.createdAt":["Date"],"path.modules.92.updatedAt":["Date"],"path.modules.93.createdAt":["Date"],"path.modules.93.updatedAt":["Date"],"path.modules.94.createdAt":["Date"],"path.modules.94.updatedAt":["Date"],"path.modules.95.createdAt":["Date"],"path.modules.95.updatedAt":["Date"],"path.modules.96.createdAt":["Date"],"path.modules.96.updatedAt":["Date"],"path.modules.97.createdAt":["Date"],"path.modules.97.updatedAt":["Date"],"path.modules.98.createdAt":["Date"],"path.modules.98.updatedAt":["Date"],"path.modules.99.createdAt":["Date"],"path.modules.99.updatedAt":["Date"],"path.modules.100.createdAt":["Date"],"path.modules.100.updatedAt":["Date"],"path.modules.101.createdAt":["Date"],"path.modules.101.updatedAt":["Date"],"path.modules.102.createdAt":["Date"],"path.modules.102.updatedAt":["Date"],"path.modules.103.createdAt":["Date"],"path.modules.103.updatedAt":["Date"],"path.modules.104.createdAt":["Date"],"path.modules.104.updatedAt":["Date"],"path.modules.105.createdAt":["Date"],"path.modules.105.updatedAt":["Date"],"path.modules.106.createdAt":["Date"],"path.modules.106.updatedAt":["Date"],"path.modules.107.createdAt":["Date"],"path.modules.107.updatedAt":["Date"],"path.modules.108.createdAt":["Date"],"path.modules.108.updatedAt":["Date"],"path.modules.109.createdAt":["Date"],"path.modules.109.updatedAt":["Date"],"path.modules.110.createdAt":["Date"],"path.modules.110.updatedAt":["Date"],"path.modules.111.createdAt":["Date"],"path.modules.111.updatedAt":["Date"],"path.modules.112.createdAt":["Date"],"path.modules.112.updatedAt":["Date"],"path.modules.113.createdAt":["Date"],"path.modules.113.updatedAt":["Date"],"path.modules.114.createdAt":["Date"],"path.modules.114.updatedAt":["Date"],"path.modules.115.createdAt":["Date"],"path.modules.115.updatedAt":["Date"],"path.modules.116.createdAt":["Date"],"path.modules.116.updatedAt":["Date"],"path.modules.117.createdAt":["Date"],"path.modules.117.updatedAt":["Date"],"path.modules.118.createdAt":["Date"],"path.modules.118.updatedAt":["Date"],"path.modules.119.createdAt":["Date"],"path.modules.119.updatedAt":["Date"],"path.modules.120.createdAt":["Date"],"path.modules.120.updatedAt":["Date"],"path.modules.121.createdAt":["Date"],"path.modules.121.updatedAt":["Date"],"path.modules.122.createdAt":["Date"],"path.modules.122.updatedAt":["Date"],"path.modules.123.createdAt":["Date"],"path.modules.123.updatedAt":["Date"],"path.modules.124.createdAt":["Date"],"path.modules.124.updatedAt":["Date"],"path.modules.125.createdAt":["Date"],"path.modules.125.updatedAt":["Date"],"path.modules.126.createdAt":["Date"],"path.modules.126.updatedAt":["Date"],"path.modules.127.createdAt":["Date"],"path.modules.127.updatedAt":["Date"],"path.modules.128.createdAt":["Date"],"path.modules.128.updatedAt":["Date"],"path.modules.129.createdAt":["Date"],"path.modules.129.updatedAt":["Date"],"path.modules.130.createdAt":["Date"],"path.modules.130.updatedAt":["Date"],"path.modules.131.createdAt":["Date"],"path.modules.131.updatedAt":["Date"],"path.modules.132.createdAt":["Date"],"path.modules.132.updatedAt":["Date"],"path.modules.133.createdAt":["Date"],"path.modules.133.updatedAt":["Date"],"path.modules.134.createdAt":["Date"],"path.modules.134.updatedAt":["Date"],"path.modules.135.createdAt":["Date"],"path.modules.135.updatedAt":["Date"],"path.modules.136.createdAt":["Date"],"path.modules.136.updatedAt":["Date"],"path.modules.137.createdAt":["Date"],"path.modules.137.updatedAt":["Date"],"path.modules.138.createdAt":["Date"],"path.modules.138.updatedAt":["Date"],"path.modules.139.createdAt":["Date"],"path.modules.139.updatedAt":["Date"],"path.modules.140.createdAt":["Date"],"path.modules.140.updatedAt":["Date"],"path.modules.141.createdAt":["Date"],"path.modules.141.updatedAt":["Date"],"path.modules.142.createdAt":["Date"],"path.modules.142.updatedAt":["Date"],"path.modules.143.createdAt":["Date"],"path.modules.143.updatedAt":["Date"],"path.modules.144.createdAt":["Date"],"path.modules.144.updatedAt":["Date"],"path.modules.145.createdAt":["Date"],"path.modules.145.updatedAt":["Date"],"path.modules.146.createdAt":["Date"],"path.modules.146.updatedAt":["Date"],"path.modules.147.createdAt":["Date"],"path.modules.147.updatedAt":["Date"],"path.modules.148.createdAt":["Date"],"path.modules.148.updatedAt":["Date"],"path.modules.149.createdAt":["Date"],"path.modules.149.updatedAt":["Date"],"path.modules.150.createdAt":["Date"],"path.modules.150.updatedAt":["Date"],"path.modules.151.createdAt":["Date"],"path.modules.151.updatedAt":["Date"],"path.modules.152.createdAt":["Date"],"path.modules.152.updatedAt":["Date"],"path.modules.153.createdAt":["Date"],"path.modules.153.updatedAt":["Date"],"path.modules.154.createdAt":["Date"],"path.modules.154.updatedAt":["Date"],"path.modules.155.createdAt":["Date"],"path.modules.155.updatedAt":["Date"],"path.modules.156.createdAt":["Date"],"path.modules.156.updatedAt":["Date"],"path.modules.157.createdAt":["Date"],"path.modules.157.updatedAt":["Date"],"path.modules.158.createdAt":["Date"],"path.modules.158.updatedAt":["Date"],"path.modules.159.createdAt":["Date"],"path.modules.159.updatedAt":["Date"],"path.modules.160.createdAt":["Date"],"path.modules.160.updatedAt":["Date"],"path.modules.161.createdAt":["Date"],"path.modules.161.updatedAt":["Date"],"path.modules.162.createdAt":["Date"],"path.modules.162.updatedAt":["Date"],"path.modules.163.createdAt":["Date"],"path.modules.163.updatedAt":["Date"],"path.modules.164.createdAt":["Date"],"path.modules.164.updatedAt":["Date"],"path.modules.165.createdAt":["Date"],"path.modules.165.updatedAt":["Date"],"path.modules.166.createdAt":["Date"],"path.modules.166.updatedAt":["Date"],"path.modules.167.createdAt":["Date"],"path.modules.167.updatedAt":["Date"],"path.modules.168.createdAt":["Date"],"path.modules.168.updatedAt":["Date"],"path.modules.169.createdAt":["Date"],"path.modules.169.updatedAt":["Date"],"path.modules.170.createdAt":["Date"],"path.modules.170.updatedAt":["Date"],"path.modules.171.createdAt":["Date"],"path.modules.171.updatedAt":["Date"],"path.modules.172.createdAt":["Date"],"path.modules.172.updatedAt":["Date"],"path.modules.173.createdAt":["Date"],"path.modules.173.updatedAt":["Date"],"path.modules.174.createdAt":["Date"],"path.modules.174.updatedAt":["Date"],"path.modules.175.createdAt":["Date"],"path.modules.175.updatedAt":["Date"],"path.modules.176.createdAt":["Date"],"path.modules.176.updatedAt":["Date"],"path.modules.177.createdAt":["Date"],"path.modules.177.updatedAt":["Date"],"path.modules.178.createdAt":["Date"],"path.modules.178.updatedAt":["Date"],"path.modules.179.createdAt":["Date"],"path.modules.179.updatedAt":["Date"],"path.modules.180.createdAt":["Date"],"path.modules.180.updatedAt":["Date"],"path.modules.181.createdAt":["Date"],"path.modules.181.updatedAt":["Date"],"path.modules.182.createdAt":["Date"],"path.modules.182.updatedAt":["Date"],"path.modules.183.createdAt":["Date"],"path.modules.183.updatedAt":["Date"],"path.modules.184.createdAt":["Date"],"path.modules.184.updatedAt":["Date"],"path.modules.185.createdAt":["Date"],"path.modules.185.updatedAt":["Date"],"path.modules.186.createdAt":["Date"],"path.modules.186.updatedAt":["Date"],"path.modules.187.createdAt":["Date"],"path.modules.187.updatedAt":["Date"],"path.modules.188.createdAt":["Date"],"path.modules.188.updatedAt":["Date"],"path.modules.189.createdAt":["Date"],"path.modules.189.updatedAt":["Date"],"path.modules.190.createdAt":["Date"],"path.modules.190.updatedAt":["Date"],"path.modules.191.createdAt":["Date"],"path.modules.191.updatedAt":["Date"],"path.modules.192.createdAt":["Date"],"path.modules.192.updatedAt":["Date"],"path.modules.193.createdAt":["Date"],"path.modules.193.updatedAt":["Date"],"path.modules.194.createdAt":["Date"],"path.modules.194.updatedAt":["Date"],"path.modules.195.createdAt":["Date"],"path.modules.195.updatedAt":["Date"],"path.modules.196.createdAt":["Date"],"path.modules.196.updatedAt":["Date"],"path.modules.197.createdAt":["Date"],"path.modules.197.updatedAt":["Date"],"path.modules.198.createdAt":["Date"],"path.modules.198.updatedAt":["Date"],"path.modules.199.createdAt":["Date"],"path.modules.199.updatedAt":["Date"],"path.modules.200.createdAt":["Date"],"path.modules.200.updatedAt":["Date"],"path.modules.201.createdAt":["Date"],"path.modules.201.updatedAt":["Date"],"path.modules.202.createdAt":["Date"],"path.modules.202.updatedAt":["Date"],"path.modules.203.createdAt":["Date"],"path.modules.203.updatedAt":["Date"],"path.modules.204.createdAt":["Date"],"path.modules.204.updatedAt":["Date"],"path.modules.205.createdAt":["Date"],"path.modules.205.updatedAt":["Date"],"path.modules.206.createdAt":["Date"],"path.modules.206.updatedAt":["Date"],"path.modules.207.createdAt":["Date"],"path.modules.207.updatedAt":["Date"],"path.modules.208.createdAt":["Date"],"path.modules.208.updatedAt":["Date"],"path.modules.209.createdAt":["Date"],"path.modules.209.updatedAt":["Date"],"path.modules.210.createdAt":["Date"],"path.modules.210.updatedAt":["Date"],"path.modules.211.createdAt":["Date"],"path.modules.211.updatedAt":["Date"],"path.modules.212.createdAt":["Date"],"path.modules.212.updatedAt":["Date"],"path.modules.213.createdAt":["Date"],"path.modules.213.updatedAt":["Date"],"path.modules.214.createdAt":["Date"],"path.modules.214.updatedAt":["Date"],"path.modules.215.createdAt":["Date"],"path.modules.215.updatedAt":["Date"],"path.modules.216.createdAt":["Date"],"path.modules.216.updatedAt":["Date"],"path.modules.217.createdAt":["Date"],"path.modules.217.updatedAt":["Date"],"path.modules.218.createdAt":["Date"],"path.modules.218.updatedAt":["Date"],"path.modules.219.createdAt":["Date"],"path.modules.219.updatedAt":["Date"],"path.modules.220.createdAt":["Date"],"path.modules.220.updatedAt":["Date"],"path.modules.221.createdAt":["Date"],"path.modules.221.updatedAt":["Date"],"path.modules.222.createdAt":["Date"],"path.modules.222.updatedAt":["Date"],"path.modules.223.createdAt":["Date"],"path.modules.223.updatedAt":["Date"],"path.modules.224.createdAt":["Date"],"path.modules.224.updatedAt":["Date"],"path.modules.225.createdAt":["Date"],"path.modules.225.updatedAt":["Date"],"path.modules.226.createdAt":["Date"],"path.modules.226.updatedAt":["Date"],"path.modules.227.createdAt":["Date"],"path.modules.227.updatedAt":["Date"],"path.modules.228.createdAt":["Date"],"path.modules.228.updatedAt":["Date"],"path.modules.229.createdAt":["Date"],"path.modules.229.updatedAt":["Date"],"path.modules.230.createdAt":["Date"],"path.modules.230.updatedAt":["Date"],"path.modules.231.createdAt":["Date"],"path.modules.231.updatedAt":["Date"],"path.modules.232.createdAt":["Date"],"path.modules.232.updatedAt":["Date"],"path.modules.233.createdAt":["Date"],"path.modules.233.updatedAt":["Date"],"path.modules.234.createdAt":["Date"],"path.modules.234.updatedAt":["Date"],"path.modules.235.createdAt":["Date"],"path.modules.235.updatedAt":["Date"],"path.modules.236.createdAt":["Date"],"path.modules.236.updatedAt":["Date"],"path.modules.237.createdAt":["Date"],"path.modules.237.updatedAt":["Date"],"path.modules.238.createdAt":["Date"],"path.modules.238.updatedAt":["Date"],"path.modules.239.createdAt":["Date"],"path.modules.239.updatedAt":["Date"],"path.modules.240.createdAt":["Date"],"path.modules.240.updatedAt":["Date"],"path.modules.241.createdAt":["Date"],"path.modules.241.updatedAt":["Date"],"path.modules.242.createdAt":["Date"],"path.modules.242.updatedAt":["Date"],"path.modules.243.createdAt":["Date"],"path.modules.243.updatedAt":["Date"],"path.modules.244.createdAt":["Date"],"path.modules.244.updatedAt":["Date"],"path.modules.245.createdAt":["Date"],"path.modules.245.updatedAt":["Date"],"path.modules.246.createdAt":["Date"],"path.modules.246.updatedAt":["Date"],"path.modules.247.createdAt":["Date"],"path.modules.247.updatedAt":["Date"],"path.modules.248.createdAt":["Date"],"path.modules.248.updatedAt":["Date"],"path.modules.249.createdAt":["Date"],"path.modules.249.updatedAt":["Date"],"path.modules.250.createdAt":["Date"],"path.modules.250.updatedAt":["Date"],"path.modules.251.createdAt":["Date"],"path.modules.251.updatedAt":["Date"],"path.modules.252.createdAt":["Date"],"path.modules.252.updatedAt":["Date"],"path.modules.253.createdAt":["Date"],"path.modules.253.updatedAt":["Date"],"path.modules.254.createdAt":["Date"],"path.modules.254.updatedAt":["Date"],"path.modules.255.createdAt":["Date"],"path.modules.255.updatedAt":["Date"],"path.modules.256.createdAt":["Date"],"path.modules.256.updatedAt":["Date"],"path.modules.257.createdAt":["Date"],"path.modules.257.updatedAt":["Date"],"path.modules.258.createdAt":["Date"],"path.modules.258.updatedAt":["Date"],"path.modules.259.createdAt":["Date"],"path.modules.259.updatedAt":["Date"],"path.modules.260.createdAt":["Date"],"path.modules.260.updatedAt":["Date"],"path.modules.261.createdAt":["Date"],"path.modules.261.updatedAt":["Date"],"path.modules.262.createdAt":["Date"],"path.modules.262.updatedAt":["Date"],"path.modules.263.createdAt":["Date"],"path.modules.263.updatedAt":["Date"],"path.modules.264.createdAt":["Date"],"path.modules.264.updatedAt":["Date"],"path.modules.265.createdAt":["Date"],"path.modules.265.updatedAt":["Date"],"path.modules.266.createdAt":["Date"],"path.modules.266.updatedAt":["Date"],"path.modules.267.createdAt":["Date"],"path.modules.267.updatedAt":["Date"],"path.modules.268.createdAt":["Date"],"path.modules.268.updatedAt":["Date"],"path.modules.269.createdAt":["Date"],"path.modules.269.updatedAt":["Date"],"path.modules.270.createdAt":["Date"],"path.modules.270.updatedAt":["Date"],"path.modules.271.createdAt":["Date"],"path.modules.271.updatedAt":["Date"],"path.modules.272.createdAt":["Date"],"path.modules.272.updatedAt":["Date"],"path.modules.273.createdAt":["Date"],"path.modules.273.updatedAt":["Date"],"path.modules.274.createdAt":["Date"],"path.modules.274.updatedAt":["Date"],"path.modules.275.createdAt":["Date"],"path.modules.275.updatedAt":["Date"],"path.modules.276.createdAt":["Date"],"path.modules.276.updatedAt":["Date"],"path.modules.277.createdAt":["Date"],"path.modules.277.updatedAt":["Date"],"path.modules.278.createdAt":["Date"],"path.modules.278.updatedAt":["Date"],"path.modules.279.createdAt":["Date"],"path.modules.279.updatedAt":["Date"],"path.modules.280.createdAt":["Date"],"path.modules.280.updatedAt":["Date"],"path.modules.281.createdAt":["Date"],"path.modules.281.updatedAt":["Date"],"path.modules.282.createdAt":["Date"],"path.modules.282.updatedAt":["Date"],"path.modules.283.createdAt":["Date"],"path.modules.283.updatedAt":["Date"],"path.modules.284.createdAt":["Date"],"path.modules.284.updatedAt":["Date"],"path.modules.285.createdAt":["Date"],"path.modules.285.updatedAt":["Date"],"path.modules.286.createdAt":["Date"],"path.modules.286.updatedAt":["Date"],"path.modules.287.createdAt":["Date"],"path.modules.287.updatedAt":["Date"],"path.modules.288.createdAt":["Date"],"path.modules.288.updatedAt":["Date"],"path.modules.289.createdAt":["Date"],"path.modules.289.updatedAt":["Date"],"path.modules.290.createdAt":["Date"],"path.modules.290.updatedAt":["Date"],"path.modules.291.createdAt":["Date"],"path.modules.291.updatedAt":["Date"],"path.modules.292.createdAt":["Date"],"path.modules.292.updatedAt":["Date"],"path.modules.293.createdAt":["Date"],"path.modules.293.updatedAt":["Date"],"path.modules.294.createdAt":["Date"],"path.modules.294.updatedAt":["Date"],"path.modules.295.createdAt":["Date"],"path.modules.295.updatedAt":["Date"],"path.modules.296.createdAt":["Date"],"path.modules.296.updatedAt":["Date"],"path.modules.297.createdAt":["Date"],"path.modules.297.updatedAt":["Date"],"path.modules.298.createdAt":["Date"],"path.modules.298.updatedAt":["Date"],"path.modules.299.createdAt":["Date"],"path.modules.299.updatedAt":["Date"],"path.modules.300.createdAt":["Date"],"path.modules.300.updatedAt":["Date"],"path.modules.301.createdAt":["Date"],"path.modules.301.updatedAt":["Date"],"path.modules.302.createdAt":["Date"],"path.modules.302.updatedAt":["Date"],"path.modules.303.createdAt":["Date"],"path.modules.303.updatedAt":["Date"],"path.modules.304.createdAt":["Date"],"path.modules.304.updatedAt":["Date"],"path.modules.305.createdAt":["Date"],"path.modules.305.updatedAt":["Date"],"path.modules.306.createdAt":["Date"],"path.modules.306.updatedAt":["Date"],"path.modules.307.createdAt":["Date"],"path.modules.307.updatedAt":["Date"],"path.modules.308.createdAt":["Date"],"path.modules.308.updatedAt":["Date"],"path.modules.309.createdAt":["Date"],"path.modules.309.updatedAt":["Date"],"path.modules.310.createdAt":["Date"],"path.modules.310.updatedAt":["Date"],"path.modules.311.createdAt":["Date"],"path.modules.311.updatedAt":["Date"],"path.modules.312.createdAt":["Date"],"path.modules.312.updatedAt":["Date"],"path.modules.313.createdAt":["Date"],"path.modules.313.updatedAt":["Date"],"path.modules.314.createdAt":["Date"],"path.modules.314.updatedAt":["Date"],"path.modules.315.createdAt":["Date"],"path.modules.315.updatedAt":["Date"],"path.modules.316.createdAt":["Date"],"path.modules.316.updatedAt":["Date"],"path.modules.317.createdAt":["Date"],"path.modules.317.updatedAt":["Date"],"path.modules.318.createdAt":["Date"],"path.modules.318.updatedAt":["Date"],"path.modules.319.createdAt":["Date"],"path.modules.319.updatedAt":["Date"],"path.modules.320.createdAt":["Date"],"path.modules.320.updatedAt":["Date"],"path.modules.321.createdAt":["Date"],"path.modules.321.updatedAt":["Date"],"path.modules.322.createdAt":["Date"],"path.modules.322.updatedAt":["Date"],"path.modules.323.createdAt":["Date"],"path.modules.323.updatedAt":["Date"],"path.modules.324.createdAt":["Date"],"path.modules.324.updatedAt":["Date"],"path.modules.325.createdAt":["Date"],"path.modules.325.updatedAt":["Date"],"path.modules.326.createdAt":["Date"],"path.modules.326.updatedAt":["Date"],"path.modules.327.createdAt":["Date"],"path.modules.327.updatedAt":["Date"],"path.modules.328.createdAt":["Date"],"path.modules.328.updatedAt":["Date"],"path.modules.329.createdAt":["Date"],"path.modules.329.updatedAt":["Date"],"path.modules.330.createdAt":["Date"],"path.modules.330.updatedAt":["Date"],"path.modules.331.createdAt":["Date"],"path.modules.331.updatedAt":["Date"],"path.modules.332.createdAt":["Date"],"path.modules.332.updatedAt":["Date"],"path.modules.333.createdAt":["Date"],"path.modules.333.updatedAt":["Date"],"path.modules.334.createdAt":["Date"],"path.modules.334.updatedAt":["Date"],"path.modules.335.createdAt":["Date"],"path.modules.335.updatedAt":["Date"],"path.modules.336.createdAt":["Date"],"path.modules.336.updatedAt":["Date"],"path.modules.337.createdAt":["Date"],"path.modules.337.updatedAt":["Date"],"path.modules.338.createdAt":["Date"],"path.modules.338.updatedAt":["Date"],"path.modules.339.createdAt":["Date"],"path.modules.339.updatedAt":["Date"],"path.modules.340.createdAt":["Date"],"path.modules.340.updatedAt":["Date"],"path.modules.341.createdAt":["Date"],"path.modules.341.updatedAt":["Date"],"path.modules.342.createdAt":["Date"],"path.modules.342.updatedAt":["Date"],"path.modules.343.createdAt":["Date"],"path.modules.343.updatedAt":["Date"],"path.modules.344.createdAt":["Date"],"path.modules.344.updatedAt":["Date"],"path.modules.345.createdAt":["Date"],"path.modules.345.updatedAt":["Date"],"path.modules.346.createdAt":["Date"],"path.modules.346.updatedAt":["Date"],"path.modules.347.createdAt":["Date"],"path.modules.347.updatedAt":["Date"],"path.modules.348.createdAt":["Date"],"path.modules.348.updatedAt":["Date"],"path.modules.349.createdAt":["Date"],"path.modules.349.updatedAt":["Date"],"path.modules.350.createdAt":["Date"],"path.modules.350.updatedAt":["Date"],"path.modules.351.createdAt":["Date"],"path.modules.351.updatedAt":["Date"],"path.modules.352.createdAt":["Date"],"path.modules.352.updatedAt":["Date"],"path.modules.353.createdAt":["Date"],"path.modules.353.updatedAt":["Date"],"path.modules.354.createdAt":["Date"],"path.modules.354.updatedAt":["Date"],"path.modules.355.createdAt":["Date"],"path.modules.355.updatedAt":["Date"],"path.modules.356.createdAt":["Date"],"path.modules.356.updatedAt":["Date"],"path.modules.357.createdAt":["Date"],"path.modules.357.updatedAt":["Date"],"path.modules.358.createdAt":["Date"],"path.modules.358.updatedAt":["Date"],"path.modules.359.createdAt":["Date"],"path.modules.359.updatedAt":["Date"],"path.modules.360.createdAt":["Date"],"path.modules.360.updatedAt":["Date"],"currentModule.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.106.createdAt","currentModule.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.106.updatedAt","prevModule.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.105.createdAt","prevModule.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.105.updatedAt","nextModule.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.107.createdAt","nextModule.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.107.updatedAt","allModules.0.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.0.createdAt","allModules.0.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.0.updatedAt","allModules.1.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.1.createdAt","allModules.1.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.1.updatedAt","allModules.2.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.2.createdAt","allModules.2.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.2.updatedAt","allModules.3.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.3.createdAt","allModules.3.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.3.updatedAt","allModules.4.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.4.createdAt","allModules.4.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.4.updatedAt","allModules.5.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.5.createdAt","allModules.5.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.5.updatedAt","allModules.6.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.6.createdAt","allModules.6.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.6.updatedAt","allModules.7.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.7.createdAt","allModules.7.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.7.updatedAt","allModules.8.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.8.createdAt","allModules.8.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.8.updatedAt","allModules.9.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.9.createdAt","allModules.9.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.9.updatedAt","allModules.10.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.10.createdAt","allModules.10.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.10.updatedAt","allModules.11.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.11.createdAt","allModules.11.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.11.updatedAt","allModules.12.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.12.createdAt","allModules.12.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.12.updatedAt","allModules.13.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.13.createdAt","allModules.13.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.13.updatedAt","allModules.14.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.14.createdAt","allModules.14.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.14.updatedAt","allModules.15.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.15.createdAt","allModules.15.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.15.updatedAt","allModules.16.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.16.createdAt","allModules.16.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.16.updatedAt","allModules.17.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.17.createdAt","allModules.17.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.17.updatedAt","allModules.18.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.18.createdAt","allModules.18.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.18.updatedAt","allModules.19.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.19.createdAt","allModules.19.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.19.updatedAt","allModules.20.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.20.createdAt","allModules.20.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.20.updatedAt","allModules.21.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.21.createdAt","allModules.21.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.21.updatedAt","allModules.22.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.22.createdAt","allModules.22.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.22.updatedAt","allModules.23.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.23.createdAt","allModules.23.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.23.updatedAt","allModules.24.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.24.createdAt","allModules.24.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.24.updatedAt","allModules.25.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.25.createdAt","allModules.25.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.25.updatedAt","allModules.26.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.26.createdAt","allModules.26.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.26.updatedAt","allModules.27.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.27.createdAt","allModules.27.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.27.updatedAt","allModules.28.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.28.createdAt","allModules.28.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.28.updatedAt","allModules.29.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.29.createdAt","allModules.29.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.29.updatedAt","allModules.30.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.30.createdAt","allModules.30.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.30.updatedAt","allModules.31.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.31.createdAt","allModules.31.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.31.updatedAt","allModules.32.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.32.createdAt","allModules.32.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.32.updatedAt","allModules.33.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.33.createdAt","allModules.33.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.33.updatedAt","allModules.34.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.34.createdAt","allModules.34.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.34.updatedAt","allModules.35.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.35.createdAt","allModules.35.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.35.updatedAt","allModules.36.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.36.createdAt","allModules.36.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.36.updatedAt","allModules.37.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.37.createdAt","allModules.37.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.37.updatedAt","allModules.38.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.38.createdAt","allModules.38.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.38.updatedAt","allModules.39.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.39.createdAt","allModules.39.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.39.updatedAt","allModules.40.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.40.createdAt","allModules.40.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.40.updatedAt","allModules.41.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.41.createdAt","allModules.41.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.41.updatedAt","allModules.42.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.42.createdAt","allModules.42.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.42.updatedAt","allModules.43.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.43.createdAt","allModules.43.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.43.updatedAt","allModules.44.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.44.createdAt","allModules.44.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.44.updatedAt","allModules.45.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.45.createdAt","allModules.45.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.45.updatedAt","allModules.46.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.46.createdAt","allModules.46.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.46.updatedAt","allModules.47.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.47.createdAt","allModules.47.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.47.updatedAt","allModules.48.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.48.createdAt","allModules.48.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.48.updatedAt","allModules.49.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.49.createdAt","allModules.49.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.49.updatedAt","allModules.50.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.50.createdAt","allModules.50.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.50.updatedAt","allModules.51.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.51.createdAt","allModules.51.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.51.updatedAt","allModules.52.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.52.createdAt","allModules.52.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.52.updatedAt","allModules.53.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.53.createdAt","allModules.53.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.53.updatedAt","allModules.54.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.54.createdAt","allModules.54.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.54.updatedAt","allModules.55.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.55.createdAt","allModules.55.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.55.updatedAt","allModules.56.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.56.createdAt","allModules.56.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.56.updatedAt","allModules.57.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.57.createdAt","allModules.57.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.57.updatedAt","allModules.58.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.58.createdAt","allModules.58.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.58.updatedAt","allModules.59.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.59.createdAt","allModules.59.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.59.updatedAt","allModules.60.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.60.createdAt","allModules.60.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.60.updatedAt","allModules.61.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.61.createdAt","allModules.61.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.61.updatedAt","allModules.62.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.62.createdAt","allModules.62.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.62.updatedAt","allModules.63.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.63.createdAt","allModules.63.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.63.updatedAt","allModules.64.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.64.createdAt","allModules.64.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.64.updatedAt","allModules.65.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.65.createdAt","allModules.65.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.65.updatedAt","allModules.66.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.66.createdAt","allModules.66.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.66.updatedAt","allModules.67.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.67.createdAt","allModules.67.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.67.updatedAt","allModules.68.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.68.createdAt","allModules.68.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.68.updatedAt","allModules.69.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.69.createdAt","allModules.69.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.69.updatedAt","allModules.70.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.70.createdAt","allModules.70.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.70.updatedAt","allModules.71.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.71.createdAt","allModules.71.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.71.updatedAt","allModules.72.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.72.createdAt","allModules.72.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.72.updatedAt","allModules.73.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.73.createdAt","allModules.73.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.73.updatedAt","allModules.74.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.74.createdAt","allModules.74.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.74.updatedAt","allModules.75.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.75.createdAt","allModules.75.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.75.updatedAt","allModules.76.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.76.createdAt","allModules.76.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.76.updatedAt","allModules.77.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.77.createdAt","allModules.77.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.77.updatedAt","allModules.78.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.78.createdAt","allModules.78.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.78.updatedAt","allModules.79.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.79.createdAt","allModules.79.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.79.updatedAt","allModules.80.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.80.createdAt","allModules.80.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.80.updatedAt","allModules.81.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.81.createdAt","allModules.81.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.81.updatedAt","allModules.82.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.82.createdAt","allModules.82.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.82.updatedAt","allModules.83.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.83.createdAt","allModules.83.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.83.updatedAt","allModules.84.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.84.createdAt","allModules.84.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.84.updatedAt","allModules.85.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.85.createdAt","allModules.85.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.85.updatedAt","allModules.86.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.86.createdAt","allModules.86.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.86.updatedAt","allModules.87.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.87.createdAt","allModules.87.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.87.updatedAt","allModules.88.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.88.createdAt","allModules.88.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.88.updatedAt","allModules.89.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.89.createdAt","allModules.89.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.89.updatedAt","allModules.90.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.90.createdAt","allModules.90.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.90.updatedAt","allModules.91.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.91.createdAt","allModules.91.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.91.updatedAt","allModules.92.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.92.createdAt","allModules.92.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.92.updatedAt","allModules.93.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.93.createdAt","allModules.93.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.93.updatedAt","allModules.94.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.94.createdAt","allModules.94.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.94.updatedAt","allModules.95.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.95.createdAt","allModules.95.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.95.updatedAt","allModules.96.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.96.createdAt","allModules.96.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.96.updatedAt","allModules.97.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.97.createdAt","allModules.97.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.97.updatedAt","allModules.98.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.98.createdAt","allModules.98.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.98.updatedAt","allModules.99.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.99.createdAt","allModules.99.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.99.updatedAt","allModules.100.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.100.createdAt","allModules.100.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.100.updatedAt","allModules.101.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.101.createdAt","allModules.101.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.101.updatedAt","allModules.102.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.102.createdAt","allModules.102.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.102.updatedAt","allModules.103.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.103.createdAt","allModules.103.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.103.updatedAt","allModules.104.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.104.createdAt","allModules.104.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.104.updatedAt","allModules.105.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.105.createdAt","allModules.105.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.105.updatedAt","allModules.106.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.106.createdAt","allModules.106.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.106.updatedAt","allModules.107.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.107.createdAt","allModules.107.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.107.updatedAt","allModules.108.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.108.createdAt","allModules.108.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.108.updatedAt","allModules.109.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.109.createdAt","allModules.109.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.109.updatedAt","allModules.110.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.110.createdAt","allModules.110.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.110.updatedAt","allModules.111.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.111.createdAt","allModules.111.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.111.updatedAt","allModules.112.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.112.createdAt","allModules.112.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.112.updatedAt","allModules.113.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.113.createdAt","allModules.113.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.113.updatedAt","allModules.114.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.114.createdAt","allModules.114.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.114.updatedAt","allModules.115.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.115.createdAt","allModules.115.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.115.updatedAt","allModules.116.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.116.createdAt","allModules.116.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.116.updatedAt","allModules.117.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.117.createdAt","allModules.117.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.117.updatedAt","allModules.118.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.118.createdAt","allModules.118.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.118.updatedAt","allModules.119.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.119.createdAt","allModules.119.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.119.updatedAt","allModules.120.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.120.createdAt","allModules.120.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.120.updatedAt","allModules.121.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.121.createdAt","allModules.121.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.121.updatedAt","allModules.122.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.122.createdAt","allModules.122.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.122.updatedAt","allModules.123.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.123.createdAt","allModules.123.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.123.updatedAt","allModules.124.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.124.createdAt","allModules.124.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.124.updatedAt","allModules.125.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.125.createdAt","allModules.125.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.125.updatedAt","allModules.126.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.126.createdAt","allModules.126.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.126.updatedAt","allModules.127.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.127.createdAt","allModules.127.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.127.updatedAt","allModules.128.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.128.createdAt","allModules.128.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.128.updatedAt","allModules.129.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.129.createdAt","allModules.129.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.129.updatedAt","allModules.130.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.130.createdAt","allModules.130.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.130.updatedAt","allModules.131.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.131.createdAt","allModules.131.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.131.updatedAt","allModules.132.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.132.createdAt","allModules.132.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.132.updatedAt","allModules.133.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.133.createdAt","allModules.133.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.133.updatedAt","allModules.134.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.134.createdAt","allModules.134.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.134.updatedAt","allModules.135.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.135.createdAt","allModules.135.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.135.updatedAt","allModules.136.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.136.createdAt","allModules.136.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.136.updatedAt","allModules.137.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.137.createdAt","allModules.137.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.137.updatedAt","allModules.138.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.138.createdAt","allModules.138.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.138.updatedAt","allModules.139.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.139.createdAt","allModules.139.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.139.updatedAt","allModules.140.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.140.createdAt","allModules.140.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.140.updatedAt","allModules.141.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.141.createdAt","allModules.141.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.141.updatedAt","allModules.142.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.142.createdAt","allModules.142.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.142.updatedAt","allModules.143.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.143.createdAt","allModules.143.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.143.updatedAt","allModules.144.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.144.createdAt","allModules.144.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.144.updatedAt","allModules.145.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.145.createdAt","allModules.145.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.145.updatedAt","allModules.146.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.146.createdAt","allModules.146.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.146.updatedAt","allModules.147.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.147.createdAt","allModules.147.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.147.updatedAt","allModules.148.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.148.createdAt","allModules.148.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.148.updatedAt","allModules.149.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.149.createdAt","allModules.149.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.149.updatedAt","allModules.150.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.150.createdAt","allModules.150.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.150.updatedAt","allModules.151.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.151.createdAt","allModules.151.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.151.updatedAt","allModules.152.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.152.createdAt","allModules.152.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.152.updatedAt","allModules.153.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.153.createdAt","allModules.153.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.153.updatedAt","allModules.154.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.154.createdAt","allModules.154.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.154.updatedAt","allModules.155.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.155.createdAt","allModules.155.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.155.updatedAt","allModules.156.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.156.createdAt","allModules.156.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.156.updatedAt","allModules.157.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.157.createdAt","allModules.157.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.157.updatedAt","allModules.158.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.158.createdAt","allModules.158.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.158.updatedAt","allModules.159.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.159.createdAt","allModules.159.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.159.updatedAt","allModules.160.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.160.createdAt","allModules.160.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.160.updatedAt","allModules.161.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.161.createdAt","allModules.161.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.161.updatedAt","allModules.162.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.162.createdAt","allModules.162.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.162.updatedAt","allModules.163.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.163.createdAt","allModules.163.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.163.updatedAt","allModules.164.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.164.createdAt","allModules.164.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.164.updatedAt","allModules.165.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.165.createdAt","allModules.165.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.165.updatedAt","allModules.166.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.166.createdAt","allModules.166.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.166.updatedAt","allModules.167.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.167.createdAt","allModules.167.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.167.updatedAt","allModules.168.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.168.createdAt","allModules.168.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.168.updatedAt","allModules.169.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.169.createdAt","allModules.169.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.169.updatedAt","allModules.170.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.170.createdAt","allModules.170.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.170.updatedAt","allModules.171.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.171.createdAt","allModules.171.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.171.updatedAt","allModules.172.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.172.createdAt","allModules.172.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.172.updatedAt","allModules.173.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.173.createdAt","allModules.173.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.173.updatedAt","allModules.174.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.174.createdAt","allModules.174.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.174.updatedAt","allModules.175.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.175.createdAt","allModules.175.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.175.updatedAt","allModules.176.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.176.createdAt","allModules.176.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.176.updatedAt","allModules.177.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.177.createdAt","allModules.177.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.177.updatedAt","allModules.178.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.178.createdAt","allModules.178.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.178.updatedAt","allModules.179.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.179.createdAt","allModules.179.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.179.updatedAt","allModules.180.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.180.createdAt","allModules.180.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.180.updatedAt","allModules.181.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.181.createdAt","allModules.181.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.181.updatedAt","allModules.182.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.182.createdAt","allModules.182.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.182.updatedAt","allModules.183.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.183.createdAt","allModules.183.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.183.updatedAt","allModules.184.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.184.createdAt","allModules.184.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.184.updatedAt","allModules.185.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.185.createdAt","allModules.185.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.185.updatedAt","allModules.186.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.186.createdAt","allModules.186.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.186.updatedAt","allModules.187.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.187.createdAt","allModules.187.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.187.updatedAt","allModules.188.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.188.createdAt","allModules.188.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.188.updatedAt","allModules.189.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.189.createdAt","allModules.189.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.189.updatedAt","allModules.190.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.190.createdAt","allModules.190.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.190.updatedAt","allModules.191.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.191.createdAt","allModules.191.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.191.updatedAt","allModules.192.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.192.createdAt","allModules.192.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.192.updatedAt","allModules.193.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.193.createdAt","allModules.193.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.193.updatedAt","allModules.194.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.194.createdAt","allModules.194.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.194.updatedAt","allModules.195.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.195.createdAt","allModules.195.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.195.updatedAt","allModules.196.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.196.createdAt","allModules.196.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.196.updatedAt","allModules.197.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.197.createdAt","allModules.197.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.197.updatedAt","allModules.198.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.198.createdAt","allModules.198.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.198.updatedAt","allModules.199.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.199.createdAt","allModules.199.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.199.updatedAt","allModules.200.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.200.createdAt","allModules.200.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.200.updatedAt","allModules.201.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.201.createdAt","allModules.201.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.201.updatedAt","allModules.202.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.202.createdAt","allModules.202.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.202.updatedAt","allModules.203.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.203.createdAt","allModules.203.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.203.updatedAt","allModules.204.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.204.createdAt","allModules.204.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.204.updatedAt","allModules.205.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.205.createdAt","allModules.205.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.205.updatedAt","allModules.206.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.206.createdAt","allModules.206.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.206.updatedAt","allModules.207.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.207.createdAt","allModules.207.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.207.updatedAt","allModules.208.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.208.createdAt","allModules.208.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.208.updatedAt","allModules.209.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.209.createdAt","allModules.209.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.209.updatedAt","allModules.210.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.210.createdAt","allModules.210.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.210.updatedAt","allModules.211.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.211.createdAt","allModules.211.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.211.updatedAt","allModules.212.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.212.createdAt","allModules.212.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.212.updatedAt","allModules.213.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.213.createdAt","allModules.213.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.213.updatedAt","allModules.214.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.214.createdAt","allModules.214.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.214.updatedAt","allModules.215.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.215.createdAt","allModules.215.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.215.updatedAt","allModules.216.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.216.createdAt","allModules.216.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.216.updatedAt","allModules.217.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.217.createdAt","allModules.217.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.217.updatedAt","allModules.218.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.218.createdAt","allModules.218.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.218.updatedAt","allModules.219.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.219.createdAt","allModules.219.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.219.updatedAt","allModules.220.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.220.createdAt","allModules.220.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.220.updatedAt","allModules.221.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.221.createdAt","allModules.221.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.221.updatedAt","allModules.222.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.222.createdAt","allModules.222.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.222.updatedAt","allModules.223.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.223.createdAt","allModules.223.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.223.updatedAt","allModules.224.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.224.createdAt","allModules.224.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.224.updatedAt","allModules.225.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.225.createdAt","allModules.225.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.225.updatedAt","allModules.226.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.226.createdAt","allModules.226.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.226.updatedAt","allModules.227.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.227.createdAt","allModules.227.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.227.updatedAt","allModules.228.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.228.createdAt","allModules.228.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.228.updatedAt","allModules.229.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.229.createdAt","allModules.229.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.229.updatedAt","allModules.230.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.230.createdAt","allModules.230.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.230.updatedAt","allModules.231.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.231.createdAt","allModules.231.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.231.updatedAt","allModules.232.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.232.createdAt","allModules.232.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.232.updatedAt","allModules.233.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.233.createdAt","allModules.233.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.233.updatedAt","allModules.234.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.234.createdAt","allModules.234.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.234.updatedAt","allModules.235.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.235.createdAt","allModules.235.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.235.updatedAt","allModules.236.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.236.createdAt","allModules.236.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.236.updatedAt","allModules.237.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.237.createdAt","allModules.237.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.237.updatedAt","allModules.238.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.238.createdAt","allModules.238.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.238.updatedAt","allModules.239.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.239.createdAt","allModules.239.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.239.updatedAt","allModules.240.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.240.createdAt","allModules.240.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.240.updatedAt","allModules.241.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.241.createdAt","allModules.241.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.241.updatedAt","allModules.242.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.242.createdAt","allModules.242.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.242.updatedAt","allModules.243.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.243.createdAt","allModules.243.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.243.updatedAt","allModules.244.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.244.createdAt","allModules.244.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.244.updatedAt","allModules.245.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.245.createdAt","allModules.245.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.245.updatedAt","allModules.246.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.246.createdAt","allModules.246.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.246.updatedAt","allModules.247.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.247.createdAt","allModules.247.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.247.updatedAt","allModules.248.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.248.createdAt","allModules.248.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.248.updatedAt","allModules.249.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.249.createdAt","allModules.249.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.249.updatedAt","allModules.250.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.250.createdAt","allModules.250.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.250.updatedAt","allModules.251.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.251.createdAt","allModules.251.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.251.updatedAt","allModules.252.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.252.createdAt","allModules.252.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.252.updatedAt","allModules.253.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.253.createdAt","allModules.253.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.253.updatedAt","allModules.254.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.254.createdAt","allModules.254.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.254.updatedAt","allModules.255.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.255.createdAt","allModules.255.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.255.updatedAt","allModules.256.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.256.createdAt","allModules.256.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.256.updatedAt","allModules.257.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.257.createdAt","allModules.257.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.257.updatedAt","allModules.258.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.258.createdAt","allModules.258.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.258.updatedAt","allModules.259.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.259.createdAt","allModules.259.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.259.updatedAt","allModules.260.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.260.createdAt","allModules.260.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.260.updatedAt","allModules.261.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.261.createdAt","allModules.261.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.261.updatedAt","allModules.262.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.262.createdAt","allModules.262.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.262.updatedAt","allModules.263.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.263.createdAt","allModules.263.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.263.updatedAt","allModules.264.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.264.createdAt","allModules.264.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.264.updatedAt","allModules.265.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.265.createdAt","allModules.265.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.265.updatedAt","allModules.266.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.266.createdAt","allModules.266.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.266.updatedAt","allModules.267.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.267.createdAt","allModules.267.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.267.updatedAt","allModules.268.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.268.createdAt","allModules.268.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.268.updatedAt","allModules.269.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.269.createdAt","allModules.269.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.269.updatedAt","allModules.270.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.270.createdAt","allModules.270.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.270.updatedAt","allModules.271.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.271.createdAt","allModules.271.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.271.updatedAt","allModules.272.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.272.createdAt","allModules.272.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.272.updatedAt","allModules.273.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.273.createdAt","allModules.273.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.273.updatedAt","allModules.274.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.274.createdAt","allModules.274.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.274.updatedAt","allModules.275.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.275.createdAt","allModules.275.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.275.updatedAt","allModules.276.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.276.createdAt","allModules.276.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.276.updatedAt","allModules.277.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.277.createdAt","allModules.277.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.277.updatedAt","allModules.278.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.278.createdAt","allModules.278.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.278.updatedAt","allModules.279.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.279.createdAt","allModules.279.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.279.updatedAt","allModules.280.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.280.createdAt","allModules.280.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.280.updatedAt","allModules.281.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.281.createdAt","allModules.281.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.281.updatedAt","allModules.282.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.282.createdAt","allModules.282.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.282.updatedAt","allModules.283.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.283.createdAt","allModules.283.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.283.updatedAt","allModules.284.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.284.createdAt","allModules.284.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.284.updatedAt","allModules.285.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.285.createdAt","allModules.285.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.285.updatedAt","allModules.286.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.286.createdAt","allModules.286.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.286.updatedAt","allModules.287.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.287.createdAt","allModules.287.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.287.updatedAt","allModules.288.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.288.createdAt","allModules.288.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.288.updatedAt","allModules.289.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.289.createdAt","allModules.289.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.289.updatedAt","allModules.290.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.290.createdAt","allModules.290.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.290.updatedAt","allModules.291.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.291.createdAt","allModules.291.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.291.updatedAt","allModules.292.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.292.createdAt","allModules.292.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.292.updatedAt","allModules.293.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.293.createdAt","allModules.293.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.293.updatedAt","allModules.294.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.294.createdAt","allModules.294.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.294.updatedAt","allModules.295.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.295.createdAt","allModules.295.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.295.updatedAt","allModules.296.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.296.createdAt","allModules.296.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.296.updatedAt","allModules.297.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.297.createdAt","allModules.297.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.297.updatedAt","allModules.298.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.298.createdAt","allModules.298.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.298.updatedAt","allModules.299.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.299.createdAt","allModules.299.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.299.updatedAt","allModules.300.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.300.createdAt","allModules.300.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.300.updatedAt","allModules.301.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.301.createdAt","allModules.301.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.301.updatedAt","allModules.302.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.302.createdAt","allModules.302.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.302.updatedAt","allModules.303.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.303.createdAt","allModules.303.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.303.updatedAt","allModules.304.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.304.createdAt","allModules.304.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.304.updatedAt","allModules.305.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.305.createdAt","allModules.305.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.305.updatedAt","allModules.306.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.306.createdAt","allModules.306.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.306.updatedAt","allModules.307.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.307.createdAt","allModules.307.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.307.updatedAt","allModules.308.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.308.createdAt","allModules.308.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.308.updatedAt","allModules.309.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.309.createdAt","allModules.309.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.309.updatedAt","allModules.310.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.310.createdAt","allModules.310.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.310.updatedAt","allModules.311.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.311.createdAt","allModules.311.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.311.updatedAt","allModules.312.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.312.createdAt","allModules.312.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.312.updatedAt","allModules.313.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.313.createdAt","allModules.313.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.313.updatedAt","allModules.314.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.314.createdAt","allModules.314.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.314.updatedAt","allModules.315.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.315.createdAt","allModules.315.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.315.updatedAt","allModules.316.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.316.createdAt","allModules.316.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.316.updatedAt","allModules.317.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.317.createdAt","allModules.317.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.317.updatedAt","allModules.318.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.318.createdAt","allModules.318.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.318.updatedAt","allModules.319.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.319.createdAt","allModules.319.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.319.updatedAt","allModules.320.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.320.createdAt","allModules.320.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.320.updatedAt","allModules.321.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.321.createdAt","allModules.321.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.321.updatedAt","allModules.322.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.322.createdAt","allModules.322.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.322.updatedAt","allModules.323.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.323.createdAt","allModules.323.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.323.updatedAt","allModules.324.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.324.createdAt","allModules.324.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.324.updatedAt","allModules.325.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.325.createdAt","allModules.325.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.325.updatedAt","allModules.326.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.326.createdAt","allModules.326.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.326.updatedAt","allModules.327.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.327.createdAt","allModules.327.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.327.updatedAt","allModules.328.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.328.createdAt","allModules.328.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.328.updatedAt","allModules.329.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.329.createdAt","allModules.329.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.329.updatedAt","allModules.330.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.330.createdAt","allModules.330.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.330.updatedAt","allModules.331.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.331.createdAt","allModules.331.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.331.updatedAt","allModules.332.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.332.createdAt","allModules.332.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.332.updatedAt","allModules.333.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.333.createdAt","allModules.333.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.333.updatedAt","allModules.334.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.334.createdAt","allModules.334.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.334.updatedAt","allModules.335.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.335.createdAt","allModules.335.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.335.updatedAt","allModules.336.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.336.createdAt","allModules.336.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.336.updatedAt","allModules.337.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.337.createdAt","allModules.337.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.337.updatedAt","allModules.338.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.338.createdAt","allModules.338.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.338.updatedAt","allModules.339.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.339.createdAt","allModules.339.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.339.updatedAt","allModules.340.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.340.createdAt","allModules.340.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.340.updatedAt","allModules.341.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.341.createdAt","allModules.341.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.341.updatedAt","allModules.342.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.342.createdAt","allModules.342.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.342.updatedAt","allModules.343.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.343.createdAt","allModules.343.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.343.updatedAt","allModules.344.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.344.createdAt","allModules.344.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.344.updatedAt","allModules.345.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.345.createdAt","allModules.345.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.345.updatedAt","allModules.346.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.346.createdAt","allModules.346.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.346.updatedAt","allModules.347.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.347.createdAt","allModules.347.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.347.updatedAt","allModules.348.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.348.createdAt","allModules.348.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.348.updatedAt","allModules.349.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.349.createdAt","allModules.349.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.349.updatedAt","allModules.350.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.350.createdAt","allModules.350.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.350.updatedAt","allModules.351.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.351.createdAt","allModules.351.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.351.updatedAt","allModules.352.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.352.createdAt","allModules.352.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.352.updatedAt","allModules.353.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.353.createdAt","allModules.353.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.353.updatedAt","allModules.354.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.354.createdAt","allModules.354.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.354.updatedAt","allModules.355.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.355.createdAt","allModules.355.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.355.updatedAt","allModules.356.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.356.createdAt","allModules.356.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.356.updatedAt","allModules.357.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.357.createdAt","allModules.357.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.357.updatedAt","allModules.358.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.358.createdAt","allModules.358.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.358.updatedAt","allModules.359.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.359.createdAt","allModules.359.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.359.updatedAt","allModules.360.createdAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.360.createdAt","allModules.360.updatedAt":"$46:props:state:queries:1:state:data:meta:values:path.modules.360.updatedAt"},"referentialEqualities":{"allModules":["path.modules"],"prevModule":["path.modules.105"],"currentModule":["path.modules.106"],"nextModule":["path.modules.107"]},"v":1}},"dataUpdateCount":1,"dataUpdatedAt":1792315781340,"error":null,"errorUpdateCount":0,"errorUpdatedAt":0,"fetchFailureCount":0,"fetchFailureReason":null,"fetchMeta":null,"isInvalidated":false,"status":"success","fetchStatus":"idle"},"queryKey":[["learningPaths","getModule"],{"input":{"pathSlug":"data-structures-algorithms","contentType":"LEARNING","contentSlug":"recursive-problem-solving-strategies"},"type":"query"}],"queryHash":"[[\"learningPaths\",\"getModule\"],{\"input\":{\"contentSlug\":\"recursive-problem-solving-strategies\",\"contentType\":\"LEARNING\",\"pathSlug\":\"data-structures-algorithms\"},\"type\":\"query\"}]"},{"dehydratedAt":1792315781659,"state":{"data":{"json":{"id":"seed_8aeb3a71ed7e6fae04f805ce0d81c083","slug":"recursive-problem-solving-strategies","category":"Data Structures & Algorithms","topic":"Recursive Problem-Solving Strategies","title":"Recursive Problem-Solving Strategies","description":"Master the art of thinking recursively. Learn to identify recursive structure in problems, break down complex challenges into smaller instances, build solutions from subproblem results, and apply proven patterns to tackle a wide variety of algorithmic challenges with elegance and efficiency.","difficulty":"INTERMEDIATE","estimatedMinutes":75,"pages":[{"id":"seed_9d5bfb7ed02568bac3e39efa592dbe8d","title":"Identifying Recursive Structure in Problems","order":0,"content":[{"id":"opening-recursive-mindset","title":"The Art of Seeing Recursion","content":[{"data":{"content":"The difference between a struggling programmer and an expert problem-solver often comes down to one critical skill: **the ability to recognize when a problem has recursive structure**. This isn't about memorizing which problems use recursion—it's about developing an instinct, a mental lens that reveals hidden self-similarity in seemingly complex challenges.\n\nConsider this: when a chess grandmaster looks at a board, they don't see 32 individual pieces. They see patterns, structures, and familiar configurations that immediately suggest the right moves. Similarly, when an experienced algorithm designer encounters a new problem, they don't start from scratch. They recognize structural fingerprints that scream 'this is recursive!'—and that recognition transforms an overwhelming problem into a manageable one.\n\nThis page will equip you with that same pattern-recognition capability. By the end, you'll possess a systematic framework for identifying recursive structure in any problem you encounter."},"type":"text"},{"data":{"icon":"Target","title":"What You Will Learn","content":"By mastering this page, you will: (1) Understand the fundamental characteristics that make a problem recursive, (2) Develop a systematic checklist for detecting recursion opportunities, (3) Learn to identify common structural patterns that indicate recursion, (4) Practice the mental shift from 'how do I solve this entirely?' to 'how does this break into smaller versions of itself?'","variant":"info"},"type":"callout"}]},{"id":"what-makes-recursive","title":"What Makes a Problem Recursive?","content":[{"data":{"content":"At its core, a problem has **recursive structure** when it can be decomposed into smaller instances of the exact same problem. This is the defining characteristic—the problem doesn't just break into smaller pieces, it breaks into smaller versions of *itself*.\n\nLet's formalize this with a precise definition:\n\n> **A problem P has recursive structure if:**\n> 1. P can be expressed in terms of one or more smaller instances P₁, P₂, ..., Pₖ\n> 2. Each Pᵢ is structurally identical to P (same problem type, smaller input)\n> 3. There exist trivially solvable instances (base cases) where decomposition isn't needed\n> 4. Solutions to Pᵢ can be combined to form the solution to P\n\nThis might sound abstract, so let's ground it with a concrete comparison:"},"type":"text"},{"data":{"left":[{"data":{"items":["**Compute factorial(n)** → Requires factorial(n-1), same problem type","**Search sorted array** → Search left or right half, same search problem","**Traverse tree** → Traverse left subtree + right subtree, identical task","**List all permutations** → Fix one element, permute the rest","**Parse nested expression** → Parse outer layer, then parse inner expressions"],"title":{"icon":"CheckCircle","text":"Recursive Structure Present","type":"icon","color":"primary","variant":"outline-circle"},"variant":"accent"},"type":"list"}],"right":[{"data":{"items":["**Find maximum in array** → Subproblems aren't the same structure","**Check if number is prime** → No meaningful decomposition into same problem","**Convert temperature units** → Atomic operation, no subproblems","**Validate email format** → Pattern matching, not self-similar","**Generate random number** → Single operation, no decomposition"],"title":{"icon":"XCircle","text":"No Natural Recursive Structure","type":"icon","color":"destructive","variant":"outline-circle"},"variant":"accent"},"type":"list"}]},"type":"two-column"},{"data":{"icon":"Lightbulb","title":"The Self-Similarity Test","content":"Ask yourself: 'If I had a magic oracle that could solve ANY smaller version of this problem instantly, could I use those answers to solve my current problem?' If yes, you likely have recursive structure. This is the essence of the recursive leap of faith.","variant":"tip"},"type":"callout"}],"titleType":"number","titleNumber":1},{"id":"five-hallmarks","title":"The Five Hallmarks of Recursive Problems","content":[{"data":{"content":"Through decades of algorithmic research and practice, five consistent hallmarks have emerged that signal recursive structure. When you encounter a new problem, systematically check for these characteristics:\n\n### Hallmark 1: Hierarchical or Nested Structure\n\nThe most obvious indicator of recursion is data that contains smaller versions of itself. Trees are the canonical example—every subtree is itself a tree. But this pattern appears everywhere:\n\n- **File systems**: Directories contain files and other directories\n- **HTML/XML documents**: Elements contain other elements\n- **Mathematical expressions**: (a + (b × (c - d))) nests expressions within expressions\n- **Organizational charts**: Managers have reports who may also be managers\n- **Nested data structures**: Lists of lists, objects containing objects\n\nWhen you see nesting or hierarchy, your first instinct should be: *this probably wants recursion*."},"type":"text"},{"data":{"fileName":"hierarchical_structure_example","languages":[{"code":"$72","label":"TypeScript","value":"typescript"},{"code":"$73","label":"Python","value":"python"}]},"type":"code"},{"data":{"content":"### Hallmark 2: Divide-and-Conquer Potential\n\nWhen a problem can be split into independent subproblems of the same type, and the results can be merged, you have classic divide-and-conquer—the purest form of recursion.\n\n**Key Question**: Can I split the input in half (or thirds, etc.), solve each piece separately, and combine the results?\n\n- **Merge Sort**: Split array in half → sort each half → merge sorted halves\n- **Binary Search**: Check middle → search either left half OR right half\n- **Closest Pair of Points**: Split by x-coordinate → find closest in each half → check across boundary\n- **Matrix Multiplication (Strassen)**: Split matrices into quadrants → multiply submatrices → combine\n\nThe signature of divide-and-conquer is that subproblems are **independent**—solving one doesn't affect the other. This independence is what makes the approach powerful and the recursion clean."},"type":"text"},{"data":{"content":"### Hallmark 3: Choice at Each Step with Subproblem Consequences\n\nMany problems involve making a choice at each step, where each choice leads to a subproblem of the same form. This is the hallmark of backtracking and many optimization problems.\n\n**Key Question**: At this point, what are my options, and does each option lead to a smaller version of the same problem?\n\n- **N-Queens**: Place a queen in row 1 → now solve for remaining rows (same problem, fewer rows)\n- **Subset Sum**: Include this element or not → solve for remaining elements (same problem, fewer elements)\n- **Path Finding**: Move up/down/left/right → find path from new position (same problem, closer to goal)\n- **Parenthesization**: Choose where to split expression → optimize each subexpression\n\nWhen you hear yourself thinking 'I could do A, B, or C here, and then figure out the rest'—that's recursive structure knocking."},"type":"text"},{"data":{"content":"### Hallmark 4: Mathematical Recurrence Relationship\n\nSome problems are defined by their mathematical structure—formulas that express larger values in terms of smaller ones.\n\n**Key Question**: Is there a mathematical formula that relates f(n) to f(n-1), f(n-2), etc.?\n\n- **Factorial**: n! = n × (n-1)!\n- **Fibonacci**: F(n) = F(n-1) + F(n-2)\n- **Binomial Coefficients**: C(n,k) = C(n-1,k-1) + C(n-1,k)\n- **Catalan Numbers**: Cₙ = Σᵢ Cᵢ × Cₙ₋₁₋ᵢ\n- **Edit Distance**: dp(i,j) depends on dp(i-1,j), dp(i,j-1), dp(i-1,j-1)\n\nWhen you see a recurrence relation in the problem statement (explicit or implied), recursion is the natural implementation. The recurrence *is* the recursive structure."},"type":"text"},{"data":{"content":"### Hallmark 5: Reduction to Simpler Case\n\nSometimes the recursive structure isn't about division or choices, but about stripping away one layer to reveal a simpler instance of the same problem.\n\n**Key Question**: If I handle one element/layer/step, do I have the same problem but smaller?\n\n- **Reverse a string**: Reverse the rest → append first character at end (or prepend last at start)\n- **Sum of list**: Add first element + sum of remaining list\n- **Power function**: x^n = x × x^(n-1)\n- **Linked list operations**: Process head → recurse on tail\n- **Nested structure flattening**: Handle top level → recurse on nested parts\n\nThis is perhaps the gentlest form of recursion—you're essentially peeling an onion, one layer at a time, until you reach the core (base case)."},"type":"text"},{"data":{"icon":"Info","title":"Multiple Hallmarks Often Coexist","content":"Real problems often exhibit multiple hallmarks simultaneously. A tree traversal problem has hierarchical structure (Hallmark 1), can be viewed as divide-and-conquer with left/right subtrees (Hallmark 2), involves choices about traversal order (Hallmark 3), and can be seen as reduction (process node, then recurse on children—Hallmark 5). The more hallmarks present, the more confident you can be that recursion is appropriate.","variant":"note"},"type":"callout"}],"titleType":"number","titleNumber":2},{"id":"detection-framework","title":"The Recursive Structure Detection Framework","content":[{"data":{"content":"Now let's synthesize these hallmarks into a practical, systematic framework you can apply to any problem. This is your checklist for detecting recursive structure:\n\n## The STAMP Framework for Recursive Structure Detection\n\n**S - Self-Similarity**: Does the problem contain smaller versions of itself?\n**T - Trivial Base**: Are there simple cases that can be solved directly?\n**A - Assembly**: Can solutions to subproblems be combined into the full solution?\n**M - Measurable Progress**: Does each recursive call move toward the base case?\n**P - Pattern Recognition**: Does this match known recursive problem patterns?\n\nLet's walk through each component in detail:"},"type":"text"},{"data":{"items":["**Self-Similarity Check**: Ask 'If I remove/handle one piece, what remains?' If what remains is the same type of problem, you have self-similarity. For 'reverse a string', removing the first character leaves you with 'reverse a string' on what's left.","**Trivial Base Identification**: Every recursive solution needs somewhere to stop. Ask 'What's the simplest input where I know the answer immediately?' Empty list, single element, zero, leaf node—these are typical base cases. If you can't identify a base case, recursion may not fit.","**Assembly Verification**: This is crucial. Subproblem solutions must combinable. Ask 'Given solutions to smaller instances, can I construct the full solution?' For sum of list: if I know sum(rest), I just add first element. For sorting: if I have two sorted halves, I can merge them.","**Measurable Progress Confirmation**: Each recursive call must have 'smaller' input by some measure—smaller array, lower number, fewer nodes, reduced depth. If progress isn't measurable, you risk infinite recursion. Define what 'smaller' means for your problem.","**Pattern Recognition Application**: Does this problem resemble known patterns? Tree traversal, divide-and-conquer, backtracking, dynamic programming with memoization? Matching to known patterns accelerates your solution design."],"title":{"icon":"Target","text":"The STAMP Framework Detailed","type":"icon","color":"primary","variant":"outline-circle"},"variant":"glass"},"type":"list"},{"data":{"fileName":"stamp_framework_applied","languages":[{"code":"$74","label":"TypeScript","value":"typescript"},{"code":"$75","label":"Python","value":"python"}]},"type":"code"}],"titleType":"number","titleNumber":3},{"id":"recursion-in-disguise","title":"Recognizing Recursive Structure in Disguise","content":[{"data":{"content":"$76"},"type":"text"},{"data":{"fileName":"subsets_revealed","languages":[{"code":"$77","label":"TypeScript","value":"typescript"},{"code":"$78","label":"Python","value":"python"}]},"type":"code"},{"data":{"content":"### The Wishful Thinking Technique\n\nAnother powerful approach is **wishful thinking**: assume you have a magic function that solves the smaller problem, and figure out how you'd use it.\n\n**Example: Check if a Binary Tree is a Valid BST**\n\nInitially, you might think: 'I need to check every node and make sure left < node < right...but wait, it's more complex because grandchildren also need to respect ancestor constraints!'\n\n*Wishful thinking*: Pretend you have a function `isValidBSTInRange(node, min, max)` that checks if a subtree is a valid BST with all values strictly between min and max.\n\nWith this magic function:\n- Left subtree must be valid with max = current node's value\n- Right subtree must be valid with min = current node's value\n\nBut wait—`isValidBSTInRange` IS the function we're trying to write! The wishful thinking revealed the recursive structure: check current node is in bounds, then recursively validate subtrees with updated bounds."},"type":"text"},{"data":{"fileName":"bst_validation_wishful_thinking","languages":[{"code":"$79","label":"TypeScript","value":"typescript"},{"code":"$7a","label":"Python","value":"python"}]},"type":"code"},{"data":{"icon":"Sparkles","title":"The Pattern of Discovery","content":"Both techniques—reframing and wishful thinking—share a common pattern: they shift focus from 'how do I solve the whole thing?' to 'how do partial solutions combine into complete solutions?' This mental shift is the key to seeing recursive structure in any problem.","variant":"tip"},"type":"callout"}],"titleType":"number","titleNumber":4},{"id":"problem-categories","title":"Common Problem Categories with Recursive Structure","content":[{"data":{"content":"$7b"},"type":"text"},{"data":{"rows":[["Tree Operations","Same operation on subtrees","Null node, leaf node","Aggregate results (sum, max, AND/OR)"],["Divide-and-Conquer","Same problem on halves/parts","Single element, empty input","Merge, concatenate, compare"],["Combinatorial","Generate for remaining elements","Empty set, single element","Extend each partial solution"],["String Processing","Process rest of string","Empty string, single char","Prepend/append results"],["Backtracking","Choices for remaining positions","All positions filled","Valid solutions propagate up"],["Dynamic Programming","Overlapping subproblems","Known base values (dp[0], dp[1])","Formula combining subproblem results"]],"caption":"Problem Categories and Their Recursive Signatures","headers":["Category","Typical Subproblem","Common Base Cases","Combination Method"]},"type":"table"},{"data":{"content":"### Category 4: String and Sequence Processing\n\nStrings and sequences often have recursive structure when processed character by character:\n\n- Palindrome checking (first == last AND middle is palindrome)\n- String matching and parsing\n- Expression evaluation\n- Subsequence problems\n\n### Category 5: Backtracking and Constraint Satisfaction\n\nWhen you need to explore all possible configurations subject to constraints:\n\n- N-Queens, Sudoku solving\n- Maze solving and pathfinding\n- Graph coloring\n- Subset sum and partition problems\n\n### Category 6: Mathematical Recurrences\n\nProblems defined by mathematical relationships:\n\n- Factorial, Fibonacci, Catalan numbers\n- Binomial coefficients\n- Number theory (GCD, modular exponentiation)\n- Counting problems with recurrence relations"},"type":"text"},{"data":{"icon":"Zap","title":"Category Recognition Accelerates Solutions","content":"When you recognize that a new problem falls into one of these categories, you immediately have a structural template to work with. Instead of deriving the recursive structure from scratch, you adapt a known pattern. This is why building a mental library of recursive problem types is so valuable.","variant":"note"},"type":"callout"}],"titleType":"number","titleNumber":5},{"id":"when-not-recursive","title":"Warning Signs: When Recursion Isn't the Answer","content":[{"data":{"content":"$7c"},"type":"text"},{"data":{"left":[{"data":{"items":["Simple single-pass array operations","Problems with no subproblem structure","State machines with limited states","Direct formula computations","I/O and side-effect heavy operations"],"title":{"icon":"AlertCircle","text":"Recursion May Be Overkill","type":"icon","color":"destructive","variant":"outline-circle"},"variant":"accent"},"type":"list"}],"right":[{"data":{"items":["Hierarchical data structures","Divide-and-conquer algorithms","Combinatorial generation","Backtracking search","Problems with clear recurrence relations"],"title":{"icon":"CheckCircle","text":"Recursion Is Natural Fit","type":"icon","color":"primary","variant":"outline-circle"},"variant":"accent"},"type":"list"}]},"type":"two-column"},{"data":{"content":"### Warning Sign 3: Extremely Deep Recursion\n\nEven when recursive structure exists, practical concerns may preclude recursion:\n\n- Recursion depth could exceed stack limits (e.g., processing a list of 1 million elements)\n- No tail-call optimization available\n- Performance-critical code where call overhead matters\n\nIn these cases, convert to iteration with an explicit stack if the recursive logic is essential.\n\n### Warning Sign 4: Forced or Unnatural Decomposition\n\nIf your recursive decomposition feels contrived—if you're bending the problem to fit recursion rather than the other way around—it's a sign that iteration or another approach might be more appropriate.\n\n**Recursion should feel natural.** When it fits, it simplifies the code and clarifies the logic. When it doesn't fit, it obscures both."},"type":"text"},{"data":{"icon":"AlertCircle","title":"The Hammer and Nail Problem","content":"Once you learn recursion well, there's a temptation to use it everywhere. Resist this. Recursion is a powerful tool for specific problem shapes. For linear, single-pass operations, a simple loop is almost always clearer and more efficient. Choose the tool that fits the problem, not the tool you most recently learned.","variant":"warning"},"type":"callout"}],"titleType":"number","titleNumber":6},{"id":"practice-identifying","title":"Practice: Identifying Recursive Structure","content":[{"data":{"content":"$7d"},"type":"text"},{"data":{"fileName":"generate_parentheses","languages":[{"code":"$7e","label":"TypeScript","value":"typescript"},{"code":"$7f","label":"Python","value":"python"}]},"type":"code"}],"titleType":"number","titleNumber":7},{"id":"summary-takeaways","title":"Summary: Key Takeaways","content":[{"data":{"content":"You've now developed a systematic approach to recognizing recursive structure. Let's consolidate the key insights:"},"type":"text"},{"data":{"type":"ordered","items":["**Recursive structure means self-similarity** — The problem decomposes into smaller instances of the same problem type, not just smaller pieces.","**Five hallmarks signal recursion** — Hierarchical data, divide-and-conquer potential, choice with consequences, mathematical recurrence, and reduction to simpler case.","**Use the STAMP framework** — Self-similarity, Trivial base, Assembly, Measurable progress, Pattern recognition provide a systematic checklist.","**Reframing and wishful thinking reveal hidden structure** — Ask 'what if I had solutions to smaller instances?' to transform your perspective.","**Know the common categories** — Tree operations, divide-and-conquer, combinatorial generation, string processing, backtracking, and mathematical recurrences almost always have recursive structure.","**Recognize when recursion doesn't fit** — Linear processing, no natural decomposition, forced structure, and practical concerns (stack depth) are warning signs."],"title":{"icon":"CheckCircle","text":"Core Principles","type":"icon","color":"primary","variant":"outline-circle"},"variant":"accent"},"type":"list"},{"data":{"content":"**What's next:**\n\nRecognizing recursive structure is the first step. The next page explores **breaking down problems into smaller instances**—the art of defining exactly how a problem decomposes, what the subproblems look like, and how many there should be. This is where recognition transforms into design."},"type":"text"},{"data":{"icon":"CheckCircle","title":"Page Complete","content":"You now have a systematic framework for identifying recursive structure in problems. This skill—seeing self-similarity where others see complexity—is foundational to mastering recursive problem-solving. The STAMP framework and pattern recognition techniques will serve you throughout your career.","variant":"success"},"type":"callout"}],"titleType":"number","titleNumber":8}],"isLocked":false},{"id":"seed_3cfa7942492642e4c577d0f6dc71eff8","title":"Breaking Down Problems into Smaller Instances","order":1,"content":null,"isLocked":true},{"id":"seed_8fc6efd88cd5c9b964e3150b59b6d16e","title":"Building Solutions from Smaller Solutions","order":2,"content":null,"isLocked":true},{"id":"seed_745d355f8858c4971f9b2b16c684dc35","title":"Practice Problems and Patterns","order":3,"content":null,"isLocked":true}]}},"dataUpdateCount":1,"dataUpdatedAt":1792315781522,"error":null,"errorUpdateCount":0,"errorUpdatedAt":0,"fetchFailureCount":0,"fetchFailureReason":null,"fetchMeta":null,"isInvalidated":false,"status":"success","fetchStatus":"idle"},"queryKey":[["learningContent","getModule"],{"input":{"slug":"recursive-problem-solving-strategies"},"type":"query"}],"queryHash":"[[\"learningContent\",\"getModule\"],{\"input\":{\"slug\":\"recursive-problem-solving-strategies\"},\"type\":\"query\"}]"},{"dehydratedAt":1792315781659,"state":{"data":{"json":null},"dataUpdateCount":1,"dataUpdatedAt":1792315781614,"error":null,"errorUpdateCount":0,"errorUpdatedAt":0,"fetchFailureCount":0,"fetchFailureReason":null,"fetchMeta":null,"isInvalidated":false,"status":"success","fetchStatus":"idle"},"queryKey":[["learningContent","getProgress"],{"input":{"moduleId":"seed_8aeb3a71ed7e6fae04f805ce0d81c083"},"type":"query"}],"queryHash":"[[\"learningContent\",\"getProgress\"],{\"input\":{\"moduleId\":\"seed_8aeb3a71ed7e6fae04f805ce0d81c083\"},\"type\":\"query\"}]"},{"dehydratedAt":1792315781659,"state":{"data":{"json":null},"dataUpdateCount":1,"dataUpdatedAt":1792315781616,"error":null,"errorUpdateCount":0,"errorUpdatedAt":0,"fetchFailureCount":0,"fetchFailureReason":null,"fetchMeta":null,"isInvalidated":false,"status":"success","fetchStatus":"idle"},"queryKey":[["feedback","get"],{"input":{"contentType":"LEARNING_PAGE","contentId":"seed_8fc6efd88cd5c9b964e3150b59b6d16e"},"type":"query"}],"queryHash":"[[\"feedback\",\"get\"],{\"input\":{\"contentId\":\"seed_8fc6efd88cd5c9b964e3150b59b6d16e\",\"contentType\":\"LEARNING_PAGE\"},\"type\":\"query\"}]"},{"dehydratedAt":1792315781659,"state":{"data":{"json":null},"dataUpdateCount":1,"dataUpdatedAt":1792315781616,"error":null,"errorUpdateCount":0,"errorUpdatedAt":0,"fetchFailureCount":0,"fetchFailureReason":null,"fetchMeta":null,"isInvalidated":false,"status":"success","fetchStatus":"idle"},"queryKey":[["feedback","getUserLike"],{"input":{"contentType":"LEARNING_PAGE","contentId":"seed_8fc6efd88cd5c9b964e3150b59b6d16e"},"type":"query"}],"queryHash":"[[\"feedback\",\"getUserLike\"],{\"input\":{\"contentId\":\"seed_8fc6efd88cd5c9b964e3150b59b6d16e\",\"contentType\":\"LEARNING_PAGE\"},\"type\":\"query\"}]"},{"dehydratedAt":1792315781659,"state":{"data":{"json":[]},"dataUpdateCount":1,"dataUpdatedAt":1792315781616,"error":null,"errorUpdateCount":0,"errorUpdatedAt":0,"fetchFailureCount":0,"fetchFailureReason":null,"fetchMeta":null,"isInvalidated":false,"status":"success","fetchStatus":"idle"},"queryKey":[["highlights","getHighlights"],{"input":{"contentType":"LEARNING_PAGE","contentId":"seed_8fc6efd88cd5c9b964e3150b59b6d16e"},"type":"query"}],"queryHash":"[[\"highlights\",\"getHighlights\"],{\"input\":{\"contentId\":\"seed_8fc6efd88cd5c9b964e3150b59b6d16e\",\"contentType\":\"LEARNING_PAGE\"},\"type\":\"query\"}]"},{"dehydratedAt":1792315781659,"state":{"data":"$undefined","dataUpdateCount":0,"dataUpdatedAt":0,"error":null,"errorUpdateCount":0,"errorUpdatedAt":0,"fetchFailureCount":0,"fetchFailureReason":null,"fetchMeta":null,"isInvalidated":false,"status":"pending","fetchStatus":"fetching"},"queryKey":[["highlights","getPopularHighlights"],{"input":{"contentType":"LEARNING_PAGE","contentId":"seed_8fc6efd88cd5c9b964e3150b59b6d16e","minCount":2},"type":"query"}],"queryHash":"[[\"highlights\",\"getPopularHighlights\"],{\"input\":{\"contentId\":\"seed_8fc6efd88cd5c9b964e3150b59b6d16e\",\"contentType\":\"LEARNING_PAGE\",\"minCount\":2},\"type\":\"query\"}]","promise":"$@80"}]},"children":"$L81"}]