{
  "main": {
    "id": "9856b59c373440ec",
    "type": "split",
    "children": [
      {
        "id": "7f1e0d32474d7f56",
        "type": "leaf",
        "state": {
          "type": "markdown",
          "state": {
            "file": "CS notes/pages/Binary Search Algorithm.md",
            "mode": "preview",
            "source": true
          }
        }
      }
    ],
    "direction": "vertical"
  },
  "left": {
    "id": "4df80c244df89992",
    "type": "split",
    "children": [
      {
        "id": "05fd175d18f726b6",
        "type": "tabs",
        "dimension": 51.903807615230455,
        "children": [
          {
            "id": "1c165a5cf2b9c326",
            "type": "leaf",
            "state": {
              "type": "file-explorer",
              "state": {}
            }
          },
          {
            "id": "3b4f0233e4d2e914",
            "type": "leaf",
            "state": {
              "type": "starred",
              "state": {}
            }
          }
        ]
      },
      {
        "id": "2a4494dde1da5a18",
        "type": "tabs",
        "dimension": 48.09619238476954,
        "children": [
          {
            "id": "903409388dafd248",
            "type": "leaf",
            "state": {
              "type": "search",
              "state": {
                "query": "tag:#vector OR tag:#vector_2d OR tag:#binary_search",
                "matchingCase": false,
                "explainSearch": false,
                "collapseAll": false,
                "extraContext": false,
                "sortOrder": "alphabetical"
              }
            }
          }
        ]
      }
    ],
    "direction": "horizontal",
    "width": 353
  },
  "right": {
    "id": "04ea9e39cc69c7f6",
    "type": "split",
    "children": [
      {
        "id": "ae88bff2fa365bea",
        "type": "tabs",
        "dimension": 42.384769539078164,
        "children": [
          {
            "id": "4010cf71e69497ee",
            "type": "leaf",
            "state": {
              "type": "outline",
              "state": {
                "file": "CS notes/pages/Binary Search Algorithm.md"
              }
            }
          },
          {
            "id": "2779adef8530c5c4",
            "type": "leaf",
            "state": {
              "type": "tag",
              "state": {
                "sortOrder": "frequency",
                "useHierarchy": true
              }
            }
          },
          {
            "id": "e64d81c7b14c0ddd",
            "type": "leaf",
            "state": {
              "type": "localgraph",
              "state": {
                "file": "CS notes/pages/Binary Search Algorithm.md",
                "options": {
                  "collapse-filter": true,
                  "search": "",
                  "localJumps": 1,
                  "localBacklinks": true,
                  "localForelinks": true,
                  "localInterlinks": true,
                  "showTags": true,
                  "showAttachments": false,
                  "hideUnresolved": false,
                  "collapse-color-groups": true,
                  "colorGroups": [],
                  "collapse-display": false,
                  "showArrow": false,
                  "textFadeMultiplier": 0,
                  "nodeSizeMultiplier": 1,
                  "lineSizeMultiplier": 1,
                  "collapse-forces": false,
                  "centerStrength": 0.518713248970312,
                  "repelStrength": 10,
                  "linkStrength": 1,
                  "linkDistance": 250,
                  "scale": 0.8220621549603881,
                  "close": true
                }
              }
            }
          }
        ],
        "currentTab": 2
      },
      {
        "id": "4239da40b67cb6ed",
        "type": "tabs",
        "dimension": 57.615230460921836,
        "children": [
          {
            "id": "79e6bf126ce52f00",
            "type": "leaf",
            "state": {
              "type": "backlink",
              "state": {
                "file": "CS notes/pages/Binary Search Algorithm.md",
                "collapseAll": false,
                "extraContext": false,
                "sortOrder": "alphabetical",
                "showSearch": false,
                "searchQuery": "",
                "backlinkCollapsed": false,
                "unlinkedCollapsed": false
              }
            }
          },
          {
            "id": "dc83579d04e04264",
            "type": "leaf",
            "state": {
              "type": "outgoing-link",
              "state": {
                "file": "CS notes/pages/Binary Search Algorithm.md",
                "linksCollapsed": false,
                "unlinkedCollapsed": false
              }
            }
          }
        ]
      }
    ],
    "direction": "horizontal",
    "width": 377
  },
  "active": "7f1e0d32474d7f56",
  "lastOpenFiles": [
    "CS notes/pages/Binary Search Algorithm.md",
    "CS notes/pages/Leetcode Search-a-2D-Matrix.md",
    "CS notes/pages/Leetcode Two-Sum.md",
    "CS notes/pages/Leetcode Merge-Sorted-Array.md",
    "CS notes/pages/Leetcode Valid-Sodoku.md",
    "CS notes/pages/Leetcode Reshape-The-Matrix.md",
    "CS notes/pages/Leetcode Pascal's-Triangle.md",
    "CS notes/pages/Leetcode Maxinum-subarray.md",
    "CS notes/pages/Kadane's Algorithm.md",
    "CS notes/pages/cpp_std_sort.md"
  ]
}