48:"/_next/static/chunks/2g8w-80ml0qgh.js" 49:"/_next/static/chunks/0iv56yrji_20j.js" 4a:"/_next/static/chunks/26v-2o8eqscfn.js" 4b:"/_next/static/chunks/0lc44eilyyvky.js" 4c:"/_next/static/chunks/1jl6tco-uuy-j.js" 4d:"/_next/static/chunks/1ot1rbfa0d_n4.js" 4e:"/_next/static/chunks/3n7h0f3nk8y8p.js" 4f:"/_next/static/chunks/3k2gyg36fnag_.js" 50:"/_next/static/chunks/3m0r7x0jt5wm7.js" 51:"/_next/static/chunks/2fohwszm1xz1m.js" 52:"/_next/static/chunks/3bgoyiso1rhn7.js" 53:"/_next/static/chunks/19bc9syhv3w28.js" 54:"/_next/static/chunks/0wa9m1-tphf9u.js" 55:"/_next/static/chunks/0m2d8jznc9t02.js" 56:"/_next/static/chunks/1xu72k8i0p_ma.js" 57:"/_next/static/chunks/2a1rt036gjwtj.js" 58:"/_next/static/chunks/1s05-oinjbm85.js" 59:"/_next/static/chunks/20k3408cq3fwt.js" 5a:"/_next/static/chunks/1_lo_qve3gu86.js" 5b:"/_next/static/chunks/3di53f0fz7pw_.js" 5c:"/_next/static/chunks/3m1xjj5kw5fie.js" 5d:"/_next/static/chunks/0so1i35v7xcta.js" 5e:"/_next/static/chunks/082jo-0ajazgr.js" 5f:"/_next/static/chunks/0-a64pg0hn7g7.js" 60:"/_next/static/chunks/09nq57stwzkgf.js" 61:"/_next/static/chunks/20329i6m_04t6.js" 62:"/_next/static/chunks/0i3-eynrkvqi7.js" 63:"/_next/static/chunks/0oag6lffx7d01.js" 64:"/_next/static/chunks/1nyz-fz1mk3y6.js" 65:"/_next/static/chunks/1dl4k5870muic.js" 66:"/_next/static/chunks/2ozcrjb_hh74t.js" 67:"/_next/static/chunks/18ggtgz2yf759.js" 68:"/_next/static/chunks/1tn-0fivsxsv1.js" 69:"/_next/static/chunks/0hlb44ca7-4a2.js" 6a:"/_next/static/chunks/1ch_-e7_eco00.js" 6b:"/_next/static/chunks/40mq7ggq-ozo4.js" 6c:"/_next/static/chunks/2112y_x317i7a.js" 6d:"/_next/static/chunks/2k8pepwc4pxns.js" 6e:"/_next/static/chunks/2hr13i-t0krnb.js" 6f:"/_next/static/chunks/0hy4a31wjpabs.js" 70:"/_next/static/chunks/2mw79vtbi206x.js" 71:"/_next/static/chunks/253gnmj0-cj17.js" 72:I[593304,["$2e","$2f","$30","$31","$32","$33","$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","$71"],"OwnedHydration"] 73:T50d,Before we define complete binary trees, let's establish a clear taxonomy of binary tree types. This classification is essential because the terms are often confused or used imprecisely, leading to fundamental misunderstandings about data structure properties. **The Hierarchy of Binary Tree Types:** Binary trees can be classified by their structural properties into several categories, each with increasing constraints: 1. **Binary Tree (General)**: Every node has at most two children (left and right). No constraints on shape or balance. This is the most general form. 2. **Full Binary Tree** (also called "Proper" or "Strictly" Binary Tree): Every node has either **zero or two** children—never just one. Every internal node has exactly two children. 3. **Complete Binary Tree**: Every level, except possibly the last, is completely filled, and all nodes in the last level are as far **left** as possible. 4. **Perfect Binary Tree**: A complete binary tree where the last level is also completely filled. Every level has the maximum number of nodes. All internal nodes have exactly two children, and all leaves are at the same depth. 5. **Balanced Binary Tree**: The heights of the left and right subtrees of every node differ by at most some constant (typically 1 for AVL trees).74:T464,Now let's establish the formal, mathematically precise definition of a complete binary tree. This precision is critical because the definition directly determines why array storage works. **Formal Definition:** A binary tree of height h is **complete** if and only if: 1. **All levels 0 through h-1 are completely filled** — meaning level k contains exactly 2^k nodes for all k from 0 to h-1. 2. **Level h (the last level) is filled from left to right with no gaps** — meaning if there are nodes at positions p₁, p₂, ..., pₘ in the last level (numbered left-to-right starting from 0), then all positions 0, 1, 2, ..., m-1 are occupied, with only positions m, m+1, ..., (2^h - 1) potentially empty. **Equivalent Characterization:** A complete binary tree can also be characterized by this property: if we assign indices to nodes in **breadth-first (level-order) traversal** starting from index 1, then the tree contains exactly the nodes with indices 1, 2, 3, ..., n (with no gaps). This is precisely why complete binary trees can be stored in arrays without wasting space—the index sequence is contiguous.75:T420,Complete Binary Tree with 10 nodes: Level 0: (1) / \ Level 1: (2) (3) / \ / \ Level 2: (4) (5) (6) (7) / \ / Level 3: (8) (9)(10) Observations: • Levels 0, 1, 2: Completely filled (1 + 2 + 4 = 7 nodes) • Level 3: Filled left-to-right (first 3 of 8 possible positions) • Node indices 1-10 are contiguous with no gaps • Height = 3 = ⌊log₂(10)⌋ NOT a Complete Binary Tree (gap in last level): Level 0: (1) / \ Level 1: (2) (3) / \ \ Level 2: (4) (5) (7) ← Node 6 missing! • This violates the left-to-right filling requirement • Cannot use contiguous array storage efficiently76:T66d,# Verifying mathematical properties of complete binary trees import math def complete_tree_properties(n: int) -> dict: """Compute and verify properties for a complete binary tree with n nodes.""" # Height calculation height = math.floor(math.log2(n)) if n > 0 else 0 # Verify height bounds min_nodes_for_height = 2 ** height max_nodes_for_height = 2 ** (height + 1) - 1 assert min_nodes_for_height <= n <= max_nodes_for_height # Leaf count num_leaves = math.ceil(n / 2) num_internal = n // 2 # Nodes at each level nodes_per_level = [] for level in range(height): nodes_per_level.append(2 ** level) # Full levels last_level_nodes = n - (2 ** height - 1) # Remaining nodes nodes_per_level.append(last_level_nodes) return { 'total_nodes': n, 'height': height, 'num_leaves': num_leaves, 'num_internal': num_internal, 'nodes_per_level': nodes_per_level, 'height_bounds': (min_nodes_for_height, max_nodes_for_height) } # Example: 10-node complete binary tree props = complete_tree_properties(10) print(f"For n = 10 nodes:") print(f" Height: {props['height']}") # 3 print(f" Leaves: {props['num_leaves']}") # 5 print(f" Internal: {props['num_internal']}") # 5 print(f" Nodes per level: {props['nodes_per_level']}") # [1, 2, 4, 3] # Larger example: 1 million nodes props_large = complete_tree_properties(1_000_000) print(f" For n = 1,000,000 nodes:") print(f" Height: {props_large['height']}") # 19 print(f" Max path length: {props_large['height']} comparisons")77:Tb79,EXAMPLE 1: Perfect Binary Tree (also Complete, also Full) ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ 1 / \ 2 3 / \ / \ 4 5 6 7 ✓ Complete: All levels fully filled, last level filled L→R ✓ Perfect: All levels (including last) completely filled ✓ Full: Every node has 0 or 2 children ═══════════════════════════════════════════════════════ EXAMPLE 2: Complete Binary Tree (NOT Perfect, NOT Full) ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ 1 / \ 2 3 / \ / 4 5 6 ✓ Complete: All levels full except last, last filled L→R ✗ Perfect: Last level not completely filled ✗ Full: Node 3 has only 1 child ═══════════════════════════════════════════════════════ EXAMPLE 3: Full Binary Tree (NOT Complete) ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ 1 / \ 2 3 / \ 4 5 ✗ Complete: Gap in last level (node 3 has no children but is not rightmost) ✗ Perfect: Last level not filled ✓ Full: Every node has 0 or 2 children ═══════════════════════════════════════════════════════ EXAMPLE 4: Neither Complete, Perfect, nor Full ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ 1 / 2 \ 3 ✗ Complete: Level 1 not filled (missing right child of root) ✗ Perfect: Not all levels filled ✗ Full: Node 2 has only right child ═══════════════════════════════════════════════════════ EXAMPLE 5: Complete but NOT Full (another case) ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ 1 / \ 2 3 / 4 ✓ Complete: All levels filled L→R (level 2 has one node, leftmost) ✗ Perfect: Last level not completely filled ✗ Full: Nodes 2 and 3 have 1 child each78:T552,Complete Binary Tree: Array Representation (1-indexed): (50) Index: [-, 50, 30, 40, 10, 20, 35, 25, 8, 5] / \ (30) (40) Position 0 is unused (or holds size) / \ / \ (10) (20)(35) (25) The tree structure is IMPLICIT: / \ • Parent of node i: ⌊i/2⌋ (8)(5) • Left child of i: 2i • Right child of i: 2i + 1 Index: 1 2 3 4 5 6 7 8 9 Value: 50 30 40 10 20 35 25 8 5 Level: 0 1 1 2 2 2 2 3 3 Why this works for COMPLETE trees: ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ When we assign indices via level-order traversal: • Root is index 1 • Children of node i are at indices 2i and 2i+1 • This ONLY works when nodes are contiguous (no gaps) With a gap (NOT complete): (50) Array: [-, 50, 30, 40, ?, 20, 35, 25] / \ (30) (40) Index 4 is EMPTY (node 10 missing) \ / \ We waste space storing the gap! (20)(35) (25) Worse: need null checks everywhere47:["$","$L72",null,{"owner":"anonymous","state":{"mutations":[],"queries":[{"dehydratedAt":1792306282155,"state":{"data":{"json":{"archivedAt":null,"id":"seed_9a9d8b83f733dcfd157a0f26a883a557","slug":"data-structures-algorithms-patterns","title":"Data Structures & Algorithms Patterns","description":"Master Data Structures and Algorithms through 15 chapters of coding patterns. From Two Pointers to Dynamic Programming, this path covers 320 carefully curated problems organized by technique for optimal learning progression.","image":null,"color":"#10B981","keyTopics":["Two Pointers & Sliding Window","Binary Search Techniques","Stack & Queue Patterns","Tree & Graph Algorithms","Greedy Algorithms","Backtracking","Dynamic Programming","Bit Manipulation"],"estimatedHours":174.3,"problemCount":323,"visualizerCount":15,"quizCount":0,"learningCount":26,"difficulty":"INTERMEDIATE","idealFor":["Software engineering candidates","Competitive programmers","CS students","Anyone preparing for technical interviews"],"prerequisites":["Basic programming knowledge","Understanding of basic data types","Familiarity with loops and conditionals"],"skillsGained":["Pattern recognition in problems","Algorithm design and analysis","Time and space complexity analysis","Systematic problem-solving approach","Code optimization techniques","Interview problem-solving skills"],"outcomes":["Master 15+ coding patterns","Solve complex algorithmic problems","Ace technical interviews at top companies","Write efficient and optimized code","Build strong problem-solving intuition"],"overview":"This comprehensive learning path organizes 320 problems into 15 chapters based on coding patterns, progressing from foundational techniques to advanced algorithms.\n\n**Learning Path Structure:**\n• Chapter 1-2: Two Pointers & Sliding Window - Master pointer manipulation\n• Chapter 3-4: Binary Search & Array Manipulation - Search and transform techniques\n• Chapter 5-7: Stack, Linked List & Heap - Core data structure patterns\n• Chapter 8-10: Trees & Graphs - Traversal and graph algorithms\n• Chapter 11-12: Greedy & Backtracking - Optimization and exploration\n• Chapter 13-14: Dynamic Programming - Optimal substructure patterns\n• Chapter 15: Bit Manipulation - Binary operations and tricks\n\nEach pattern includes multiple problems to reinforce learning.","createdAt":"2026-10-15T17:47:45.111Z","updatedAt":"2026-10-17T16:28:34.214Z","modules":[{"id":"seed_8e82f930391ad4f50a80acfcc6eabfcf","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"What Is an Array? — The Fundamental Collection","order":1,"contentType":"LEARNING","contentSlug":"what-is-an-array","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.096Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_bd4fd4d7d2868dd85f5122476342d9b4","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Array Memory Model & Contiguous Storage","order":2,"contentType":"LEARNING","contentSlug":"array-memory-model","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.096Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_d594eca65799bde462b4394323ac957b","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"In-Place Unique Elements","order":3,"contentType":"VISUALIZER","contentSlug":"inplace-unique-elements","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.096Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_5ff3de7b499b57099e9cb9da8071c025","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"In-Place Unique Elements","order":4,"contentType":"PROBLEM","contentSlug":"inplace-unique-elements","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_abb9319861f00fe8fd4e457324ad9203","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Filter Array By Value","order":5,"contentType":"PROBLEM","contentSlug":"filter-array-by-value","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_abe7b11f6a8394f8c876eb98937633b6","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Limit Element Occurrences in Sorted Array","order":6,"contentType":"PROBLEM","contentSlug":"limit-element-occurrences","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_f587df465429171ccdddbbd006c3170e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Relocate Zeroes to End","order":7,"contentType":"PROBLEM","contentSlug":"relocate-zeroes-to-end","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_3a1c49d62b73dfd281fc6723b5cc0502","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Maximum Water Container","order":8,"contentType":"PROBLEM","contentSlug":"maximum-water-container","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_23eb213462a6664b943abd217f642af1","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Triplet Nearest Sum","order":9,"contentType":"PROBLEM","contentSlug":"triplet-nearest-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_27e9fa29137dd9f3b92d07970abd68fa","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Sorted Array Pair Search","order":10,"contentType":"PROBLEM","contentSlug":"sorted-array-pair-search","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_f3e90eb8520e648909b91087a968c1c9","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Integer Square Verification","order":11,"contentType":"PROBLEM","contentSlug":"integer-square-verification","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_7825c28543ac0793e6a2bbf475c6d626","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Perfect Square Pair Sum","order":12,"contentType":"PROBLEM","contentSlug":"perfect-square-pair-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_ed95466c2e37d5d7cccae582430e2785","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Sorted Squares","order":13,"contentType":"PROBLEM","contentSlug":"sorted-squares","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_16db40717018b8b7830e43dddc41629a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Maximum Pair Sum Below Threshold","order":14,"contentType":"PROBLEM","contentSlug":"maximum-pair-sum-below-threshold","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_8650b38a95404871667b9c0019e9772e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Count Pairs Below Threshold","order":15,"contentType":"PROBLEM","contentSlug":"count-pairs-below-threshold","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_63a2a43074ec5cf7e5dfbf3aba42a6fb","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Rainfall Basin Accumulation","order":16,"contentType":"PROBLEM","contentSlug":"rainfall-basin-accumulation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_c15021bea8bb4cc7391cac401c92fe80","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Rescue Vessel Allocation","order":17,"contentType":"PROBLEM","contentSlug":"rescue-vessel-allocation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_63963a917ea81e24dab026432a8428c7","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Cyclic Chain Detection","order":18,"contentType":"PROBLEM","contentSlug":"cyclic-chain-detection","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_e62992d6e23acc6019f097742f8673df","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Circular List Entry Point","order":19,"contentType":"PROBLEM","contentSlug":"circular-list-entry-point","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_90a86717ad5f7dfc7e10cfd5e60fdbd8","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Rearrange Linked List","order":20,"contentType":"PROBLEM","contentSlug":"rearrange-linked-list","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_7e15ea895b22322b3008153a8ef667fd","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Symmetric Linked List","order":21,"contentType":"PROBLEM","contentSlug":"symmetric-linked-list","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_2a4f468580678bd9cee6f2cf24fdc0a6","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Linked List Center Node","order":22,"contentType":"PROBLEM","contentSlug":"linked-list-center-node","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_4bf5c32a0fd2651600c020c7e8c66fd0","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Remove Central Node from Linked List","order":23,"contentType":"PROBLEM","contentSlug":"remove-central-node-from-linked-list","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_5cc5c4badb453dfbc3ac45d4dec9fb3e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Tri-Value Partition","order":24,"contentType":"PROBLEM","contentSlug":"tri-value-partition","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_e45d9c2b589e7889c82714ffe6944af3","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Wave Pattern Rearrangement","order":25,"contentType":"PROBLEM","contentSlug":"wave-pattern-rearrangement","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_27ec81a7db8dda87d6697e3ca5a133c2","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Array Element Ordering","order":26,"contentType":"PROBLEM","contentSlug":"array-element-ordering","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_32753ffaa7bb1a6297b0fa2280f7028b","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Common Elements with Frequency","order":27,"contentType":"PROBLEM","contentSlug":"common-elements-frequency","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_d20324d7a096d572908b356ebe2ec3d4","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Smallest Shared Element in Sorted Arrays","order":28,"contentType":"PROBLEM","contentSlug":"smallest-shared-element","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_83d439774e1bf65e25939e232811ed4a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Maximum Symmetric Substring","order":29,"contentType":"PROBLEM","contentSlug":"maximum-symmetric-substring","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_c49d6b3256f65372bb35bd2586dfac95","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Minimum Palindrome Splits","order":30,"contentType":"PROBLEM","contentSlug":"minimum-palindrome-splits","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_fb696e728cce96325a8ab467783d7c88","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Symmetric Substring Count","order":31,"contentType":"PROBLEM","contentSlug":"symmetric-substring-count","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_f32f4bee2b595a8332f3fad7327a3b06","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Triple Palindrome Partition","order":32,"contentType":"PROBLEM","contentSlug":"triple-palindrome-partition","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_6e2854046f63e196de9e98df388ebc16","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Optimal Disjoint Palindrome Selection","order":33,"contentType":"PROBLEM","contentSlug":"optimal-disjoint-palindrome-selection","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_7f44086c4f2beae6048f1f9aeb4eeca4","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"What Is a String?","order":1,"contentType":"LEARNING","contentSlug":"what-is-a-string","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.096Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_cca35d7e02ad2de5a974899b1fa579df","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"How Strings Are Represented (Conceptual View)","order":2,"contentType":"LEARNING","contentSlug":"how-strings-are-represented","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.096Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_70983b75813b19ee13240096a62dd742","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Permutation Substring Finder","order":3,"contentType":"VISUALIZER","contentSlug":"permutation-substring-finder","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.096Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_6f0bdf6b92d2f73e5d82a57f33f3d283","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Permutation Substring Finder","order":4,"contentType":"PROBLEM","contentSlug":"permutation-substring-finder","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_893e87c49d5335eea628d3bcc195f13d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Anagram Substring Detection","order":5,"contentType":"PROBLEM","contentSlug":"anagram-substring-detection","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_4488e8f7097fd6f44175f56188950b47","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Peak Window Average","order":6,"contentType":"PROBLEM","contentSlug":"peak-window-average","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_529b74dd9de8f47cacc24d5fad4502e0","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Qualifying Window Segments","order":7,"contentType":"PROBLEM","contentSlug":"qualifying-window-segments","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_c0cd8f2780b71046f74a7d32ee8912ee","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Peak Vowel Count in Window","order":8,"contentType":"PROBLEM","contentSlug":"peak-vowel-count-in-window","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_fcbf1f99e82683f33972035266c0ec75","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Minimum Tile Repaints","order":9,"contentType":"PROBLEM","contentSlug":"minimum-tile-repaints","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_3451de72af500f91198a1487e998b9f4","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Maximum Unique Window Sum","order":10,"contentType":"PROBLEM","contentSlug":"maximum-unique-window-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_c1659a7bca272efba2fd17f70f9c7a61","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Maximum Unique Substring Length","order":11,"contentType":"PROBLEM","contentSlug":"max-unique-substring-length","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_2c38b8cb0bdc055a406b77fea08cc189","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Smallest Covering Substring","order":12,"contentType":"PROBLEM","contentSlug":"smallest-covering-substring","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_46cdbd9bba093c1a8df4e2be60a70f20","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Max Length Window With Limited Unique Characters","order":13,"contentType":"PROBLEM","contentSlug":"max-length-window-with-limited-unique-chars","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_e465975faba68e04f65d0ec9d8078e18","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Bounded Unique Character Window","order":14,"contentType":"PROBLEM","contentSlug":"bounded-unique-character-window","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_e83a0870372f6ab02f8097bc3751cbcd","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Maximum Uniform Segment","order":15,"contentType":"PROBLEM","contentSlug":"maximum-uniform-segment","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z"},{"id":"seed_f9dc69c2c25682261e0c5a0b3cc6078d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Longest Continuous Segment with Modifications","order":16,"contentType":"PROBLEM","contentSlug":"longest-continuous-segment-with-modifications","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_5ca1b7558d57fc38a6abd5f796c9a754","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Maximum Matching Substring Within Budget","order":17,"contentType":"PROBLEM","contentSlug":"max-matching-substring-with-budget","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_1a53f97dad1d370ac531433b96943bfd","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Maximum Consecutive Ones After Removal","order":18,"contentType":"PROBLEM","contentSlug":"maximum-consecutive-ones-after-removal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_a38dac46d61c210f307a7170e5b20f55","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Maximize Uniform Signal Segment","order":19,"contentType":"PROBLEM","contentSlug":"maximize-uniform-signal-segment","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_11cfa321bbb62ef3b83b5f39a8eceadd","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Binary Segments With Target Sum","order":20,"contentType":"PROBLEM","contentSlug":"binary-segments-with-target-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_192951140c804eee87329d596bc5943a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"K Distinct Element Subarrays","order":21,"contentType":"PROBLEM","contentSlug":"k-distinct-element-subarrays","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_328e8f1807c04fcbf89e89a86ef7a637","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Qualifying Subarray Count","order":22,"contentType":"PROBLEM","contentSlug":"qualifying-subarray-count","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_9b8b3a4371fb28868e5055017120d8fa","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Complete Triplet Substring Count","order":23,"contentType":"PROBLEM","contentSlug":"complete-triplet-substring-count","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_4a1bf736c4774440ec3f92be2debd52a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Full Spectrum Subarrays","order":24,"contentType":"PROBLEM","contentSlug":"full-spectrum-subarrays","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_af3225a561f61f684f840ad1f0439a6e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"The Search Problem — Formalization","order":1,"contentType":"LEARNING","contentSlug":"search-problem-formalization","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_9ea4474d68484d924b79146f4ff48e77","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Linear Search — The Baseline Search Algorithm","order":2,"contentType":"LEARNING","contentSlug":"linear-search-baseline","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_87ef20185664544b9cfa92a42b53607f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Rotated Array Search","order":3,"contentType":"VISUALIZER","contentSlug":"rotated-array-search","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_5e25bce0ab9c3d0b95c9789ef299d5b3","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Rotated Array Search","order":4,"contentType":"PROBLEM","contentSlug":"rotated-array-search","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_0197d8500ab8d2483c3032addf8e5b0b","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Sorted Array Position Finder","order":5,"contentType":"PROBLEM","contentSlug":"sorted-array-position-finder","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_c5c66e9d87bc5fd990c59216aa483c84","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Smallest Element in Cyclic Sorted Array","order":6,"contentType":"PROBLEM","contentSlug":"smallest-element-in-cyclic-sorted-array","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_27cabc0597b491fee95667e5c3c2d548","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"First Defective Release","order":7,"contentType":"PROBLEM","contentSlug":"first-defective-release","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_f88e73890941a67a04188a2d0da70c0d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Target Element Range","order":8,"contentType":"PROBLEM","contentSlug":"target-element-range","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_3f1877b0fbc02aede28f185539588d99","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Smallest Element in Rotated Duplicates Array","order":9,"contentType":"PROBLEM","contentSlug":"smallest-element-in-rotated-duplicates-array","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_fdaa469bfc562e22ac7b9053156a08c5","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Locate Local Maximum","order":10,"contentType":"PROBLEM","contentSlug":"locate-local-maximum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_100e8d40c15d74115f64af338f02f3a5","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Lone Element in Paired Sequence","order":11,"contentType":"PROBLEM","contentSlug":"lone-element-in-paired-sequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_7a4a5df5dc13a8d132bceaae7827c06d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Summit Position in Unimodal Sequence","order":12,"contentType":"PROBLEM","contentSlug":"summit-position-in-unimodal-sequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_dd1b8566e825deb930862df6f544a566","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Mountain Array Target Search","order":13,"contentType":"PROBLEM","contentSlug":"mountain-array-target-search","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_b5f6b2581f77dfd2eccfec9e9845b078","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Cyclic Shifted Array Lookup with Duplicates","order":14,"contentType":"PROBLEM","contentSlug":"cyclic-shifted-array-lookup-with-duplicates","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_e2cb189f6dbd609e5027f96105bc0451","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Optimal Workload Partitioning","order":15,"contentType":"PROBLEM","contentSlug":"optimal-workload-partitioning","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_6ae5c9d01b4e9e0a8bdae6e8f41774a4","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Minimize Largest Gap After Placements","order":16,"contentType":"PROBLEM","contentSlug":"minimize-largest-gap-after-placements","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_ee45036c87630a716e9ec9ebe2ac7a54","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Optimal Consumption Rate","order":17,"contentType":"PROBLEM","contentSlug":"optimal-consumption-rate","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_f9be048792482438d61a7bcd3f0ccc92","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Minimum Freight Capacity within Deadline","order":18,"contentType":"PROBLEM","contentSlug":"minimum-freight-capacity","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_ca117a14e7ef0957649a012c7f91916c","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Maximum Minimum Spacing","order":19,"contentType":"PROBLEM","contentSlug":"maximum-minimum-spacing","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_18d56e35ce47faa9fa63883ae5dd68e7","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Maximum Ascending Chain Length","order":20,"contentType":"PROBLEM","contentSlug":"maximum-ascending-chain-length","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_7600fae988ec38efad4cc5f72682de53","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Nested Container Stacking","order":21,"contentType":"PROBLEM","contentSlug":"nested-container-stacking","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_6c8c7232de458093703f275bf5c51804","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Batch Interval Modifier","order":1,"contentType":"VISUALIZER","contentSlug":"batch-interval-modifier","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_b430b93ecd62f604418c92e9fab80f6e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Batch Interval Modifier","order":2,"contentType":"PROBLEM","contentSlug":"batch-interval-modifier","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_5a3e2a4e19eb2486e7704a155d89c20b","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Cumulative Character Rotation","order":3,"contentType":"PROBLEM","contentSlug":"cumulative-character-rotation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_b1d4557a925b0a25eb9e8e8c411af52f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Shuttle Service Capacity Check","order":4,"contentType":"PROBLEM","contentSlug":"shuttle-service-capacity-check","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_fc463e00d69ac07de558a98f27bc2eda","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Aggregate Range Reservations","order":5,"contentType":"PROBLEM","contentSlug":"aggregate-range-reservations","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_162a02b12f9b7cc43443a691de903be0","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Smallest Absent Positive","order":6,"contentType":"PROBLEM","contentSlug":"smallest-absent-positive","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_f80c102b1c687d62e9405d89baffcf45","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Detect Absent Element","order":7,"contentType":"PROBLEM","contentSlug":"detect-absent-element","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_dee9e46cf7361486c3c275d175a0c1be","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Detect Repeating Element","order":8,"contentType":"PROBLEM","contentSlug":"detect-repeating-element","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_13322e06f297cd5a7e2206fe293e5027","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Missing Elements in Sequence","order":9,"contentType":"PROBLEM","contentSlug":"missing-elements-in-sequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_1ced7b074a7933e219b449de49c30e51","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Wave Pattern Arrangement","order":10,"contentType":"PROBLEM","contentSlug":"wave-pattern-arrangement","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_caefa86e4266ef1309795403cb9031bc","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Partition Evens Before Odds","order":11,"contentType":"PROBLEM","contentSlug":"partition-evens-before-odds","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_2f95d8ba149fa1d9e42adb1021a18081","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Parity Index Alignment","order":12,"contentType":"PROBLEM","contentSlug":"parity-index-alignment","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_974b359fce861a88e22b81ce84ca3791","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Spiral Grid Traversal","order":13,"contentType":"PROBLEM","contentSlug":"spiral-grid-traversal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_abff7543eb96b56ad0457975e479b068","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Generate Spiral Grid","order":14,"contentType":"PROBLEM","contentSlug":"generate-spiral-grid","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_3b7fd63f60f14e15ca1ed5458f8714ba","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Zigzag Matrix Walk","order":15,"contentType":"PROBLEM","contentSlug":"zigzag-matrix-walk","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_dfbfbbeadfe3a7ee57a5681cf0de8050","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Diagonal Consistency Matrix","order":16,"contentType":"PROBLEM","contentSlug":"diagonal-consistency-matrix","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_16db156e5ab6a5886b690d17f7d04b3f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Diagonal Matrix Ordering","order":17,"contentType":"PROBLEM","contentSlug":"diagonal-matrix-ordering","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_f90c26030f5cd44023f65226f469bfdc","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Anti-Diagonal Matrix Traversal","order":18,"contentType":"PROBLEM","contentSlug":"anti-diagonal-matrix-traversal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_aa31255f3a0e43474e6395c71ee27b44","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Anagram Clustering","order":19,"contentType":"PROBLEM","contentSlug":"anagram-clustering","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_d59dd66fe8c10398cea7a3e5b596972e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Cyclic Character Equivalence","order":20,"contentType":"PROBLEM","contentSlug":"cyclic-character-equivalence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_22d9ed58adb69cbe82b746e36624c4da","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Duplicate File Detector","order":21,"contentType":"PROBLEM","contentSlug":"duplicate-file-detector","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_0087fcc4b5df8df4856143657b3566b7","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Partition Members by Team Capacity","order":22,"contentType":"PROBLEM","contentSlug":"partition-members-by-team-capacity","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_8a02a6025e2c89065e5c543438f12561","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Letter Composition Validator","order":23,"contentType":"PROBLEM","contentSlug":"letter-composition-validator","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_e867d59f6e2f31a77d3619fadee17269","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Locate First Singular Character","order":24,"contentType":"PROBLEM","contentSlug":"locate-first-singular-character","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_5cb151a1a14e3d393528523d6f92275a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Spot the Extra Character","order":25,"contentType":"PROBLEM","contentSlug":"spot-the-extra-character","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_a0564b270024bf20db35220c9f3bfda1","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Maximum Palindrome Construction Length","order":26,"contentType":"PROBLEM","contentSlug":"max-palindrome-construction","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_bbc9243f9e1e3903198f637652d832ab","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Treasure Stone Counter","order":27,"contentType":"PROBLEM","contentSlug":"treasure-stone-counter","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_df2ce7f688a3952f1f5e671c909bb7fe","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Shared Letters Extraction","order":28,"contentType":"PROBLEM","contentSlug":"shared-letters-extraction","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_78d88fc5242f530e9bee7b69162f1635","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Constructible Words from Character Pool","order":29,"contentType":"PROBLEM","contentSlug":"constructible-words-from-character-pool","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_fcbf7f7df55d73b81e0c2662b4487854","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Uniform Character Frequency","order":30,"contentType":"PROBLEM","contentSlug":"uniform-character-frequency","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_de51333f01c4226136d7bfb35039a7de","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Substring Position Finder","order":31,"contentType":"PROBLEM","contentSlug":"substring-position-finder","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_cb93d68f284e08bada1aa64b07936cdb","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Cyclic Pattern Detection","order":32,"contentType":"PROBLEM","contentSlug":"cyclic-pattern-detection","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_48c06882746ca2ad138bac2516fc3fae","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Subsequence Validator","order":33,"contentType":"PROBLEM","contentSlug":"subsequence-validator","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_012e1fd2254db76f8f668ec80dfa6bca","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Shortest Covering Substring for Subsequence","order":34,"contentType":"PROBLEM","contentSlug":"shortest-covering-substring-for-subsequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_aede66dd340cbf8ec96ce78a53260119","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"String Segmentation","order":35,"contentType":"PROBLEM","contentSlug":"string-segmentation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_6036c08a85a7f9119c27bbc24cf4fd75","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Dictionary Sentence Formation","order":36,"contentType":"PROBLEM","contentSlug":"dictionary-sentence-formation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_e059b124b96ea86d5eee65eb36e54586","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Minimum Leftover Characters","order":37,"contentType":"PROBLEM","contentSlug":"minimum-leftover-characters","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_0d34d37bc36ce2819df4e52ee7b99061","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Pair Target Sum","order":38,"contentType":"PROBLEM","contentSlug":"pair-target-sum","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_a0b5eee4c6f4f02327c9d3e08e54b932","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"What Is a Stack? Real-World Intuition","order":1,"contentType":"LEARNING","contentSlug":"what-is-a-stack","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_9def8f5b56f2ab7ed8b07ddab69976d8","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Stack as an Abstract Data Type (ADT)","order":2,"contentType":"LEARNING","contentSlug":"stack-as-abstract-data-type","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_0ffd0a65b20894303125da91267c7317","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Smallest Element Tracker Stack","order":3,"contentType":"VISUALIZER","contentSlug":"smallest-element-tracker-stack","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_a0fc282df89d91eb03aef6290ffaffdc","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Smallest Element Tracker Stack","order":4,"contentType":"PROBLEM","contentSlug":"smallest-element-tracker-stack","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_eb5afca9ce66b92a649f64b19ab7a132","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Maximum Tracking Stack","order":5,"contentType":"PROBLEM","contentSlug":"maximum-tracking-stack","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_98f8216e3ab5ad93c70cb5bed9ceecc2","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Streaming Price Dominance Tracker","order":6,"contentType":"PROBLEM","contentSlug":"streaming-price-dominance-tracker","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_98f14108946ce0b876e7faacb9ae3e90","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Incrementable Capacity Stack","order":7,"contentType":"PROBLEM","contentSlug":"incrementable-capacity-stack","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_3bb93b432f0d7871b0d6617d989310df","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Maximum Balanced Bracket Sequence","order":8,"contentType":"PROBLEM","contentSlug":"maximum-balanced-bracket-sequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_a6ada23aef45cfee241c49addf1b39fe","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Nested Bracket Scoring","order":9,"contentType":"PROBLEM","contentSlug":"nested-bracket-scoring","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_b7aa096b61625fd8b958cdf8954c9084","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Deepest Bracket Level","order":10,"contentType":"PROBLEM","contentSlug":"deepest-bracket-level","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_d3cefc45b1614b76d67ca56a1b0fa909","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Maximum Rectangular Area","order":11,"contentType":"PROBLEM","contentSlug":"maximum-rectangular-area","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_5947b3eadb1ad47552794f3a5b281227","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Next Warmer Day Distance","order":12,"contentType":"PROBLEM","contentSlug":"next-warmer-day-distance","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_8206e33b95f09aa197733582f4f60fe9","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Eliminate Consecutive Twins","order":13,"contentType":"PROBLEM","contentSlug":"eliminate-consecutive-twins","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_ee7fc89e32df3985416fd318084bddb2","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Consecutive Character Collapse","order":14,"contentType":"PROBLEM","contentSlug":"consecutive-character-collapse","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_9ff9026acc3bfb0d11944a5c2ca66183","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Bounded Gap Subsequence Maximum","order":15,"contentType":"PROBLEM","contentSlug":"bounded-gap-subsequence-maximum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_9e504990594e6b880ada957bfcf60f97","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Bounded Leap Max Score","order":16,"contentType":"PROBLEM","contentSlug":"bounded-leap-max-score","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_339c1ffb68e8196e5813680709399a42","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 6: Linked List Patterns","sectionOrder":6,"title":"Why Linked Lists? Limitations of Arrays","order":1,"contentType":"LEARNING","contentSlug":"why-linked-lists","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_cab2b4e9d8c673b0e376637fcc70b099","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 6: Linked List Patterns","sectionOrder":6,"title":"What Is a Linked List?","order":2,"contentType":"LEARNING","contentSlug":"what-is-a-linked-list","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_6c09210c36d5e320e12a94ea8d14ea06","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 6: Linked List Patterns","sectionOrder":6,"title":"Combine Ordered Sequences","order":3,"contentType":"VISUALIZER","contentSlug":"combine-ordered-sequences","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_c40fdc7694c20c98b910f905baf7fa96","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 6: Linked List Patterns","sectionOrder":6,"title":"Combine Ordered Sequences","order":4,"contentType":"PROBLEM","contentSlug":"combine-ordered-sequences","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_975c629f106810978db41db9ec794385","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 6: Linked List Patterns","sectionOrder":6,"title":"Combine Sorted Sequences","order":5,"contentType":"PROBLEM","contentSlug":"combine-sorted-sequences","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_a0c08efbcbb81fb283d0ecb788b9e1b0","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 6: Linked List Patterns","sectionOrder":6,"title":"Linked List Sort","order":6,"contentType":"PROBLEM","contentSlug":"linked-list-sort","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_0d0b2b601905a3f3e0726b3ceb5edd33","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 6: Linked List Patterns","sectionOrder":6,"title":"Adjacent Node Exchange","order":7,"contentType":"PROBLEM","contentSlug":"adjacent-node-exchange","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_2f89b71b7b1ac289258d8d01aa35b407","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 6: Linked List Patterns","sectionOrder":6,"title":"K-Segment List Reversal","order":8,"contentType":"PROBLEM","contentSlug":"k-segment-list-reversal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_5d075e8824cec7e00bc0b580cc35d6eb","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 6: Linked List Patterns","sectionOrder":6,"title":"Linked List Number Addition","order":9,"contentType":"PROBLEM","contentSlug":"linked-list-number-addition","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_d772e628541148d8460374b272b40459","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 7: Heap & Priority Queue","sectionOrder":7,"title":"Priority Queues Revisited — Now with Implementation","order":1,"contentType":"LEARNING","contentSlug":"priority-queues-revisited","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_e46db410ca7ec2572b85feda32376a69","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 7: Heap & Priority Queue","sectionOrder":7,"title":"Complete Binary Trees — The Foundation of Array-Based Heaps","order":2,"contentType":"LEARNING","contentSlug":"complete-binary-tree-representation","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_3bad020b359153eb9fc7c35fde1431dc","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 7: Heap & Priority Queue","sectionOrder":7,"title":"Find Kth Ranked Element","order":3,"contentType":"VISUALIZER","contentSlug":"find-kth-ranked-element","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_6894a50046d823830ecd8e0c9087fe7f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 7: Heap & Priority Queue","sectionOrder":7,"title":"Find Kth Ranked Element","order":4,"contentType":"PROBLEM","contentSlug":"find-kth-ranked-element","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_f939fb61b359fe80dececfa4074fd0a3","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 7: Heap & Priority Queue","sectionOrder":7,"title":"Kth Order Element in Doubly Sorted Grid","order":5,"contentType":"PROBLEM","contentSlug":"kth-order-element-in-doubly-sorted-grid","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_74f33aaab7abcb7afb5af820f8f4df38","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 7: Heap & Priority Queue","sectionOrder":7,"title":"K Nearest Values","order":6,"contentType":"PROBLEM","contentSlug":"k-nearest-values","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_befb5e3d6af3bdf89d327d104c81dfaf","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 7: Heap & Priority Queue","sectionOrder":7,"title":"Streaming Kth Highest Tracker","order":7,"contentType":"PROBLEM","contentSlug":"streaming-kth-highest-tracker","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_c36a0569683fa1fcb4e7efe0a9973ed7","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 7: Heap & Priority Queue","sectionOrder":7,"title":"K Most Common Elements","order":8,"contentType":"PROBLEM","contentSlug":"k-most-common-elements","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_d03d93faafd7ff97ce6213e91e71f364","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 7: Heap & Priority Queue","sectionOrder":7,"title":"Frequency-Based Character Ordering","order":9,"contentType":"PROBLEM","contentSlug":"frequency-based-character-ordering","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_7487ce139f28f0e0fe8478b754ab10a3","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Why Trees? Limitations of Linear Structures","order":1,"contentType":"LEARNING","contentSlug":"why-trees-limitations-of-linear-structures","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_761b172dcf254392d58ccb1885f08cb5","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Tree Properties — Height, Depth, Levels","order":2,"contentType":"LEARNING","contentSlug":"tree-properties-height-depth-levels","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_fe63e570028944f69e1fba90ef180f92","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Layer-by-Layer Binary Tree Values","order":3,"contentType":"VISUALIZER","contentSlug":"layer-by-layer-binary-tree-values","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_431136787fd65f4b837d8ed9bf25f413","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Layer-by-Layer Binary Tree Values","order":4,"contentType":"PROBLEM","contentSlug":"layer-by-layer-binary-tree-values","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_fae3b4aa15bb4c00e5433f77295edc80","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Alternating Level Traversal","order":5,"contentType":"PROBLEM","contentSlug":"alternating-level-traversal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_117a0a49db7b684c404f9ebac066414a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Binary Tree Height","order":6,"contentType":"PROBLEM","contentSlug":"binary-tree-height","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_acfa117d0955199e47623e121d46522c","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Reverse Level Order Tree Traversal","order":7,"contentType":"PROBLEM","contentSlug":"reverse-level-order-tree-traversal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_3f35f4d67426ebc2e792f215f8c42d71","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Shortest Path to Tree Leaf","order":8,"contentType":"PROBLEM","contentSlug":"shortest-path-to-tree-leaf","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_c7d883e98f994a19d40aea6cae328e55","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Rightmost Level Nodes","order":9,"contentType":"PROBLEM","contentSlug":"rightmost-level-nodes","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_101711a3a2f01360a667df3dab069ed3","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Multi-Child Tree Layer Traversal","order":10,"contentType":"PROBLEM","contentSlug":"multi-child-tree-layer-traversal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_763cb9478895bcfa86457b351dd79ccf","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Maximum Value Per Binary Tree Level","order":11,"contentType":"PROBLEM","contentSlug":"maximum-value-per-binary-tree-level","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_a1bc937d814d32421a1ed07d557af8cb","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Level Mean Values","order":12,"contentType":"PROBLEM","contentSlug":"level-mean-values","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_38614c376f88027eefbdcd642caa2529","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Peak Depth Value in Tree","order":13,"contentType":"PROBLEM","contentSlug":"peak-depth-value-in-tree","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_fd7d920e8c69862368a9fdb185cb1b47","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Lowest Level Node Aggregation","order":14,"contentType":"PROBLEM","contentSlug":"lowest-level-node-aggregation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_01c23a1933375e92fe9252b88f09cf5a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Binary Tree Longest Path","order":15,"contentType":"PROBLEM","contentSlug":"binary-tree-longest-path","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_ea5ca378e44de1a7e9f1eaab263d07b5","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"N-ary Tree Height","order":16,"contentType":"PROBLEM","contentSlug":"nary-tree-height","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_0982c5d32fdfce5fdc1031ca2bcce4a0","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Identical Binary Trees","order":17,"contentType":"PROBLEM","contentSlug":"identical-binary-trees","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_2d9e2a1877dba70f1de83cf7e73d5dd1","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Mirror Tree Validation","order":18,"contentType":"PROBLEM","contentSlug":"mirror-tree-validation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_05cfa2e6493a064b2c0f5de8e33cbd08","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Height-Balanced Tree Verification","order":19,"contentType":"PROBLEM","contentSlug":"height-balanced-tree-check","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_00f6b5656a53363affc42d76f424fcb5","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Embedded Tree Detection","order":20,"contentType":"PROBLEM","contentSlug":"embedded-tree-detection","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_dcd25f9bd29f71944399eeac54b45f22","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Mirror Equivalent Binary Trees","order":21,"contentType":"PROBLEM","contentSlug":"mirror-equivalent-binary-trees","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_78acb6afb2fe5ad466dcf90e5a90aa8d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Rebuild Binary Tree from Preorder and Inorder Traversals","order":22,"contentType":"PROBLEM","contentSlug":"rebuild-tree-from-traversals","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_65d34c35fb9c6358c118dc336650adbb","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Reconstruct Tree from Preorder and Postorder Sequences","order":23,"contentType":"PROBLEM","contentSlug":"reconstruct-tree-from-traversals","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_5716848c123dd4e9528b99857254b1fa","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Verify BST Integrity","order":24,"contentType":"PROBLEM","contentSlug":"verify-bst-integrity","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_756a32a520161f858897ab404bbf810d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Restore Corrupted Binary Search Tree","order":25,"contentType":"PROBLEM","contentSlug":"restore-corrupted-bst","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_1b9340e4e74f46ce8b1b537e2b1c9388","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"BST Rank Finder","order":26,"contentType":"PROBLEM","contentSlug":"bst-rank-finder","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_704871769c0455251408997b00b84ee7","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"BST Most Frequent Values","order":27,"contentType":"PROBLEM","contentSlug":"bst-most-frequent-values","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_398310d5386ad939c49a5555cb9e1e7e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Closest Value Gap in Search Tree","order":28,"contentType":"PROBLEM","contentSlug":"closest-value-gap-in-search-tree","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_5bc4f3a90179b4a8c77d8e3d20f9ce4d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Smallest Value Gap in Binary Search Tree","order":29,"contentType":"PROBLEM","contentSlug":"smallest-value-gap-in-binary-search-tree","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_38276617d5af9583e8f65a26cd3f2e2a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Ascending BST Reorganization","order":30,"contentType":"PROBLEM","contentSlug":"ascending-bst-reorganization","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_4050239acb286fdf3bb60a4994e5d924","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Binary Tree Bounded Sum","order":31,"contentType":"PROBLEM","contentSlug":"binary-tree-bounded-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_3b4d6db93f259f9b4fc8f84d2acde1eb","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Inorder Tree Values","order":32,"contentType":"PROBLEM","contentSlug":"inorder-tree-values","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_22826b4ce1751b029102e718000a0807","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Target Sum Paths","order":33,"contentType":"PROBLEM","contentSlug":"target-sum-paths","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_c58d64a667f54497a8d5d97ddfb4eb76","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Aggregate Path Numbers in Binary Tree","order":34,"contentType":"PROBLEM","contentSlug":"aggregate-path-numbers","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_e1ff05e63016085e61148e02ad0a3216","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Tree Root-to-Leaf Paths","order":35,"contentType":"PROBLEM","contentSlug":"tree-root-to-leaf-paths","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_e7d3cfbf06f27b1b06ad8a8a7bfb06df","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Lexicographically Minimal Leaf-to-Root String","order":36,"contentType":"PROBLEM","contentSlug":"lexicographically-minimal-leaf-to-root-string","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_be7abb314c52eb90b911039910ea2d6f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Rearrangeable Palindrome Root-to-Leaf Paths","order":37,"contentType":"PROBLEM","contentSlug":"rearrangeable-palindrome-paths","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_a4977976243dfc42744543ed4782fa05","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Optimal Tree Route Sum","order":38,"contentType":"PROBLEM","contentSlug":"optimal-tree-route-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_cd26f6bfa158c1c04120be32ec612e86","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Tree Balance Metric","order":39,"contentType":"PROBLEM","contentSlug":"tree-balance-metric","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_fdb35ff35ef94f1a3aef3fd8088fe765","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Maximum Uniform Path","order":40,"contentType":"PROBLEM","contentSlug":"maximum-uniform-path","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_13a932f4133a74dbad91645dbc154717","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Tree Column Traversal","order":41,"contentType":"PROBLEM","contentSlug":"tree-column-traversal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_727319f4aa6152347cac97d836d7f10c","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Columnar Tree Traversal","order":42,"contentType":"PROBLEM","contentSlug":"columnar-tree-traversal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_a545ad5c534c1c116e33b508ba5c5a47","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Why Graphs? Real-World Networks","order":1,"contentType":"LEARNING","contentSlug":"why-graphs","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_8f751679065b97d6239d604a2ffc05a2","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"What Is a Graph? Definition & Terminology","order":2,"contentType":"LEARNING","contentSlug":"graph-definition-terminology","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_d63230a4cf93ef33f387633e2261f524","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Capture Enclosed Territory","order":3,"contentType":"VISUALIZER","contentSlug":"capture-enclosed-territory","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_f73177a99666e00bb2321f26179b454a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Capture Enclosed Territory","order":4,"contentType":"PROBLEM","contentSlug":"capture-enclosed-territory","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_fd3dd785285506d281ccc8a8ceaf6753","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Count Connected Landmasses","order":5,"contentType":"PROBLEM","contentSlug":"count-connected-landmasses","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_b8abacdd21879660121e34bee64e9697","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Dual Ocean Drainage Cells","order":6,"contentType":"PROBLEM","contentSlug":"dual-ocean-drainage-cells","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_1d927ba7a92941f6df87e651074eb09e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Landmass Boundary Length","order":7,"contentType":"PROBLEM","contentSlug":"landmass-boundary-length","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_2bd8ac157c2e8f814350fe836a92a74c","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Minefield Explorer","order":8,"contentType":"PROBLEM","contentSlug":"minefield-explorer","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_cb127134ad1b45df24baccd3148596f1","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Largest Connected Land Region","order":9,"contentType":"PROBLEM","contentSlug":"largest-connected-land-region","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_daaae1420504c34758f2f562b2e978db","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Region Color Propagation","order":10,"contentType":"PROBLEM","contentSlug":"region-color-propagation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_80c47500f5dc599da3d1d838b9317526","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Count Isolated Land Cells","order":11,"contentType":"PROBLEM","contentSlug":"count-isolated-land-cells","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_e0b5b052675492fca8ac0d3e1eacfeac","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Count Enclosed Land Regions","order":12,"contentType":"PROBLEM","contentSlug":"count-enclosed-land-regions","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_3ee3a000ac3385bc6218e52ae58993ac","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Contained Region Count","order":13,"contentType":"PROBLEM","contentSlug":"contained-region-count","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_a9532d84ea38062b0cb8d7f4b96a0957","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Unique Landmass Shapes","order":14,"contentType":"PROBLEM","contentSlug":"unique-landmass-shapes","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_6050dc32a559fb015b601e8f89a6943f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Canonical Island Shapes","order":15,"contentType":"PROBLEM","contentSlug":"canonical-island-shapes","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_3d52f10023bc69752dbde7db97b8b02d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Infection Spread Simulation","order":16,"contentType":"PROBLEM","contentSlug":"infection-spread-simulation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_f504c82ff675caa03846a58067bc73ca","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Nearest Zero Distance","order":17,"contentType":"PROBLEM","contentSlug":"nearest-zero-distance","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_e1568709f6218790721c1748ba9dab19","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Maximum Ocean Distance","order":18,"contentType":"PROBLEM","contentSlug":"maximum-ocean-distance","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_d0636f8fb4029edc47e0973ed6070067","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Terrain Elevation Grid","order":19,"contentType":"PROBLEM","contentSlug":"terrain-elevation-grid","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_70f3a31f8f0dd21590b9d6d568bbb589","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Vocabulary Chain Transformation","order":20,"contentType":"PROBLEM","contentSlug":"vocabulary-chain-transformation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_c17c2c89d7207e1672e3d119f74a14b6","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Minimum Square Sum Decomposition","order":21,"contentType":"PROBLEM","contentSlug":"minimum-square-sum-decomposition","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_c301bd9bc78b4316a0bdc2b6dbaced76","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Minimum DNA Sequence Transformations","order":22,"contentType":"PROBLEM","contentSlug":"minimum-dna-sequence-transformations","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_93a2e5de97c5278714d5ed1a1d361337","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Combination Lock Solver","order":23,"contentType":"PROBLEM","contentSlug":"combination-lock-solver","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_03859f5d2b2fcf20e101904985d2f8fa","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Tile Shuffle Puzzle","order":24,"contentType":"PROBLEM","contentSlug":"tile-shuffle-puzzle","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_f3af4fdf80355aefdc5af45f522b3763","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Minimum Swap Distance","order":25,"contentType":"PROBLEM","contentSlug":"minimum-swap-distance","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_7acea26c1f049d4823073e86d2af78f4","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Minimum Path in Binary Grid","order":26,"contentType":"PROBLEM","contentSlug":"minimum-path-binary-grid","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_747b040b0e1c42a8e206639291b3d4b1","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Grid Navigation with Obstacle Removal","order":27,"contentType":"PROBLEM","contentSlug":"grid-navigation-with-obstacle-removal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_93bbb88aaa80d8be44041243970333b2","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Array Teleportation Jumps","order":28,"contentType":"PROBLEM","contentSlug":"array-teleportation-jumps","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_4a629f27cd4446abee5b34217f51a3c1","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Minimum Direction Changes for Grid Navigation","order":29,"contentType":"PROBLEM","contentSlug":"minimum-direction-changes-grid-navigation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_b84f4fc571f7f309d9e5592dc887338b","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Minimum Barrier Clearance to Destination","order":30,"contentType":"PROBLEM","contentSlug":"minimum-barrier-clearance-to-destination","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_041e446b88905c4f71aafe58b3e596f9","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Graph Traversal Overview","order":1,"contentType":"LEARNING","contentSlug":"graph-traversal-overview","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_27bb839546a195b5e4702b5d23707319","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Depth-First Search (DFS) — Algorithm & Applications","order":2,"contentType":"LEARNING","contentSlug":"dfs-algorithm-and-applications","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_4118900ad89b50a86312a19633cb82be","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Task Dependency Validator","order":3,"contentType":"VISUALIZER","contentSlug":"task-dependency-validator","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_e599d2202a95ccdb84ee5bdd216a1641","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Task Dependency Validator","order":4,"contentType":"PROBLEM","contentSlug":"task-dependency-validator","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_44984b8c4d8d4431fe786e52f338e3d5","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Task Execution Order","order":5,"contentType":"PROBLEM","contentSlug":"task-execution-order","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_df3bb428ba89aaba43637aacb0dab3ec","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Safe Destination Nodes","order":6,"contentType":"PROBLEM","contentSlug":"safe-destination-nodes","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_310819da1e99200f5a167e4824e09815","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Two-Set Graph Partition","order":7,"contentType":"PROBLEM","contentSlug":"two-set-graph-partition","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_2913207f1b4ab6bfbcd526e41ecb19da","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Group Division Feasibility","order":8,"contentType":"PROBLEM","contentSlug":"group-division-feasibility","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_6dcc6008fe684ac489e4bdc20f6a5066","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Optimal Graph Layering","order":9,"contentType":"PROBLEM","contentSlug":"optimal-graph-layering","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_aad785a48dbd9870ae6371f58caf2855","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Connected City Regions","order":10,"contentType":"PROBLEM","contentSlug":"connected-city-regions","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_02add0dd08a1e4558b7a7dcc0294cf4b","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Undirected Graph Tree Validation","order":11,"contentType":"PROBLEM","contentSlug":"undirected-graph-tree-validation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_64485595a3cae05f7cfd70fa01f5b362","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Cycle Forming Edge Detection","order":12,"contentType":"PROBLEM","contentSlug":"cycle-forming-edge-detection","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_670e8015fa7897dc5b9e0c693b77b73a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Foreign Alphabet Order","order":13,"contentType":"PROBLEM","contentSlug":"foreign-alphabet-order","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_d87e7f80934798b4adaab50bb8fd05b4","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Unique Ordering Verification","order":14,"contentType":"PROBLEM","contentSlug":"unique-ordering-verification","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_74cd15faa4dd84dfc68ae6136c0c0fed","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Quietest Wealthier Connection","order":15,"contentType":"PROBLEM","contentSlug":"quietest-wealthier-connection","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_9e235e3594fa69a48de7a5ac2663293d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Minimum Study Terms","order":16,"contentType":"PROBLEM","contentSlug":"minimum-study-terms","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_83dd7bbd9f68f250a80a6ba2f3e9dc54","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Dependency Reachability Queries","order":17,"contentType":"PROBLEM","contentSlug":"dependency-reachability-queries","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_96ac2654f53020a817cab1b61a4f12a8","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Maximum Color Frequency in DAG Paths","order":18,"contentType":"PROBLEM","contentSlug":"maximum-color-frequency-in-dag-paths","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_4d997b7c75a5a0f74fcf85c27b11e234","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Minimum Project Completion Time","order":19,"contentType":"PROBLEM","contentSlug":"minimum-project-completion-time","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_66a93cab1465bb84d11f20b6e4a1db61","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Craftable Items From Inventory","order":20,"contentType":"PROBLEM","contentSlug":"craftable-items-from-inventory","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_d9ac8f6d0841747a89407f8333bb77dc","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Deep Copy Network","order":21,"contentType":"PROBLEM","contentSlug":"deep-copy-network","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_cb85d30140e5539fd640a69a881ea0c5","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Duplicate Linked List with Arbitrary Links","order":22,"contentType":"PROBLEM","contentSlug":"duplicate-linked-list-with-arbitrary-links","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_c5d5a814e1635301df28195845653be9","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"N-ary Tree Duplication","order":23,"contentType":"PROBLEM","contentSlug":"nary-tree-duplication","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_4a8f5ef44ef13df2d86d27caa8ebad26","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Signal Propagation Time","order":24,"contentType":"PROBLEM","contentSlug":"signal-propagation-time","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_bdfa14e972576356d9b7a087d8e6ce65","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Highest Success Route","order":25,"contentType":"PROBLEM","contentSlug":"highest-success-route","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_5f76a5e991e6b0e4042e4d369d21f16b","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Minimum Exertion Path","order":26,"contentType":"PROBLEM","contentSlug":"minimum-exertion-path","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_2be3e3170e0a2ad182d82489fa862ac9","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Shortest Route Count","order":27,"contentType":"PROBLEM","contentSlug":"shortest-route-count","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_ef86f4f362625ec717cc71b373bd473d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Flood Navigation Minimum Time","order":28,"contentType":"PROBLEM","contentSlug":"flood-navigation-minimum-time","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_5e66abc12a90ed1357f92d84a6ac9a4a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Minimum Cost Network Infrastructure","order":29,"contentType":"PROBLEM","contentSlug":"minimum-cost-network-infrastructure","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_3c62b196954c457fb52242d1facf8d6e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Minimum Community Utility Cost","order":30,"contentType":"PROBLEM","contentSlug":"minimum-community-utility-cost","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_8d8d9a6f45b7ed9e3e86ad97d045b4df","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Minimum Network Cost","order":31,"contentType":"PROBLEM","contentSlug":"minimum-network-cost","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_b1435058e360315a14c1a1cab3196eb7","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Flight Route Planner","order":32,"contentType":"PROBLEM","contentSlug":"flight-route-planner","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_56bdcf3094cb6a20398dee1c35e42a62","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Chained Segment Ordering","order":33,"contentType":"PROBLEM","contentSlug":"chained-segment-ordering","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_bb526a9790acbceb42d938436ce9777f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"What Is a Greedy Algorithm?","order":1,"contentType":"LEARNING","contentSlug":"what-is-greedy-algorithm","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_764b3901e39029ba077f095d5e7c0e19","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"The Greedy Choice Property — Foundation of Greedy Algorithms","order":2,"contentType":"LEARNING","contentSlug":"greedy-choice-property","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_d458b0ed6938901d73a17e5b07d41899","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Optimal Contiguous Subarray Sum","order":3,"contentType":"VISUALIZER","contentSlug":"optimal-contiguous-subarray-sum","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_d2a7df74bb28ac456567f00257729d39","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Optimal Contiguous Subarray Sum","order":4,"contentType":"PROBLEM","contentSlug":"optimal-contiguous-subarray-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_69c9fcc40cc7e79ebcf7a52b8ce7cd61","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Optimal Single Trade Profit","order":5,"contentType":"PROBLEM","contentSlug":"optimal-single-trade-profit","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_9a305024b5c1abdf7d35b54caf3d3c1b","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Circular Array Maximum Subarray Sum","order":6,"contentType":"PROBLEM","contentSlug":"circular-array-max-subarray-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_e5470b9e739705029a3f30c03e88e284","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Optimal Landmark Pair","order":7,"contentType":"PROBLEM","contentSlug":"optimal-landmark-pair","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_191cbccb775ef75bcd0d4376e69e5416","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Maximize Trading Gains","order":8,"contentType":"PROBLEM","contentSlug":"maximize-trading-gains","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_bf2479d9bdfafb643ffe8572810eab78","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Circular Route Fuel Station","order":9,"contentType":"PROBLEM","contentSlug":"circular-route-fuel-station","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_95a8b5ece0d59b5b5972b32c06ad088c","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Maximum Sortable Partitions","order":10,"contentType":"PROBLEM","contentSlug":"maximum-sortable-partitions","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_b3804dc92f7c841ae00a0a2121af2346","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Minimum Hops to Destination","order":11,"contentType":"PROBLEM","contentSlug":"minimum-hops-to-destination","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_17c168a8607f7065749d2e6e32d308d7","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Destination Reachability","order":12,"contentType":"PROBLEM","contentSlug":"destination-reachability","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_402ce6bfa745d6c333712ed399c9c88c","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Minimum Interval Coverage","order":13,"contentType":"PROBLEM","contentSlug":"minimum-interval-coverage","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_317c3e0cb73a9e2817af70ab411b28eb","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Optimal Sprinkler Coverage","order":14,"contentType":"PROBLEM","contentSlug":"optimal-sprinkler-coverage","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_2e872e43332846c2c07ebc069795a337","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Minimum Interval Removals","order":15,"contentType":"PROBLEM","contentSlug":"minimum-interval-removals","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_a30d4aab705acde47ca7505fd3f37486","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Minimum Darts to Pop Intervals","order":16,"contentType":"PROBLEM","contentSlug":"minimum-darts-to-pop-intervals","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_6ce4186370e8a5caecd84494f1202dc3","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Longest Interval Sequence","order":17,"contentType":"PROBLEM","contentSlug":"longest-interval-sequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_c5fd20872b24634b50255c99fb592659","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Spaced Character Rearrangement","order":18,"contentType":"PROBLEM","contentSlug":"spaced-character-rearrangement","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_cd8035183e6b18490f166251d773422a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"CPU Operation Scheduler with Cooldown","order":19,"contentType":"PROBLEM","contentSlug":"cpu-operation-scheduler-with-cooldown","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_2ca117601de0bd0da332ced0a5eed9b0","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Adjacent Character Separator","order":20,"contentType":"PROBLEM","contentSlug":"adjacent-character-separator","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_acfc61ce7bffa4c4990f025008ded2b0","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Non-Adjacent Element Rearrangement","order":21,"contentType":"PROBLEM","contentSlug":"non-adjacent-element-rearrangement","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_673b0922133d004e42de0c395f24340f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Maximum Balanced Sequence","order":22,"contentType":"PROBLEM","contentSlug":"maximum-balanced-sequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_9848fd16469b3a1b6c23eb0b4965d027","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Final Boulder Mass","order":23,"contentType":"PROBLEM","contentSlug":"final-boulder-mass","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_29f1729914fb32747383672b1568c3a5","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Minimum Rope Concatenation Cost","order":24,"contentType":"PROBLEM","contentSlug":"minimum-rope-concatenation-cost","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_e2f8eaec57f4542a1cf80c28c89ada2f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Optimal Workforce Allocation","order":25,"contentType":"PROBLEM","contentSlug":"optimal-workforce-allocation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_e258437dc76eaabef6036e776f44e549","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Merge Operations to Reach Minimum Bound","order":26,"contentType":"PROBLEM","contentSlug":"merge-operations-to-reach-minimum-bound","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_c7bc5d2fa2ff8b93b2f73c41defd6462","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Simple Prime Factor Check","order":27,"contentType":"PROBLEM","contentSlug":"simple-prime-factor-check","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_32712c2d30835a491c45997f46e6978f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Maximum Product Partition","order":28,"contentType":"PROBLEM","contentSlug":"maximum-product-partition","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_8189b31ebd070cd0feb560068e777474","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Minimum Test Subjects","order":29,"contentType":"PROBLEM","contentSlug":"minimum-test-subjects","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_299644e24e4b221044af4d8d5a0b8216","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Smallest Digit Product Number","order":30,"contentType":"PROBLEM","contentSlug":"smallest-digit-product-number","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_c50f1d264000413840fb39c7013b9047","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Minimal Text Replication","order":31,"contentType":"PROBLEM","contentSlug":"minimal-text-replication","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_c9c862b0617b0dde1c086da2f3a3e73f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"What Is Backtracking?","order":1,"contentType":"LEARNING","contentSlug":"what-is-backtracking","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_c25e5cdbbcc35b6bde66045966c3209e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Backtracking vs Brute Force: Understanding the Distinction","order":2,"contentType":"LEARNING","contentSlug":"backtracking-vs-brute-force","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_47382729d0d47b1a5283dc90a80719db","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Power Set Generation","order":3,"contentType":"VISUALIZER","contentSlug":"power-set-generation","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_4c32b6868cc3fc8e52d43bb1d5948b4a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Power Set Generation","order":4,"contentType":"PROBLEM","contentSlug":"power-set-generation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_b4da23eb171a0e71ed5e15ec702ab6ee","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Unique Power Set","order":5,"contentType":"PROBLEM","contentSlug":"unique-power-set","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_e8a9c8f1421d0ea3c0bfe1a1efbd387e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Ascending Order Subsequences","order":6,"contentType":"PROBLEM","contentSlug":"ascending-order-subsequences","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_49930c129492ddba34979c8bf3e60116","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Target Sum Combinations","order":7,"contentType":"PROBLEM","contentSlug":"target-sum-combinations","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_aec263862c50a94377e983a25ccbba01","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Unique Subset Combinations","order":8,"contentType":"PROBLEM","contentSlug":"unique-subset-combinations","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_ce04f68654cef4b4285484a923751ed7","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"K-Element Subsets","order":9,"contentType":"PROBLEM","contentSlug":"k-element-subsets","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_ee586685a9ee65b0da5d9521b3460e89","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"K-Element Target Sum","order":10,"contentType":"PROBLEM","contentSlug":"k-element-target-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_b6d1a3328e168fcb93b026b356767062","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Generate All Arrangements","order":11,"contentType":"PROBLEM","contentSlug":"generate-all-arrangements","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_f04ca882172c65c0556f64a552cfd334","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Unique Arrangements","order":12,"contentType":"PROBLEM","contentSlug":"unique-arrangements","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_22be242640934f328781c9d6ad728931","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Palindrome Rearrangement Enumeration","order":13,"contentType":"PROBLEM","contentSlug":"palindrome-rearrangement-enumeration","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_143ceb09e89b3582b2aa8557c6b9f647","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Divisibility Compliant Permutations","order":14,"contentType":"PROBLEM","contentSlug":"divisibility-compliant-permutations","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_73a602aafb388565420839e19afcade5","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Perfect Square Permutations","order":15,"contentType":"PROBLEM","contentSlug":"perfect-square-permutations","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_1727b899b60d132eeb9ba213735a2b9c","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Optimal Pairing Alignment Score","order":16,"contentType":"PROBLEM","contentSlug":"optimal-pairing-alignment-score","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_67fcc2c1af4899ce271a0bfa471a6c2c","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Coprime Index Arrangements","order":17,"contentType":"PROBLEM","contentSlug":"coprime-index-arrangements","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_97252bf7e6e52e8f85f8d8505b02dcf9","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Parity Alternating Sequences","order":18,"contentType":"PROBLEM","contentSlug":"parity-alternating-sequences","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_e479984811171e0c93da6a3e1bc33932","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Reconstruct Network Addresses","order":19,"contentType":"PROBLEM","contentSlug":"reconstruct-network-addresses","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_3a5eb65e3ac1c9270a1536e4d41d04aa","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Palindrome Segmentation","order":20,"contentType":"PROBLEM","contentSlug":"palindrome-segmentation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_de34cc848dcc0031b9c1a6a0e4ba67c2","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Maximum Distinct Partitions","order":21,"contentType":"PROBLEM","contentSlug":"maximum-distinct-partitions","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_dd9d8d4f27bd94e0c18a375854375cbc","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Equal Split Subset Sum","order":22,"contentType":"PROBLEM","contentSlug":"equal-split-subset-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_66ceda758872bd26397fd74e33993e92","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Partition Sticks Into Square","order":23,"contentType":"PROBLEM","contentSlug":"partition-sticks-into-square","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_70e5f25544a976960e96fb48149dc2e2","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Divide Into Equal Sum Groups","order":24,"contentType":"PROBLEM","contentSlug":"divide-into-equal-sum-groups","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_c140422e0026673d4a11c65c03861fb6","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Throne Arrangement","order":25,"contentType":"PROBLEM","contentSlug":"throne-arrangement","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_f050f08a8fe497d3a14f6700fccb37ba","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Royal Placement Count","order":26,"contentType":"PROBLEM","contentSlug":"royal-placement-count","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_8b5b5c8bb60279feea439541a9cada2f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"What Is Dynamic Programming?","order":1,"contentType":"LEARNING","contentSlug":"what-is-dynamic-programming","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_8076bf758b719cbab0ef842102dc06a3","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Overlapping Subproblems — The Heart of Dynamic Programming","order":2,"contentType":"LEARNING","contentSlug":"overlapping-subproblems","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_49cedc87852e4bde869df9c006b9ce32","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Staircase Ascent","order":3,"contentType":"VISUALIZER","contentSlug":"staircase-ascent","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_e7b8047f85c84324a27fc045d304b04e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Staircase Ascent","order":4,"contentType":"PROBLEM","contentSlug":"staircase-ascent","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_482fea9c3024855d341cc50549187165","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Maximum Non-Adjacent Selection","order":5,"contentType":"PROBLEM","contentSlug":"maximum-non-adjacent-selection","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_921c2779c01ff38d2ea10fd6a7a068a9","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Sequence Sum Calculator","order":6,"contentType":"PROBLEM","contentSlug":"sequence-sum-calculator","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_17a10d66e0e4ec8e5d84b3c19dd3d4a9","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Minimum Expense Staircase Traversal","order":7,"contentType":"PROBLEM","contentSlug":"minimum-expense-staircase-traversal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_c15813be98c6058762106e41b9759416","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Grid Traversal Routes","order":8,"contentType":"PROBLEM","contentSlug":"grid-traversal-routes","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_1233dcebd1d2a2edd05d29eb1719c29d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Grid Navigation with Obstacles","order":9,"contentType":"PROBLEM","contentSlug":"grid-navigation-with-obstacles","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_8981f9e75f401546d6581aa47db3688d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Grid Minimum Cost Traversal","order":10,"contentType":"PROBLEM","contentSlug":"grid-minimum-cost-traversal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_173b0462b195c413f30363454150ae4a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Maximum Profit with Limited Transactions","order":11,"contentType":"PROBLEM","contentSlug":"maximum-profit-limited-transactions","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_93862a20f4feb6cd6a8dc1ebd8057759","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Circular Neighborhood Heist","order":12,"contentType":"PROBLEM","contentSlug":"circular-neighborhood-heist","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_52ab1170e8417c1c8079fcaa9c697d43","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Collect and Discard","order":13,"contentType":"PROBLEM","contentSlug":"collect-and-discard","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_b0a58fb50d94db69a37d13a82ff6732e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Longest Mirror Subsequence","order":14,"contentType":"PROBLEM","contentSlug":"longest-mirror-subsequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_1b2811dcfc213fc0101b61a3cb119ea4","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Largest Unit Square","order":15,"contentType":"PROBLEM","contentSlug":"largest-unit-square","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_03d32d939c7aea9e182f186305b2d039","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"All-Ones Square Submatrix Count","order":16,"contentType":"PROBLEM","contentSlug":"all-ones-square-submatrix-count","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_2d5644656d1630983fdc08f55d8584b3","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"String Transformation Cost","order":1,"contentType":"VISUALIZER","contentSlug":"string-transformation-cost","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_dee7bc10d61eb462792d56314fee3661","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"String Transformation Cost","order":2,"contentType":"PROBLEM","contentSlug":"string-transformation-cost","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_d43ee6f7433c785535642c0e8d6d37e8","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Unique Subsequence Count","order":3,"contentType":"PROBLEM","contentSlug":"unique-subsequence-count","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_9d33547f96d92de5328014ee15698c05","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Minimum Deletions to Equalize Strings","order":4,"contentType":"PROBLEM","contentSlug":"minimum-deletions-to-equalize-strings","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_3a45869eca46bb2458e3b58d17eea016","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Longest Shared Subsequence","order":5,"contentType":"PROBLEM","contentSlug":"longest-shared-subsequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_3d9c41e3a6872e20c7ab2e8dc04b6442","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Minimal Universal Supersequence","order":6,"contentType":"PROBLEM","contentSlug":"minimal-universal-supersequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_cea139ffd5f2ca84445e99624b9f47c2","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Pattern Text Matching","order":7,"contentType":"PROBLEM","contentSlug":"pattern-text-matching","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_887cd6cfa3035a98a6abc242a164e744","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Pattern Glob Matching","order":8,"contentType":"PROBLEM","contentSlug":"pattern-glob-matching","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_67016cd34dbe1c8f959d73cb9058714a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Woven String Validation","order":9,"contentType":"PROBLEM","contentSlug":"woven-string-validation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_513afa89ee6680fefc884493dd84000e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Signed Expression Ways","order":10,"contentType":"PROBLEM","contentSlug":"signed-expression-ways","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_268f85a417d54665b07b936fd98ffbe3","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Denomination Combination Count","order":11,"contentType":"PROBLEM","contentSlug":"denomination-combination-count","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_4e89b9796fb55e0c1ef464d27bc4a6f4","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Minimum Collision Residue","order":12,"contentType":"PROBLEM","contentSlug":"minimum-collision-residue","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_8c0abc7103a31deaadbc70ce3e44431e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Sequence Count to Target","order":13,"contentType":"PROBLEM","contentSlug":"sequence-count-to-target","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_41c34995c10816c150f5d305c4351e89","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Bundle Deal Optimizer","order":14,"contentType":"PROBLEM","contentSlug":"bundle-deal-optimizer","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_ecbb673584d343884b076561b1957b1f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Optimal Polygon Triangulation Cost","order":15,"contentType":"PROBLEM","contentSlug":"optimal-polygon-triangulation-cost","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_b834e1893532cf85918daf578509933b","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Optimal Rod Division Cost","order":16,"contentType":"PROBLEM","contentSlug":"optimal-rod-division-cost","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_28c000d35edb6fa117c5c65cc2a80130","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Construct Valid Bracket Sequences","order":17,"contentType":"PROBLEM","contentSlug":"construct-valid-bracket-sequences","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_eb1af724610b783f96affdcb68bba233","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Construct Distinct Binary Search Trees","order":18,"contentType":"PROBLEM","contentSlug":"construct-distinct-bst","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_610e8e70a47b7ade9430b504f18a3f1b","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Distinct BST Formations","order":19,"contentType":"PROBLEM","contentSlug":"distinct-bst-formations","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_fa6b6061d82e50ae0a91b2521d24e809","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Binary Representation Revisited — The Language of Low-Level Optimization","order":1,"contentType":"LEARNING","contentSlug":"binary-representation-revisited","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z"},{"id":"seed_64dc13f06c4755178b5e050a8d5e5cd7","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Bitwise Operators — AND, OR, XOR, NOT","order":2,"contentType":"LEARNING","contentSlug":"bitwise-operators","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.201Z","updatedAt":"2026-10-17T16:28:32.743Z"},{"id":"seed_dd7bebcb1213395f624768cb0ac4ff66","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Binary One Counter","order":3,"contentType":"VISUALIZER","contentSlug":"binary-one-counter","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.201Z","updatedAt":"2026-10-17T16:28:32.743Z"},{"id":"seed_d1532a8d923b7493d3d21aa34b46d84a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Binary One Counter","order":4,"contentType":"PROBLEM","contentSlug":"binary-one-counter","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z"},{"id":"seed_2ad90f01aeaa59ce1e80ea03e97151fe","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Range Bitwise Conjunction","order":5,"contentType":"PROBLEM","contentSlug":"range-bitwise-conjunction","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z"},{"id":"seed_33c9daac5b62f1a87bafface07b95c33","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Binary Power Verification","order":6,"contentType":"PROBLEM","contentSlug":"binary-power-verification","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z"},{"id":"seed_276672d06d9e6c9fe0a065d1d7391680","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Unique Element Finder","order":7,"contentType":"PROBLEM","contentSlug":"unique-element-finder","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z"},{"id":"seed_966e4bd0a5dbc4a0703bdb192d3e28cb","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Dual Singleton Detection","order":8,"contentType":"PROBLEM","contentSlug":"dual-singleton-detection","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z"},{"id":"seed_894fbcd315513b8678b43dc5d31045fc","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Arithmetic Sequence XOR","order":9,"contentType":"PROBLEM","contentSlug":"arithmetic-sequence-xor","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z"},{"id":"seed_cfec2c01de869dab92d3c308653766a7","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Binary Reduction to Zero","order":10,"contentType":"PROBLEM","contentSlug":"binary-reduction-to-zero","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z"},{"id":"seed_a77e0590d337e59858e1f03d39357c96","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Cross Pair XOR Aggregate","order":11,"contentType":"PROBLEM","contentSlug":"cross-pair-xor-aggregate","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z"},{"id":"seed_7b51cc673b33977fad57bedeeca1a375","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Circular XOR Array Validation","order":12,"contentType":"PROBLEM","contentSlug":"circular-xor-array-validation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z"},{"id":"seed_94f7a803923c0ee49bc1c83137937fe4","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Quadruple Power Check","order":13,"contentType":"PROBLEM","contentSlug":"quadruple-power-check","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z"},{"id":"seed_d8d93015bf1574e5e77262c43ffdf0ac","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Reflected Binary Sequence","order":14,"contentType":"PROBLEM","contentSlug":"reflected-binary-sequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z"},{"id":"seed_efc5eda0a4c452eb086511a85c743c5c","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Binary Ones Counter","order":15,"contentType":"PROBLEM","contentSlug":"binary-ones-counter","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z"},{"id":"seed_ff45e7eb7d6c5fe90f5cd1cf4df312fd","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Transfer patterns to a repository","sectionOrder":16,"title":"Completed deliveries still count against route capacity","order":1,"contentType":"REPO","contentSlug":"dispatch-planner-route-peak","description":null,"estimatedMins":60,"createdAt":"2026-10-17T16:02:59.201Z","updatedAt":"2026-10-17T16:28:32.743Z"},{"id":"seed_66df37d2bac6d67475e540c3dd30e4ec","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Transfer patterns to a repository","sectionOrder":16,"title":"Measure peak load instead of total pickups","order":2,"contentType":"CODE_REVIEW","contentSlug":"dispatch-planner-review-route-peak","description":null,"estimatedMins":35,"createdAt":"2026-10-17T16:02:59.201Z","updatedAt":"2026-10-17T16:28:32.743Z"}],"sections":[{"title":"Chapter 1: Two Pointers Techniques","order":1,"modules":["$47:props:state:queries:0:state:data:json:modules:0","$47:props:state:queries:0:state:data:json:modules:1","$47:props:state:queries:0:state:data:json:modules:2","$47:props:state:queries:0:state:data:json:modules:3","$47:props:state:queries:0:state:data:json:modules:4","$47:props:state:queries:0:state:data:json:modules:5","$47:props:state:queries:0:state:data:json:modules:6","$47:props:state:queries:0:state:data:json:modules:7","$47:props:state:queries:0:state:data:json:modules:8","$47:props:state:queries:0:state:data:json:modules:9","$47:props:state:queries:0:state:data:json:modules:10","$47:props:state:queries:0:state:data:json:modules:11","$47:props:state:queries:0:state:data:json:modules:12","$47:props:state:queries:0:state:data:json:modules:13","$47:props:state:queries:0:state:data:json:modules:14","$47:props:state:queries:0:state:data:json:modules:15","$47:props:state:queries:0:state:data:json:modules:16","$47:props:state:queries:0:state:data:json:modules:17","$47:props:state:queries:0:state:data:json:modules:18","$47:props:state:queries:0:state:data:json:modules:19","$47:props:state:queries:0:state:data:json:modules:20","$47:props:state:queries:0:state:data:json:modules:21","$47:props:state:queries:0:state:data:json:modules:22","$47:props:state:queries:0:state:data:json:modules:23","$47:props:state:queries:0:state:data:json:modules:24","$47:props:state:queries:0:state:data:json:modules:25","$47:props:state:queries:0:state:data:json:modules:26","$47:props:state:queries:0:state:data:json:modules:27","$47:props:state:queries:0:state:data:json:modules:28","$47:props:state:queries:0:state:data:json:modules:29","$47:props:state:queries:0:state:data:json:modules:30","$47:props:state:queries:0:state:data:json:modules:31","$47:props:state:queries:0:state:data:json:modules:32"]},{"title":"Chapter 2: Sliding Window Patterns","order":2,"modules":["$47:props:state:queries:0:state:data:json:modules:33","$47:props:state:queries:0:state:data:json:modules:34","$47:props:state:queries:0:state:data:json:modules:35","$47:props:state:queries:0:state:data:json:modules:36","$47:props:state:queries:0:state:data:json:modules:37","$47:props:state:queries:0:state:data:json:modules:38","$47:props:state:queries:0:state:data:json:modules:39","$47:props:state:queries:0:state:data:json:modules:40","$47:props:state:queries:0:state:data:json:modules:41","$47:props:state:queries:0:state:data:json:modules:42","$47:props:state:queries:0:state:data:json:modules:43","$47:props:state:queries:0:state:data:json:modules:44","$47:props:state:queries:0:state:data:json:modules:45","$47:props:state:queries:0:state:data:json:modules:46","$47:props:state:queries:0:state:data:json:modules:47","$47:props:state:queries:0:state:data:json:modules:48","$47:props:state:queries:0:state:data:json:modules:49","$47:props:state:queries:0:state:data:json:modules:50","$47:props:state:queries:0:state:data:json:modules:51","$47:props:state:queries:0:state:data:json:modules:52","$47:props:state:queries:0:state:data:json:modules:53","$47:props:state:queries:0:state:data:json:modules:54","$47:props:state:queries:0:state:data:json:modules:55","$47:props:state:queries:0:state:data:json:modules:56"]},{"title":"Chapter 3: Binary Search Techniques","order":3,"modules":["$47:props:state:queries:0:state:data:json:modules:57","$47:props:state:queries:0:state:data:json:modules:58","$47:props:state:queries:0:state:data:json:modules:59","$47:props:state:queries:0:state:data:json:modules:60","$47:props:state:queries:0:state:data:json:modules:61","$47:props:state:queries:0:state:data:json:modules:62","$47:props:state:queries:0:state:data:json:modules:63","$47:props:state:queries:0:state:data:json:modules:64","$47:props:state:queries:0:state:data:json:modules:65","$47:props:state:queries:0:state:data:json:modules:66","$47:props:state:queries:0:state:data:json:modules:67","$47:props:state:queries:0:state:data:json:modules:68","$47:props:state:queries:0:state:data:json:modules:69","$47:props:state:queries:0:state:data:json:modules:70","$47:props:state:queries:0:state:data:json:modules:71","$47:props:state:queries:0:state:data:json:modules:72","$47:props:state:queries:0:state:data:json:modules:73","$47:props:state:queries:0:state:data:json:modules:74","$47:props:state:queries:0:state:data:json:modules:75","$47:props:state:queries:0:state:data:json:modules:76","$47:props:state:queries:0:state:data:json:modules:77"]},{"title":"Chapter 4: Array & String Manipulation","order":4,"modules":["$47:props:state:queries:0:state:data:json:modules:78","$47:props:state:queries:0:state:data:json:modules:79","$47:props:state:queries:0:state:data:json:modules:80","$47:props:state:queries:0:state:data:json:modules:81","$47:props:state:queries:0:state:data:json:modules:82","$47:props:state:queries:0:state:data:json:modules:83","$47:props:state:queries:0:state:data:json:modules:84","$47:props:state:queries:0:state:data:json:modules:85","$47:props:state:queries:0:state:data:json:modules:86","$47:props:state:queries:0:state:data:json:modules:87","$47:props:state:queries:0:state:data:json:modules:88","$47:props:state:queries:0:state:data:json:modules:89","$47:props:state:queries:0:state:data:json:modules:90","$47:props:state:queries:0:state:data:json:modules:91","$47:props:state:queries:0:state:data:json:modules:92","$47:props:state:queries:0:state:data:json:modules:93","$47:props:state:queries:0:state:data:json:modules:94","$47:props:state:queries:0:state:data:json:modules:95","$47:props:state:queries:0:state:data:json:modules:96","$47:props:state:queries:0:state:data:json:modules:97","$47:props:state:queries:0:state:data:json:modules:98","$47:props:state:queries:0:state:data:json:modules:99","$47:props:state:queries:0:state:data:json:modules:100","$47:props:state:queries:0:state:data:json:modules:101","$47:props:state:queries:0:state:data:json:modules:102","$47:props:state:queries:0:state:data:json:modules:103","$47:props:state:queries:0:state:data:json:modules:104","$47:props:state:queries:0:state:data:json:modules:105","$47:props:state:queries:0:state:data:json:modules:106","$47:props:state:queries:0:state:data:json:modules:107","$47:props:state:queries:0:state:data:json:modules:108","$47:props:state:queries:0:state:data:json:modules:109","$47:props:state:queries:0:state:data:json:modules:110","$47:props:state:queries:0:state:data:json:modules:111","$47:props:state:queries:0:state:data:json:modules:112","$47:props:state:queries:0:state:data:json:modules:113","$47:props:state:queries:0:state:data:json:modules:114","$47:props:state:queries:0:state:data:json:modules:115"]},{"title":"Chapter 5: Stack-Based Patterns","order":5,"modules":["$47:props:state:queries:0:state:data:json:modules:116","$47:props:state:queries:0:state:data:json:modules:117","$47:props:state:queries:0:state:data:json:modules:118","$47:props:state:queries:0:state:data:json:modules:119","$47:props:state:queries:0:state:data:json:modules:120","$47:props:state:queries:0:state:data:json:modules:121","$47:props:state:queries:0:state:data:json:modules:122","$47:props:state:queries:0:state:data:json:modules:123","$47:props:state:queries:0:state:data:json:modules:124","$47:props:state:queries:0:state:data:json:modules:125","$47:props:state:queries:0:state:data:json:modules:126","$47:props:state:queries:0:state:data:json:modules:127","$47:props:state:queries:0:state:data:json:modules:128","$47:props:state:queries:0:state:data:json:modules:129","$47:props:state:queries:0:state:data:json:modules:130","$47:props:state:queries:0:state:data:json:modules:131"]},{"title":"Chapter 6: Linked List Patterns","order":6,"modules":["$47:props:state:queries:0:state:data:json:modules:132","$47:props:state:queries:0:state:data:json:modules:133","$47:props:state:queries:0:state:data:json:modules:134","$47:props:state:queries:0:state:data:json:modules:135","$47:props:state:queries:0:state:data:json:modules:136","$47:props:state:queries:0:state:data:json:modules:137","$47:props:state:queries:0:state:data:json:modules:138","$47:props:state:queries:0:state:data:json:modules:139","$47:props:state:queries:0:state:data:json:modules:140"]},{"title":"Chapter 7: Heap & Priority Queue","order":7,"modules":["$47:props:state:queries:0:state:data:json:modules:141","$47:props:state:queries:0:state:data:json:modules:142","$47:props:state:queries:0:state:data:json:modules:143","$47:props:state:queries:0:state:data:json:modules:144","$47:props:state:queries:0:state:data:json:modules:145","$47:props:state:queries:0:state:data:json:modules:146","$47:props:state:queries:0:state:data:json:modules:147","$47:props:state:queries:0:state:data:json:modules:148","$47:props:state:queries:0:state:data:json:modules:149"]},{"title":"Chapter 8: Tree Traversal & Manipulation","order":8,"modules":["$47:props:state:queries:0:state:data:json:modules:150","$47:props:state:queries:0:state:data:json:modules:151","$47:props:state:queries:0:state:data:json:modules:152","$47:props:state:queries:0:state:data:json:modules:153","$47:props:state:queries:0:state:data:json:modules:154","$47:props:state:queries:0:state:data:json:modules:155","$47:props:state:queries:0:state:data:json:modules:156","$47:props:state:queries:0:state:data:json:modules:157","$47:props:state:queries:0:state:data:json:modules:158","$47:props:state:queries:0:state:data:json:modules:159","$47:props:state:queries:0:state:data:json:modules:160","$47:props:state:queries:0:state:data:json:modules:161","$47:props:state:queries:0:state:data:json:modules:162","$47:props:state:queries:0:state:data:json:modules:163","$47:props:state:queries:0:state:data:json:modules:164","$47:props:state:queries:0:state:data:json:modules:165","$47:props:state:queries:0:state:data:json:modules:166","$47:props:state:queries:0:state:data:json:modules:167","$47:props:state:queries:0:state:data:json:modules:168","$47:props:state:queries:0:state:data:json:modules:169","$47:props:state:queries:0:state:data:json:modules:170","$47:props:state:queries:0:state:data:json:modules:171","$47:props:state:queries:0:state:data:json:modules:172","$47:props:state:queries:0:state:data:json:modules:173","$47:props:state:queries:0:state:data:json:modules:174","$47:props:state:queries:0:state:data:json:modules:175","$47:props:state:queries:0:state:data:json:modules:176","$47:props:state:queries:0:state:data:json:modules:177","$47:props:state:queries:0:state:data:json:modules:178","$47:props:state:queries:0:state:data:json:modules:179","$47:props:state:queries:0:state:data:json:modules:180","$47:props:state:queries:0:state:data:json:modules:181","$47:props:state:queries:0:state:data:json:modules:182","$47:props:state:queries:0:state:data:json:modules:183","$47:props:state:queries:0:state:data:json:modules:184","$47:props:state:queries:0:state:data:json:modules:185","$47:props:state:queries:0:state:data:json:modules:186","$47:props:state:queries:0:state:data:json:modules:187","$47:props:state:queries:0:state:data:json:modules:188","$47:props:state:queries:0:state:data:json:modules:189","$47:props:state:queries:0:state:data:json:modules:190","$47:props:state:queries:0:state:data:json:modules:191"]},{"title":"Chapter 9: Graph BFS Patterns","order":9,"modules":["$47:props:state:queries:0:state:data:json:modules:192","$47:props:state:queries:0:state:data:json:modules:193","$47:props:state:queries:0:state:data:json:modules:194","$47:props:state:queries:0:state:data:json:modules:195","$47:props:state:queries:0:state:data:json:modules:196","$47:props:state:queries:0:state:data:json:modules:197","$47:props:state:queries:0:state:data:json:modules:198","$47:props:state:queries:0:state:data:json:modules:199","$47:props:state:queries:0:state:data:json:modules:200","$47:props:state:queries:0:state:data:json:modules:201","$47:props:state:queries:0:state:data:json:modules:202","$47:props:state:queries:0:state:data:json:modules:203","$47:props:state:queries:0:state:data:json:modules:204","$47:props:state:queries:0:state:data:json:modules:205","$47:props:state:queries:0:state:data:json:modules:206","$47:props:state:queries:0:state:data:json:modules:207","$47:props:state:queries:0:state:data:json:modules:208","$47:props:state:queries:0:state:data:json:modules:209","$47:props:state:queries:0:state:data:json:modules:210","$47:props:state:queries:0:state:data:json:modules:211","$47:props:state:queries:0:state:data:json:modules:212","$47:props:state:queries:0:state:data:json:modules:213","$47:props:state:queries:0:state:data:json:modules:214","$47:props:state:queries:0:state:data:json:modules:215","$47:props:state:queries:0:state:data:json:modules:216","$47:props:state:queries:0:state:data:json:modules:217","$47:props:state:queries:0:state:data:json:modules:218","$47:props:state:queries:0:state:data:json:modules:219","$47:props:state:queries:0:state:data:json:modules:220","$47:props:state:queries:0:state:data:json:modules:221"]},{"title":"Chapter 10: Graph DFS & Advanced Patterns","order":10,"modules":["$47:props:state:queries:0:state:data:json:modules:222","$47:props:state:queries:0:state:data:json:modules:223","$47:props:state:queries:0:state:data:json:modules:224","$47:props:state:queries:0:state:data:json:modules:225","$47:props:state:queries:0:state:data:json:modules:226","$47:props:state:queries:0:state:data:json:modules:227","$47:props:state:queries:0:state:data:json:modules:228","$47:props:state:queries:0:state:data:json:modules:229","$47:props:state:queries:0:state:data:json:modules:230","$47:props:state:queries:0:state:data:json:modules:231","$47:props:state:queries:0:state:data:json:modules:232","$47:props:state:queries:0:state:data:json:modules:233","$47:props:state:queries:0:state:data:json:modules:234","$47:props:state:queries:0:state:data:json:modules:235","$47:props:state:queries:0:state:data:json:modules:236","$47:props:state:queries:0:state:data:json:modules:237","$47:props:state:queries:0:state:data:json:modules:238","$47:props:state:queries:0:state:data:json:modules:239","$47:props:state:queries:0:state:data:json:modules:240","$47:props:state:queries:0:state:data:json:modules:241","$47:props:state:queries:0:state:data:json:modules:242","$47:props:state:queries:0:state:data:json:modules:243","$47:props:state:queries:0:state:data:json:modules:244","$47:props:state:queries:0:state:data:json:modules:245","$47:props:state:queries:0:state:data:json:modules:246","$47:props:state:queries:0:state:data:json:modules:247","$47:props:state:queries:0:state:data:json:modules:248","$47:props:state:queries:0:state:data:json:modules:249","$47:props:state:queries:0:state:data:json:modules:250","$47:props:state:queries:0:state:data:json:modules:251","$47:props:state:queries:0:state:data:json:modules:252","$47:props:state:queries:0:state:data:json:modules:253","$47:props:state:queries:0:state:data:json:modules:254"]},{"title":"Chapter 11: Greedy Algorithms","order":11,"modules":["$47:props:state:queries:0:state:data:json:modules:255","$47:props:state:queries:0:state:data:json:modules:256","$47:props:state:queries:0:state:data:json:modules:257","$47:props:state:queries:0:state:data:json:modules:258","$47:props:state:queries:0:state:data:json:modules:259","$47:props:state:queries:0:state:data:json:modules:260","$47:props:state:queries:0:state:data:json:modules:261","$47:props:state:queries:0:state:data:json:modules:262","$47:props:state:queries:0:state:data:json:modules:263","$47:props:state:queries:0:state:data:json:modules:264","$47:props:state:queries:0:state:data:json:modules:265","$47:props:state:queries:0:state:data:json:modules:266","$47:props:state:queries:0:state:data:json:modules:267","$47:props:state:queries:0:state:data:json:modules:268","$47:props:state:queries:0:state:data:json:modules:269","$47:props:state:queries:0:state:data:json:modules:270","$47:props:state:queries:0:state:data:json:modules:271","$47:props:state:queries:0:state:data:json:modules:272","$47:props:state:queries:0:state:data:json:modules:273","$47:props:state:queries:0:state:data:json:modules:274","$47:props:state:queries:0:state:data:json:modules:275","$47:props:state:queries:0:state:data:json:modules:276","$47:props:state:queries:0:state:data:json:modules:277","$47:props:state:queries:0:state:data:json:modules:278","$47:props:state:queries:0:state:data:json:modules:279","$47:props:state:queries:0:state:data:json:modules:280","$47:props:state:queries:0:state:data:json:modules:281","$47:props:state:queries:0:state:data:json:modules:282","$47:props:state:queries:0:state:data:json:modules:283","$47:props:state:queries:0:state:data:json:modules:284","$47:props:state:queries:0:state:data:json:modules:285"]},{"title":"Chapter 12: Backtracking Patterns","order":12,"modules":["$47:props:state:queries:0:state:data:json:modules:286","$47:props:state:queries:0:state:data:json:modules:287","$47:props:state:queries:0:state:data:json:modules:288","$47:props:state:queries:0:state:data:json:modules:289","$47:props:state:queries:0:state:data:json:modules:290","$47:props:state:queries:0:state:data:json:modules:291","$47:props:state:queries:0:state:data:json:modules:292","$47:props:state:queries:0:state:data:json:modules:293","$47:props:state:queries:0:state:data:json:modules:294","$47:props:state:queries:0:state:data:json:modules:295","$47:props:state:queries:0:state:data:json:modules:296","$47:props:state:queries:0:state:data:json:modules:297","$47:props:state:queries:0:state:data:json:modules:298","$47:props:state:queries:0:state:data:json:modules:299","$47:props:state:queries:0:state:data:json:modules:300","$47:props:state:queries:0:state:data:json:modules:301","$47:props:state:queries:0:state:data:json:modules:302","$47:props:state:queries:0:state:data:json:modules:303","$47:props:state:queries:0:state:data:json:modules:304","$47:props:state:queries:0:state:data:json:modules:305","$47:props:state:queries:0:state:data:json:modules:306","$47:props:state:queries:0:state:data:json:modules:307","$47:props:state:queries:0:state:data:json:modules:308","$47:props:state:queries:0:state:data:json:modules:309","$47:props:state:queries:0:state:data:json:modules:310","$47:props:state:queries:0:state:data:json:modules:311"]},{"title":"Chapter 13: Dynamic Programming Fundamentals","order":13,"modules":["$47:props:state:queries:0:state:data:json:modules:312","$47:props:state:queries:0:state:data:json:modules:313","$47:props:state:queries:0:state:data:json:modules:314","$47:props:state:queries:0:state:data:json:modules:315","$47:props:state:queries:0:state:data:json:modules:316","$47:props:state:queries:0:state:data:json:modules:317","$47:props:state:queries:0:state:data:json:modules:318","$47:props:state:queries:0:state:data:json:modules:319","$47:props:state:queries:0:state:data:json:modules:320","$47:props:state:queries:0:state:data:json:modules:321","$47:props:state:queries:0:state:data:json:modules:322","$47:props:state:queries:0:state:data:json:modules:323","$47:props:state:queries:0:state:data:json:modules:324","$47:props:state:queries:0:state:data:json:modules:325","$47:props:state:queries:0:state:data:json:modules:326","$47:props:state:queries:0:state:data:json:modules:327"]},{"title":"Chapter 14: Advanced Dynamic Programming","order":14,"modules":["$47:props:state:queries:0:state:data:json:modules:328","$47:props:state:queries:0:state:data:json:modules:329","$47:props:state:queries:0:state:data:json:modules:330","$47:props:state:queries:0:state:data:json:modules:331","$47:props:state:queries:0:state:data:json:modules:332","$47:props:state:queries:0:state:data:json:modules:333","$47:props:state:queries:0:state:data:json:modules:334","$47:props:state:queries:0:state:data:json:modules:335","$47:props:state:queries:0:state:data:json:modules:336","$47:props:state:queries:0:state:data:json:modules:337","$47:props:state:queries:0:state:data:json:modules:338","$47:props:state:queries:0:state:data:json:modules:339","$47:props:state:queries:0:state:data:json:modules:340","$47:props:state:queries:0:state:data:json:modules:341","$47:props:state:queries:0:state:data:json:modules:342","$47:props:state:queries:0:state:data:json:modules:343","$47:props:state:queries:0:state:data:json:modules:344","$47:props:state:queries:0:state:data:json:modules:345","$47:props:state:queries:0:state:data:json:modules:346"]},{"title":"Chapter 15: Bit Manipulation","order":15,"modules":["$47:props:state:queries:0:state:data:json:modules:347","$47:props:state:queries:0:state:data:json:modules:348","$47:props:state:queries:0:state:data:json:modules:349","$47:props:state:queries:0:state:data:json:modules:350","$47:props:state:queries:0:state:data:json:modules:351","$47:props:state:queries:0:state:data:json:modules:352","$47:props:state:queries:0:state:data:json:modules:353","$47:props:state:queries:0:state:data:json:modules:354","$47:props:state:queries:0:state:data:json:modules:355","$47:props:state:queries:0:state:data:json:modules:356","$47:props:state:queries:0:state:data:json:modules:357","$47:props:state:queries:0:state:data:json:modules:358","$47:props:state:queries:0:state:data:json:modules:359","$47:props:state:queries:0:state:data:json:modules:360","$47:props:state:queries:0:state:data:json:modules:361"]},{"title":"Transfer patterns to a repository","order":16,"modules":["$47:props:state:queries:0:state:data:json:modules:362","$47:props:state:queries:0:state:data:json:modules:363"]}]},"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"],"modules.361.createdAt":["Date"],"modules.361.updatedAt":["Date"],"modules.362.createdAt":["Date"],"modules.362.updatedAt":["Date"],"modules.363.createdAt":["Date"],"modules.363.updatedAt":["Date"],"sections.0.modules.0.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.0.createdAt","sections.0.modules.0.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.0.updatedAt","sections.0.modules.1.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.1.createdAt","sections.0.modules.1.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.1.updatedAt","sections.0.modules.2.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.2.createdAt","sections.0.modules.2.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.2.updatedAt","sections.0.modules.3.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.3.createdAt","sections.0.modules.3.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.3.updatedAt","sections.0.modules.4.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.4.createdAt","sections.0.modules.4.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.4.updatedAt","sections.0.modules.5.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.5.createdAt","sections.0.modules.5.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.5.updatedAt","sections.0.modules.6.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.6.createdAt","sections.0.modules.6.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.6.updatedAt","sections.0.modules.7.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.7.createdAt","sections.0.modules.7.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.7.updatedAt","sections.0.modules.8.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.8.createdAt","sections.0.modules.8.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.8.updatedAt","sections.0.modules.9.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.9.createdAt","sections.0.modules.9.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.9.updatedAt","sections.0.modules.10.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.10.createdAt","sections.0.modules.10.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.10.updatedAt","sections.0.modules.11.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.11.createdAt","sections.0.modules.11.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.11.updatedAt","sections.0.modules.12.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.12.createdAt","sections.0.modules.12.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.12.updatedAt","sections.0.modules.13.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.13.createdAt","sections.0.modules.13.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.13.updatedAt","sections.0.modules.14.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.14.createdAt","sections.0.modules.14.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.14.updatedAt","sections.0.modules.15.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.15.createdAt","sections.0.modules.15.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.15.updatedAt","sections.0.modules.16.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.16.createdAt","sections.0.modules.16.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.16.updatedAt","sections.0.modules.17.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.17.createdAt","sections.0.modules.17.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.17.updatedAt","sections.0.modules.18.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.18.createdAt","sections.0.modules.18.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.18.updatedAt","sections.0.modules.19.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.19.createdAt","sections.0.modules.19.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.19.updatedAt","sections.0.modules.20.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.20.createdAt","sections.0.modules.20.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.20.updatedAt","sections.0.modules.21.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.21.createdAt","sections.0.modules.21.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.21.updatedAt","sections.0.modules.22.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.22.createdAt","sections.0.modules.22.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.22.updatedAt","sections.0.modules.23.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.23.createdAt","sections.0.modules.23.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.23.updatedAt","sections.0.modules.24.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.24.createdAt","sections.0.modules.24.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.24.updatedAt","sections.0.modules.25.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.25.createdAt","sections.0.modules.25.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.25.updatedAt","sections.0.modules.26.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.26.createdAt","sections.0.modules.26.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.26.updatedAt","sections.0.modules.27.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.27.createdAt","sections.0.modules.27.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.27.updatedAt","sections.0.modules.28.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.28.createdAt","sections.0.modules.28.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.28.updatedAt","sections.0.modules.29.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.29.createdAt","sections.0.modules.29.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.29.updatedAt","sections.0.modules.30.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.30.createdAt","sections.0.modules.30.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.30.updatedAt","sections.0.modules.31.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.31.createdAt","sections.0.modules.31.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.31.updatedAt","sections.0.modules.32.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.32.createdAt","sections.0.modules.32.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.32.updatedAt","sections.1.modules.0.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.33.createdAt","sections.1.modules.0.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.33.updatedAt","sections.1.modules.1.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.34.createdAt","sections.1.modules.1.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.34.updatedAt","sections.1.modules.2.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.35.createdAt","sections.1.modules.2.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.35.updatedAt","sections.1.modules.3.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.36.createdAt","sections.1.modules.3.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.36.updatedAt","sections.1.modules.4.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.37.createdAt","sections.1.modules.4.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.37.updatedAt","sections.1.modules.5.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.38.createdAt","sections.1.modules.5.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.38.updatedAt","sections.1.modules.6.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.39.createdAt","sections.1.modules.6.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.39.updatedAt","sections.1.modules.7.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.40.createdAt","sections.1.modules.7.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.40.updatedAt","sections.1.modules.8.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.41.createdAt","sections.1.modules.8.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.41.updatedAt","sections.1.modules.9.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.42.createdAt","sections.1.modules.9.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.42.updatedAt","sections.1.modules.10.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.43.createdAt","sections.1.modules.10.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.43.updatedAt","sections.1.modules.11.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.44.createdAt","sections.1.modules.11.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.44.updatedAt","sections.1.modules.12.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.45.createdAt","sections.1.modules.12.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.45.updatedAt","sections.1.modules.13.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.46.createdAt","sections.1.modules.13.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.46.updatedAt","sections.1.modules.14.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.47.createdAt","sections.1.modules.14.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.47.updatedAt","sections.1.modules.15.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.48.createdAt","sections.1.modules.15.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.48.updatedAt","sections.1.modules.16.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.49.createdAt","sections.1.modules.16.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.49.updatedAt","sections.1.modules.17.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.50.createdAt","sections.1.modules.17.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.50.updatedAt","sections.1.modules.18.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.51.createdAt","sections.1.modules.18.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.51.updatedAt","sections.1.modules.19.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.52.createdAt","sections.1.modules.19.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.52.updatedAt","sections.1.modules.20.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.53.createdAt","sections.1.modules.20.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.53.updatedAt","sections.1.modules.21.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.54.createdAt","sections.1.modules.21.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.54.updatedAt","sections.1.modules.22.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.55.createdAt","sections.1.modules.22.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.55.updatedAt","sections.1.modules.23.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.56.createdAt","sections.1.modules.23.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.56.updatedAt","sections.2.modules.0.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.57.createdAt","sections.2.modules.0.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.57.updatedAt","sections.2.modules.1.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.58.createdAt","sections.2.modules.1.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.58.updatedAt","sections.2.modules.2.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.59.createdAt","sections.2.modules.2.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.59.updatedAt","sections.2.modules.3.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.60.createdAt","sections.2.modules.3.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.60.updatedAt","sections.2.modules.4.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.61.createdAt","sections.2.modules.4.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.61.updatedAt","sections.2.modules.5.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.62.createdAt","sections.2.modules.5.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.62.updatedAt","sections.2.modules.6.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.63.createdAt","sections.2.modules.6.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.63.updatedAt","sections.2.modules.7.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.64.createdAt","sections.2.modules.7.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.64.updatedAt","sections.2.modules.8.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.65.createdAt","sections.2.modules.8.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.65.updatedAt","sections.2.modules.9.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.66.createdAt","sections.2.modules.9.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.66.updatedAt","sections.2.modules.10.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.67.createdAt","sections.2.modules.10.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.67.updatedAt","sections.2.modules.11.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.68.createdAt","sections.2.modules.11.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.68.updatedAt","sections.2.modules.12.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.69.createdAt","sections.2.modules.12.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.69.updatedAt","sections.2.modules.13.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.70.createdAt","sections.2.modules.13.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.70.updatedAt","sections.2.modules.14.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.71.createdAt","sections.2.modules.14.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.71.updatedAt","sections.2.modules.15.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.72.createdAt","sections.2.modules.15.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.72.updatedAt","sections.2.modules.16.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.73.createdAt","sections.2.modules.16.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.73.updatedAt","sections.2.modules.17.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.74.createdAt","sections.2.modules.17.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.74.updatedAt","sections.2.modules.18.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.75.createdAt","sections.2.modules.18.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.75.updatedAt","sections.2.modules.19.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.76.createdAt","sections.2.modules.19.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.76.updatedAt","sections.2.modules.20.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.77.createdAt","sections.2.modules.20.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.77.updatedAt","sections.3.modules.0.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.78.createdAt","sections.3.modules.0.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.78.updatedAt","sections.3.modules.1.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.79.createdAt","sections.3.modules.1.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.79.updatedAt","sections.3.modules.2.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.80.createdAt","sections.3.modules.2.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.80.updatedAt","sections.3.modules.3.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.81.createdAt","sections.3.modules.3.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.81.updatedAt","sections.3.modules.4.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.82.createdAt","sections.3.modules.4.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.82.updatedAt","sections.3.modules.5.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.83.createdAt","sections.3.modules.5.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.83.updatedAt","sections.3.modules.6.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.84.createdAt","sections.3.modules.6.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.84.updatedAt","sections.3.modules.7.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.85.createdAt","sections.3.modules.7.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.85.updatedAt","sections.3.modules.8.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.86.createdAt","sections.3.modules.8.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.86.updatedAt","sections.3.modules.9.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.87.createdAt","sections.3.modules.9.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.87.updatedAt","sections.3.modules.10.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.88.createdAt","sections.3.modules.10.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.88.updatedAt","sections.3.modules.11.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.89.createdAt","sections.3.modules.11.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.89.updatedAt","sections.3.modules.12.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.90.createdAt","sections.3.modules.12.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.90.updatedAt","sections.3.modules.13.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.91.createdAt","sections.3.modules.13.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.91.updatedAt","sections.3.modules.14.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.92.createdAt","sections.3.modules.14.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.92.updatedAt","sections.3.modules.15.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.93.createdAt","sections.3.modules.15.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.93.updatedAt","sections.3.modules.16.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.94.createdAt","sections.3.modules.16.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.94.updatedAt","sections.3.modules.17.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.95.createdAt","sections.3.modules.17.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.95.updatedAt","sections.3.modules.18.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.96.createdAt","sections.3.modules.18.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.96.updatedAt","sections.3.modules.19.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.97.createdAt","sections.3.modules.19.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.97.updatedAt","sections.3.modules.20.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.98.createdAt","sections.3.modules.20.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.98.updatedAt","sections.3.modules.21.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.99.createdAt","sections.3.modules.21.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.99.updatedAt","sections.3.modules.22.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.100.createdAt","sections.3.modules.22.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.100.updatedAt","sections.3.modules.23.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.101.createdAt","sections.3.modules.23.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.101.updatedAt","sections.3.modules.24.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.102.createdAt","sections.3.modules.24.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.102.updatedAt","sections.3.modules.25.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.103.createdAt","sections.3.modules.25.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.103.updatedAt","sections.3.modules.26.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.104.createdAt","sections.3.modules.26.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.104.updatedAt","sections.3.modules.27.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.105.createdAt","sections.3.modules.27.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.105.updatedAt","sections.3.modules.28.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.106.createdAt","sections.3.modules.28.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.106.updatedAt","sections.3.modules.29.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.107.createdAt","sections.3.modules.29.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.107.updatedAt","sections.3.modules.30.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.108.createdAt","sections.3.modules.30.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.108.updatedAt","sections.3.modules.31.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.109.createdAt","sections.3.modules.31.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.109.updatedAt","sections.3.modules.32.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.110.createdAt","sections.3.modules.32.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.110.updatedAt","sections.3.modules.33.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.111.createdAt","sections.3.modules.33.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.111.updatedAt","sections.3.modules.34.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.112.createdAt","sections.3.modules.34.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.112.updatedAt","sections.3.modules.35.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.113.createdAt","sections.3.modules.35.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.113.updatedAt","sections.3.modules.36.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.114.createdAt","sections.3.modules.36.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.114.updatedAt","sections.3.modules.37.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.115.createdAt","sections.3.modules.37.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.115.updatedAt","sections.4.modules.0.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.116.createdAt","sections.4.modules.0.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.116.updatedAt","sections.4.modules.1.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.117.createdAt","sections.4.modules.1.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.117.updatedAt","sections.4.modules.2.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.118.createdAt","sections.4.modules.2.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.118.updatedAt","sections.4.modules.3.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.119.createdAt","sections.4.modules.3.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.119.updatedAt","sections.4.modules.4.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.120.createdAt","sections.4.modules.4.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.120.updatedAt","sections.4.modules.5.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.121.createdAt","sections.4.modules.5.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.121.updatedAt","sections.4.modules.6.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.122.createdAt","sections.4.modules.6.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.122.updatedAt","sections.4.modules.7.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.123.createdAt","sections.4.modules.7.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.123.updatedAt","sections.4.modules.8.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.124.createdAt","sections.4.modules.8.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.124.updatedAt","sections.4.modules.9.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.125.createdAt","sections.4.modules.9.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.125.updatedAt","sections.4.modules.10.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.126.createdAt","sections.4.modules.10.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.126.updatedAt","sections.4.modules.11.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.127.createdAt","sections.4.modules.11.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.127.updatedAt","sections.4.modules.12.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.128.createdAt","sections.4.modules.12.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.128.updatedAt","sections.4.modules.13.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.129.createdAt","sections.4.modules.13.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.129.updatedAt","sections.4.modules.14.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.130.createdAt","sections.4.modules.14.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.130.updatedAt","sections.4.modules.15.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.131.createdAt","sections.4.modules.15.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.131.updatedAt","sections.5.modules.0.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.132.createdAt","sections.5.modules.0.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.132.updatedAt","sections.5.modules.1.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.133.createdAt","sections.5.modules.1.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.133.updatedAt","sections.5.modules.2.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.134.createdAt","sections.5.modules.2.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.134.updatedAt","sections.5.modules.3.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.135.createdAt","sections.5.modules.3.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.135.updatedAt","sections.5.modules.4.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.136.createdAt","sections.5.modules.4.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.136.updatedAt","sections.5.modules.5.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.137.createdAt","sections.5.modules.5.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.137.updatedAt","sections.5.modules.6.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.138.createdAt","sections.5.modules.6.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.138.updatedAt","sections.5.modules.7.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.139.createdAt","sections.5.modules.7.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.139.updatedAt","sections.5.modules.8.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.140.createdAt","sections.5.modules.8.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.140.updatedAt","sections.6.modules.0.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.141.createdAt","sections.6.modules.0.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.141.updatedAt","sections.6.modules.1.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.142.createdAt","sections.6.modules.1.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.142.updatedAt","sections.6.modules.2.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.143.createdAt","sections.6.modules.2.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.143.updatedAt","sections.6.modules.3.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.144.createdAt","sections.6.modules.3.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.144.updatedAt","sections.6.modules.4.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.145.createdAt","sections.6.modules.4.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.145.updatedAt","sections.6.modules.5.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.146.createdAt","sections.6.modules.5.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.146.updatedAt","sections.6.modules.6.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.147.createdAt","sections.6.modules.6.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.147.updatedAt","sections.6.modules.7.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.148.createdAt","sections.6.modules.7.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.148.updatedAt","sections.6.modules.8.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.149.createdAt","sections.6.modules.8.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.149.updatedAt","sections.7.modules.0.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.150.createdAt","sections.7.modules.0.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.150.updatedAt","sections.7.modules.1.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.151.createdAt","sections.7.modules.1.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.151.updatedAt","sections.7.modules.2.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.152.createdAt","sections.7.modules.2.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.152.updatedAt","sections.7.modules.3.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.153.createdAt","sections.7.modules.3.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.153.updatedAt","sections.7.modules.4.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.154.createdAt","sections.7.modules.4.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.154.updatedAt","sections.7.modules.5.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.155.createdAt","sections.7.modules.5.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.155.updatedAt","sections.7.modules.6.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.156.createdAt","sections.7.modules.6.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.156.updatedAt","sections.7.modules.7.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.157.createdAt","sections.7.modules.7.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.157.updatedAt","sections.7.modules.8.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.158.createdAt","sections.7.modules.8.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.158.updatedAt","sections.7.modules.9.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.159.createdAt","sections.7.modules.9.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.159.updatedAt","sections.7.modules.10.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.160.createdAt","sections.7.modules.10.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.160.updatedAt","sections.7.modules.11.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.161.createdAt","sections.7.modules.11.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.161.updatedAt","sections.7.modules.12.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.162.createdAt","sections.7.modules.12.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.162.updatedAt","sections.7.modules.13.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.163.createdAt","sections.7.modules.13.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.163.updatedAt","sections.7.modules.14.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.164.createdAt","sections.7.modules.14.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.164.updatedAt","sections.7.modules.15.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.165.createdAt","sections.7.modules.15.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.165.updatedAt","sections.7.modules.16.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.166.createdAt","sections.7.modules.16.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.166.updatedAt","sections.7.modules.17.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.167.createdAt","sections.7.modules.17.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.167.updatedAt","sections.7.modules.18.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.168.createdAt","sections.7.modules.18.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.168.updatedAt","sections.7.modules.19.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.169.createdAt","sections.7.modules.19.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.169.updatedAt","sections.7.modules.20.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.170.createdAt","sections.7.modules.20.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.170.updatedAt","sections.7.modules.21.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.171.createdAt","sections.7.modules.21.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.171.updatedAt","sections.7.modules.22.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.172.createdAt","sections.7.modules.22.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.172.updatedAt","sections.7.modules.23.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.173.createdAt","sections.7.modules.23.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.173.updatedAt","sections.7.modules.24.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.174.createdAt","sections.7.modules.24.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.174.updatedAt","sections.7.modules.25.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.175.createdAt","sections.7.modules.25.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.175.updatedAt","sections.7.modules.26.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.176.createdAt","sections.7.modules.26.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.176.updatedAt","sections.7.modules.27.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.177.createdAt","sections.7.modules.27.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.177.updatedAt","sections.7.modules.28.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.178.createdAt","sections.7.modules.28.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.178.updatedAt","sections.7.modules.29.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.179.createdAt","sections.7.modules.29.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.179.updatedAt","sections.7.modules.30.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.180.createdAt","sections.7.modules.30.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.180.updatedAt","sections.7.modules.31.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.181.createdAt","sections.7.modules.31.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.181.updatedAt","sections.7.modules.32.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.182.createdAt","sections.7.modules.32.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.182.updatedAt","sections.7.modules.33.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.183.createdAt","sections.7.modules.33.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.183.updatedAt","sections.7.modules.34.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.184.createdAt","sections.7.modules.34.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.184.updatedAt","sections.7.modules.35.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.185.createdAt","sections.7.modules.35.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.185.updatedAt","sections.7.modules.36.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.186.createdAt","sections.7.modules.36.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.186.updatedAt","sections.7.modules.37.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.187.createdAt","sections.7.modules.37.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.187.updatedAt","sections.7.modules.38.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.188.createdAt","sections.7.modules.38.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.188.updatedAt","sections.7.modules.39.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.189.createdAt","sections.7.modules.39.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.189.updatedAt","sections.7.modules.40.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.190.createdAt","sections.7.modules.40.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.190.updatedAt","sections.7.modules.41.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.191.createdAt","sections.7.modules.41.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.191.updatedAt","sections.8.modules.0.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.192.createdAt","sections.8.modules.0.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.192.updatedAt","sections.8.modules.1.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.193.createdAt","sections.8.modules.1.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.193.updatedAt","sections.8.modules.2.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.194.createdAt","sections.8.modules.2.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.194.updatedAt","sections.8.modules.3.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.195.createdAt","sections.8.modules.3.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.195.updatedAt","sections.8.modules.4.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.196.createdAt","sections.8.modules.4.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.196.updatedAt","sections.8.modules.5.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.197.createdAt","sections.8.modules.5.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.197.updatedAt","sections.8.modules.6.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.198.createdAt","sections.8.modules.6.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.198.updatedAt","sections.8.modules.7.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.199.createdAt","sections.8.modules.7.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.199.updatedAt","sections.8.modules.8.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.200.createdAt","sections.8.modules.8.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.200.updatedAt","sections.8.modules.9.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.201.createdAt","sections.8.modules.9.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.201.updatedAt","sections.8.modules.10.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.202.createdAt","sections.8.modules.10.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.202.updatedAt","sections.8.modules.11.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.203.createdAt","sections.8.modules.11.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.203.updatedAt","sections.8.modules.12.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.204.createdAt","sections.8.modules.12.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.204.updatedAt","sections.8.modules.13.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.205.createdAt","sections.8.modules.13.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.205.updatedAt","sections.8.modules.14.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.206.createdAt","sections.8.modules.14.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.206.updatedAt","sections.8.modules.15.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.207.createdAt","sections.8.modules.15.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.207.updatedAt","sections.8.modules.16.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.208.createdAt","sections.8.modules.16.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.208.updatedAt","sections.8.modules.17.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.209.createdAt","sections.8.modules.17.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.209.updatedAt","sections.8.modules.18.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.210.createdAt","sections.8.modules.18.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.210.updatedAt","sections.8.modules.19.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.211.createdAt","sections.8.modules.19.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.211.updatedAt","sections.8.modules.20.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.212.createdAt","sections.8.modules.20.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.212.updatedAt","sections.8.modules.21.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.213.createdAt","sections.8.modules.21.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.213.updatedAt","sections.8.modules.22.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.214.createdAt","sections.8.modules.22.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.214.updatedAt","sections.8.modules.23.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.215.createdAt","sections.8.modules.23.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.215.updatedAt","sections.8.modules.24.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.216.createdAt","sections.8.modules.24.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.216.updatedAt","sections.8.modules.25.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.217.createdAt","sections.8.modules.25.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.217.updatedAt","sections.8.modules.26.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.218.createdAt","sections.8.modules.26.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.218.updatedAt","sections.8.modules.27.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.219.createdAt","sections.8.modules.27.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.219.updatedAt","sections.8.modules.28.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.220.createdAt","sections.8.modules.28.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.220.updatedAt","sections.8.modules.29.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.221.createdAt","sections.8.modules.29.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.221.updatedAt","sections.9.modules.0.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.222.createdAt","sections.9.modules.0.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.222.updatedAt","sections.9.modules.1.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.223.createdAt","sections.9.modules.1.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.223.updatedAt","sections.9.modules.2.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.224.createdAt","sections.9.modules.2.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.224.updatedAt","sections.9.modules.3.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.225.createdAt","sections.9.modules.3.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.225.updatedAt","sections.9.modules.4.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.226.createdAt","sections.9.modules.4.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.226.updatedAt","sections.9.modules.5.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.227.createdAt","sections.9.modules.5.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.227.updatedAt","sections.9.modules.6.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.228.createdAt","sections.9.modules.6.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.228.updatedAt","sections.9.modules.7.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.229.createdAt","sections.9.modules.7.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.229.updatedAt","sections.9.modules.8.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.230.createdAt","sections.9.modules.8.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.230.updatedAt","sections.9.modules.9.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.231.createdAt","sections.9.modules.9.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.231.updatedAt","sections.9.modules.10.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.232.createdAt","sections.9.modules.10.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.232.updatedAt","sections.9.modules.11.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.233.createdAt","sections.9.modules.11.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.233.updatedAt","sections.9.modules.12.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.234.createdAt","sections.9.modules.12.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.234.updatedAt","sections.9.modules.13.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.235.createdAt","sections.9.modules.13.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.235.updatedAt","sections.9.modules.14.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.236.createdAt","sections.9.modules.14.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.236.updatedAt","sections.9.modules.15.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.237.createdAt","sections.9.modules.15.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.237.updatedAt","sections.9.modules.16.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.238.createdAt","sections.9.modules.16.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.238.updatedAt","sections.9.modules.17.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.239.createdAt","sections.9.modules.17.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.239.updatedAt","sections.9.modules.18.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.240.createdAt","sections.9.modules.18.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.240.updatedAt","sections.9.modules.19.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.241.createdAt","sections.9.modules.19.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.241.updatedAt","sections.9.modules.20.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.242.createdAt","sections.9.modules.20.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.242.updatedAt","sections.9.modules.21.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.243.createdAt","sections.9.modules.21.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.243.updatedAt","sections.9.modules.22.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.244.createdAt","sections.9.modules.22.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.244.updatedAt","sections.9.modules.23.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.245.createdAt","sections.9.modules.23.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.245.updatedAt","sections.9.modules.24.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.246.createdAt","sections.9.modules.24.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.246.updatedAt","sections.9.modules.25.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.247.createdAt","sections.9.modules.25.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.247.updatedAt","sections.9.modules.26.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.248.createdAt","sections.9.modules.26.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.248.updatedAt","sections.9.modules.27.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.249.createdAt","sections.9.modules.27.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.249.updatedAt","sections.9.modules.28.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.250.createdAt","sections.9.modules.28.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.250.updatedAt","sections.9.modules.29.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.251.createdAt","sections.9.modules.29.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.251.updatedAt","sections.9.modules.30.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.252.createdAt","sections.9.modules.30.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.252.updatedAt","sections.9.modules.31.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.253.createdAt","sections.9.modules.31.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.253.updatedAt","sections.9.modules.32.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.254.createdAt","sections.9.modules.32.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.254.updatedAt","sections.10.modules.0.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.255.createdAt","sections.10.modules.0.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.255.updatedAt","sections.10.modules.1.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.256.createdAt","sections.10.modules.1.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.256.updatedAt","sections.10.modules.2.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.257.createdAt","sections.10.modules.2.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.257.updatedAt","sections.10.modules.3.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.258.createdAt","sections.10.modules.3.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.258.updatedAt","sections.10.modules.4.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.259.createdAt","sections.10.modules.4.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.259.updatedAt","sections.10.modules.5.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.260.createdAt","sections.10.modules.5.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.260.updatedAt","sections.10.modules.6.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.261.createdAt","sections.10.modules.6.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.261.updatedAt","sections.10.modules.7.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.262.createdAt","sections.10.modules.7.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.262.updatedAt","sections.10.modules.8.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.263.createdAt","sections.10.modules.8.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.263.updatedAt","sections.10.modules.9.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.264.createdAt","sections.10.modules.9.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.264.updatedAt","sections.10.modules.10.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.265.createdAt","sections.10.modules.10.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.265.updatedAt","sections.10.modules.11.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.266.createdAt","sections.10.modules.11.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.266.updatedAt","sections.10.modules.12.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.267.createdAt","sections.10.modules.12.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.267.updatedAt","sections.10.modules.13.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.268.createdAt","sections.10.modules.13.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.268.updatedAt","sections.10.modules.14.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.269.createdAt","sections.10.modules.14.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.269.updatedAt","sections.10.modules.15.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.270.createdAt","sections.10.modules.15.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.270.updatedAt","sections.10.modules.16.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.271.createdAt","sections.10.modules.16.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.271.updatedAt","sections.10.modules.17.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.272.createdAt","sections.10.modules.17.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.272.updatedAt","sections.10.modules.18.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.273.createdAt","sections.10.modules.18.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.273.updatedAt","sections.10.modules.19.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.274.createdAt","sections.10.modules.19.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.274.updatedAt","sections.10.modules.20.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.275.createdAt","sections.10.modules.20.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.275.updatedAt","sections.10.modules.21.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.276.createdAt","sections.10.modules.21.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.276.updatedAt","sections.10.modules.22.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.277.createdAt","sections.10.modules.22.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.277.updatedAt","sections.10.modules.23.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.278.createdAt","sections.10.modules.23.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.278.updatedAt","sections.10.modules.24.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.279.createdAt","sections.10.modules.24.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.279.updatedAt","sections.10.modules.25.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.280.createdAt","sections.10.modules.25.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.280.updatedAt","sections.10.modules.26.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.281.createdAt","sections.10.modules.26.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.281.updatedAt","sections.10.modules.27.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.282.createdAt","sections.10.modules.27.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.282.updatedAt","sections.10.modules.28.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.283.createdAt","sections.10.modules.28.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.283.updatedAt","sections.10.modules.29.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.284.createdAt","sections.10.modules.29.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.284.updatedAt","sections.10.modules.30.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.285.createdAt","sections.10.modules.30.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.285.updatedAt","sections.11.modules.0.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.286.createdAt","sections.11.modules.0.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.286.updatedAt","sections.11.modules.1.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.287.createdAt","sections.11.modules.1.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.287.updatedAt","sections.11.modules.2.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.288.createdAt","sections.11.modules.2.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.288.updatedAt","sections.11.modules.3.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.289.createdAt","sections.11.modules.3.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.289.updatedAt","sections.11.modules.4.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.290.createdAt","sections.11.modules.4.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.290.updatedAt","sections.11.modules.5.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.291.createdAt","sections.11.modules.5.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.291.updatedAt","sections.11.modules.6.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.292.createdAt","sections.11.modules.6.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.292.updatedAt","sections.11.modules.7.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.293.createdAt","sections.11.modules.7.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.293.updatedAt","sections.11.modules.8.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.294.createdAt","sections.11.modules.8.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.294.updatedAt","sections.11.modules.9.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.295.createdAt","sections.11.modules.9.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.295.updatedAt","sections.11.modules.10.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.296.createdAt","sections.11.modules.10.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.296.updatedAt","sections.11.modules.11.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.297.createdAt","sections.11.modules.11.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.297.updatedAt","sections.11.modules.12.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.298.createdAt","sections.11.modules.12.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.298.updatedAt","sections.11.modules.13.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.299.createdAt","sections.11.modules.13.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.299.updatedAt","sections.11.modules.14.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.300.createdAt","sections.11.modules.14.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.300.updatedAt","sections.11.modules.15.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.301.createdAt","sections.11.modules.15.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.301.updatedAt","sections.11.modules.16.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.302.createdAt","sections.11.modules.16.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.302.updatedAt","sections.11.modules.17.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.303.createdAt","sections.11.modules.17.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.303.updatedAt","sections.11.modules.18.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.304.createdAt","sections.11.modules.18.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.304.updatedAt","sections.11.modules.19.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.305.createdAt","sections.11.modules.19.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.305.updatedAt","sections.11.modules.20.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.306.createdAt","sections.11.modules.20.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.306.updatedAt","sections.11.modules.21.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.307.createdAt","sections.11.modules.21.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.307.updatedAt","sections.11.modules.22.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.308.createdAt","sections.11.modules.22.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.308.updatedAt","sections.11.modules.23.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.309.createdAt","sections.11.modules.23.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.309.updatedAt","sections.11.modules.24.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.310.createdAt","sections.11.modules.24.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.310.updatedAt","sections.11.modules.25.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.311.createdAt","sections.11.modules.25.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.311.updatedAt","sections.12.modules.0.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.312.createdAt","sections.12.modules.0.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.312.updatedAt","sections.12.modules.1.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.313.createdAt","sections.12.modules.1.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.313.updatedAt","sections.12.modules.2.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.314.createdAt","sections.12.modules.2.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.314.updatedAt","sections.12.modules.3.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.315.createdAt","sections.12.modules.3.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.315.updatedAt","sections.12.modules.4.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.316.createdAt","sections.12.modules.4.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.316.updatedAt","sections.12.modules.5.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.317.createdAt","sections.12.modules.5.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.317.updatedAt","sections.12.modules.6.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.318.createdAt","sections.12.modules.6.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.318.updatedAt","sections.12.modules.7.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.319.createdAt","sections.12.modules.7.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.319.updatedAt","sections.12.modules.8.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.320.createdAt","sections.12.modules.8.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.320.updatedAt","sections.12.modules.9.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.321.createdAt","sections.12.modules.9.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.321.updatedAt","sections.12.modules.10.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.322.createdAt","sections.12.modules.10.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.322.updatedAt","sections.12.modules.11.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.323.createdAt","sections.12.modules.11.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.323.updatedAt","sections.12.modules.12.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.324.createdAt","sections.12.modules.12.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.324.updatedAt","sections.12.modules.13.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.325.createdAt","sections.12.modules.13.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.325.updatedAt","sections.12.modules.14.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.326.createdAt","sections.12.modules.14.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.326.updatedAt","sections.12.modules.15.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.327.createdAt","sections.12.modules.15.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.327.updatedAt","sections.13.modules.0.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.328.createdAt","sections.13.modules.0.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.328.updatedAt","sections.13.modules.1.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.329.createdAt","sections.13.modules.1.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.329.updatedAt","sections.13.modules.2.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.330.createdAt","sections.13.modules.2.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.330.updatedAt","sections.13.modules.3.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.331.createdAt","sections.13.modules.3.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.331.updatedAt","sections.13.modules.4.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.332.createdAt","sections.13.modules.4.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.332.updatedAt","sections.13.modules.5.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.333.createdAt","sections.13.modules.5.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.333.updatedAt","sections.13.modules.6.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.334.createdAt","sections.13.modules.6.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.334.updatedAt","sections.13.modules.7.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.335.createdAt","sections.13.modules.7.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.335.updatedAt","sections.13.modules.8.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.336.createdAt","sections.13.modules.8.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.336.updatedAt","sections.13.modules.9.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.337.createdAt","sections.13.modules.9.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.337.updatedAt","sections.13.modules.10.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.338.createdAt","sections.13.modules.10.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.338.updatedAt","sections.13.modules.11.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.339.createdAt","sections.13.modules.11.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.339.updatedAt","sections.13.modules.12.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.340.createdAt","sections.13.modules.12.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.340.updatedAt","sections.13.modules.13.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.341.createdAt","sections.13.modules.13.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.341.updatedAt","sections.13.modules.14.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.342.createdAt","sections.13.modules.14.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.342.updatedAt","sections.13.modules.15.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.343.createdAt","sections.13.modules.15.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.343.updatedAt","sections.13.modules.16.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.344.createdAt","sections.13.modules.16.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.344.updatedAt","sections.13.modules.17.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.345.createdAt","sections.13.modules.17.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.345.updatedAt","sections.13.modules.18.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.346.createdAt","sections.13.modules.18.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.346.updatedAt","sections.14.modules.0.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.347.createdAt","sections.14.modules.0.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.347.updatedAt","sections.14.modules.1.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.348.createdAt","sections.14.modules.1.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.348.updatedAt","sections.14.modules.2.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.349.createdAt","sections.14.modules.2.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.349.updatedAt","sections.14.modules.3.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.350.createdAt","sections.14.modules.3.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.350.updatedAt","sections.14.modules.4.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.351.createdAt","sections.14.modules.4.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.351.updatedAt","sections.14.modules.5.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.352.createdAt","sections.14.modules.5.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.352.updatedAt","sections.14.modules.6.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.353.createdAt","sections.14.modules.6.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.353.updatedAt","sections.14.modules.7.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.354.createdAt","sections.14.modules.7.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.354.updatedAt","sections.14.modules.8.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.355.createdAt","sections.14.modules.8.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.355.updatedAt","sections.14.modules.9.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.356.createdAt","sections.14.modules.9.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.356.updatedAt","sections.14.modules.10.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.357.createdAt","sections.14.modules.10.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.357.updatedAt","sections.14.modules.11.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.358.createdAt","sections.14.modules.11.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.358.updatedAt","sections.14.modules.12.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.359.createdAt","sections.14.modules.12.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.359.updatedAt","sections.14.modules.13.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.360.createdAt","sections.14.modules.13.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.360.updatedAt","sections.14.modules.14.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.361.createdAt","sections.14.modules.14.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.361.updatedAt","sections.15.modules.0.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.362.createdAt","sections.15.modules.0.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.362.updatedAt","sections.15.modules.1.createdAt":"$47:props:state:queries:0:state:data:meta:values:modules.363.createdAt","sections.15.modules.1.updatedAt":"$47:props:state:queries:0:state:data:meta:values:modules.363.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.0.modules.8"],"modules.9":["sections.0.modules.9"],"modules.10":["sections.0.modules.10"],"modules.11":["sections.0.modules.11"],"modules.12":["sections.0.modules.12"],"modules.13":["sections.0.modules.13"],"modules.14":["sections.0.modules.14"],"modules.15":["sections.0.modules.15"],"modules.16":["sections.0.modules.16"],"modules.17":["sections.0.modules.17"],"modules.18":["sections.0.modules.18"],"modules.19":["sections.0.modules.19"],"modules.20":["sections.0.modules.20"],"modules.21":["sections.0.modules.21"],"modules.22":["sections.0.modules.22"],"modules.23":["sections.0.modules.23"],"modules.24":["sections.0.modules.24"],"modules.25":["sections.0.modules.25"],"modules.26":["sections.0.modules.26"],"modules.27":["sections.0.modules.27"],"modules.28":["sections.0.modules.28"],"modules.29":["sections.0.modules.29"],"modules.30":["sections.0.modules.30"],"modules.31":["sections.0.modules.31"],"modules.32":["sections.0.modules.32"],"modules.33":["sections.1.modules.0"],"modules.34":["sections.1.modules.1"],"modules.35":["sections.1.modules.2"],"modules.36":["sections.1.modules.3"],"modules.37":["sections.1.modules.4"],"modules.38":["sections.1.modules.5"],"modules.39":["sections.1.modules.6"],"modules.40":["sections.1.modules.7"],"modules.41":["sections.1.modules.8"],"modules.42":["sections.1.modules.9"],"modules.43":["sections.1.modules.10"],"modules.44":["sections.1.modules.11"],"modules.45":["sections.1.modules.12"],"modules.46":["sections.1.modules.13"],"modules.47":["sections.1.modules.14"],"modules.48":["sections.1.modules.15"],"modules.49":["sections.1.modules.16"],"modules.50":["sections.1.modules.17"],"modules.51":["sections.1.modules.18"],"modules.52":["sections.1.modules.19"],"modules.53":["sections.1.modules.20"],"modules.54":["sections.1.modules.21"],"modules.55":["sections.1.modules.22"],"modules.56":["sections.1.modules.23"],"modules.57":["sections.2.modules.0"],"modules.58":["sections.2.modules.1"],"modules.59":["sections.2.modules.2"],"modules.60":["sections.2.modules.3"],"modules.61":["sections.2.modules.4"],"modules.62":["sections.2.modules.5"],"modules.63":["sections.2.modules.6"],"modules.64":["sections.2.modules.7"],"modules.65":["sections.2.modules.8"],"modules.66":["sections.2.modules.9"],"modules.67":["sections.2.modules.10"],"modules.68":["sections.2.modules.11"],"modules.69":["sections.2.modules.12"],"modules.70":["sections.2.modules.13"],"modules.71":["sections.2.modules.14"],"modules.72":["sections.2.modules.15"],"modules.73":["sections.2.modules.16"],"modules.74":["sections.2.modules.17"],"modules.75":["sections.2.modules.18"],"modules.76":["sections.2.modules.19"],"modules.77":["sections.2.modules.20"],"modules.78":["sections.3.modules.0"],"modules.79":["sections.3.modules.1"],"modules.80":["sections.3.modules.2"],"modules.81":["sections.3.modules.3"],"modules.82":["sections.3.modules.4"],"modules.83":["sections.3.modules.5"],"modules.84":["sections.3.modules.6"],"modules.85":["sections.3.modules.7"],"modules.86":["sections.3.modules.8"],"modules.87":["sections.3.modules.9"],"modules.88":["sections.3.modules.10"],"modules.89":["sections.3.modules.11"],"modules.90":["sections.3.modules.12"],"modules.91":["sections.3.modules.13"],"modules.92":["sections.3.modules.14"],"modules.93":["sections.3.modules.15"],"modules.94":["sections.3.modules.16"],"modules.95":["sections.3.modules.17"],"modules.96":["sections.3.modules.18"],"modules.97":["sections.3.modules.19"],"modules.98":["sections.3.modules.20"],"modules.99":["sections.3.modules.21"],"modules.100":["sections.3.modules.22"],"modules.101":["sections.3.modules.23"],"modules.102":["sections.3.modules.24"],"modules.103":["sections.3.modules.25"],"modules.104":["sections.3.modules.26"],"modules.105":["sections.3.modules.27"],"modules.106":["sections.3.modules.28"],"modules.107":["sections.3.modules.29"],"modules.108":["sections.3.modules.30"],"modules.109":["sections.3.modules.31"],"modules.110":["sections.3.modules.32"],"modules.111":["sections.3.modules.33"],"modules.112":["sections.3.modules.34"],"modules.113":["sections.3.modules.35"],"modules.114":["sections.3.modules.36"],"modules.115":["sections.3.modules.37"],"modules.116":["sections.4.modules.0"],"modules.117":["sections.4.modules.1"],"modules.118":["sections.4.modules.2"],"modules.119":["sections.4.modules.3"],"modules.120":["sections.4.modules.4"],"modules.121":["sections.4.modules.5"],"modules.122":["sections.4.modules.6"],"modules.123":["sections.4.modules.7"],"modules.124":["sections.4.modules.8"],"modules.125":["sections.4.modules.9"],"modules.126":["sections.4.modules.10"],"modules.127":["sections.4.modules.11"],"modules.128":["sections.4.modules.12"],"modules.129":["sections.4.modules.13"],"modules.130":["sections.4.modules.14"],"modules.131":["sections.4.modules.15"],"modules.132":["sections.5.modules.0"],"modules.133":["sections.5.modules.1"],"modules.134":["sections.5.modules.2"],"modules.135":["sections.5.modules.3"],"modules.136":["sections.5.modules.4"],"modules.137":["sections.5.modules.5"],"modules.138":["sections.5.modules.6"],"modules.139":["sections.5.modules.7"],"modules.140":["sections.5.modules.8"],"modules.141":["sections.6.modules.0"],"modules.142":["sections.6.modules.1"],"modules.143":["sections.6.modules.2"],"modules.144":["sections.6.modules.3"],"modules.145":["sections.6.modules.4"],"modules.146":["sections.6.modules.5"],"modules.147":["sections.6.modules.6"],"modules.148":["sections.6.modules.7"],"modules.149":["sections.6.modules.8"],"modules.150":["sections.7.modules.0"],"modules.151":["sections.7.modules.1"],"modules.152":["sections.7.modules.2"],"modules.153":["sections.7.modules.3"],"modules.154":["sections.7.modules.4"],"modules.155":["sections.7.modules.5"],"modules.156":["sections.7.modules.6"],"modules.157":["sections.7.modules.7"],"modules.158":["sections.7.modules.8"],"modules.159":["sections.7.modules.9"],"modules.160":["sections.7.modules.10"],"modules.161":["sections.7.modules.11"],"modules.162":["sections.7.modules.12"],"modules.163":["sections.7.modules.13"],"modules.164":["sections.7.modules.14"],"modules.165":["sections.7.modules.15"],"modules.166":["sections.7.modules.16"],"modules.167":["sections.7.modules.17"],"modules.168":["sections.7.modules.18"],"modules.169":["sections.7.modules.19"],"modules.170":["sections.7.modules.20"],"modules.171":["sections.7.modules.21"],"modules.172":["sections.7.modules.22"],"modules.173":["sections.7.modules.23"],"modules.174":["sections.7.modules.24"],"modules.175":["sections.7.modules.25"],"modules.176":["sections.7.modules.26"],"modules.177":["sections.7.modules.27"],"modules.178":["sections.7.modules.28"],"modules.179":["sections.7.modules.29"],"modules.180":["sections.7.modules.30"],"modules.181":["sections.7.modules.31"],"modules.182":["sections.7.modules.32"],"modules.183":["sections.7.modules.33"],"modules.184":["sections.7.modules.34"],"modules.185":["sections.7.modules.35"],"modules.186":["sections.7.modules.36"],"modules.187":["sections.7.modules.37"],"modules.188":["sections.7.modules.38"],"modules.189":["sections.7.modules.39"],"modules.190":["sections.7.modules.40"],"modules.191":["sections.7.modules.41"],"modules.192":["sections.8.modules.0"],"modules.193":["sections.8.modules.1"],"modules.194":["sections.8.modules.2"],"modules.195":["sections.8.modules.3"],"modules.196":["sections.8.modules.4"],"modules.197":["sections.8.modules.5"],"modules.198":["sections.8.modules.6"],"modules.199":["sections.8.modules.7"],"modules.200":["sections.8.modules.8"],"modules.201":["sections.8.modules.9"],"modules.202":["sections.8.modules.10"],"modules.203":["sections.8.modules.11"],"modules.204":["sections.8.modules.12"],"modules.205":["sections.8.modules.13"],"modules.206":["sections.8.modules.14"],"modules.207":["sections.8.modules.15"],"modules.208":["sections.8.modules.16"],"modules.209":["sections.8.modules.17"],"modules.210":["sections.8.modules.18"],"modules.211":["sections.8.modules.19"],"modules.212":["sections.8.modules.20"],"modules.213":["sections.8.modules.21"],"modules.214":["sections.8.modules.22"],"modules.215":["sections.8.modules.23"],"modules.216":["sections.8.modules.24"],"modules.217":["sections.8.modules.25"],"modules.218":["sections.8.modules.26"],"modules.219":["sections.8.modules.27"],"modules.220":["sections.8.modules.28"],"modules.221":["sections.8.modules.29"],"modules.222":["sections.9.modules.0"],"modules.223":["sections.9.modules.1"],"modules.224":["sections.9.modules.2"],"modules.225":["sections.9.modules.3"],"modules.226":["sections.9.modules.4"],"modules.227":["sections.9.modules.5"],"modules.228":["sections.9.modules.6"],"modules.229":["sections.9.modules.7"],"modules.230":["sections.9.modules.8"],"modules.231":["sections.9.modules.9"],"modules.232":["sections.9.modules.10"],"modules.233":["sections.9.modules.11"],"modules.234":["sections.9.modules.12"],"modules.235":["sections.9.modules.13"],"modules.236":["sections.9.modules.14"],"modules.237":["sections.9.modules.15"],"modules.238":["sections.9.modules.16"],"modules.239":["sections.9.modules.17"],"modules.240":["sections.9.modules.18"],"modules.241":["sections.9.modules.19"],"modules.242":["sections.9.modules.20"],"modules.243":["sections.9.modules.21"],"modules.244":["sections.9.modules.22"],"modules.245":["sections.9.modules.23"],"modules.246":["sections.9.modules.24"],"modules.247":["sections.9.modules.25"],"modules.248":["sections.9.modules.26"],"modules.249":["sections.9.modules.27"],"modules.250":["sections.9.modules.28"],"modules.251":["sections.9.modules.29"],"modules.252":["sections.9.modules.30"],"modules.253":["sections.9.modules.31"],"modules.254":["sections.9.modules.32"],"modules.255":["sections.10.modules.0"],"modules.256":["sections.10.modules.1"],"modules.257":["sections.10.modules.2"],"modules.258":["sections.10.modules.3"],"modules.259":["sections.10.modules.4"],"modules.260":["sections.10.modules.5"],"modules.261":["sections.10.modules.6"],"modules.262":["sections.10.modules.7"],"modules.263":["sections.10.modules.8"],"modules.264":["sections.10.modules.9"],"modules.265":["sections.10.modules.10"],"modules.266":["sections.10.modules.11"],"modules.267":["sections.10.modules.12"],"modules.268":["sections.10.modules.13"],"modules.269":["sections.10.modules.14"],"modules.270":["sections.10.modules.15"],"modules.271":["sections.10.modules.16"],"modules.272":["sections.10.modules.17"],"modules.273":["sections.10.modules.18"],"modules.274":["sections.10.modules.19"],"modules.275":["sections.10.modules.20"],"modules.276":["sections.10.modules.21"],"modules.277":["sections.10.modules.22"],"modules.278":["sections.10.modules.23"],"modules.279":["sections.10.modules.24"],"modules.280":["sections.10.modules.25"],"modules.281":["sections.10.modules.26"],"modules.282":["sections.10.modules.27"],"modules.283":["sections.10.modules.28"],"modules.284":["sections.10.modules.29"],"modules.285":["sections.10.modules.30"],"modules.286":["sections.11.modules.0"],"modules.287":["sections.11.modules.1"],"modules.288":["sections.11.modules.2"],"modules.289":["sections.11.modules.3"],"modules.290":["sections.11.modules.4"],"modules.291":["sections.11.modules.5"],"modules.292":["sections.11.modules.6"],"modules.293":["sections.11.modules.7"],"modules.294":["sections.11.modules.8"],"modules.295":["sections.11.modules.9"],"modules.296":["sections.11.modules.10"],"modules.297":["sections.11.modules.11"],"modules.298":["sections.11.modules.12"],"modules.299":["sections.11.modules.13"],"modules.300":["sections.11.modules.14"],"modules.301":["sections.11.modules.15"],"modules.302":["sections.11.modules.16"],"modules.303":["sections.11.modules.17"],"modules.304":["sections.11.modules.18"],"modules.305":["sections.11.modules.19"],"modules.306":["sections.11.modules.20"],"modules.307":["sections.11.modules.21"],"modules.308":["sections.11.modules.22"],"modules.309":["sections.11.modules.23"],"modules.310":["sections.11.modules.24"],"modules.311":["sections.11.modules.25"],"modules.312":["sections.12.modules.0"],"modules.313":["sections.12.modules.1"],"modules.314":["sections.12.modules.2"],"modules.315":["sections.12.modules.3"],"modules.316":["sections.12.modules.4"],"modules.317":["sections.12.modules.5"],"modules.318":["sections.12.modules.6"],"modules.319":["sections.12.modules.7"],"modules.320":["sections.12.modules.8"],"modules.321":["sections.12.modules.9"],"modules.322":["sections.12.modules.10"],"modules.323":["sections.12.modules.11"],"modules.324":["sections.12.modules.12"],"modules.325":["sections.12.modules.13"],"modules.326":["sections.12.modules.14"],"modules.327":["sections.12.modules.15"],"modules.328":["sections.13.modules.0"],"modules.329":["sections.13.modules.1"],"modules.330":["sections.13.modules.2"],"modules.331":["sections.13.modules.3"],"modules.332":["sections.13.modules.4"],"modules.333":["sections.13.modules.5"],"modules.334":["sections.13.modules.6"],"modules.335":["sections.13.modules.7"],"modules.336":["sections.13.modules.8"],"modules.337":["sections.13.modules.9"],"modules.338":["sections.13.modules.10"],"modules.339":["sections.13.modules.11"],"modules.340":["sections.13.modules.12"],"modules.341":["sections.13.modules.13"],"modules.342":["sections.13.modules.14"],"modules.343":["sections.13.modules.15"],"modules.344":["sections.13.modules.16"],"modules.345":["sections.13.modules.17"],"modules.346":["sections.13.modules.18"],"modules.347":["sections.14.modules.0"],"modules.348":["sections.14.modules.1"],"modules.349":["sections.14.modules.2"],"modules.350":["sections.14.modules.3"],"modules.351":["sections.14.modules.4"],"modules.352":["sections.14.modules.5"],"modules.353":["sections.14.modules.6"],"modules.354":["sections.14.modules.7"],"modules.355":["sections.14.modules.8"],"modules.356":["sections.14.modules.9"],"modules.357":["sections.14.modules.10"],"modules.358":["sections.14.modules.11"],"modules.359":["sections.14.modules.12"],"modules.360":["sections.14.modules.13"],"modules.361":["sections.14.modules.14"],"modules.362":["sections.15.modules.0"],"modules.363":["sections.15.modules.1"]},"v":1}},"dataUpdateCount":1,"dataUpdatedAt":1792306281938,"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-patterns"},"type":"query"}],"queryHash":"[[\"learningPaths\",\"getBySlug\"],{\"input\":{\"slug\":\"data-structures-algorithms-patterns\"},\"type\":\"query\"}]"},{"dehydratedAt":1792306282174,"state":{"data":{"json":{"path":{"archivedAt":null,"id":"seed_9a9d8b83f733dcfd157a0f26a883a557","slug":"data-structures-algorithms-patterns","title":"Data Structures & Algorithms Patterns","description":"Master Data Structures and Algorithms through 15 chapters of coding patterns. From Two Pointers to Dynamic Programming, this path covers 320 carefully curated problems organized by technique for optimal learning progression.","image":null,"color":"#10B981","keyTopics":["Two Pointers & Sliding Window","Binary Search Techniques","Stack & Queue Patterns","Tree & Graph Algorithms","Greedy Algorithms","Backtracking","Dynamic Programming","Bit Manipulation"],"estimatedHours":174.3,"problemCount":323,"visualizerCount":15,"quizCount":0,"learningCount":26,"difficulty":"INTERMEDIATE","idealFor":["Software engineering candidates","Competitive programmers","CS students","Anyone preparing for technical interviews"],"prerequisites":["Basic programming knowledge","Understanding of basic data types","Familiarity with loops and conditionals"],"skillsGained":["Pattern recognition in problems","Algorithm design and analysis","Time and space complexity analysis","Systematic problem-solving approach","Code optimization techniques","Interview problem-solving skills"],"outcomes":["Master 15+ coding patterns","Solve complex algorithmic problems","Ace technical interviews at top companies","Write efficient and optimized code","Build strong problem-solving intuition"],"overview":"This comprehensive learning path organizes 320 problems into 15 chapters based on coding patterns, progressing from foundational techniques to advanced algorithms.\n\n**Learning Path Structure:**\n• Chapter 1-2: Two Pointers & Sliding Window - Master pointer manipulation\n• Chapter 3-4: Binary Search & Array Manipulation - Search and transform techniques\n• Chapter 5-7: Stack, Linked List & Heap - Core data structure patterns\n• Chapter 8-10: Trees & Graphs - Traversal and graph algorithms\n• Chapter 11-12: Greedy & Backtracking - Optimization and exploration\n• Chapter 13-14: Dynamic Programming - Optimal substructure patterns\n• Chapter 15: Bit Manipulation - Binary operations and tricks\n\nEach pattern includes multiple problems to reinforce learning.","createdAt":"2026-10-15T17:47:45.111Z","updatedAt":"2026-10-17T16:28:34.214Z","modules":[{"id":"seed_8e82f930391ad4f50a80acfcc6eabfcf","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"What Is an Array? — The Fundamental Collection","order":1,"contentType":"LEARNING","contentSlug":"what-is-an-array","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.096Z","updatedAt":"2026-10-17T16:28:32.434Z","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_bd4fd4d7d2868dd85f5122476342d9b4","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Array Memory Model & Contiguous Storage","order":2,"contentType":"LEARNING","contentSlug":"array-memory-model","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.096Z","updatedAt":"2026-10-17T16:28:32.434Z","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_d594eca65799bde462b4394323ac957b","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"In-Place Unique Elements","order":3,"contentType":"VISUALIZER","contentSlug":"inplace-unique-elements","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.096Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_5ff3de7b499b57099e9cb9da8071c025","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"In-Place Unique Elements","order":4,"contentType":"PROBLEM","contentSlug":"inplace-unique-elements","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_abb9319861f00fe8fd4e457324ad9203","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Filter Array By Value","order":5,"contentType":"PROBLEM","contentSlug":"filter-array-by-value","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_abe7b11f6a8394f8c876eb98937633b6","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Limit Element Occurrences in Sorted Array","order":6,"contentType":"PROBLEM","contentSlug":"limit-element-occurrences","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_f587df465429171ccdddbbd006c3170e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Relocate Zeroes to End","order":7,"contentType":"PROBLEM","contentSlug":"relocate-zeroes-to-end","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_3a1c49d62b73dfd281fc6723b5cc0502","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Maximum Water Container","order":8,"contentType":"PROBLEM","contentSlug":"maximum-water-container","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_23eb213462a6664b943abd217f642af1","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Triplet Nearest Sum","order":9,"contentType":"PROBLEM","contentSlug":"triplet-nearest-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_27e9fa29137dd9f3b92d07970abd68fa","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Sorted Array Pair Search","order":10,"contentType":"PROBLEM","contentSlug":"sorted-array-pair-search","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_f3e90eb8520e648909b91087a968c1c9","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Integer Square Verification","order":11,"contentType":"PROBLEM","contentSlug":"integer-square-verification","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_7825c28543ac0793e6a2bbf475c6d626","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Perfect Square Pair Sum","order":12,"contentType":"PROBLEM","contentSlug":"perfect-square-pair-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_ed95466c2e37d5d7cccae582430e2785","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Sorted Squares","order":13,"contentType":"PROBLEM","contentSlug":"sorted-squares","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_16db40717018b8b7830e43dddc41629a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Maximum Pair Sum Below Threshold","order":14,"contentType":"PROBLEM","contentSlug":"maximum-pair-sum-below-threshold","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_8650b38a95404871667b9c0019e9772e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Count Pairs Below Threshold","order":15,"contentType":"PROBLEM","contentSlug":"count-pairs-below-threshold","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_63a2a43074ec5cf7e5dfbf3aba42a6fb","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Rainfall Basin Accumulation","order":16,"contentType":"PROBLEM","contentSlug":"rainfall-basin-accumulation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_c15021bea8bb4cc7391cac401c92fe80","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Rescue Vessel Allocation","order":17,"contentType":"PROBLEM","contentSlug":"rescue-vessel-allocation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_63963a917ea81e24dab026432a8428c7","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Cyclic Chain Detection","order":18,"contentType":"PROBLEM","contentSlug":"cyclic-chain-detection","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_e62992d6e23acc6019f097742f8673df","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Circular List Entry Point","order":19,"contentType":"PROBLEM","contentSlug":"circular-list-entry-point","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_90a86717ad5f7dfc7e10cfd5e60fdbd8","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Rearrange Linked List","order":20,"contentType":"PROBLEM","contentSlug":"rearrange-linked-list","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_7e15ea895b22322b3008153a8ef667fd","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Symmetric Linked List","order":21,"contentType":"PROBLEM","contentSlug":"symmetric-linked-list","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_2a4f468580678bd9cee6f2cf24fdc0a6","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Linked List Center Node","order":22,"contentType":"PROBLEM","contentSlug":"linked-list-center-node","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_4bf5c32a0fd2651600c020c7e8c66fd0","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Remove Central Node from Linked List","order":23,"contentType":"PROBLEM","contentSlug":"remove-central-node-from-linked-list","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_5cc5c4badb453dfbc3ac45d4dec9fb3e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Tri-Value Partition","order":24,"contentType":"PROBLEM","contentSlug":"tri-value-partition","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_e45d9c2b589e7889c82714ffe6944af3","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Wave Pattern Rearrangement","order":25,"contentType":"PROBLEM","contentSlug":"wave-pattern-rearrangement","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_27ec81a7db8dda87d6697e3ca5a133c2","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Array Element Ordering","order":26,"contentType":"PROBLEM","contentSlug":"array-element-ordering","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_32753ffaa7bb1a6297b0fa2280f7028b","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Common Elements with Frequency","order":27,"contentType":"PROBLEM","contentSlug":"common-elements-frequency","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_d20324d7a096d572908b356ebe2ec3d4","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Smallest Shared Element in Sorted Arrays","order":28,"contentType":"PROBLEM","contentSlug":"smallest-shared-element","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_83d439774e1bf65e25939e232811ed4a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Maximum Symmetric Substring","order":29,"contentType":"PROBLEM","contentSlug":"maximum-symmetric-substring","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_c49d6b3256f65372bb35bd2586dfac95","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Minimum Palindrome Splits","order":30,"contentType":"PROBLEM","contentSlug":"minimum-palindrome-splits","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_fb696e728cce96325a8ab467783d7c88","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Symmetric Substring Count","order":31,"contentType":"PROBLEM","contentSlug":"symmetric-substring-count","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_f32f4bee2b595a8332f3fad7327a3b06","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Triple Palindrome Partition","order":32,"contentType":"PROBLEM","contentSlug":"triple-palindrome-partition","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_6e2854046f63e196de9e98df388ebc16","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 1: Two Pointers Techniques","sectionOrder":1,"title":"Optimal Disjoint Palindrome Selection","order":33,"contentType":"PROBLEM","contentSlug":"optimal-disjoint-palindrome-selection","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_7f44086c4f2beae6048f1f9aeb4eeca4","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"What Is a String?","order":1,"contentType":"LEARNING","contentSlug":"what-is-a-string","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.096Z","updatedAt":"2026-10-17T16:28:32.434Z","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_cca35d7e02ad2de5a974899b1fa579df","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"How Strings Are Represented (Conceptual View)","order":2,"contentType":"LEARNING","contentSlug":"how-strings-are-represented","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.096Z","updatedAt":"2026-10-17T16:28:32.434Z","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_70983b75813b19ee13240096a62dd742","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Permutation Substring Finder","order":3,"contentType":"VISUALIZER","contentSlug":"permutation-substring-finder","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.096Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_6f0bdf6b92d2f73e5d82a57f33f3d283","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Permutation Substring Finder","order":4,"contentType":"PROBLEM","contentSlug":"permutation-substring-finder","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_893e87c49d5335eea628d3bcc195f13d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Anagram Substring Detection","order":5,"contentType":"PROBLEM","contentSlug":"anagram-substring-detection","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_4488e8f7097fd6f44175f56188950b47","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Peak Window Average","order":6,"contentType":"PROBLEM","contentSlug":"peak-window-average","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_529b74dd9de8f47cacc24d5fad4502e0","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Qualifying Window Segments","order":7,"contentType":"PROBLEM","contentSlug":"qualifying-window-segments","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_c0cd8f2780b71046f74a7d32ee8912ee","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Peak Vowel Count in Window","order":8,"contentType":"PROBLEM","contentSlug":"peak-vowel-count-in-window","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_fcbf1f99e82683f33972035266c0ec75","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Minimum Tile Repaints","order":9,"contentType":"PROBLEM","contentSlug":"minimum-tile-repaints","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_3451de72af500f91198a1487e998b9f4","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Maximum Unique Window Sum","order":10,"contentType":"PROBLEM","contentSlug":"maximum-unique-window-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_c1659a7bca272efba2fd17f70f9c7a61","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Maximum Unique Substring Length","order":11,"contentType":"PROBLEM","contentSlug":"max-unique-substring-length","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_2c38b8cb0bdc055a406b77fea08cc189","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Smallest Covering Substring","order":12,"contentType":"PROBLEM","contentSlug":"smallest-covering-substring","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_46cdbd9bba093c1a8df4e2be60a70f20","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Max Length Window With Limited Unique Characters","order":13,"contentType":"PROBLEM","contentSlug":"max-length-window-with-limited-unique-chars","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_e465975faba68e04f65d0ec9d8078e18","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Bounded Unique Character Window","order":14,"contentType":"PROBLEM","contentSlug":"bounded-unique-character-window","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_e83a0870372f6ab02f8097bc3751cbcd","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Maximum Uniform Segment","order":15,"contentType":"PROBLEM","contentSlug":"maximum-uniform-segment","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.434Z","pages":[]},{"id":"seed_f9dc69c2c25682261e0c5a0b3cc6078d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Longest Continuous Segment with Modifications","order":16,"contentType":"PROBLEM","contentSlug":"longest-continuous-segment-with-modifications","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_5ca1b7558d57fc38a6abd5f796c9a754","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Maximum Matching Substring Within Budget","order":17,"contentType":"PROBLEM","contentSlug":"max-matching-substring-with-budget","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_1a53f97dad1d370ac531433b96943bfd","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Maximum Consecutive Ones After Removal","order":18,"contentType":"PROBLEM","contentSlug":"maximum-consecutive-ones-after-removal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_a38dac46d61c210f307a7170e5b20f55","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Maximize Uniform Signal Segment","order":19,"contentType":"PROBLEM","contentSlug":"maximize-uniform-signal-segment","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_11cfa321bbb62ef3b83b5f39a8eceadd","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Binary Segments With Target Sum","order":20,"contentType":"PROBLEM","contentSlug":"binary-segments-with-target-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_192951140c804eee87329d596bc5943a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"K Distinct Element Subarrays","order":21,"contentType":"PROBLEM","contentSlug":"k-distinct-element-subarrays","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_328e8f1807c04fcbf89e89a86ef7a637","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Qualifying Subarray Count","order":22,"contentType":"PROBLEM","contentSlug":"qualifying-subarray-count","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_9b8b3a4371fb28868e5055017120d8fa","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Complete Triplet Substring Count","order":23,"contentType":"PROBLEM","contentSlug":"complete-triplet-substring-count","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_4a1bf736c4774440ec3f92be2debd52a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 2: Sliding Window Patterns","sectionOrder":2,"title":"Full Spectrum Subarrays","order":24,"contentType":"PROBLEM","contentSlug":"full-spectrum-subarrays","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_af3225a561f61f684f840ad1f0439a6e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"The Search Problem — Formalization","order":1,"contentType":"LEARNING","contentSlug":"search-problem-formalization","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_9ea4474d68484d924b79146f4ff48e77","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Linear Search — The Baseline Search Algorithm","order":2,"contentType":"LEARNING","contentSlug":"linear-search-baseline","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_87ef20185664544b9cfa92a42b53607f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Rotated Array Search","order":3,"contentType":"VISUALIZER","contentSlug":"rotated-array-search","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_5e25bce0ab9c3d0b95c9789ef299d5b3","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Rotated Array Search","order":4,"contentType":"PROBLEM","contentSlug":"rotated-array-search","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_0197d8500ab8d2483c3032addf8e5b0b","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Sorted Array Position Finder","order":5,"contentType":"PROBLEM","contentSlug":"sorted-array-position-finder","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_c5c66e9d87bc5fd990c59216aa483c84","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Smallest Element in Cyclic Sorted Array","order":6,"contentType":"PROBLEM","contentSlug":"smallest-element-in-cyclic-sorted-array","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_27cabc0597b491fee95667e5c3c2d548","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"First Defective Release","order":7,"contentType":"PROBLEM","contentSlug":"first-defective-release","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_f88e73890941a67a04188a2d0da70c0d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Target Element Range","order":8,"contentType":"PROBLEM","contentSlug":"target-element-range","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_3f1877b0fbc02aede28f185539588d99","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Smallest Element in Rotated Duplicates Array","order":9,"contentType":"PROBLEM","contentSlug":"smallest-element-in-rotated-duplicates-array","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_fdaa469bfc562e22ac7b9053156a08c5","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Locate Local Maximum","order":10,"contentType":"PROBLEM","contentSlug":"locate-local-maximum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_100e8d40c15d74115f64af338f02f3a5","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Lone Element in Paired Sequence","order":11,"contentType":"PROBLEM","contentSlug":"lone-element-in-paired-sequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_7a4a5df5dc13a8d132bceaae7827c06d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Summit Position in Unimodal Sequence","order":12,"contentType":"PROBLEM","contentSlug":"summit-position-in-unimodal-sequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_dd1b8566e825deb930862df6f544a566","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Mountain Array Target Search","order":13,"contentType":"PROBLEM","contentSlug":"mountain-array-target-search","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_b5f6b2581f77dfd2eccfec9e9845b078","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Cyclic Shifted Array Lookup with Duplicates","order":14,"contentType":"PROBLEM","contentSlug":"cyclic-shifted-array-lookup-with-duplicates","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_e2cb189f6dbd609e5027f96105bc0451","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Optimal Workload Partitioning","order":15,"contentType":"PROBLEM","contentSlug":"optimal-workload-partitioning","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_6ae5c9d01b4e9e0a8bdae6e8f41774a4","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Minimize Largest Gap After Placements","order":16,"contentType":"PROBLEM","contentSlug":"minimize-largest-gap-after-placements","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_ee45036c87630a716e9ec9ebe2ac7a54","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Optimal Consumption Rate","order":17,"contentType":"PROBLEM","contentSlug":"optimal-consumption-rate","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_f9be048792482438d61a7bcd3f0ccc92","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Minimum Freight Capacity within Deadline","order":18,"contentType":"PROBLEM","contentSlug":"minimum-freight-capacity","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_ca117a14e7ef0957649a012c7f91916c","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Maximum Minimum Spacing","order":19,"contentType":"PROBLEM","contentSlug":"maximum-minimum-spacing","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_18d56e35ce47faa9fa63883ae5dd68e7","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Maximum Ascending Chain Length","order":20,"contentType":"PROBLEM","contentSlug":"maximum-ascending-chain-length","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_7600fae988ec38efad4cc5f72682de53","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 3: Binary Search Techniques","sectionOrder":3,"title":"Nested Container Stacking","order":21,"contentType":"PROBLEM","contentSlug":"nested-container-stacking","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_6c8c7232de458093703f275bf5c51804","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Batch Interval Modifier","order":1,"contentType":"VISUALIZER","contentSlug":"batch-interval-modifier","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_b430b93ecd62f604418c92e9fab80f6e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Batch Interval Modifier","order":2,"contentType":"PROBLEM","contentSlug":"batch-interval-modifier","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_5a3e2a4e19eb2486e7704a155d89c20b","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Cumulative Character Rotation","order":3,"contentType":"PROBLEM","contentSlug":"cumulative-character-rotation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_b1d4557a925b0a25eb9e8e8c411af52f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Shuttle Service Capacity Check","order":4,"contentType":"PROBLEM","contentSlug":"shuttle-service-capacity-check","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_fc463e00d69ac07de558a98f27bc2eda","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Aggregate Range Reservations","order":5,"contentType":"PROBLEM","contentSlug":"aggregate-range-reservations","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_162a02b12f9b7cc43443a691de903be0","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Smallest Absent Positive","order":6,"contentType":"PROBLEM","contentSlug":"smallest-absent-positive","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_f80c102b1c687d62e9405d89baffcf45","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Detect Absent Element","order":7,"contentType":"PROBLEM","contentSlug":"detect-absent-element","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_dee9e46cf7361486c3c275d175a0c1be","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Detect Repeating Element","order":8,"contentType":"PROBLEM","contentSlug":"detect-repeating-element","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_13322e06f297cd5a7e2206fe293e5027","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Missing Elements in Sequence","order":9,"contentType":"PROBLEM","contentSlug":"missing-elements-in-sequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_1ced7b074a7933e219b449de49c30e51","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Wave Pattern Arrangement","order":10,"contentType":"PROBLEM","contentSlug":"wave-pattern-arrangement","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_caefa86e4266ef1309795403cb9031bc","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Partition Evens Before Odds","order":11,"contentType":"PROBLEM","contentSlug":"partition-evens-before-odds","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_2f95d8ba149fa1d9e42adb1021a18081","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Parity Index Alignment","order":12,"contentType":"PROBLEM","contentSlug":"parity-index-alignment","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_974b359fce861a88e22b81ce84ca3791","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Spiral Grid Traversal","order":13,"contentType":"PROBLEM","contentSlug":"spiral-grid-traversal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_abff7543eb96b56ad0457975e479b068","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Generate Spiral Grid","order":14,"contentType":"PROBLEM","contentSlug":"generate-spiral-grid","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_3b7fd63f60f14e15ca1ed5458f8714ba","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Zigzag Matrix Walk","order":15,"contentType":"PROBLEM","contentSlug":"zigzag-matrix-walk","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_dfbfbbeadfe3a7ee57a5681cf0de8050","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Diagonal Consistency Matrix","order":16,"contentType":"PROBLEM","contentSlug":"diagonal-consistency-matrix","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_16db156e5ab6a5886b690d17f7d04b3f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Diagonal Matrix Ordering","order":17,"contentType":"PROBLEM","contentSlug":"diagonal-matrix-ordering","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_f90c26030f5cd44023f65226f469bfdc","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Anti-Diagonal Matrix Traversal","order":18,"contentType":"PROBLEM","contentSlug":"anti-diagonal-matrix-traversal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_aa31255f3a0e43474e6395c71ee27b44","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Anagram Clustering","order":19,"contentType":"PROBLEM","contentSlug":"anagram-clustering","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_d59dd66fe8c10398cea7a3e5b596972e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Cyclic Character Equivalence","order":20,"contentType":"PROBLEM","contentSlug":"cyclic-character-equivalence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_22d9ed58adb69cbe82b746e36624c4da","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Duplicate File Detector","order":21,"contentType":"PROBLEM","contentSlug":"duplicate-file-detector","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_0087fcc4b5df8df4856143657b3566b7","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Partition Members by Team Capacity","order":22,"contentType":"PROBLEM","contentSlug":"partition-members-by-team-capacity","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_8a02a6025e2c89065e5c543438f12561","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Letter Composition Validator","order":23,"contentType":"PROBLEM","contentSlug":"letter-composition-validator","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_e867d59f6e2f31a77d3619fadee17269","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Locate First Singular Character","order":24,"contentType":"PROBLEM","contentSlug":"locate-first-singular-character","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_5cb151a1a14e3d393528523d6f92275a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Spot the Extra Character","order":25,"contentType":"PROBLEM","contentSlug":"spot-the-extra-character","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_a0564b270024bf20db35220c9f3bfda1","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Maximum Palindrome Construction Length","order":26,"contentType":"PROBLEM","contentSlug":"max-palindrome-construction","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_bbc9243f9e1e3903198f637652d832ab","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Treasure Stone Counter","order":27,"contentType":"PROBLEM","contentSlug":"treasure-stone-counter","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_df2ce7f688a3952f1f5e671c909bb7fe","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Shared Letters Extraction","order":28,"contentType":"PROBLEM","contentSlug":"shared-letters-extraction","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_78d88fc5242f530e9bee7b69162f1635","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Constructible Words from Character Pool","order":29,"contentType":"PROBLEM","contentSlug":"constructible-words-from-character-pool","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_fcbf7f7df55d73b81e0c2662b4487854","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Uniform Character Frequency","order":30,"contentType":"PROBLEM","contentSlug":"uniform-character-frequency","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_de51333f01c4226136d7bfb35039a7de","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Substring Position Finder","order":31,"contentType":"PROBLEM","contentSlug":"substring-position-finder","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_cb93d68f284e08bada1aa64b07936cdb","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Cyclic Pattern Detection","order":32,"contentType":"PROBLEM","contentSlug":"cyclic-pattern-detection","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_48c06882746ca2ad138bac2516fc3fae","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Subsequence Validator","order":33,"contentType":"PROBLEM","contentSlug":"subsequence-validator","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_012e1fd2254db76f8f668ec80dfa6bca","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Shortest Covering Substring for Subsequence","order":34,"contentType":"PROBLEM","contentSlug":"shortest-covering-substring-for-subsequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_aede66dd340cbf8ec96ce78a53260119","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"String Segmentation","order":35,"contentType":"PROBLEM","contentSlug":"string-segmentation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_6036c08a85a7f9119c27bbc24cf4fd75","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Dictionary Sentence Formation","order":36,"contentType":"PROBLEM","contentSlug":"dictionary-sentence-formation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_e059b124b96ea86d5eee65eb36e54586","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Minimum Leftover Characters","order":37,"contentType":"PROBLEM","contentSlug":"minimum-leftover-characters","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_0d34d37bc36ce2819df4e52ee7b99061","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 4: Array & String Manipulation","sectionOrder":4,"title":"Pair Target Sum","order":38,"contentType":"PROBLEM","contentSlug":"pair-target-sum","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_a0b5eee4c6f4f02327c9d3e08e54b932","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"What Is a Stack? Real-World Intuition","order":1,"contentType":"LEARNING","contentSlug":"what-is-a-stack","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_9def8f5b56f2ab7ed8b07ddab69976d8","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Stack as an Abstract Data Type (ADT)","order":2,"contentType":"LEARNING","contentSlug":"stack-as-abstract-data-type","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_0ffd0a65b20894303125da91267c7317","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Smallest Element Tracker Stack","order":3,"contentType":"VISUALIZER","contentSlug":"smallest-element-tracker-stack","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_a0fc282df89d91eb03aef6290ffaffdc","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Smallest Element Tracker Stack","order":4,"contentType":"PROBLEM","contentSlug":"smallest-element-tracker-stack","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_eb5afca9ce66b92a649f64b19ab7a132","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Maximum Tracking Stack","order":5,"contentType":"PROBLEM","contentSlug":"maximum-tracking-stack","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_98f8216e3ab5ad93c70cb5bed9ceecc2","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Streaming Price Dominance Tracker","order":6,"contentType":"PROBLEM","contentSlug":"streaming-price-dominance-tracker","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_98f14108946ce0b876e7faacb9ae3e90","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Incrementable Capacity Stack","order":7,"contentType":"PROBLEM","contentSlug":"incrementable-capacity-stack","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_3bb93b432f0d7871b0d6617d989310df","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Maximum Balanced Bracket Sequence","order":8,"contentType":"PROBLEM","contentSlug":"maximum-balanced-bracket-sequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_a6ada23aef45cfee241c49addf1b39fe","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Nested Bracket Scoring","order":9,"contentType":"PROBLEM","contentSlug":"nested-bracket-scoring","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_b7aa096b61625fd8b958cdf8954c9084","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Deepest Bracket Level","order":10,"contentType":"PROBLEM","contentSlug":"deepest-bracket-level","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_d3cefc45b1614b76d67ca56a1b0fa909","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Maximum Rectangular Area","order":11,"contentType":"PROBLEM","contentSlug":"maximum-rectangular-area","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_5947b3eadb1ad47552794f3a5b281227","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Next Warmer Day Distance","order":12,"contentType":"PROBLEM","contentSlug":"next-warmer-day-distance","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_8206e33b95f09aa197733582f4f60fe9","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Eliminate Consecutive Twins","order":13,"contentType":"PROBLEM","contentSlug":"eliminate-consecutive-twins","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_ee7fc89e32df3985416fd318084bddb2","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Consecutive Character Collapse","order":14,"contentType":"PROBLEM","contentSlug":"consecutive-character-collapse","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_9ff9026acc3bfb0d11944a5c2ca66183","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Bounded Gap Subsequence Maximum","order":15,"contentType":"PROBLEM","contentSlug":"bounded-gap-subsequence-maximum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_9e504990594e6b880ada957bfcf60f97","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 5: Stack-Based Patterns","sectionOrder":5,"title":"Bounded Leap Max Score","order":16,"contentType":"PROBLEM","contentSlug":"bounded-leap-max-score","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_339c1ffb68e8196e5813680709399a42","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 6: Linked List Patterns","sectionOrder":6,"title":"Why Linked Lists? Limitations of Arrays","order":1,"contentType":"LEARNING","contentSlug":"why-linked-lists","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_cab2b4e9d8c673b0e376637fcc70b099","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 6: Linked List Patterns","sectionOrder":6,"title":"What Is a Linked List?","order":2,"contentType":"LEARNING","contentSlug":"what-is-a-linked-list","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_6c09210c36d5e320e12a94ea8d14ea06","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 6: Linked List Patterns","sectionOrder":6,"title":"Combine Ordered Sequences","order":3,"contentType":"VISUALIZER","contentSlug":"combine-ordered-sequences","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_c40fdc7694c20c98b910f905baf7fa96","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 6: Linked List Patterns","sectionOrder":6,"title":"Combine Ordered Sequences","order":4,"contentType":"PROBLEM","contentSlug":"combine-ordered-sequences","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_975c629f106810978db41db9ec794385","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 6: Linked List Patterns","sectionOrder":6,"title":"Combine Sorted Sequences","order":5,"contentType":"PROBLEM","contentSlug":"combine-sorted-sequences","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_a0c08efbcbb81fb283d0ecb788b9e1b0","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 6: Linked List Patterns","sectionOrder":6,"title":"Linked List Sort","order":6,"contentType":"PROBLEM","contentSlug":"linked-list-sort","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_0d0b2b601905a3f3e0726b3ceb5edd33","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 6: Linked List Patterns","sectionOrder":6,"title":"Adjacent Node Exchange","order":7,"contentType":"PROBLEM","contentSlug":"adjacent-node-exchange","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_2f89b71b7b1ac289258d8d01aa35b407","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 6: Linked List Patterns","sectionOrder":6,"title":"K-Segment List Reversal","order":8,"contentType":"PROBLEM","contentSlug":"k-segment-list-reversal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_5d075e8824cec7e00bc0b580cc35d6eb","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 6: Linked List Patterns","sectionOrder":6,"title":"Linked List Number Addition","order":9,"contentType":"PROBLEM","contentSlug":"linked-list-number-addition","description":null,"estimatedMins":30,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_d772e628541148d8460374b272b40459","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 7: Heap & Priority Queue","sectionOrder":7,"title":"Priority Queues Revisited — Now with Implementation","order":1,"contentType":"LEARNING","contentSlug":"priority-queues-revisited","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_e46db410ca7ec2572b85feda32376a69","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 7: Heap & Priority Queue","sectionOrder":7,"title":"Complete Binary Trees — The Foundation of Array-Based Heaps","order":2,"contentType":"LEARNING","contentSlug":"complete-binary-tree-representation","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_3bad020b359153eb9fc7c35fde1431dc","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 7: Heap & Priority Queue","sectionOrder":7,"title":"Find Kth Ranked Element","order":3,"contentType":"VISUALIZER","contentSlug":"find-kth-ranked-element","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_6894a50046d823830ecd8e0c9087fe7f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 7: Heap & Priority Queue","sectionOrder":7,"title":"Find Kth Ranked Element","order":4,"contentType":"PROBLEM","contentSlug":"find-kth-ranked-element","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_f939fb61b359fe80dececfa4074fd0a3","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 7: Heap & Priority Queue","sectionOrder":7,"title":"Kth Order Element in Doubly Sorted Grid","order":5,"contentType":"PROBLEM","contentSlug":"kth-order-element-in-doubly-sorted-grid","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_74f33aaab7abcb7afb5af820f8f4df38","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 7: Heap & Priority Queue","sectionOrder":7,"title":"K Nearest Values","order":6,"contentType":"PROBLEM","contentSlug":"k-nearest-values","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_befb5e3d6af3bdf89d327d104c81dfaf","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 7: Heap & Priority Queue","sectionOrder":7,"title":"Streaming Kth Highest Tracker","order":7,"contentType":"PROBLEM","contentSlug":"streaming-kth-highest-tracker","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_c36a0569683fa1fcb4e7efe0a9973ed7","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 7: Heap & Priority Queue","sectionOrder":7,"title":"K Most Common Elements","order":8,"contentType":"PROBLEM","contentSlug":"k-most-common-elements","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_d03d93faafd7ff97ce6213e91e71f364","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 7: Heap & Priority Queue","sectionOrder":7,"title":"Frequency-Based Character Ordering","order":9,"contentType":"PROBLEM","contentSlug":"frequency-based-character-ordering","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_7487ce139f28f0e0fe8478b754ab10a3","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Why Trees? Limitations of Linear Structures","order":1,"contentType":"LEARNING","contentSlug":"why-trees-limitations-of-linear-structures","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_761b172dcf254392d58ccb1885f08cb5","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Tree Properties — Height, Depth, Levels","order":2,"contentType":"LEARNING","contentSlug":"tree-properties-height-depth-levels","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_fe63e570028944f69e1fba90ef180f92","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Layer-by-Layer Binary Tree Values","order":3,"contentType":"VISUALIZER","contentSlug":"layer-by-layer-binary-tree-values","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_431136787fd65f4b837d8ed9bf25f413","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Layer-by-Layer Binary Tree Values","order":4,"contentType":"PROBLEM","contentSlug":"layer-by-layer-binary-tree-values","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_fae3b4aa15bb4c00e5433f77295edc80","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Alternating Level Traversal","order":5,"contentType":"PROBLEM","contentSlug":"alternating-level-traversal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_117a0a49db7b684c404f9ebac066414a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Binary Tree Height","order":6,"contentType":"PROBLEM","contentSlug":"binary-tree-height","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_acfa117d0955199e47623e121d46522c","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Reverse Level Order Tree Traversal","order":7,"contentType":"PROBLEM","contentSlug":"reverse-level-order-tree-traversal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_3f35f4d67426ebc2e792f215f8c42d71","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Shortest Path to Tree Leaf","order":8,"contentType":"PROBLEM","contentSlug":"shortest-path-to-tree-leaf","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_c7d883e98f994a19d40aea6cae328e55","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Rightmost Level Nodes","order":9,"contentType":"PROBLEM","contentSlug":"rightmost-level-nodes","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_101711a3a2f01360a667df3dab069ed3","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Multi-Child Tree Layer Traversal","order":10,"contentType":"PROBLEM","contentSlug":"multi-child-tree-layer-traversal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_763cb9478895bcfa86457b351dd79ccf","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Maximum Value Per Binary Tree Level","order":11,"contentType":"PROBLEM","contentSlug":"maximum-value-per-binary-tree-level","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_a1bc937d814d32421a1ed07d557af8cb","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Level Mean Values","order":12,"contentType":"PROBLEM","contentSlug":"level-mean-values","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_38614c376f88027eefbdcd642caa2529","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Peak Depth Value in Tree","order":13,"contentType":"PROBLEM","contentSlug":"peak-depth-value-in-tree","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_fd7d920e8c69862368a9fdb185cb1b47","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Lowest Level Node Aggregation","order":14,"contentType":"PROBLEM","contentSlug":"lowest-level-node-aggregation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_01c23a1933375e92fe9252b88f09cf5a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Binary Tree Longest Path","order":15,"contentType":"PROBLEM","contentSlug":"binary-tree-longest-path","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_ea5ca378e44de1a7e9f1eaab263d07b5","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"N-ary Tree Height","order":16,"contentType":"PROBLEM","contentSlug":"nary-tree-height","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_0982c5d32fdfce5fdc1031ca2bcce4a0","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Identical Binary Trees","order":17,"contentType":"PROBLEM","contentSlug":"identical-binary-trees","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_2d9e2a1877dba70f1de83cf7e73d5dd1","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Mirror Tree Validation","order":18,"contentType":"PROBLEM","contentSlug":"mirror-tree-validation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_05cfa2e6493a064b2c0f5de8e33cbd08","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Height-Balanced Tree Verification","order":19,"contentType":"PROBLEM","contentSlug":"height-balanced-tree-check","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_00f6b5656a53363affc42d76f424fcb5","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Embedded Tree Detection","order":20,"contentType":"PROBLEM","contentSlug":"embedded-tree-detection","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_dcd25f9bd29f71944399eeac54b45f22","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Mirror Equivalent Binary Trees","order":21,"contentType":"PROBLEM","contentSlug":"mirror-equivalent-binary-trees","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_78acb6afb2fe5ad466dcf90e5a90aa8d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Rebuild Binary Tree from Preorder and Inorder Traversals","order":22,"contentType":"PROBLEM","contentSlug":"rebuild-tree-from-traversals","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_65d34c35fb9c6358c118dc336650adbb","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Reconstruct Tree from Preorder and Postorder Sequences","order":23,"contentType":"PROBLEM","contentSlug":"reconstruct-tree-from-traversals","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_5716848c123dd4e9528b99857254b1fa","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Verify BST Integrity","order":24,"contentType":"PROBLEM","contentSlug":"verify-bst-integrity","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_756a32a520161f858897ab404bbf810d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Restore Corrupted Binary Search Tree","order":25,"contentType":"PROBLEM","contentSlug":"restore-corrupted-bst","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_1b9340e4e74f46ce8b1b537e2b1c9388","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"BST Rank Finder","order":26,"contentType":"PROBLEM","contentSlug":"bst-rank-finder","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_704871769c0455251408997b00b84ee7","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"BST Most Frequent Values","order":27,"contentType":"PROBLEM","contentSlug":"bst-most-frequent-values","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_398310d5386ad939c49a5555cb9e1e7e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Closest Value Gap in Search Tree","order":28,"contentType":"PROBLEM","contentSlug":"closest-value-gap-in-search-tree","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_5bc4f3a90179b4a8c77d8e3d20f9ce4d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Smallest Value Gap in Binary Search Tree","order":29,"contentType":"PROBLEM","contentSlug":"smallest-value-gap-in-binary-search-tree","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_38276617d5af9583e8f65a26cd3f2e2a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Ascending BST Reorganization","order":30,"contentType":"PROBLEM","contentSlug":"ascending-bst-reorganization","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_4050239acb286fdf3bb60a4994e5d924","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Binary Tree Bounded Sum","order":31,"contentType":"PROBLEM","contentSlug":"binary-tree-bounded-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_3b4d6db93f259f9b4fc8f84d2acde1eb","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Inorder Tree Values","order":32,"contentType":"PROBLEM","contentSlug":"inorder-tree-values","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_22826b4ce1751b029102e718000a0807","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Target Sum Paths","order":33,"contentType":"PROBLEM","contentSlug":"target-sum-paths","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_c58d64a667f54497a8d5d97ddfb4eb76","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Aggregate Path Numbers in Binary Tree","order":34,"contentType":"PROBLEM","contentSlug":"aggregate-path-numbers","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_e1ff05e63016085e61148e02ad0a3216","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Tree Root-to-Leaf Paths","order":35,"contentType":"PROBLEM","contentSlug":"tree-root-to-leaf-paths","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_e7d3cfbf06f27b1b06ad8a8a7bfb06df","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Lexicographically Minimal Leaf-to-Root String","order":36,"contentType":"PROBLEM","contentSlug":"lexicographically-minimal-leaf-to-root-string","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_be7abb314c52eb90b911039910ea2d6f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Rearrangeable Palindrome Root-to-Leaf Paths","order":37,"contentType":"PROBLEM","contentSlug":"rearrangeable-palindrome-paths","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_a4977976243dfc42744543ed4782fa05","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Optimal Tree Route Sum","order":38,"contentType":"PROBLEM","contentSlug":"optimal-tree-route-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_cd26f6bfa158c1c04120be32ec612e86","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Tree Balance Metric","order":39,"contentType":"PROBLEM","contentSlug":"tree-balance-metric","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_fdb35ff35ef94f1a3aef3fd8088fe765","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Maximum Uniform Path","order":40,"contentType":"PROBLEM","contentSlug":"maximum-uniform-path","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_13a932f4133a74dbad91645dbc154717","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Tree Column Traversal","order":41,"contentType":"PROBLEM","contentSlug":"tree-column-traversal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_727319f4aa6152347cac97d836d7f10c","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 8: Tree Traversal & Manipulation","sectionOrder":8,"title":"Columnar Tree Traversal","order":42,"contentType":"PROBLEM","contentSlug":"columnar-tree-traversal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_a545ad5c534c1c116e33b508ba5c5a47","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Why Graphs? Real-World Networks","order":1,"contentType":"LEARNING","contentSlug":"why-graphs","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_8f751679065b97d6239d604a2ffc05a2","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"What Is a Graph? Definition & Terminology","order":2,"contentType":"LEARNING","contentSlug":"graph-definition-terminology","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_d63230a4cf93ef33f387633e2261f524","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Capture Enclosed Territory","order":3,"contentType":"VISUALIZER","contentSlug":"capture-enclosed-territory","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_f73177a99666e00bb2321f26179b454a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Capture Enclosed Territory","order":4,"contentType":"PROBLEM","contentSlug":"capture-enclosed-territory","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_fd3dd785285506d281ccc8a8ceaf6753","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Count Connected Landmasses","order":5,"contentType":"PROBLEM","contentSlug":"count-connected-landmasses","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_b8abacdd21879660121e34bee64e9697","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Dual Ocean Drainage Cells","order":6,"contentType":"PROBLEM","contentSlug":"dual-ocean-drainage-cells","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_1d927ba7a92941f6df87e651074eb09e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Landmass Boundary Length","order":7,"contentType":"PROBLEM","contentSlug":"landmass-boundary-length","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_2bd8ac157c2e8f814350fe836a92a74c","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Minefield Explorer","order":8,"contentType":"PROBLEM","contentSlug":"minefield-explorer","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_cb127134ad1b45df24baccd3148596f1","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Largest Connected Land Region","order":9,"contentType":"PROBLEM","contentSlug":"largest-connected-land-region","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_daaae1420504c34758f2f562b2e978db","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Region Color Propagation","order":10,"contentType":"PROBLEM","contentSlug":"region-color-propagation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_80c47500f5dc599da3d1d838b9317526","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Count Isolated Land Cells","order":11,"contentType":"PROBLEM","contentSlug":"count-isolated-land-cells","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_e0b5b052675492fca8ac0d3e1eacfeac","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Count Enclosed Land Regions","order":12,"contentType":"PROBLEM","contentSlug":"count-enclosed-land-regions","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_3ee3a000ac3385bc6218e52ae58993ac","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Contained Region Count","order":13,"contentType":"PROBLEM","contentSlug":"contained-region-count","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_a9532d84ea38062b0cb8d7f4b96a0957","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Unique Landmass Shapes","order":14,"contentType":"PROBLEM","contentSlug":"unique-landmass-shapes","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_6050dc32a559fb015b601e8f89a6943f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Canonical Island Shapes","order":15,"contentType":"PROBLEM","contentSlug":"canonical-island-shapes","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_3d52f10023bc69752dbde7db97b8b02d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Infection Spread Simulation","order":16,"contentType":"PROBLEM","contentSlug":"infection-spread-simulation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_f504c82ff675caa03846a58067bc73ca","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Nearest Zero Distance","order":17,"contentType":"PROBLEM","contentSlug":"nearest-zero-distance","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_e1568709f6218790721c1748ba9dab19","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Maximum Ocean Distance","order":18,"contentType":"PROBLEM","contentSlug":"maximum-ocean-distance","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_d0636f8fb4029edc47e0973ed6070067","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Terrain Elevation Grid","order":19,"contentType":"PROBLEM","contentSlug":"terrain-elevation-grid","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_70f3a31f8f0dd21590b9d6d568bbb589","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Vocabulary Chain Transformation","order":20,"contentType":"PROBLEM","contentSlug":"vocabulary-chain-transformation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_c17c2c89d7207e1672e3d119f74a14b6","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Minimum Square Sum Decomposition","order":21,"contentType":"PROBLEM","contentSlug":"minimum-square-sum-decomposition","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_c301bd9bc78b4316a0bdc2b6dbaced76","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Minimum DNA Sequence Transformations","order":22,"contentType":"PROBLEM","contentSlug":"minimum-dna-sequence-transformations","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_93a2e5de97c5278714d5ed1a1d361337","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Combination Lock Solver","order":23,"contentType":"PROBLEM","contentSlug":"combination-lock-solver","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_03859f5d2b2fcf20e101904985d2f8fa","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Tile Shuffle Puzzle","order":24,"contentType":"PROBLEM","contentSlug":"tile-shuffle-puzzle","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_f3af4fdf80355aefdc5af45f522b3763","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Minimum Swap Distance","order":25,"contentType":"PROBLEM","contentSlug":"minimum-swap-distance","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_7acea26c1f049d4823073e86d2af78f4","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Minimum Path in Binary Grid","order":26,"contentType":"PROBLEM","contentSlug":"minimum-path-binary-grid","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.337Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_747b040b0e1c42a8e206639291b3d4b1","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Grid Navigation with Obstacle Removal","order":27,"contentType":"PROBLEM","contentSlug":"grid-navigation-with-obstacle-removal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_93bbb88aaa80d8be44041243970333b2","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Array Teleportation Jumps","order":28,"contentType":"PROBLEM","contentSlug":"array-teleportation-jumps","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_4a629f27cd4446abee5b34217f51a3c1","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Minimum Direction Changes for Grid Navigation","order":29,"contentType":"PROBLEM","contentSlug":"minimum-direction-changes-grid-navigation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_b84f4fc571f7f309d9e5592dc887338b","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 9: Graph BFS Patterns","sectionOrder":9,"title":"Minimum Barrier Clearance to Destination","order":30,"contentType":"PROBLEM","contentSlug":"minimum-barrier-clearance-to-destination","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_041e446b88905c4f71aafe58b3e596f9","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Graph Traversal Overview","order":1,"contentType":"LEARNING","contentSlug":"graph-traversal-overview","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_27bb839546a195b5e4702b5d23707319","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Depth-First Search (DFS) — Algorithm & Applications","order":2,"contentType":"LEARNING","contentSlug":"dfs-algorithm-and-applications","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_4118900ad89b50a86312a19633cb82be","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Task Dependency Validator","order":3,"contentType":"VISUALIZER","contentSlug":"task-dependency-validator","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_e599d2202a95ccdb84ee5bdd216a1641","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Task Dependency Validator","order":4,"contentType":"PROBLEM","contentSlug":"task-dependency-validator","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_44984b8c4d8d4431fe786e52f338e3d5","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Task Execution Order","order":5,"contentType":"PROBLEM","contentSlug":"task-execution-order","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_df3bb428ba89aaba43637aacb0dab3ec","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Safe Destination Nodes","order":6,"contentType":"PROBLEM","contentSlug":"safe-destination-nodes","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_310819da1e99200f5a167e4824e09815","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Two-Set Graph Partition","order":7,"contentType":"PROBLEM","contentSlug":"two-set-graph-partition","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_2913207f1b4ab6bfbcd526e41ecb19da","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Group Division Feasibility","order":8,"contentType":"PROBLEM","contentSlug":"group-division-feasibility","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_6dcc6008fe684ac489e4bdc20f6a5066","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Optimal Graph Layering","order":9,"contentType":"PROBLEM","contentSlug":"optimal-graph-layering","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_aad785a48dbd9870ae6371f58caf2855","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Connected City Regions","order":10,"contentType":"PROBLEM","contentSlug":"connected-city-regions","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_02add0dd08a1e4558b7a7dcc0294cf4b","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Undirected Graph Tree Validation","order":11,"contentType":"PROBLEM","contentSlug":"undirected-graph-tree-validation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_64485595a3cae05f7cfd70fa01f5b362","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Cycle Forming Edge Detection","order":12,"contentType":"PROBLEM","contentSlug":"cycle-forming-edge-detection","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_670e8015fa7897dc5b9e0c693b77b73a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Foreign Alphabet Order","order":13,"contentType":"PROBLEM","contentSlug":"foreign-alphabet-order","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_d87e7f80934798b4adaab50bb8fd05b4","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Unique Ordering Verification","order":14,"contentType":"PROBLEM","contentSlug":"unique-ordering-verification","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_74cd15faa4dd84dfc68ae6136c0c0fed","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Quietest Wealthier Connection","order":15,"contentType":"PROBLEM","contentSlug":"quietest-wealthier-connection","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_9e235e3594fa69a48de7a5ac2663293d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Minimum Study Terms","order":16,"contentType":"PROBLEM","contentSlug":"minimum-study-terms","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_83dd7bbd9f68f250a80a6ba2f3e9dc54","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Dependency Reachability Queries","order":17,"contentType":"PROBLEM","contentSlug":"dependency-reachability-queries","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_96ac2654f53020a817cab1b61a4f12a8","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Maximum Color Frequency in DAG Paths","order":18,"contentType":"PROBLEM","contentSlug":"maximum-color-frequency-in-dag-paths","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_4d997b7c75a5a0f74fcf85c27b11e234","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Minimum Project Completion Time","order":19,"contentType":"PROBLEM","contentSlug":"minimum-project-completion-time","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_66a93cab1465bb84d11f20b6e4a1db61","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Craftable Items From Inventory","order":20,"contentType":"PROBLEM","contentSlug":"craftable-items-from-inventory","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_d9ac8f6d0841747a89407f8333bb77dc","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Deep Copy Network","order":21,"contentType":"PROBLEM","contentSlug":"deep-copy-network","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_cb85d30140e5539fd640a69a881ea0c5","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Duplicate Linked List with Arbitrary Links","order":22,"contentType":"PROBLEM","contentSlug":"duplicate-linked-list-with-arbitrary-links","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_c5d5a814e1635301df28195845653be9","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"N-ary Tree Duplication","order":23,"contentType":"PROBLEM","contentSlug":"nary-tree-duplication","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_4a8f5ef44ef13df2d86d27caa8ebad26","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Signal Propagation Time","order":24,"contentType":"PROBLEM","contentSlug":"signal-propagation-time","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_bdfa14e972576356d9b7a087d8e6ce65","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Highest Success Route","order":25,"contentType":"PROBLEM","contentSlug":"highest-success-route","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_5f76a5e991e6b0e4042e4d369d21f16b","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Minimum Exertion Path","order":26,"contentType":"PROBLEM","contentSlug":"minimum-exertion-path","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_2be3e3170e0a2ad182d82489fa862ac9","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Shortest Route Count","order":27,"contentType":"PROBLEM","contentSlug":"shortest-route-count","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_ef86f4f362625ec717cc71b373bd473d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Flood Navigation Minimum Time","order":28,"contentType":"PROBLEM","contentSlug":"flood-navigation-minimum-time","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_5e66abc12a90ed1357f92d84a6ac9a4a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Minimum Cost Network Infrastructure","order":29,"contentType":"PROBLEM","contentSlug":"minimum-cost-network-infrastructure","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_3c62b196954c457fb52242d1facf8d6e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Minimum Community Utility Cost","order":30,"contentType":"PROBLEM","contentSlug":"minimum-community-utility-cost","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_8d8d9a6f45b7ed9e3e86ad97d045b4df","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Minimum Network Cost","order":31,"contentType":"PROBLEM","contentSlug":"minimum-network-cost","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_b1435058e360315a14c1a1cab3196eb7","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Flight Route Planner","order":32,"contentType":"PROBLEM","contentSlug":"flight-route-planner","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_56bdcf3094cb6a20398dee1c35e42a62","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 10: Graph DFS & Advanced Patterns","sectionOrder":10,"title":"Chained Segment Ordering","order":33,"contentType":"PROBLEM","contentSlug":"chained-segment-ordering","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_bb526a9790acbceb42d938436ce9777f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"What Is a Greedy Algorithm?","order":1,"contentType":"LEARNING","contentSlug":"what-is-greedy-algorithm","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_764b3901e39029ba077f095d5e7c0e19","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"The Greedy Choice Property — Foundation of Greedy Algorithms","order":2,"contentType":"LEARNING","contentSlug":"greedy-choice-property","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_d458b0ed6938901d73a17e5b07d41899","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Optimal Contiguous Subarray Sum","order":3,"contentType":"VISUALIZER","contentSlug":"optimal-contiguous-subarray-sum","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_d2a7df74bb28ac456567f00257729d39","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Optimal Contiguous Subarray Sum","order":4,"contentType":"PROBLEM","contentSlug":"optimal-contiguous-subarray-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_69c9fcc40cc7e79ebcf7a52b8ce7cd61","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Optimal Single Trade Profit","order":5,"contentType":"PROBLEM","contentSlug":"optimal-single-trade-profit","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_9a305024b5c1abdf7d35b54caf3d3c1b","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Circular Array Maximum Subarray Sum","order":6,"contentType":"PROBLEM","contentSlug":"circular-array-max-subarray-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_e5470b9e739705029a3f30c03e88e284","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Optimal Landmark Pair","order":7,"contentType":"PROBLEM","contentSlug":"optimal-landmark-pair","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_191cbccb775ef75bcd0d4376e69e5416","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Maximize Trading Gains","order":8,"contentType":"PROBLEM","contentSlug":"maximize-trading-gains","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_bf2479d9bdfafb643ffe8572810eab78","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Circular Route Fuel Station","order":9,"contentType":"PROBLEM","contentSlug":"circular-route-fuel-station","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_95a8b5ece0d59b5b5972b32c06ad088c","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Maximum Sortable Partitions","order":10,"contentType":"PROBLEM","contentSlug":"maximum-sortable-partitions","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_b3804dc92f7c841ae00a0a2121af2346","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Minimum Hops to Destination","order":11,"contentType":"PROBLEM","contentSlug":"minimum-hops-to-destination","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_17c168a8607f7065749d2e6e32d308d7","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Destination Reachability","order":12,"contentType":"PROBLEM","contentSlug":"destination-reachability","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_402ce6bfa745d6c333712ed399c9c88c","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Minimum Interval Coverage","order":13,"contentType":"PROBLEM","contentSlug":"minimum-interval-coverage","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_317c3e0cb73a9e2817af70ab411b28eb","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Optimal Sprinkler Coverage","order":14,"contentType":"PROBLEM","contentSlug":"optimal-sprinkler-coverage","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_2e872e43332846c2c07ebc069795a337","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Minimum Interval Removals","order":15,"contentType":"PROBLEM","contentSlug":"minimum-interval-removals","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_a30d4aab705acde47ca7505fd3f37486","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Minimum Darts to Pop Intervals","order":16,"contentType":"PROBLEM","contentSlug":"minimum-darts-to-pop-intervals","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_6ce4186370e8a5caecd84494f1202dc3","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Longest Interval Sequence","order":17,"contentType":"PROBLEM","contentSlug":"longest-interval-sequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_c5fd20872b24634b50255c99fb592659","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Spaced Character Rearrangement","order":18,"contentType":"PROBLEM","contentSlug":"spaced-character-rearrangement","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_cd8035183e6b18490f166251d773422a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"CPU Operation Scheduler with Cooldown","order":19,"contentType":"PROBLEM","contentSlug":"cpu-operation-scheduler-with-cooldown","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_2ca117601de0bd0da332ced0a5eed9b0","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Adjacent Character Separator","order":20,"contentType":"PROBLEM","contentSlug":"adjacent-character-separator","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_acfc61ce7bffa4c4990f025008ded2b0","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Non-Adjacent Element Rearrangement","order":21,"contentType":"PROBLEM","contentSlug":"non-adjacent-element-rearrangement","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_673b0922133d004e42de0c395f24340f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Maximum Balanced Sequence","order":22,"contentType":"PROBLEM","contentSlug":"maximum-balanced-sequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_9848fd16469b3a1b6c23eb0b4965d027","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Final Boulder Mass","order":23,"contentType":"PROBLEM","contentSlug":"final-boulder-mass","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_29f1729914fb32747383672b1568c3a5","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Minimum Rope Concatenation Cost","order":24,"contentType":"PROBLEM","contentSlug":"minimum-rope-concatenation-cost","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_e2f8eaec57f4542a1cf80c28c89ada2f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Optimal Workforce Allocation","order":25,"contentType":"PROBLEM","contentSlug":"optimal-workforce-allocation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_e258437dc76eaabef6036e776f44e549","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Merge Operations to Reach Minimum Bound","order":26,"contentType":"PROBLEM","contentSlug":"merge-operations-to-reach-minimum-bound","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_c7bc5d2fa2ff8b93b2f73c41defd6462","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Simple Prime Factor Check","order":27,"contentType":"PROBLEM","contentSlug":"simple-prime-factor-check","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_32712c2d30835a491c45997f46e6978f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Maximum Product Partition","order":28,"contentType":"PROBLEM","contentSlug":"maximum-product-partition","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_8189b31ebd070cd0feb560068e777474","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Minimum Test Subjects","order":29,"contentType":"PROBLEM","contentSlug":"minimum-test-subjects","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_299644e24e4b221044af4d8d5a0b8216","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Smallest Digit Product Number","order":30,"contentType":"PROBLEM","contentSlug":"smallest-digit-product-number","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_c50f1d264000413840fb39c7013b9047","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 11: Greedy Algorithms","sectionOrder":11,"title":"Minimal Text Replication","order":31,"contentType":"PROBLEM","contentSlug":"minimal-text-replication","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_c9c862b0617b0dde1c086da2f3a3e73f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"What Is Backtracking?","order":1,"contentType":"LEARNING","contentSlug":"what-is-backtracking","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_c25e5cdbbcc35b6bde66045966c3209e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Backtracking vs Brute Force: Understanding the Distinction","order":2,"contentType":"LEARNING","contentSlug":"backtracking-vs-brute-force","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_47382729d0d47b1a5283dc90a80719db","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Power Set Generation","order":3,"contentType":"VISUALIZER","contentSlug":"power-set-generation","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_4c32b6868cc3fc8e52d43bb1d5948b4a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Power Set Generation","order":4,"contentType":"PROBLEM","contentSlug":"power-set-generation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_b4da23eb171a0e71ed5e15ec702ab6ee","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Unique Power Set","order":5,"contentType":"PROBLEM","contentSlug":"unique-power-set","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_e8a9c8f1421d0ea3c0bfe1a1efbd387e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Ascending Order Subsequences","order":6,"contentType":"PROBLEM","contentSlug":"ascending-order-subsequences","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_49930c129492ddba34979c8bf3e60116","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Target Sum Combinations","order":7,"contentType":"PROBLEM","contentSlug":"target-sum-combinations","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_aec263862c50a94377e983a25ccbba01","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Unique Subset Combinations","order":8,"contentType":"PROBLEM","contentSlug":"unique-subset-combinations","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_ce04f68654cef4b4285484a923751ed7","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"K-Element Subsets","order":9,"contentType":"PROBLEM","contentSlug":"k-element-subsets","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_ee586685a9ee65b0da5d9521b3460e89","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"K-Element Target Sum","order":10,"contentType":"PROBLEM","contentSlug":"k-element-target-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_b6d1a3328e168fcb93b026b356767062","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Generate All Arrangements","order":11,"contentType":"PROBLEM","contentSlug":"generate-all-arrangements","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_f04ca882172c65c0556f64a552cfd334","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Unique Arrangements","order":12,"contentType":"PROBLEM","contentSlug":"unique-arrangements","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_22be242640934f328781c9d6ad728931","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Palindrome Rearrangement Enumeration","order":13,"contentType":"PROBLEM","contentSlug":"palindrome-rearrangement-enumeration","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_143ceb09e89b3582b2aa8557c6b9f647","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Divisibility Compliant Permutations","order":14,"contentType":"PROBLEM","contentSlug":"divisibility-compliant-permutations","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_73a602aafb388565420839e19afcade5","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Perfect Square Permutations","order":15,"contentType":"PROBLEM","contentSlug":"perfect-square-permutations","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_1727b899b60d132eeb9ba213735a2b9c","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Optimal Pairing Alignment Score","order":16,"contentType":"PROBLEM","contentSlug":"optimal-pairing-alignment-score","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_67fcc2c1af4899ce271a0bfa471a6c2c","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Coprime Index Arrangements","order":17,"contentType":"PROBLEM","contentSlug":"coprime-index-arrangements","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_97252bf7e6e52e8f85f8d8505b02dcf9","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Parity Alternating Sequences","order":18,"contentType":"PROBLEM","contentSlug":"parity-alternating-sequences","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_e479984811171e0c93da6a3e1bc33932","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Reconstruct Network Addresses","order":19,"contentType":"PROBLEM","contentSlug":"reconstruct-network-addresses","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_3a5eb65e3ac1c9270a1536e4d41d04aa","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Palindrome Segmentation","order":20,"contentType":"PROBLEM","contentSlug":"palindrome-segmentation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_de34cc848dcc0031b9c1a6a0e4ba67c2","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Maximum Distinct Partitions","order":21,"contentType":"PROBLEM","contentSlug":"maximum-distinct-partitions","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_dd9d8d4f27bd94e0c18a375854375cbc","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Equal Split Subset Sum","order":22,"contentType":"PROBLEM","contentSlug":"equal-split-subset-sum","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_66ceda758872bd26397fd74e33993e92","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Partition Sticks Into Square","order":23,"contentType":"PROBLEM","contentSlug":"partition-sticks-into-square","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_70e5f25544a976960e96fb48149dc2e2","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Divide Into Equal Sum Groups","order":24,"contentType":"PROBLEM","contentSlug":"divide-into-equal-sum-groups","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_c140422e0026673d4a11c65c03861fb6","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Throne Arrangement","order":25,"contentType":"PROBLEM","contentSlug":"throne-arrangement","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_f050f08a8fe497d3a14f6700fccb37ba","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 12: Backtracking Patterns","sectionOrder":12,"title":"Royal Placement Count","order":26,"contentType":"PROBLEM","contentSlug":"royal-placement-count","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_8b5b5c8bb60279feea439541a9cada2f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"What Is Dynamic Programming?","order":1,"contentType":"LEARNING","contentSlug":"what-is-dynamic-programming","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_8076bf758b719cbab0ef842102dc06a3","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Overlapping Subproblems — The Heart of Dynamic Programming","order":2,"contentType":"LEARNING","contentSlug":"overlapping-subproblems","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_49cedc87852e4bde869df9c006b9ce32","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Staircase Ascent","order":3,"contentType":"VISUALIZER","contentSlug":"staircase-ascent","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_e7b8047f85c84324a27fc045d304b04e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Staircase Ascent","order":4,"contentType":"PROBLEM","contentSlug":"staircase-ascent","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_482fea9c3024855d341cc50549187165","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Maximum Non-Adjacent Selection","order":5,"contentType":"PROBLEM","contentSlug":"maximum-non-adjacent-selection","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_921c2779c01ff38d2ea10fd6a7a068a9","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Sequence Sum Calculator","order":6,"contentType":"PROBLEM","contentSlug":"sequence-sum-calculator","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_17a10d66e0e4ec8e5d84b3c19dd3d4a9","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Minimum Expense Staircase Traversal","order":7,"contentType":"PROBLEM","contentSlug":"minimum-expense-staircase-traversal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_c15813be98c6058762106e41b9759416","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Grid Traversal Routes","order":8,"contentType":"PROBLEM","contentSlug":"grid-traversal-routes","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_1233dcebd1d2a2edd05d29eb1719c29d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Grid Navigation with Obstacles","order":9,"contentType":"PROBLEM","contentSlug":"grid-navigation-with-obstacles","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_8981f9e75f401546d6581aa47db3688d","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Grid Minimum Cost Traversal","order":10,"contentType":"PROBLEM","contentSlug":"grid-minimum-cost-traversal","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_173b0462b195c413f30363454150ae4a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Maximum Profit with Limited Transactions","order":11,"contentType":"PROBLEM","contentSlug":"maximum-profit-limited-transactions","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_93862a20f4feb6cd6a8dc1ebd8057759","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Circular Neighborhood Heist","order":12,"contentType":"PROBLEM","contentSlug":"circular-neighborhood-heist","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_52ab1170e8417c1c8079fcaa9c697d43","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Collect and Discard","order":13,"contentType":"PROBLEM","contentSlug":"collect-and-discard","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_b0a58fb50d94db69a37d13a82ff6732e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Longest Mirror Subsequence","order":14,"contentType":"PROBLEM","contentSlug":"longest-mirror-subsequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_1b2811dcfc213fc0101b61a3cb119ea4","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"Largest Unit Square","order":15,"contentType":"PROBLEM","contentSlug":"largest-unit-square","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_03d32d939c7aea9e182f186305b2d039","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 13: Dynamic Programming Fundamentals","sectionOrder":13,"title":"All-Ones Square Submatrix Count","order":16,"contentType":"PROBLEM","contentSlug":"all-ones-square-submatrix-count","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_2d5644656d1630983fdc08f55d8584b3","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"String Transformation Cost","order":1,"contentType":"VISUALIZER","contentSlug":"string-transformation-cost","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_dee7bc10d61eb462792d56314fee3661","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"String Transformation Cost","order":2,"contentType":"PROBLEM","contentSlug":"string-transformation-cost","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_d43ee6f7433c785535642c0e8d6d37e8","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Unique Subsequence Count","order":3,"contentType":"PROBLEM","contentSlug":"unique-subsequence-count","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_9d33547f96d92de5328014ee15698c05","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Minimum Deletions to Equalize Strings","order":4,"contentType":"PROBLEM","contentSlug":"minimum-deletions-to-equalize-strings","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_3a45869eca46bb2458e3b58d17eea016","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Longest Shared Subsequence","order":5,"contentType":"PROBLEM","contentSlug":"longest-shared-subsequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_3d9c41e3a6872e20c7ab2e8dc04b6442","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Minimal Universal Supersequence","order":6,"contentType":"PROBLEM","contentSlug":"minimal-universal-supersequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_cea139ffd5f2ca84445e99624b9f47c2","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Pattern Text Matching","order":7,"contentType":"PROBLEM","contentSlug":"pattern-text-matching","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_887cd6cfa3035a98a6abc242a164e744","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Pattern Glob Matching","order":8,"contentType":"PROBLEM","contentSlug":"pattern-glob-matching","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_67016cd34dbe1c8f959d73cb9058714a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Woven String Validation","order":9,"contentType":"PROBLEM","contentSlug":"woven-string-validation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_513afa89ee6680fefc884493dd84000e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Signed Expression Ways","order":10,"contentType":"PROBLEM","contentSlug":"signed-expression-ways","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_268f85a417d54665b07b936fd98ffbe3","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Denomination Combination Count","order":11,"contentType":"PROBLEM","contentSlug":"denomination-combination-count","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_4e89b9796fb55e0c1ef464d27bc4a6f4","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Minimum Collision Residue","order":12,"contentType":"PROBLEM","contentSlug":"minimum-collision-residue","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_8c0abc7103a31deaadbc70ce3e44431e","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Sequence Count to Target","order":13,"contentType":"PROBLEM","contentSlug":"sequence-count-to-target","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_41c34995c10816c150f5d305c4351e89","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Bundle Deal Optimizer","order":14,"contentType":"PROBLEM","contentSlug":"bundle-deal-optimizer","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_ecbb673584d343884b076561b1957b1f","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Optimal Polygon Triangulation Cost","order":15,"contentType":"PROBLEM","contentSlug":"optimal-polygon-triangulation-cost","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_b834e1893532cf85918daf578509933b","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Optimal Rod Division Cost","order":16,"contentType":"PROBLEM","contentSlug":"optimal-rod-division-cost","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_28c000d35edb6fa117c5c65cc2a80130","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Construct Valid Bracket Sequences","order":17,"contentType":"PROBLEM","contentSlug":"construct-valid-bracket-sequences","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_eb1af724610b783f96affdcb68bba233","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Construct Distinct Binary Search Trees","order":18,"contentType":"PROBLEM","contentSlug":"construct-distinct-bst","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_610e8e70a47b7ade9430b504f18a3f1b","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 14: Advanced Dynamic Programming","sectionOrder":14,"title":"Distinct BST Formations","order":19,"contentType":"PROBLEM","contentSlug":"distinct-bst-formations","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.641Z","pages":[]},{"id":"seed_fa6b6061d82e50ae0a91b2521d24e809","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Binary Representation Revisited — The Language of Low-Level Optimization","order":1,"contentType":"LEARNING","contentSlug":"binary-representation-revisited","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.152Z","updatedAt":"2026-10-17T16:28:32.641Z","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_64dc13f06c4755178b5e050a8d5e5cd7","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Bitwise Operators — AND, OR, XOR, NOT","order":2,"contentType":"LEARNING","contentSlug":"bitwise-operators","description":null,"estimatedMins":20,"createdAt":"2026-10-17T16:02:59.201Z","updatedAt":"2026-10-17T16:28:32.743Z","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_dd7bebcb1213395f624768cb0ac4ff66","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Binary One Counter","order":3,"contentType":"VISUALIZER","contentSlug":"binary-one-counter","description":null,"estimatedMins":15,"createdAt":"2026-10-17T16:02:59.201Z","updatedAt":"2026-10-17T16:28:32.743Z","pages":[]},{"id":"seed_d1532a8d923b7493d3d21aa34b46d84a","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Binary One Counter","order":4,"contentType":"PROBLEM","contentSlug":"binary-one-counter","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z","pages":[]},{"id":"seed_2ad90f01aeaa59ce1e80ea03e97151fe","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Range Bitwise Conjunction","order":5,"contentType":"PROBLEM","contentSlug":"range-bitwise-conjunction","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z","pages":[]},{"id":"seed_33c9daac5b62f1a87bafface07b95c33","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Binary Power Verification","order":6,"contentType":"PROBLEM","contentSlug":"binary-power-verification","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z","pages":[]},{"id":"seed_276672d06d9e6c9fe0a065d1d7391680","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Unique Element Finder","order":7,"contentType":"PROBLEM","contentSlug":"unique-element-finder","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z","pages":[]},{"id":"seed_966e4bd0a5dbc4a0703bdb192d3e28cb","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Dual Singleton Detection","order":8,"contentType":"PROBLEM","contentSlug":"dual-singleton-detection","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z","pages":[]},{"id":"seed_894fbcd315513b8678b43dc5d31045fc","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Arithmetic Sequence XOR","order":9,"contentType":"PROBLEM","contentSlug":"arithmetic-sequence-xor","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z","pages":[]},{"id":"seed_cfec2c01de869dab92d3c308653766a7","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Binary Reduction to Zero","order":10,"contentType":"PROBLEM","contentSlug":"binary-reduction-to-zero","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z","pages":[]},{"id":"seed_a77e0590d337e59858e1f03d39357c96","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Cross Pair XOR Aggregate","order":11,"contentType":"PROBLEM","contentSlug":"cross-pair-xor-aggregate","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z","pages":[]},{"id":"seed_7b51cc673b33977fad57bedeeca1a375","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Circular XOR Array Validation","order":12,"contentType":"PROBLEM","contentSlug":"circular-xor-array-validation","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z","pages":[]},{"id":"seed_94f7a803923c0ee49bc1c83137937fe4","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Quadruple Power Check","order":13,"contentType":"PROBLEM","contentSlug":"quadruple-power-check","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z","pages":[]},{"id":"seed_d8d93015bf1574e5e77262c43ffdf0ac","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Reflected Binary Sequence","order":14,"contentType":"PROBLEM","contentSlug":"reflected-binary-sequence","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z","pages":[]},{"id":"seed_efc5eda0a4c452eb086511a85c743c5c","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Chapter 15: Bit Manipulation","sectionOrder":15,"title":"Binary Ones Counter","order":15,"contentType":"PROBLEM","contentSlug":"binary-ones-counter","description":null,"estimatedMins":30,"createdAt":"2026-10-15T17:47:45.373Z","updatedAt":"2026-10-17T16:28:32.743Z","pages":[]},{"id":"seed_ff45e7eb7d6c5fe90f5cd1cf4df312fd","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Transfer patterns to a repository","sectionOrder":16,"title":"Completed deliveries still count against route capacity","order":1,"contentType":"REPO","contentSlug":"dispatch-planner-route-peak","description":null,"estimatedMins":60,"createdAt":"2026-10-17T16:02:59.201Z","updatedAt":"2026-10-17T16:28:32.743Z","pages":[]},{"id":"seed_66df37d2bac6d67475e540c3dd30e4ec","learningPathId":"seed_9a9d8b83f733dcfd157a0f26a883a557","section":"Transfer patterns to a repository","sectionOrder":16,"title":"Measure peak load instead of total pickups","order":2,"contentType":"CODE_REVIEW","contentSlug":"dispatch-planner-review-route-peak","description":null,"estimatedMins":35,"createdAt":"2026-10-17T16:02:59.201Z","updatedAt":"2026-10-17T16:28:32.743Z","pages":[]}]},"currentModule":"$47:props:state:queries:1:state:data:json:path:modules:142","prevModule":"$47:props:state:queries:1:state:data:json:path:modules:141","nextModule":"$47:props:state:queries:1:state:data:json:path:modules:143","allModules":"$47: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"],"path.modules.361.createdAt":["Date"],"path.modules.361.updatedAt":["Date"],"path.modules.362.createdAt":["Date"],"path.modules.362.updatedAt":["Date"],"path.modules.363.createdAt":["Date"],"path.modules.363.updatedAt":["Date"],"currentModule.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.142.createdAt","currentModule.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.142.updatedAt","prevModule.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.141.createdAt","prevModule.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.141.updatedAt","nextModule.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.143.createdAt","nextModule.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.143.updatedAt","allModules.0.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.0.createdAt","allModules.0.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.0.updatedAt","allModules.1.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.1.createdAt","allModules.1.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.1.updatedAt","allModules.2.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.2.createdAt","allModules.2.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.2.updatedAt","allModules.3.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.3.createdAt","allModules.3.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.3.updatedAt","allModules.4.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.4.createdAt","allModules.4.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.4.updatedAt","allModules.5.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.5.createdAt","allModules.5.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.5.updatedAt","allModules.6.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.6.createdAt","allModules.6.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.6.updatedAt","allModules.7.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.7.createdAt","allModules.7.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.7.updatedAt","allModules.8.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.8.createdAt","allModules.8.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.8.updatedAt","allModules.9.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.9.createdAt","allModules.9.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.9.updatedAt","allModules.10.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.10.createdAt","allModules.10.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.10.updatedAt","allModules.11.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.11.createdAt","allModules.11.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.11.updatedAt","allModules.12.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.12.createdAt","allModules.12.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.12.updatedAt","allModules.13.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.13.createdAt","allModules.13.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.13.updatedAt","allModules.14.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.14.createdAt","allModules.14.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.14.updatedAt","allModules.15.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.15.createdAt","allModules.15.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.15.updatedAt","allModules.16.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.16.createdAt","allModules.16.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.16.updatedAt","allModules.17.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.17.createdAt","allModules.17.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.17.updatedAt","allModules.18.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.18.createdAt","allModules.18.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.18.updatedAt","allModules.19.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.19.createdAt","allModules.19.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.19.updatedAt","allModules.20.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.20.createdAt","allModules.20.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.20.updatedAt","allModules.21.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.21.createdAt","allModules.21.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.21.updatedAt","allModules.22.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.22.createdAt","allModules.22.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.22.updatedAt","allModules.23.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.23.createdAt","allModules.23.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.23.updatedAt","allModules.24.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.24.createdAt","allModules.24.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.24.updatedAt","allModules.25.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.25.createdAt","allModules.25.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.25.updatedAt","allModules.26.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.26.createdAt","allModules.26.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.26.updatedAt","allModules.27.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.27.createdAt","allModules.27.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.27.updatedAt","allModules.28.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.28.createdAt","allModules.28.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.28.updatedAt","allModules.29.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.29.createdAt","allModules.29.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.29.updatedAt","allModules.30.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.30.createdAt","allModules.30.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.30.updatedAt","allModules.31.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.31.createdAt","allModules.31.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.31.updatedAt","allModules.32.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.32.createdAt","allModules.32.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.32.updatedAt","allModules.33.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.33.createdAt","allModules.33.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.33.updatedAt","allModules.34.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.34.createdAt","allModules.34.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.34.updatedAt","allModules.35.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.35.createdAt","allModules.35.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.35.updatedAt","allModules.36.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.36.createdAt","allModules.36.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.36.updatedAt","allModules.37.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.37.createdAt","allModules.37.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.37.updatedAt","allModules.38.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.38.createdAt","allModules.38.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.38.updatedAt","allModules.39.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.39.createdAt","allModules.39.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.39.updatedAt","allModules.40.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.40.createdAt","allModules.40.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.40.updatedAt","allModules.41.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.41.createdAt","allModules.41.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.41.updatedAt","allModules.42.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.42.createdAt","allModules.42.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.42.updatedAt","allModules.43.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.43.createdAt","allModules.43.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.43.updatedAt","allModules.44.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.44.createdAt","allModules.44.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.44.updatedAt","allModules.45.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.45.createdAt","allModules.45.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.45.updatedAt","allModules.46.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.46.createdAt","allModules.46.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.46.updatedAt","allModules.47.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.47.createdAt","allModules.47.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.47.updatedAt","allModules.48.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.48.createdAt","allModules.48.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.48.updatedAt","allModules.49.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.49.createdAt","allModules.49.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.49.updatedAt","allModules.50.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.50.createdAt","allModules.50.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.50.updatedAt","allModules.51.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.51.createdAt","allModules.51.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.51.updatedAt","allModules.52.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.52.createdAt","allModules.52.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.52.updatedAt","allModules.53.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.53.createdAt","allModules.53.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.53.updatedAt","allModules.54.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.54.createdAt","allModules.54.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.54.updatedAt","allModules.55.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.55.createdAt","allModules.55.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.55.updatedAt","allModules.56.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.56.createdAt","allModules.56.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.56.updatedAt","allModules.57.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.57.createdAt","allModules.57.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.57.updatedAt","allModules.58.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.58.createdAt","allModules.58.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.58.updatedAt","allModules.59.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.59.createdAt","allModules.59.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.59.updatedAt","allModules.60.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.60.createdAt","allModules.60.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.60.updatedAt","allModules.61.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.61.createdAt","allModules.61.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.61.updatedAt","allModules.62.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.62.createdAt","allModules.62.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.62.updatedAt","allModules.63.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.63.createdAt","allModules.63.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.63.updatedAt","allModules.64.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.64.createdAt","allModules.64.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.64.updatedAt","allModules.65.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.65.createdAt","allModules.65.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.65.updatedAt","allModules.66.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.66.createdAt","allModules.66.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.66.updatedAt","allModules.67.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.67.createdAt","allModules.67.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.67.updatedAt","allModules.68.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.68.createdAt","allModules.68.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.68.updatedAt","allModules.69.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.69.createdAt","allModules.69.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.69.updatedAt","allModules.70.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.70.createdAt","allModules.70.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.70.updatedAt","allModules.71.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.71.createdAt","allModules.71.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.71.updatedAt","allModules.72.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.72.createdAt","allModules.72.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.72.updatedAt","allModules.73.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.73.createdAt","allModules.73.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.73.updatedAt","allModules.74.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.74.createdAt","allModules.74.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.74.updatedAt","allModules.75.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.75.createdAt","allModules.75.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.75.updatedAt","allModules.76.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.76.createdAt","allModules.76.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.76.updatedAt","allModules.77.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.77.createdAt","allModules.77.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.77.updatedAt","allModules.78.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.78.createdAt","allModules.78.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.78.updatedAt","allModules.79.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.79.createdAt","allModules.79.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.79.updatedAt","allModules.80.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.80.createdAt","allModules.80.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.80.updatedAt","allModules.81.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.81.createdAt","allModules.81.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.81.updatedAt","allModules.82.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.82.createdAt","allModules.82.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.82.updatedAt","allModules.83.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.83.createdAt","allModules.83.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.83.updatedAt","allModules.84.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.84.createdAt","allModules.84.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.84.updatedAt","allModules.85.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.85.createdAt","allModules.85.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.85.updatedAt","allModules.86.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.86.createdAt","allModules.86.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.86.updatedAt","allModules.87.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.87.createdAt","allModules.87.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.87.updatedAt","allModules.88.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.88.createdAt","allModules.88.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.88.updatedAt","allModules.89.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.89.createdAt","allModules.89.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.89.updatedAt","allModules.90.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.90.createdAt","allModules.90.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.90.updatedAt","allModules.91.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.91.createdAt","allModules.91.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.91.updatedAt","allModules.92.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.92.createdAt","allModules.92.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.92.updatedAt","allModules.93.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.93.createdAt","allModules.93.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.93.updatedAt","allModules.94.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.94.createdAt","allModules.94.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.94.updatedAt","allModules.95.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.95.createdAt","allModules.95.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.95.updatedAt","allModules.96.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.96.createdAt","allModules.96.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.96.updatedAt","allModules.97.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.97.createdAt","allModules.97.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.97.updatedAt","allModules.98.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.98.createdAt","allModules.98.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.98.updatedAt","allModules.99.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.99.createdAt","allModules.99.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.99.updatedAt","allModules.100.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.100.createdAt","allModules.100.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.100.updatedAt","allModules.101.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.101.createdAt","allModules.101.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.101.updatedAt","allModules.102.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.102.createdAt","allModules.102.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.102.updatedAt","allModules.103.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.103.createdAt","allModules.103.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.103.updatedAt","allModules.104.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.104.createdAt","allModules.104.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.104.updatedAt","allModules.105.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.105.createdAt","allModules.105.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.105.updatedAt","allModules.106.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.106.createdAt","allModules.106.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.106.updatedAt","allModules.107.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.107.createdAt","allModules.107.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.107.updatedAt","allModules.108.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.108.createdAt","allModules.108.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.108.updatedAt","allModules.109.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.109.createdAt","allModules.109.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.109.updatedAt","allModules.110.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.110.createdAt","allModules.110.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.110.updatedAt","allModules.111.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.111.createdAt","allModules.111.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.111.updatedAt","allModules.112.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.112.createdAt","allModules.112.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.112.updatedAt","allModules.113.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.113.createdAt","allModules.113.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.113.updatedAt","allModules.114.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.114.createdAt","allModules.114.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.114.updatedAt","allModules.115.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.115.createdAt","allModules.115.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.115.updatedAt","allModules.116.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.116.createdAt","allModules.116.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.116.updatedAt","allModules.117.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.117.createdAt","allModules.117.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.117.updatedAt","allModules.118.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.118.createdAt","allModules.118.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.118.updatedAt","allModules.119.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.119.createdAt","allModules.119.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.119.updatedAt","allModules.120.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.120.createdAt","allModules.120.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.120.updatedAt","allModules.121.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.121.createdAt","allModules.121.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.121.updatedAt","allModules.122.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.122.createdAt","allModules.122.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.122.updatedAt","allModules.123.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.123.createdAt","allModules.123.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.123.updatedAt","allModules.124.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.124.createdAt","allModules.124.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.124.updatedAt","allModules.125.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.125.createdAt","allModules.125.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.125.updatedAt","allModules.126.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.126.createdAt","allModules.126.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.126.updatedAt","allModules.127.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.127.createdAt","allModules.127.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.127.updatedAt","allModules.128.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.128.createdAt","allModules.128.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.128.updatedAt","allModules.129.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.129.createdAt","allModules.129.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.129.updatedAt","allModules.130.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.130.createdAt","allModules.130.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.130.updatedAt","allModules.131.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.131.createdAt","allModules.131.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.131.updatedAt","allModules.132.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.132.createdAt","allModules.132.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.132.updatedAt","allModules.133.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.133.createdAt","allModules.133.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.133.updatedAt","allModules.134.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.134.createdAt","allModules.134.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.134.updatedAt","allModules.135.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.135.createdAt","allModules.135.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.135.updatedAt","allModules.136.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.136.createdAt","allModules.136.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.136.updatedAt","allModules.137.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.137.createdAt","allModules.137.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.137.updatedAt","allModules.138.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.138.createdAt","allModules.138.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.138.updatedAt","allModules.139.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.139.createdAt","allModules.139.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.139.updatedAt","allModules.140.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.140.createdAt","allModules.140.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.140.updatedAt","allModules.141.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.141.createdAt","allModules.141.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.141.updatedAt","allModules.142.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.142.createdAt","allModules.142.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.142.updatedAt","allModules.143.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.143.createdAt","allModules.143.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.143.updatedAt","allModules.144.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.144.createdAt","allModules.144.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.144.updatedAt","allModules.145.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.145.createdAt","allModules.145.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.145.updatedAt","allModules.146.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.146.createdAt","allModules.146.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.146.updatedAt","allModules.147.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.147.createdAt","allModules.147.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.147.updatedAt","allModules.148.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.148.createdAt","allModules.148.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.148.updatedAt","allModules.149.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.149.createdAt","allModules.149.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.149.updatedAt","allModules.150.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.150.createdAt","allModules.150.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.150.updatedAt","allModules.151.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.151.createdAt","allModules.151.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.151.updatedAt","allModules.152.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.152.createdAt","allModules.152.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.152.updatedAt","allModules.153.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.153.createdAt","allModules.153.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.153.updatedAt","allModules.154.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.154.createdAt","allModules.154.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.154.updatedAt","allModules.155.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.155.createdAt","allModules.155.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.155.updatedAt","allModules.156.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.156.createdAt","allModules.156.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.156.updatedAt","allModules.157.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.157.createdAt","allModules.157.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.157.updatedAt","allModules.158.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.158.createdAt","allModules.158.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.158.updatedAt","allModules.159.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.159.createdAt","allModules.159.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.159.updatedAt","allModules.160.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.160.createdAt","allModules.160.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.160.updatedAt","allModules.161.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.161.createdAt","allModules.161.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.161.updatedAt","allModules.162.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.162.createdAt","allModules.162.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.162.updatedAt","allModules.163.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.163.createdAt","allModules.163.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.163.updatedAt","allModules.164.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.164.createdAt","allModules.164.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.164.updatedAt","allModules.165.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.165.createdAt","allModules.165.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.165.updatedAt","allModules.166.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.166.createdAt","allModules.166.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.166.updatedAt","allModules.167.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.167.createdAt","allModules.167.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.167.updatedAt","allModules.168.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.168.createdAt","allModules.168.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.168.updatedAt","allModules.169.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.169.createdAt","allModules.169.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.169.updatedAt","allModules.170.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.170.createdAt","allModules.170.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.170.updatedAt","allModules.171.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.171.createdAt","allModules.171.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.171.updatedAt","allModules.172.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.172.createdAt","allModules.172.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.172.updatedAt","allModules.173.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.173.createdAt","allModules.173.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.173.updatedAt","allModules.174.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.174.createdAt","allModules.174.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.174.updatedAt","allModules.175.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.175.createdAt","allModules.175.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.175.updatedAt","allModules.176.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.176.createdAt","allModules.176.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.176.updatedAt","allModules.177.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.177.createdAt","allModules.177.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.177.updatedAt","allModules.178.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.178.createdAt","allModules.178.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.178.updatedAt","allModules.179.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.179.createdAt","allModules.179.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.179.updatedAt","allModules.180.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.180.createdAt","allModules.180.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.180.updatedAt","allModules.181.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.181.createdAt","allModules.181.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.181.updatedAt","allModules.182.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.182.createdAt","allModules.182.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.182.updatedAt","allModules.183.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.183.createdAt","allModules.183.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.183.updatedAt","allModules.184.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.184.createdAt","allModules.184.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.184.updatedAt","allModules.185.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.185.createdAt","allModules.185.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.185.updatedAt","allModules.186.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.186.createdAt","allModules.186.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.186.updatedAt","allModules.187.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.187.createdAt","allModules.187.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.187.updatedAt","allModules.188.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.188.createdAt","allModules.188.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.188.updatedAt","allModules.189.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.189.createdAt","allModules.189.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.189.updatedAt","allModules.190.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.190.createdAt","allModules.190.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.190.updatedAt","allModules.191.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.191.createdAt","allModules.191.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.191.updatedAt","allModules.192.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.192.createdAt","allModules.192.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.192.updatedAt","allModules.193.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.193.createdAt","allModules.193.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.193.updatedAt","allModules.194.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.194.createdAt","allModules.194.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.194.updatedAt","allModules.195.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.195.createdAt","allModules.195.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.195.updatedAt","allModules.196.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.196.createdAt","allModules.196.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.196.updatedAt","allModules.197.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.197.createdAt","allModules.197.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.197.updatedAt","allModules.198.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.198.createdAt","allModules.198.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.198.updatedAt","allModules.199.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.199.createdAt","allModules.199.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.199.updatedAt","allModules.200.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.200.createdAt","allModules.200.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.200.updatedAt","allModules.201.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.201.createdAt","allModules.201.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.201.updatedAt","allModules.202.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.202.createdAt","allModules.202.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.202.updatedAt","allModules.203.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.203.createdAt","allModules.203.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.203.updatedAt","allModules.204.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.204.createdAt","allModules.204.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.204.updatedAt","allModules.205.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.205.createdAt","allModules.205.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.205.updatedAt","allModules.206.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.206.createdAt","allModules.206.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.206.updatedAt","allModules.207.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.207.createdAt","allModules.207.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.207.updatedAt","allModules.208.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.208.createdAt","allModules.208.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.208.updatedAt","allModules.209.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.209.createdAt","allModules.209.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.209.updatedAt","allModules.210.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.210.createdAt","allModules.210.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.210.updatedAt","allModules.211.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.211.createdAt","allModules.211.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.211.updatedAt","allModules.212.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.212.createdAt","allModules.212.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.212.updatedAt","allModules.213.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.213.createdAt","allModules.213.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.213.updatedAt","allModules.214.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.214.createdAt","allModules.214.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.214.updatedAt","allModules.215.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.215.createdAt","allModules.215.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.215.updatedAt","allModules.216.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.216.createdAt","allModules.216.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.216.updatedAt","allModules.217.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.217.createdAt","allModules.217.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.217.updatedAt","allModules.218.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.218.createdAt","allModules.218.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.218.updatedAt","allModules.219.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.219.createdAt","allModules.219.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.219.updatedAt","allModules.220.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.220.createdAt","allModules.220.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.220.updatedAt","allModules.221.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.221.createdAt","allModules.221.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.221.updatedAt","allModules.222.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.222.createdAt","allModules.222.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.222.updatedAt","allModules.223.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.223.createdAt","allModules.223.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.223.updatedAt","allModules.224.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.224.createdAt","allModules.224.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.224.updatedAt","allModules.225.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.225.createdAt","allModules.225.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.225.updatedAt","allModules.226.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.226.createdAt","allModules.226.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.226.updatedAt","allModules.227.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.227.createdAt","allModules.227.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.227.updatedAt","allModules.228.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.228.createdAt","allModules.228.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.228.updatedAt","allModules.229.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.229.createdAt","allModules.229.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.229.updatedAt","allModules.230.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.230.createdAt","allModules.230.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.230.updatedAt","allModules.231.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.231.createdAt","allModules.231.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.231.updatedAt","allModules.232.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.232.createdAt","allModules.232.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.232.updatedAt","allModules.233.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.233.createdAt","allModules.233.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.233.updatedAt","allModules.234.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.234.createdAt","allModules.234.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.234.updatedAt","allModules.235.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.235.createdAt","allModules.235.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.235.updatedAt","allModules.236.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.236.createdAt","allModules.236.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.236.updatedAt","allModules.237.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.237.createdAt","allModules.237.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.237.updatedAt","allModules.238.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.238.createdAt","allModules.238.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.238.updatedAt","allModules.239.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.239.createdAt","allModules.239.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.239.updatedAt","allModules.240.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.240.createdAt","allModules.240.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.240.updatedAt","allModules.241.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.241.createdAt","allModules.241.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.241.updatedAt","allModules.242.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.242.createdAt","allModules.242.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.242.updatedAt","allModules.243.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.243.createdAt","allModules.243.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.243.updatedAt","allModules.244.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.244.createdAt","allModules.244.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.244.updatedAt","allModules.245.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.245.createdAt","allModules.245.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.245.updatedAt","allModules.246.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.246.createdAt","allModules.246.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.246.updatedAt","allModules.247.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.247.createdAt","allModules.247.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.247.updatedAt","allModules.248.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.248.createdAt","allModules.248.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.248.updatedAt","allModules.249.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.249.createdAt","allModules.249.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.249.updatedAt","allModules.250.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.250.createdAt","allModules.250.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.250.updatedAt","allModules.251.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.251.createdAt","allModules.251.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.251.updatedAt","allModules.252.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.252.createdAt","allModules.252.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.252.updatedAt","allModules.253.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.253.createdAt","allModules.253.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.253.updatedAt","allModules.254.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.254.createdAt","allModules.254.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.254.updatedAt","allModules.255.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.255.createdAt","allModules.255.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.255.updatedAt","allModules.256.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.256.createdAt","allModules.256.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.256.updatedAt","allModules.257.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.257.createdAt","allModules.257.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.257.updatedAt","allModules.258.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.258.createdAt","allModules.258.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.258.updatedAt","allModules.259.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.259.createdAt","allModules.259.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.259.updatedAt","allModules.260.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.260.createdAt","allModules.260.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.260.updatedAt","allModules.261.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.261.createdAt","allModules.261.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.261.updatedAt","allModules.262.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.262.createdAt","allModules.262.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.262.updatedAt","allModules.263.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.263.createdAt","allModules.263.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.263.updatedAt","allModules.264.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.264.createdAt","allModules.264.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.264.updatedAt","allModules.265.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.265.createdAt","allModules.265.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.265.updatedAt","allModules.266.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.266.createdAt","allModules.266.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.266.updatedAt","allModules.267.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.267.createdAt","allModules.267.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.267.updatedAt","allModules.268.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.268.createdAt","allModules.268.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.268.updatedAt","allModules.269.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.269.createdAt","allModules.269.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.269.updatedAt","allModules.270.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.270.createdAt","allModules.270.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.270.updatedAt","allModules.271.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.271.createdAt","allModules.271.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.271.updatedAt","allModules.272.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.272.createdAt","allModules.272.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.272.updatedAt","allModules.273.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.273.createdAt","allModules.273.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.273.updatedAt","allModules.274.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.274.createdAt","allModules.274.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.274.updatedAt","allModules.275.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.275.createdAt","allModules.275.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.275.updatedAt","allModules.276.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.276.createdAt","allModules.276.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.276.updatedAt","allModules.277.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.277.createdAt","allModules.277.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.277.updatedAt","allModules.278.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.278.createdAt","allModules.278.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.278.updatedAt","allModules.279.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.279.createdAt","allModules.279.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.279.updatedAt","allModules.280.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.280.createdAt","allModules.280.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.280.updatedAt","allModules.281.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.281.createdAt","allModules.281.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.281.updatedAt","allModules.282.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.282.createdAt","allModules.282.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.282.updatedAt","allModules.283.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.283.createdAt","allModules.283.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.283.updatedAt","allModules.284.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.284.createdAt","allModules.284.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.284.updatedAt","allModules.285.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.285.createdAt","allModules.285.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.285.updatedAt","allModules.286.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.286.createdAt","allModules.286.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.286.updatedAt","allModules.287.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.287.createdAt","allModules.287.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.287.updatedAt","allModules.288.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.288.createdAt","allModules.288.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.288.updatedAt","allModules.289.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.289.createdAt","allModules.289.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.289.updatedAt","allModules.290.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.290.createdAt","allModules.290.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.290.updatedAt","allModules.291.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.291.createdAt","allModules.291.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.291.updatedAt","allModules.292.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.292.createdAt","allModules.292.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.292.updatedAt","allModules.293.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.293.createdAt","allModules.293.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.293.updatedAt","allModules.294.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.294.createdAt","allModules.294.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.294.updatedAt","allModules.295.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.295.createdAt","allModules.295.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.295.updatedAt","allModules.296.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.296.createdAt","allModules.296.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.296.updatedAt","allModules.297.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.297.createdAt","allModules.297.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.297.updatedAt","allModules.298.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.298.createdAt","allModules.298.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.298.updatedAt","allModules.299.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.299.createdAt","allModules.299.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.299.updatedAt","allModules.300.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.300.createdAt","allModules.300.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.300.updatedAt","allModules.301.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.301.createdAt","allModules.301.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.301.updatedAt","allModules.302.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.302.createdAt","allModules.302.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.302.updatedAt","allModules.303.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.303.createdAt","allModules.303.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.303.updatedAt","allModules.304.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.304.createdAt","allModules.304.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.304.updatedAt","allModules.305.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.305.createdAt","allModules.305.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.305.updatedAt","allModules.306.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.306.createdAt","allModules.306.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.306.updatedAt","allModules.307.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.307.createdAt","allModules.307.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.307.updatedAt","allModules.308.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.308.createdAt","allModules.308.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.308.updatedAt","allModules.309.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.309.createdAt","allModules.309.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.309.updatedAt","allModules.310.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.310.createdAt","allModules.310.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.310.updatedAt","allModules.311.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.311.createdAt","allModules.311.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.311.updatedAt","allModules.312.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.312.createdAt","allModules.312.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.312.updatedAt","allModules.313.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.313.createdAt","allModules.313.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.313.updatedAt","allModules.314.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.314.createdAt","allModules.314.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.314.updatedAt","allModules.315.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.315.createdAt","allModules.315.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.315.updatedAt","allModules.316.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.316.createdAt","allModules.316.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.316.updatedAt","allModules.317.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.317.createdAt","allModules.317.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.317.updatedAt","allModules.318.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.318.createdAt","allModules.318.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.318.updatedAt","allModules.319.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.319.createdAt","allModules.319.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.319.updatedAt","allModules.320.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.320.createdAt","allModules.320.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.320.updatedAt","allModules.321.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.321.createdAt","allModules.321.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.321.updatedAt","allModules.322.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.322.createdAt","allModules.322.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.322.updatedAt","allModules.323.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.323.createdAt","allModules.323.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.323.updatedAt","allModules.324.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.324.createdAt","allModules.324.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.324.updatedAt","allModules.325.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.325.createdAt","allModules.325.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.325.updatedAt","allModules.326.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.326.createdAt","allModules.326.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.326.updatedAt","allModules.327.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.327.createdAt","allModules.327.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.327.updatedAt","allModules.328.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.328.createdAt","allModules.328.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.328.updatedAt","allModules.329.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.329.createdAt","allModules.329.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.329.updatedAt","allModules.330.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.330.createdAt","allModules.330.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.330.updatedAt","allModules.331.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.331.createdAt","allModules.331.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.331.updatedAt","allModules.332.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.332.createdAt","allModules.332.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.332.updatedAt","allModules.333.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.333.createdAt","allModules.333.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.333.updatedAt","allModules.334.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.334.createdAt","allModules.334.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.334.updatedAt","allModules.335.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.335.createdAt","allModules.335.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.335.updatedAt","allModules.336.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.336.createdAt","allModules.336.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.336.updatedAt","allModules.337.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.337.createdAt","allModules.337.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.337.updatedAt","allModules.338.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.338.createdAt","allModules.338.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.338.updatedAt","allModules.339.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.339.createdAt","allModules.339.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.339.updatedAt","allModules.340.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.340.createdAt","allModules.340.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.340.updatedAt","allModules.341.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.341.createdAt","allModules.341.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.341.updatedAt","allModules.342.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.342.createdAt","allModules.342.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.342.updatedAt","allModules.343.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.343.createdAt","allModules.343.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.343.updatedAt","allModules.344.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.344.createdAt","allModules.344.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.344.updatedAt","allModules.345.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.345.createdAt","allModules.345.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.345.updatedAt","allModules.346.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.346.createdAt","allModules.346.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.346.updatedAt","allModules.347.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.347.createdAt","allModules.347.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.347.updatedAt","allModules.348.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.348.createdAt","allModules.348.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.348.updatedAt","allModules.349.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.349.createdAt","allModules.349.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.349.updatedAt","allModules.350.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.350.createdAt","allModules.350.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.350.updatedAt","allModules.351.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.351.createdAt","allModules.351.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.351.updatedAt","allModules.352.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.352.createdAt","allModules.352.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.352.updatedAt","allModules.353.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.353.createdAt","allModules.353.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.353.updatedAt","allModules.354.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.354.createdAt","allModules.354.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.354.updatedAt","allModules.355.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.355.createdAt","allModules.355.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.355.updatedAt","allModules.356.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.356.createdAt","allModules.356.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.356.updatedAt","allModules.357.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.357.createdAt","allModules.357.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.357.updatedAt","allModules.358.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.358.createdAt","allModules.358.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.358.updatedAt","allModules.359.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.359.createdAt","allModules.359.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.359.updatedAt","allModules.360.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.360.createdAt","allModules.360.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.360.updatedAt","allModules.361.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.361.createdAt","allModules.361.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.361.updatedAt","allModules.362.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.362.createdAt","allModules.362.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.362.updatedAt","allModules.363.createdAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.363.createdAt","allModules.363.updatedAt":"$47:props:state:queries:1:state:data:meta:values:path.modules.363.updatedAt"},"referentialEqualities":{"allModules":["path.modules"],"prevModule":["path.modules.141"],"currentModule":["path.modules.142"],"nextModule":["path.modules.143"]},"v":1}},"dataUpdateCount":1,"dataUpdatedAt":1792306282018,"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-patterns","contentType":"LEARNING","contentSlug":"complete-binary-tree-representation"},"type":"query"}],"queryHash":"[[\"learningPaths\",\"getModule\"],{\"input\":{\"contentSlug\":\"complete-binary-tree-representation\",\"contentType\":\"LEARNING\",\"pathSlug\":\"data-structures-algorithms-patterns\"},\"type\":\"query\"}]"},{"dehydratedAt":1792306282196,"state":{"data":{"json":{"id":"seed_09032688655d1584fcbb928af1336c6b","slug":"complete-binary-tree-representation","category":"Data Structures & Algorithms","topic":"Complete Binary Tree Representation","title":"Complete Binary Trees — The Foundation of Array-Based Heaps","description":"Master the complete binary tree structure that enables efficient array-based heap implementations. Understand level-by-level filling, why this shape matters for memory efficiency, and how it guarantees O(log n) height bounds critical for heap performance.","difficulty":"INTERMEDIATE","estimatedMinutes":50,"pages":[{"id":"seed_bae04fbf372e9adf0b798ce722c80bab","title":"What is a Complete Binary Tree","order":0,"content":[{"id":"opening-hook","title":"The Shape That Makes Heaps Work","content":[{"data":{"content":"When we introduced heaps in the previous module, we emphasized that heaps are fundamentally about maintaining the **heap property**—the ordering constraint where every parent is larger (or smaller) than its children. But there's a second, equally critical constraint that we touched upon briefly: the **shape constraint**.\n\nThis shape constraint is not arbitrary. It's what allows heaps to be implemented as simple arrays without any pointers, achieve O(log n) operations with guaranteed worst-case bounds, and exhibit excellent memory efficiency and cache locality. The shape in question is the **complete binary tree**.\n\nUnderstanding complete binary trees is not merely academic preparation—it's essential for grasping why heaps work so efficiently and why they're implemented the way they are. Without the complete binary tree structure, heaps would lose many of their performance advantages."},"type":"text"},{"data":{"icon":"Target","title":"What You Will Learn","content":"By the end of this page, you will understand the precise definition of a complete binary tree, how it differs from other binary tree types, why this specific structure enables array representation of trees, and the mathematical properties that make complete binary trees ideal for heap implementations.","variant":"info"},"type":"callout"}]},{"id":"binary-tree-types-review","title":"Binary Tree Types — A Critical Distinction","content":[{"data":{"content":"$73"},"type":"text"},{"data":{"icon":"AlertCircle","title":"Common Terminology Confusion","content":"Different textbooks and educational resources sometimes use these terms inconsistently. Some call a 'full binary tree' what we call 'perfect,' and vice versa. For this curriculum, we use the definitions above, which align with NIST and most algorithm textbooks. Always verify terminology in any new context.","variant":"warning"},"type":"callout"},{"data":{"rows":[["Node constraint","≤2 children per node","0 or 2 children only","≤2 children per node","2 children (internal), 0 (leaves)"],["Level filling","No constraint","No constraint","All levels full except possibly last","All levels completely full"],["Last level","No constraint","No constraint","Filled left-to-right","Completely filled"],["Height for n nodes","O(n) worst case","O(n) worst case","Θ(log n) always","Θ(log n) exactly"],["Array representation","Inefficient (gaps)","Inefficient (gaps)","Perfectly efficient","Perfectly efficient"],["Heap suitability","Poor","Poor","Ideal","Ideal (but hard to maintain)"]],"caption":"Comparison of Binary Tree Types","headers":["Property","General Binary","Full Binary","Complete Binary","Perfect Binary"]},"type":"table"},{"data":{"content":"**Why These Distinctions Matter for Heaps:**\n\nHeaps specifically require the **complete binary tree** structure—not just any binary tree. Here's why:\n\n- **General binary trees** can be arbitrarily skewed, leading to O(n) height and destroying the O(log n) operation guarantees.\n- **Full binary trees** don't guarantee bounded height; they can still be tall and thin.\n- **Perfect binary trees** would be ideal, but maintaining perfect fullness after insertions and deletions is impossible without complete restructuring.\n- **Complete binary trees** strike the perfect balance: they guarantee O(log n) height while allowing efficient insertions and deletions at the 'rightmost position of the last level.'"},"type":"text"}],"titleType":"number","titleNumber":1},{"id":"precise-definition","title":"The Precise Definition of Complete Binary Trees","content":[{"data":{"content":"$74"},"type":"text"},{"data":{"code":"$75","fileName":"Complete Binary Tree Visual Structure","language":"text"},"type":"code"},{"data":{"icon":"Lightbulb","title":"The 'Leftmost' Intuition","content":"Think of filling a complete binary tree like pouring water into a glass. The water fills level by level, and within each level, it spreads from left to right. You can never have a gap—water can't float. Similarly, in a complete binary tree, you can never have a node without its left sibling being present (unless it's the leftmost at its level).","variant":"tip"},"type":"callout"},{"data":{"content":"**Key Invariant — The Completeness Property:**\n\nFor any node in a complete binary tree:\n\n- If a node has a right child, it **must** have a left child.\n- If a node is at level k < h-1 (not the second-to-last or last level), it **must** have both children.\n- Nodes in the last level have no children (they are all leaves).\n- The 'last' node in a complete binary tree is always the rightmost node in the last level.\n\nThis invariant is what heaps exploit: they always insert at the 'next available position' (after the last node) and delete from the 'last position' (the rightmost leaf), then restore the heap property through bubbling."},"type":"text"}],"titleType":"number","titleNumber":2},{"id":"mathematical-properties","title":"Mathematical Properties of Complete Binary Trees","content":[{"data":{"content":"Complete binary trees possess several elegant mathematical properties that directly impact algorithmic efficiency. Understanding these properties provides insight into why heaps achieve their performance guarantees.\n\n**Property 1: Tight Height Bound**\n\nFor a complete binary tree with **n** nodes, the height **h** is:\n\n```\nh = ⌊log₂(n)⌋\n```\n\n**Proof Sketch:**\n- A complete binary tree of height h has between 2^h (minimum: only one node at last level) and 2^(h+1) - 1 (maximum: perfect tree) nodes.\n- Thus: 2^h ≤ n ≤ 2^(h+1) - 1 < 2^(h+1)\n- Taking log₂: h ≤ log₂(n) < h + 1\n- Therefore: h = ⌊log₂(n)⌋\n\nThis guarantees that any path from root to leaf is O(log n), which bounds the time for heap operations."},"type":"text"},{"data":{"rows":[["0","1","1","1"],["1","2","3","2-3"],["2","4","7","4-7"],["3","8","15","8-15"],["4","16","31","16-31"],["5","32","63","32-63"],["10","1,024","2,047","~1K-2K"],["20","1,048,576","2,097,151","~1M-2M"]],"caption":"Height vs. Node Count for Complete Binary Trees","headers":["Height h","Minimum Nodes","Maximum Nodes","Node Range"]},"type":"table"},{"data":{"content":"**Property 2: Node Count at Each Level**\n\nIn a complete binary tree of height h:\n- Level k (for k < h) contains exactly **2^k** nodes.\n- Level h (the last level) contains between **1** and **2^h** nodes.\n- The total number of nodes n satisfies: **2^h ≤ n ≤ 2^(h+1) - 1**\n\n**Property 3: Leaf vs. Internal Node Distribution**\n\nFor a complete binary tree with n nodes:\n- Number of leaves: **⌈n/2⌉**\n- Number of internal nodes: **⌊n/2⌋**\n\nThis means roughly half the nodes are leaves! This fact is crucial for the O(n) heap-building algorithm we'll see later—most nodes are near the bottom where bubbling down is cheap.\n\n**Property 4: Number of Nodes with Both Children**\n\nIf n is the total number of nodes:\n- Nodes with two children: **n - ⌈n/2⌉ - (0 or 1)** depending on whether the last node's parent has one or two children.\n- For most purposes, approximately **n/2** nodes have both children."},"type":"text"},{"data":{"code":"$76","fileName":"property_verification.py","language":"python"},"type":"code"},{"data":{"icon":"Info","title":"Why Height = ⌊log₂n⌋ Matters","content":"The logarithmic height guarantee is what makes heap operations efficient. With 1 million elements, the height is only 19. This means insert and extract operations never require more than 19 comparisons and swaps—regardless of the data or insertion order. This is a **worst-case guarantee**, not just an average case.","variant":"note"},"type":"callout"}],"titleType":"number","titleNumber":3},{"id":"complete-vs-perfect-vs-full","title":"Complete vs. Perfect vs. Full — Visual Clarification","content":[{"data":{"content":"The distinction between complete, perfect, and full binary trees is one of the most commonly confused topics in data structures education. Let's clarify with explicit visual examples and precise criteria.\n\n**Key Insight:**\n- **Perfect** is a subset of **Complete**: Every perfect binary tree is complete, but not every complete tree is perfect.\n- **Full** is orthogonal to **Complete**: A tree can be full but not complete, complete but not full, both, or neither."},"type":"text"},{"data":{"code":"$77","fileName":"Tree Type Comparisons","language":"text"},"type":"code"},{"data":{"content":"**Why Complete (Not Perfect) for Heaps?**\n\nPerfect binary trees would seem ideal—they're beautifully symmetric and have no wasted potential. So why don't heaps maintain perfect structure?\n\nThe answer is **dynamic operations**. After inserting or deleting a single element:\n- Maintaining a **perfect** tree would require global restructuring (removing an entire level or adding a complete level).\n- Maintaining a **complete** tree requires only a single-point adjustment (add/remove the rightmost leaf of the last level).\n\nComplete trees allow for **incremental** changes: one insert adds exactly one node; one delete removes exactly one node. This is what enables O(log n) operations."},"type":"text"},{"data":{"icon":"Lightbulb","title":"Memory Efficiency Comparison","content":"A perfect binary tree uses 100% of its array capacity efficiently. A complete binary tree with the same height uses at least 50% of capacity (when only one node is in the last level). In contrast, an arbitrary binary tree might use only 0.1% of allocated array space if skewed. The complete property guarantees reasonable memory efficiency while allowing dynamic structure.","variant":"tip"},"type":"callout"}],"titleType":"number","titleNumber":4},{"id":"array-connection-preview","title":"Preview: Why Complete Trees Enable Array Storage","content":[{"data":{"content":"The most profound practical implication of the complete binary tree structure is that it enables **implicit** tree representation using a simple array. We'll explore this in depth in the next module, but let's preview why completeness is the key.\n\n**The Core Insight:**\n\nIf we number nodes 1, 2, 3, 4, ... in level-order (breadth-first) traversal, the complete tree property guarantees that:\n- Node 1 exists (the root)\n- Node 2 exists if and only if n ≥ 2\n- Node 3 exists if and only if n ≥ 3\n- ...\n- Node k exists if and only if n ≥ k\n\nHere, **every index from 1 to n is used, with no gaps**. This means we can store the tree in an array A where A[i] contains the value of node i."},"type":"text"},{"data":{"code":"$78","fileName":"Complete Tree to Array Mapping","language":"text"},"type":"code"},{"data":{"content":"**The Contiguity Guarantee:**\n\nComplete binary trees guarantee that if you store n nodes, you use exactly n array positions (plus potentially one unused position at index 0 for convenience). There's no wasted space from gaps.\n\n**Comparison of Storage Efficiency:**"},"type":"text"},{"data":{"rows":[["Complete binary tree","n (exactly)","100%"],["Perfect binary tree","n (exactly)","100%"],["Full binary tree","Up to 2^n (exponential)","Can be < 1%"],["Arbitrary binary tree","Up to 2^n","Can be < 0.01%"]],"headers":["Tree Type","Array Positions for n Nodes","Efficiency"]},"type":"table"},{"data":{"content":"For a skewed tree (linked list shape) of n nodes, you would need 2^n array positions to maintain the parent/child index formulas. For n = 30, that's over a billion positions for 30 elements—clearly absurd. Complete trees eliminate this problem entirely."},"type":"text"},{"data":{"icon":"AlertCircle","title":"Pointer-Based vs. Array-Based Tradeoffs","content":"Pointer-based trees can represent ANY binary tree shape efficiently, but require extra memory for two pointers per node and have poor cache locality. Array-based trees require the complete property but eliminate pointer overhead and achieve excellent cache performance. For heaps, the complete structure makes arrays the clear winner.","variant":"warning"},"type":"callout"}],"titleType":"number","titleNumber":5},{"id":"complete-trees-context","title":"Complete Binary Trees in the Broader DSA Context","content":[{"data":{"content":"Complete binary trees appear in several important contexts beyond heaps. Understanding their role across data structures reinforces why this shape is so valuable.\n\n**1. Binary Heaps (Priority Queues)**\n\nThe primary use case. The complete tree structure enables:\n- O(log n) insertion via 'bubble up' from the last position\n- O(log n) extraction via 'bubble down' from the root\n- O(n) construction via bottom-up heapify\n- Efficient array storage without pointers\n\n**2. Heapsort Algorithm**\n\nHeapsort builds a heap in the input array itself, exploiting the complete tree structure to achieve O(n log n) sorting with O(1) extra space.\n\n**3. Nearly Complete Trees in Practice**\n\nSome data structures use 'almost complete' trees where slight deviations are allowed for specific purposes:\n- **Segment trees**: Complete trees with 2n-1 nodes for n leaf values\n- **Binary indexed trees (Fenwick trees)**: Conceptually related to complete tree indexing\n- **Tournament trees**: Complete trees for tournament-style selection"},"type":"text"},{"data":{"items":["**Guaranteed O(log n) height** — The most balanced shape possible for any given n, ensuring logarithmic path lengths.","**Implicit structure** — Parent-child relationships derived from index arithmetic, eliminating pointer storage and traversal overhead.","**Cache efficiency** — Sequential array storage means sequential memory access patterns, maximizing CPU cache utilization.","**Predictable memory** — Exactly n positions for n elements, with no fragmentation or variable overhead per element.","**Simple insertion point** — The 'next' position is always deterministic: index n+1 (for 1-indexed arrays)."],"title":{"icon":"Lightbulb","text":"Why the Complete Shape Keeps Appearing","type":"icon","color":"primary","variant":"outline-circle"},"variant":"accent"},"type":"list"},{"data":{"content":"**Contrast with BST-Based Trees:**\n\nBalanced BSTs (AVL, Red-Black) make different tradeoffs:\n- They maintain **search tree ordering** (left < root < right), which complete trees don't guarantee\n- They use pointer-based representation, allowing any shape\n- They're 'approximately balanced' but not necessarily 'complete'\n- They support ordered operations (predecessor, successor, range queries)\n\nHeaps trade away ordered structure for simpler balancing. The complete tree property is the heap's balancing mechanism—it's maintained automatically by always inserting at the 'next' position."},"type":"text"}],"titleType":"number","titleNumber":6},{"id":"summary","title":"Summary: The Complete Binary Tree Foundation","content":[{"data":{"content":"We've established the foundational understanding of complete binary trees—the structural constraint that makes heap implementations efficient. Let's consolidate the key insights:"},"type":"text"},{"data":{"type":"ordered","items":["**Complete binary trees have all levels full except possibly the last, which is filled left-to-right** — This is the defining property that distinguishes complete from full, perfect, and general binary trees.","**Height is exactly ⌊log₂(n)⌋ for n nodes** — This tight bound guarantees O(log n) worst-case path lengths, critical for heap operation efficiency.","**Node indices are contiguous in level-order numbering** — If we number nodes 1 through n in BFS order, there are no gaps, enabling direct array storage.","**Roughly half the nodes are leaves** — The ⌈n/2⌉ leaf count is important for analyzing heap construction time.","**Complete ⊇ Perfect, but Complete is independent of Full** — Understanding the taxonomy prevents terminology confusion.","**Completeness enables array representation** — This eliminates pointer overhead and provides cache-efficient storage."],"title":{"icon":"CheckCircle","text":"Key Takeaways","type":"icon","color":"primary","variant":"outline-circle"},"variant":"accent"},"type":"list"},{"data":{"content":"**What's Next:**\n\nWith the complete binary tree concept firmly established, we now turn to how this structure is filled: the **level-by-level filling** process. This process is not just a construction algorithm—it's the invariant that heap operations maintain, and understanding it deeply will clarify how insertions and deletions work."},"type":"text"},{"data":{"icon":"CheckCircle","title":"Page Complete","content":"You now understand what makes a complete binary tree structurally unique and why this specific shape is essential for efficient heap implementations. The contiguous indexing property is the bridge between abstract tree structure and practical array storage.","variant":"success"},"type":"callout"}],"titleType":"number","titleNumber":7}],"isLocked":false},{"id":"seed_80dcb5feba6126beb2de975cf77a0548","title":"Level-by-Level Filling","order":1,"content":null,"isLocked":true},{"id":"seed_da15e5eba4bd215f31bd9ec3a01e927d","title":"Why Completeness Enables Array Storage","order":2,"content":null,"isLocked":true},{"id":"seed_e50d02618d26659052f068b8d27cb9f4","title":"Height Guarantees — O(log n)","order":3,"content":null,"isLocked":true}]}},"dataUpdateCount":1,"dataUpdatedAt":1792306282141,"error":null,"errorUpdateCount":0,"errorUpdatedAt":0,"fetchFailureCount":0,"fetchFailureReason":null,"fetchMeta":null,"isInvalidated":false,"status":"success","fetchStatus":"idle"},"queryKey":[["learningContent","getModule"],{"input":{"slug":"complete-binary-tree-representation"},"type":"query"}],"queryHash":"[[\"learningContent\",\"getModule\"],{\"input\":{\"slug\":\"complete-binary-tree-representation\"},\"type\":\"query\"}]"},{"dehydratedAt":1792306282197,"state":{"data":{"json":null},"dataUpdateCount":1,"dataUpdatedAt":1792306282144,"error":null,"errorUpdateCount":0,"errorUpdatedAt":0,"fetchFailureCount":0,"fetchFailureReason":null,"fetchMeta":null,"isInvalidated":false,"status":"success","fetchStatus":"idle"},"queryKey":[["learningContent","getProgress"],{"input":{"moduleId":"seed_09032688655d1584fcbb928af1336c6b"},"type":"query"}],"queryHash":"[[\"learningContent\",\"getProgress\"],{\"input\":{\"moduleId\":\"seed_09032688655d1584fcbb928af1336c6b\"},\"type\":\"query\"}]"},{"dehydratedAt":1792306282197,"state":{"data":{"json":null},"dataUpdateCount":1,"dataUpdatedAt":1792306282144,"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_da15e5eba4bd215f31bd9ec3a01e927d"},"type":"query"}],"queryHash":"[[\"feedback\",\"get\"],{\"input\":{\"contentId\":\"seed_da15e5eba4bd215f31bd9ec3a01e927d\",\"contentType\":\"LEARNING_PAGE\"},\"type\":\"query\"}]"},{"dehydratedAt":1792306282197,"state":{"data":{"json":null},"dataUpdateCount":1,"dataUpdatedAt":1792306282144,"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_da15e5eba4bd215f31bd9ec3a01e927d"},"type":"query"}],"queryHash":"[[\"feedback\",\"getUserLike\"],{\"input\":{\"contentId\":\"seed_da15e5eba4bd215f31bd9ec3a01e927d\",\"contentType\":\"LEARNING_PAGE\"},\"type\":\"query\"}]"},{"dehydratedAt":1792306282197,"state":{"data":{"json":[]},"dataUpdateCount":1,"dataUpdatedAt":1792306282144,"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_da15e5eba4bd215f31bd9ec3a01e927d"},"type":"query"}],"queryHash":"[[\"highlights\",\"getHighlights\"],{\"input\":{\"contentId\":\"seed_da15e5eba4bd215f31bd9ec3a01e927d\",\"contentType\":\"LEARNING_PAGE\"},\"type\":\"query\"}]"},{"dehydratedAt":1792306282197,"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_da15e5eba4bd215f31bd9ec3a01e927d","minCount":2},"type":"query"}],"queryHash":"[[\"highlights\",\"getPopularHighlights\"],{\"input\":{\"contentId\":\"seed_da15e5eba4bd215f31bd9ec3a01e927d\",\"contentType\":\"LEARNING_PAGE\",\"minCount\":2},\"type\":\"query\"}]","promise":"$@79"}]},"children":"$L7a"}]