{"version":1,"pages":[{"id":"ERu8lfLbcpT72wBtlLnX","title":"Coding Interview Patterns","pathname":"/coding-interview-patterns","siteSpaceId":"sitesp_ELBEJ","description":""},{"id":"-MbBOLIM1nswZIzig7AR","title":"1. Pattern: Sliding Window","pathname":"/coding-interview-patterns/1.-pattern-sliding-window","siteSpaceId":"sitesp_ELBEJ","description":""},{"id":"-MbFJg_0UWGNVWeZWCAC","title":"1.0 Introduction","pathname":"/coding-interview-patterns/1.-pattern-sliding-window/1.0-introduction","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"1. Pattern: Sliding Window"}]},{"id":"-MbBOYAy8zu0U5zwSW-d","title":"1.1 Maximum Sum Subarray of Size K (easy)","pathname":"/coding-interview-patterns/1.-pattern-sliding-window/1.1-maximum-sum-subarray-of-size-k-easy","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"1. Pattern: Sliding Window"}]},{"id":"-MbBP5HRRCtwakpNeeYd","title":"1.2 Smallest Subarray with a given sum (easy)","pathname":"/coding-interview-patterns/1.-pattern-sliding-window/1.2-smallest-subarray-with-a-given-sum-easy","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"1. Pattern: Sliding Window"}]},{"id":"-MbBPrOiJfrEaF30oXyC","title":"1.3 Longest Substring with K Distinct Characters (medium)","pathname":"/coding-interview-patterns/1.-pattern-sliding-window/1.3-longest-substring-with-k-distinct-characters-medium","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"1. Pattern: Sliding Window"}]},{"id":"-MbBPyMEvfi_iwQq3Fjf","title":"1.4 Fruits into Baskets (medium)","pathname":"/coding-interview-patterns/1.-pattern-sliding-window/1.4-fruits-into-baskets-medium","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"1. Pattern: Sliding Window"}]},{"id":"-MbBQ30bxrj2TWXigbp4","title":"1.5 No-repeat Substring (hard)","pathname":"/coding-interview-patterns/1.-pattern-sliding-window/1.5-no-repeat-substring-hard","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"1. Pattern: Sliding Window"}]},{"id":"-MbBQFKjcI46sKNogj8s","title":"1.6 Longest Substring with Same Letters after Replacement (hard)","pathname":"/coding-interview-patterns/1.-pattern-sliding-window/1.6-longest-substring-with-same-letters-after-replacement-hard","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"1. Pattern: Sliding Window"}]},{"id":"-MbBQRQLH-Igq7hocMpl","title":"1.7 Longest Subarray with Ones after Replacement (hard)","pathname":"/coding-interview-patterns/1.-pattern-sliding-window/1.7-longest-subarray-with-ones-after-replacement-hard","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"1. Pattern: Sliding Window"}]},{"id":"-MbBQZoLKkQwHee_x6a8","title":"1.8 - Permutation in a String (hard)","pathname":"/coding-interview-patterns/1.-pattern-sliding-window/1.8-permutation-in-a-string-hard","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"1. Pattern: Sliding Window"}]},{"id":"-MbBQfzUi865UGU8VKfy","title":"1.9 String Anagrams (hard)","pathname":"/coding-interview-patterns/1.-pattern-sliding-window/1.9-string-anagrams-hard","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"1. Pattern: Sliding Window"}]},{"id":"-MbBQmt5wtMBSCquvMiG","title":"1.10 Smallest Window containing Substring (hard)","pathname":"/coding-interview-patterns/1.-pattern-sliding-window/1.10-smallest-window-containing-substring-hard","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"1. Pattern: Sliding Window"}]},{"id":"-MbBQtDq03JhvUrDsSav","title":"1.11 Words Concatenation (hard)","pathname":"/coding-interview-patterns/1.-pattern-sliding-window/1.11-words-concatenation-hard","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"1. Pattern: Sliding Window"}]},{"id":"-MbBR8pVvuW293r9Wbmh","title":"2. Pattern: Two Pointers","pathname":"/coding-interview-patterns/2.-pattern-two-pointers","siteSpaceId":"sitesp_ELBEJ","description":""},{"id":"-MbFNAjG-uk68c6xA3gn","title":"2.0 Introduction","pathname":"/coding-interview-patterns/2.-pattern-two-pointers/2.0-introduction","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"2. Pattern: Two Pointers"}]},{"id":"-MbBTjO6FFQHuyxIdnCA","title":"2.1 Pair with Target Sum (easy)","pathname":"/coding-interview-patterns/2.-pattern-two-pointers/2.1-pair-with-target-sum-easy","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"2. Pattern: Two Pointers"}]},{"id":"-MbBU2MxE0OYVq1Dg-ip","title":"2.2 Remove Duplicates (easy)","pathname":"/coding-interview-patterns/2.-pattern-two-pointers/2.2-remove-duplicates-easy","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"2. Pattern: Two Pointers"}]},{"id":"-MbBU77L-CttRuFaE2cw","title":"2.3 Squaring a Sorted Array (easy)","pathname":"/coding-interview-patterns/2.-pattern-two-pointers/2.3-squaring-a-sorted-array-easy","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"2. Pattern: Two Pointers"}]},{"id":"-MbBUHkMRjRuS5cYRSuk","title":"2.4 Triplet Sum to Zero (medium)","pathname":"/coding-interview-patterns/2.-pattern-two-pointers/2.4-triplet-sum-to-zero-medium","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"2. Pattern: Two Pointers"}]},{"id":"-MbBUOSEWNoeqf-ESa-D","title":"2.5 Triplet Sum Close to Target (medium)","pathname":"/coding-interview-patterns/2.-pattern-two-pointers/2.5-triplet-sum-close-to-target-medium","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"2. Pattern: Two Pointers"}]},{"id":"-MbBUU4MZB3QY2s7N8jB","title":"2.6 Triplets with Smaller Sum (medium)","pathname":"/coding-interview-patterns/2.-pattern-two-pointers/2.6-triplets-with-smaller-sum-medium","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"2. Pattern: Two Pointers"}]},{"id":"-MbBV2PNzlasxPAZf7cV","title":"2.7 Subarrays with Product Less than a Target (medium)","pathname":"/coding-interview-patterns/2.-pattern-two-pointers/2.7-subarrays-with-product-less-than-a-target-medium","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"2. Pattern: Two Pointers"}]},{"id":"-MbBV8kDvAATqi3RiwG0","title":"2.8 Dutch National Flag Problem (medium)","pathname":"/coding-interview-patterns/2.-pattern-two-pointers/2.8-dutch-national-flag-problem-medium","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"2. Pattern: Two Pointers"}]},{"id":"-MbBVFbzWfx3_ejS8bCJ","title":"2.9 Comparing Strings containing Backspaces (medium)","pathname":"/coding-interview-patterns/2.-pattern-two-pointers/2.9-comparing-strings-containing-backspaces-medium","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"2. Pattern: Two Pointers"}]},{"id":"-MbBVLo_S4rUibvhQLsO","title":"2.10 Minimum Window Sort (medium)","pathname":"/coding-interview-patterns/2.-pattern-two-pointers/2.10-minimum-window-sort-medium","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"2. Pattern: Two Pointers"}]},{"id":"-MbBUGn3reLTrPyliKSQ","title":"7. Pattern: Tree Breadth First Search","pathname":"/coding-interview-patterns/untitled","siteSpaceId":"sitesp_ELBEJ","description":""},{"id":"2UpTGr4pg5PySfW3LNXb","title":"7.0 Introduction","pathname":"/coding-interview-patterns/untitled/7.0-introduction","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"7. Pattern: Tree Breadth First Search"}]},{"id":"2je3gtvBkhPeO2Wrnokn","title":"7.1 Binary Tree Level Order Traversal (easy)","pathname":"/coding-interview-patterns/untitled/7.1-binary-tree-level-order-traversal-easy","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"7. Pattern: Tree Breadth First Search"}]},{"id":"Nz86kzgzbBD8Qu5OImZN","title":"7.2 Reverse Level Order Traversal (easy)","pathname":"/coding-interview-patterns/untitled/7.2-reverse-level-order-traversal-easy","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"7. Pattern: Tree Breadth First Search"}]},{"id":"HUbGyGtsK4rXxBC63N74","title":"7.3 Zigzag Traversal (medium)","pathname":"/coding-interview-patterns/untitled/7.3-zigzag-traversal-medium","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"7. Pattern: Tree Breadth First Search"}]},{"id":"7lBjLoj1jTA06gqTY8BM","title":"7.4 Level Averages in a Binary Tree (easy)","pathname":"/coding-interview-patterns/untitled/7.4-level-averages-in-a-binary-tree-easy","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"7. Pattern: Tree Breadth First Search"}]},{"id":"rJUMKf1YJvLaE6Xlw6c1","title":"7.5 Minimum Depth of a Binary Tree (easy)","pathname":"/coding-interview-patterns/untitled/7.5-minimum-depth-of-a-binary-tree-easy","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"7. Pattern: Tree Breadth First Search"}]},{"id":"v8QiDNNakV82r9XEhjNd","title":"7.6 Maximum Depth of Binary Tree (easy)","pathname":"/coding-interview-patterns/untitled/7.6-maximum-depth-of-binary-tree-easy","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"7. Pattern: Tree Breadth First Search"}]},{"id":"ViV20Cemzp5fFmr4QlLD","title":"7.7 Level Order Successor (easy)","pathname":"/coding-interview-patterns/untitled/7.7-level-order-successor-easy","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"7. Pattern: Tree Breadth First Search"}]},{"id":"6tFmREqFu3Rb9THiJce4","title":"7.8 Connect Level Order Siblings (medium)","pathname":"/coding-interview-patterns/untitled/7.8-connect-level-order-siblings-medium","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"7. Pattern: Tree Breadth First Search"}]},{"id":"FSfOeEA9cBscbqmqF5Dn","title":"7.9 Problem Challenge 1 - Connect All Level Order Siblings (medium)","pathname":"/coding-interview-patterns/untitled/7.9-problem-challenge-1-connect-all-level-order-siblings-medium","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"7. Pattern: Tree Breadth First Search"}]},{"id":"ZS3j8ZxHDnji9Ow0UjyR","title":"7.10 Problem Challenge 2 - Right View of a Binary Tree (easy)","pathname":"/coding-interview-patterns/untitled/7.10-problem-challenge-2-right-view-of-a-binary-tree-easy","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"7. Pattern: Tree Breadth First Search"}]},{"id":"ygnC6EwXJmqsdeSZj12J","title":"11. Pattern: Modified Binary Search","pathname":"/coding-interview-patterns/11.-pattern-modified-binary-search","siteSpaceId":"sitesp_ELBEJ","description":""},{"id":"qSWnrq4HhcSTis2fvD02","title":"11.1 Introduction","pathname":"/coding-interview-patterns/11.-pattern-modified-binary-search/11.1-introduction","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"11. Pattern: Modified Binary Search"}]},{"id":"YZnPXx4NVg5bYhXKQwyl","title":"11.2 Order-agnostic Binary Search (easy)","pathname":"/coding-interview-patterns/11.-pattern-modified-binary-search/11.2-order-agnostic-binary-search-easy","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"11. Pattern: Modified Binary Search"}]},{"id":"nlcr18fVX5qS3iyY1IIG","title":"11.3","pathname":"/coding-interview-patterns/11.-pattern-modified-binary-search/11.3","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"11. Pattern: Modified Binary Search"}]},{"id":"ztRfOU5TXbrGlomdhAeJ","title":"16. Pattern: Topological Sort (Graph)","pathname":"/coding-interview-patterns/16.-pattern-topological-sort-graph","siteSpaceId":"sitesp_ELBEJ","description":""},{"id":"Ki0WZIP1KPyf4dXZ5SHB","title":"16.1 Introduction","pathname":"/coding-interview-patterns/16.-pattern-topological-sort-graph/16.1-introduction","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"16. Pattern: Topological Sort (Graph)"}]},{"id":"nxtyA0lmi1wkIXmdK0nh","title":"16.2 Topological Sort (medium)","pathname":"/coding-interview-patterns/16.-pattern-topological-sort-graph/16.2-topological-sort-medium","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"16. Pattern: Topological Sort (Graph)"}]},{"id":"1eERePUtYaEuahyNCON3","title":"16.3 Tasks Scheduling (medium)","pathname":"/coding-interview-patterns/16.-pattern-topological-sort-graph/16.3-tasks-scheduling-medium","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"16. Pattern: Topological Sort (Graph)"}]},{"id":"fspYPfFtuCNTOKuCCxa6","title":"16.4 Tasks Scheduling Order (medium)","pathname":"/coding-interview-patterns/16.-pattern-topological-sort-graph/16.4-tasks-scheduling-order-medium","siteSpaceId":"sitesp_ELBEJ","description":"","breadcrumbs":[{"label":"16. Pattern: Topological Sort (Graph)"}]},{"id":"-MbBMRbxNA1RODRNQQgr","title":"Contributor Covenant Code of Conduct","pathname":"/coding-interview-patterns/code_of_conduct","siteSpaceId":"sitesp_ELBEJ","description":""},{"id":"NMqeQuYuLOW1n4yb2RMF","title":"Page 1","pathname":"/coding-interview-patterns/page-1","siteSpaceId":"sitesp_ELBEJ","description":""}]}