{
  "main": {
    "id": "9856b59c373440ec",
    "type": "split",
    "children": [
      {
        "id": "cf977333cff98c94",
        "type": "leaf",
        "state": {
          "type": "markdown",
          "state": {
            "file": "CS notes/pages/Leetcode Merge-Two-Sorted-Lists.md",
            "mode": "preview",
            "source": true
          }
        }
      }
    ],
    "direction": "vertical"
  },
  "left": {
    "id": "654e26088317eda6",
    "type": "split",
    "children": [
      {
        "id": "7a26546a3eef59fe",
        "type": "tabs",
        "dimension": 79.95991983967936,
        "children": [
          {
            "id": "9ca42282f81f27a8",
            "type": "leaf",
            "state": {
              "type": "file-explorer",
              "state": {}
            }
          }
        ]
      },
      {
        "id": "b06d39b00e327dc3",
        "type": "tabs",
        "dimension": 20.04008016032064,
        "children": [
          {
            "id": "9fd87fc5ad3e86ee",
            "type": "leaf",
            "state": {
              "type": "starred",
              "state": {}
            }
          }
        ]
      }
    ],
    "direction": "horizontal",
    "width": 300
  },
  "right": {
    "id": "18d35bef74f2720b",
    "type": "split",
    "children": [
      {
        "id": "142873fcfcd0f687",
        "type": "tabs",
        "dimension": 40.3807615230461,
        "children": [
          {
            "id": "9c3fdcfa76b34713",
            "type": "leaf",
            "state": {
              "type": "backlink",
              "state": {
                "file": "CS notes/pages/Leetcode Merge-Two-Sorted-Lists.md",
                "collapseAll": true,
                "extraContext": false,
                "sortOrder": "alphabetical",
                "showSearch": false,
                "searchQuery": "",
                "backlinkCollapsed": false,
                "unlinkedCollapsed": false
              }
            }
          },
          {
            "id": "7b7f58052ceefca4",
            "type": "leaf",
            "state": {
              "type": "outgoing-link",
              "state": {
                "file": "CS notes/pages/Leetcode Merge-Two-Sorted-Lists.md",
                "linksCollapsed": false,
                "unlinkedCollapsed": true
              }
            }
          },
          {
            "id": "e20d98be4c26fe37",
            "type": "leaf",
            "state": {
              "type": "tag",
              "state": {
                "sortOrder": "frequency",
                "useHierarchy": true
              }
            }
          },
          {
            "id": "8d7c07d8147a8fab",
            "type": "leaf",
            "state": {
              "type": "outline",
              "state": {
                "file": "CS notes/pages/Leetcode Merge-Two-Sorted-Lists.md"
              }
            }
          }
        ]
      },
      {
        "id": "34f8b139a3c9a1fc",
        "type": "tabs",
        "dimension": 59.6192384769539,
        "children": [
          {
            "id": "bcccacca989eec17",
            "type": "leaf",
            "state": {
              "type": "search",
              "state": {
                "query": "tag:#algorithm tag:#CS_analysis -tag:#template_remove_me ",
                "matchingCase": false,
                "explainSearch": false,
                "collapseAll": false,
                "extraContext": false,
                "sortOrder": "alphabetical"
              }
            }
          }
        ]
      }
    ],
    "direction": "horizontal",
    "width": 300
  },
  "active": "cf977333cff98c94",
  "lastOpenFiles": [
    "CS notes/pages/Leetcode Merge-Two-Sorted-Lists.md",
    "Untitled.md",
    "CS notes/pages/Two pointers approach.md",
    "CS notes/CS-index.md",
    "CS notes/pages/cpp_std_multiset.md",
    "CS notes/pages/Leetcode Linked-List-Cycle.md",
    "CS notes/pages/Floyd's Cycle Finding Algorithm.md",
    "CS notes/pages/Binary Search Algorithm.md",
    "CS notes/pages/Leetcode Valid-Anagram.md",
    "CS notes/pages/Leetcode First-Unique-Character-In-a-String.md"
  ]
}