{"version":1,"pages":[{"id":"-MXD5fEE59a6A11i8XWk","title":"Welcome!","pathname":"/","siteSpaceId":"sitesp_sHtvd","emoji":"1f929","description":"Oliver's Blog"},{"id":"7Jc6QSTO4RfofmGJ8Xse","title":"RISC Game","pathname":"/projects/risc-game","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Projects"}]},{"id":"xjyBs9N26OYydSXgSb5Q","title":"Mini Amazon","pathname":"/projects/mini-amazon","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Projects"}]},{"id":"ebBEB5zXHCcn8ZwaHPpW","title":"HTTP Caching Proxy","pathname":"/projects/http-caching-proxy","siteSpaceId":"sitesp_sHtvd","description":"Introducing My HTTP Caching Proxy Project: A High-Performance, Scalable Solution As part of my efforts to deepen my understanding of networking, HTTP protocols, and high-performance server development","breadcrumbs":[{"label":"Projects"}]},{"id":"wuFnaE82JIOmU3439k2e","title":"Course Enrollment App","pathname":"/projects/course-enrollment-app","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Projects"}]},{"id":"s7QGCzKbelZBKMSrXSbO","title":"Fitness Tracker App","pathname":"/projects/fitness-tracker-app","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Projects"}]},{"id":"Wx1m5NJxXxFOgD2X04Un","title":"Voice Shopping Assistant","pathname":"/projects/voice-shopping-assistant","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Projects"}]},{"id":"Mn34KVCGv3IZ26XY1jeN","title":"Graphics Town","pathname":"/projects/graphics-town","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Projects"}]},{"id":"-Mavjm0S7dSoHbHfes1H","title":"Binary Search","pathname":"/algo/binary-search","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Algo"}]},{"id":"-Mavjq9WQuPqJMdLvINk","title":"Classical Binary Search","pathname":"/algo/binary-search/classical-binary-search","siteSpaceId":"sitesp_sHtvd","description":"ID: 457; easy; 经典二分查找问题","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-Mavn3zA7YLpIhMDQ8ld","title":"First Position of Target","pathname":"/algo/binary-search/first-position-of-target","siteSpaceId":"sitesp_sHtvd","description":"ID: 14; easy; 二分查找","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-Mavn4M1xmlx16Ngxa-K","title":"Last Position of Target","pathname":"/algo/binary-search/last-position-of-target","siteSpaceId":"sitesp_sHtvd","description":"ID: 458; easy; 目标最后位置","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-MavnRcY9MWFsg5Qu58y","title":"Guess Number Higher or Lower","pathname":"/algo/binary-search/guess-number-higher-or-lower","siteSpaceId":"sitesp_sHtvd","description":"ID: 662; easy; 猜数游戏","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-Mb793kgGTLfrXuCLf5c","title":"Search in a Big Sorted Array","pathname":"/algo/binary-search/search-in-a-big-sorted-array","siteSpaceId":"sitesp_sHtvd","description":"ID: 447; medium; 在大数组中查找","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-Mb72vBAUzmSd_Ynxp6R","title":"Total Occurrence of Target","pathname":"/algo/binary-search/total-occurrence-of-target","siteSpaceId":"sitesp_sHtvd","description":"ID: 462; easy; 目标出现总和","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-MavoGlL3KDAxLSvXLfp","title":"First Bad Version","pathname":"/algo/binary-search/first-bad-version","siteSpaceId":"sitesp_sHtvd","description":"ID; 74; medium; 第一个错误的代码版本","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-MavoSLs0Ykm9fU9rWBW","title":"Find Minimum in Rotated Sorted Array","pathname":"/algo/binary-search/find-minimum-in-rotated-sorted-array","siteSpaceId":"sitesp_sHtvd","description":"ID: 159; medium; 寻找旋转排序数组中的最小值","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-MavoZ_t8Pgp3cOcfceO","title":"Maximum Number in Mountain Sequence","pathname":"/algo/binary-search/maximum-number-in-mountain-sequence","siteSpaceId":"sitesp_sHtvd","description":"ID: 585; medium; 山脉序列中的最大值","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-Mb7T9-WSAHnrxCw5fdg","title":"Search a 2D Matrix","pathname":"/algo/binary-search/search-a-2d-matrix","siteSpaceId":"sitesp_sHtvd","description":"ID: 28; easy; 搜索二维矩阵","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-Mb7T9uoc-Z3XglXFu-D","title":"Search a 2D Matrix II","pathname":"/algo/binary-search/search-a-2d-matrix-ii","siteSpaceId":"sitesp_sHtvd","description":"ID: 38; medium; 搜索二维矩阵（二）","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-Mb7T9lbppGzF8aaKqrr","title":"Search for a Range","pathname":"/algo/binary-search/search-for-a-range","siteSpaceId":"sitesp_sHtvd","description":"ID: 61; medium; 搜索区间","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-Mb7T9bTaFa-zb0umBIS","title":"Smallest Rectangle Enclosing Black Pixels","pathname":"/algo/binary-search/smallest-rectangle-enclosing-black-pixels","siteSpaceId":"sitesp_sHtvd","description":"ID: 600; hard; 包裹黑色像素点的最小矩形","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-Mb7T9OwTfuta-d_Jg4S","title":"Find Peak Element","pathname":"/algo/binary-search/find-peak-element","siteSpaceId":"sitesp_sHtvd","description":"ID: 75; medium; 寻找峰值","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-Mb8ZVmhClZ_k4To-p0R","title":"Search in Rotated Sorted Array","pathname":"/algo/binary-search/search-in-rotated-sorted-array","siteSpaceId":"sitesp_sHtvd","description":"ID: 62; medium; 搜索旋转排序数组","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-MbI7gTXq3JWJGd0KOuW","title":"Wood Cut","pathname":"/algo/binary-search/wood-cut","siteSpaceId":"sitesp_sHtvd","description":"ID; 183; hard; 木材加工","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-MbIHuO7MVOgOuT_9qVw","title":"Find the Duplicate Number","pathname":"/algo/binary-search/find-the-duplicate-number","siteSpaceId":"sitesp_sHtvd","description":"ID: 633; medium; 寻找重复的数","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-MbII7WnxtgjJimdx5RP","title":"Sqrt(x) II","pathname":"/algo/binary-search/sqrt-x-ii","siteSpaceId":"sitesp_sHtvd","description":"ID: 586; medium; 对x开根II","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-MbII8jparqCWZPK3Omf","title":"Maximum Average Subarray II","pathname":"/algo/binary-search/maximum-average-subarray-ii","siteSpaceId":"sitesp_sHtvd","description":"ID: 617; medium; 子数组的最大平均值 II","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-MbII9jwDZoGL_Z9tQGa","title":"Copy Books","pathname":"/algo/binary-search/copy-books","siteSpaceId":"sitesp_sHtvd","description":"ID: 437; medium; 书籍复印","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-MbIhLbgU7LNH0IfK69h","title":"How Many Problem Can I Accept","pathname":"/algo/binary-search/how-many-problem-can-i-accept","siteSpaceId":"sitesp_sHtvd","description":"ID: 937; medium; 可以完成的题目数量","breadcrumbs":[{"label":"Algo"},{"label":"Binary Search"}]},{"id":"-MaiqPvmJAgH2CFsvxwt","title":"Linked List","pathname":"/algo/linked-list","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Algo"}]},{"id":"-MbOJdDnVnpEwxOmGh8A","title":"Insert Node in Sorted Linked List","pathname":"/algo/linked-list/insert-node-in-sorted-linked-list","siteSpaceId":"sitesp_sHtvd","description":"ID: 219; easy; 在排序链表中插入一个节点","breadcrumbs":[{"label":"Algo"},{"label":"Linked List"}]},{"id":"-MbOJeQrLWoL4a0YmZLF","title":"Merge Two Sorted Lists","pathname":"/algo/linked-list/merge-two-sorted-lists","siteSpaceId":"sitesp_sHtvd","description":"ID: 165; easy; 合并两个排序链表","breadcrumbs":[{"label":"Algo"},{"label":"Linked List"}]},{"id":"-MbOJfMtboL-KCogZKb1","title":"Merge K Sorted Lists","pathname":"/algo/linked-list/merge-k-sorted-lists","siteSpaceId":"sitesp_sHtvd","description":"ID: 104; medium; 合并k个排序链表算法","breadcrumbs":[{"label":"Algo"},{"label":"Linked List"}]},{"id":"-MbOJfBzMBnQWMcUz2rC","title":"LRU Cache","pathname":"/algo/linked-list/lru-cache","siteSpaceId":"sitesp_sHtvd","description":"ID: 134; hard; LRU缓存策略","breadcrumbs":[{"label":"Algo"},{"label":"Linked List"}]},{"id":"-MbOJf4gZjSVz3Gdf7F8","title":"Reverse Linked List II","pathname":"/algo/linked-list/reverse-linked-list-ii","siteSpaceId":"sitesp_sHtvd","description":"ID: 36; medium; 翻转链表（二）","breadcrumbs":[{"label":"Algo"},{"label":"Linked List"}]},{"id":"-MbOJewCZ2qvEdoPsZ96","title":"Copy List with Random Pointer","pathname":"/algo/linked-list/copy-list-with-random-pointer","siteSpaceId":"sitesp_sHtvd","description":"ID: 105; medium; 复制带随机指针的链表","breadcrumbs":[{"label":"Algo"},{"label":"Linked List"}]},{"id":"-MbbMhiQkm9LHGT3O2AW","title":"Reverse Nodes in k-Group","pathname":"/algo/linked-list/reverse-nodes-in-k-group","siteSpaceId":"sitesp_sHtvd","description":"ID: 450; hard; K组翻转链表","breadcrumbs":[{"label":"Algo"},{"label":"Linked List"}]},{"id":"-Mal8atXp3G6jERh213e","title":"Add Two Numbers","pathname":"/algo/linked-list/add-two-numbers","siteSpaceId":"sitesp_sHtvd","description":"ID: 2; medium","breadcrumbs":[{"label":"Algo"},{"label":"Linked List"}]},{"id":"-MapyyxAaPDwZ7nRWQ16","title":"Swap Nodes in Pairs","pathname":"/algo/linked-list/swap-nodes-in-pairs","siteSpaceId":"sitesp_sHtvd","description":"ID: 24; medium","breadcrumbs":[{"label":"Algo"},{"label":"Linked List"}]},{"id":"-Mapz7HEihoHkx7zSOfG","title":"Rotate List","pathname":"/algo/linked-list/rotate-list","siteSpaceId":"sitesp_sHtvd","description":"ID: 61; medium","breadcrumbs":[{"label":"Algo"},{"label":"Linked List"}]},{"id":"-MakqHuhzpgrXvErMzDh","title":"Linked List Cycle","pathname":"/algo/linked-list/linked-list-cycle","siteSpaceId":"sitesp_sHtvd","description":"ID: 141; easy","breadcrumbs":[{"label":"Algo"},{"label":"Linked List"}]},{"id":"-Mal07Pho4doNAESNYjn","title":"Linked List Cycle II","pathname":"/algo/linked-list/linked-list-cycle-ii","siteSpaceId":"sitesp_sHtvd","description":"ID: 142; medium","breadcrumbs":[{"label":"Algo"},{"label":"Linked List"}]},{"id":"-MapyH_GsREk9nAxeYaz","title":"Intersection of Two Linked Lists","pathname":"/algo/linked-list/intersection-of-two-linked-lists","siteSpaceId":"sitesp_sHtvd","description":"ID: 160; easy","breadcrumbs":[{"label":"Algo"},{"label":"Linked List"}]},{"id":"-Mbm298x_fsKB1mWRQGr","title":"Remove Linked List Elements","pathname":"/algo/linked-list/remove-linked-list-elements","siteSpaceId":"sitesp_sHtvd","description":"ID: 203; easy","breadcrumbs":[{"label":"Algo"},{"label":"Linked List"}]},{"id":"-MaiqTKnEhzi-Fgr24Pk","title":"Reverse Linked List","pathname":"/algo/linked-list/reverse-linked-list","siteSpaceId":"sitesp_sHtvd","description":"ID: 206; easy","breadcrumbs":[{"label":"Algo"},{"label":"Linked List"}]},{"id":"-MakkJzuS5-N8W2pMXJL","title":"Delete Node in a Linked List","pathname":"/algo/linked-list/delete-node-in-a-linked-list","siteSpaceId":"sitesp_sHtvd","description":"ID: 237; easy","breadcrumbs":[{"label":"Algo"},{"label":"Linked List"}]},{"id":"-Mal8k9PAB39qjo5JHuq","title":"Odd Even Linked List","pathname":"/algo/linked-list/odd-even-linked-list","siteSpaceId":"sitesp_sHtvd","description":"ID: 328; medium","breadcrumbs":[{"label":"Algo"},{"label":"Linked List"}]},{"id":"-MfeyKlBC3quf2FCz4pP","title":"Partition List","pathname":"/algo/linked-list/partition-list","siteSpaceId":"sitesp_sHtvd","description":"ID: 86; medium","breadcrumbs":[{"label":"Algo"},{"label":"Linked List"}]},{"id":"-McAP2g67awi3P6iAy89","title":"Recursion Basics","pathname":"/algo/recursion-basics","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Algo"}]},{"id":"-McAPHiP4J3BBp7EiLA-","title":"Fibonacci","pathname":"/algo/recursion-basics/fibonacci","siteSpaceId":"sitesp_sHtvd","description":"ID: 366; naive; 斐波纳契数列","breadcrumbs":[{"label":"Algo"},{"label":"Recursion Basics"}]},{"id":"-McAtwVvWjMu77KaMKAX","title":"Double Factorial","pathname":"/algo/recursion-basics/double-factorial","siteSpaceId":"sitesp_sHtvd","description":"ID: 771; easy; 二阶阶乘","breadcrumbs":[{"label":"Algo"},{"label":"Recursion Basics"}]},{"id":"-McAtvycfg8xGdHqkxla","title":"Reverse Order Storage","pathname":"/algo/recursion-basics/reverse-order-storage","siteSpaceId":"sitesp_sHtvd","description":"ID: 822; easy; 相反的顺序存储","breadcrumbs":[{"label":"Algo"},{"label":"Recursion Basics"}]},{"id":"-McBxsKgR1-sWZo0gY8h","title":"Linked List Weighted Sum In Reverse Order","pathname":"/algo/recursion-basics/linked-list-weighted-sum-in-reverse-order","siteSpaceId":"sitesp_sHtvd","description":"ID: 786; easy;","breadcrumbs":[{"label":"Algo"},{"label":"Recursion Basics"}]},{"id":"-MaZKXzzfc7qGWqe-KB5","title":"Binary Tree","pathname":"/algo/binary-tree","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Algo"}]},{"id":"-MdtskYRW6g1zPAIuG1q","title":"1. Traversal","pathname":"/algo/binary-tree/1.-traversal","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"}]},{"id":"-MafoO-ikyx6Vsg4lHY0","title":"Binary Tree Preorder Traversal","pathname":"/algo/binary-tree/1.-traversal/binary-tree-preorder-traversal","siteSpaceId":"sitesp_sHtvd","description":"ID: 144; easy","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"1. Traversal"}]},{"id":"-MaZPtRD1RDYj1ZSCkoo","title":"Binary Tree Inorder Traversal","pathname":"/algo/binary-tree/1.-traversal/binary-tree-inorder-traversal","siteSpaceId":"sitesp_sHtvd","description":"ID: 94; easy","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"1. Traversal"}]},{"id":"-MafoNF_iq_Ss3amff3x","title":"Binary Tree Postorder Traversal","pathname":"/algo/binary-tree/1.-traversal/binary-tree-postorder-traversal","siteSpaceId":"sitesp_sHtvd","description":"ID: 145; easy","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"1. Traversal"}]},{"id":"-MdDAOkQ_3oPcUfzzNam","title":"Construct Binary Tree from Inorder and Postorder Traversal","pathname":"/algo/binary-tree/1.-traversal/construct-binary-tree-from-inorder-and-postorder-traversal","siteSpaceId":"sitesp_sHtvd","description":"ID: 72; medium; 中序遍历和后序遍历树构造二叉树","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"1. Traversal"}]},{"id":"-Ma_EKpPTMxJIou2dY7W","title":"Minimum Depth of Binary Tree","pathname":"/algo/binary-tree/1.-traversal/minimum-depth-of-binary-tree","siteSpaceId":"sitesp_sHtvd","description":"ID: 111; easy","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"1. Traversal"}]},{"id":"-MdPlWHv9kWBw6IxKfnr","title":"Find Leaves of Binary Tree","pathname":"/algo/binary-tree/1.-traversal/find-leaves-of-binary-tree","siteSpaceId":"sitesp_sHtvd","description":"ID: 650; medium; 二叉树叶子顺序遍历","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"1. Traversal"}]},{"id":"-MdPvvlnHRgYXc5cob2b","title":"Reconstruct Itinerary","pathname":"/algo/binary-tree/1.-traversal/reconstruct-itinerary","siteSpaceId":"sitesp_sHtvd","description":"ID: 1288; medium;","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"1. Traversal"}]},{"id":"-Mdtt9jDaE8mWaJ5UPZ7","title":"2. Classical Questions","pathname":"/algo/binary-tree/2.-classical-questions","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"}]},{"id":"-Ma_CP3MGYp9bAdfPeCU","title":"Maximum Depth of Binary Tree","pathname":"/algo/binary-tree/2.-classical-questions/maximum-depth-of-binary-tree","siteSpaceId":"sitesp_sHtvd","description":"ID: 104; easy","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"2. Classical Questions"}]},{"id":"-McCyUDcOATtQ_H0PCNA","title":"Average of Levels in Binary Tree","pathname":"/algo/binary-tree/2.-classical-questions/average-of-levels-in-binary-tree","siteSpaceId":"sitesp_sHtvd","description":"ID: 1115; easy; 二叉树每层的平均数","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"2. Classical Questions"}]},{"id":"-McNBQiafSm3K51GGNiL","title":"Binary Tree Leaf Sum","pathname":"/algo/binary-tree/2.-classical-questions/binary-tree-leaf-sum","siteSpaceId":"sitesp_sHtvd","description":"ID: 481; easy; 二叉树叶子节点之和","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"2. Classical Questions"}]},{"id":"-Ma_RSBuFimQgPOBO6pe","title":"Invert Binary Tree","pathname":"/algo/binary-tree/2.-classical-questions/invert-binary-tree","siteSpaceId":"sitesp_sHtvd","description":"ID: 226; easy","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"2. Classical Questions"}]},{"id":"-McNJwNkdvLzvvZp_NRs","title":"Binary Tree Path Sum","pathname":"/algo/binary-tree/2.-classical-questions/binary-tree-path-sum","siteSpaceId":"sitesp_sHtvd","description":"ID: 376; easy;  二叉树的路径和","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"2. Classical Questions"}]},{"id":"-McPq9jA71Illdeeot36","title":"Binary Tree Path Sum II","pathname":"/algo/binary-tree/2.-classical-questions/binary-tree-path-sum-ii","siteSpaceId":"sitesp_sHtvd","description":"ID: 246; medium; 二叉树的路径和 II","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"2. Classical Questions"}]},{"id":"-McPz1PkEKTFbKmiTU7a","title":"Binary Tree Path Sum III","pathname":"/algo/binary-tree/2.-classical-questions/binary-tree-path-sum-iii","siteSpaceId":"sitesp_sHtvd","description":"ID: 472; hard; 二叉树的路径和 III","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"2. Classical Questions"}]},{"id":"-McQ6OF78PcbzwJxo3IS","title":"Clone Binary Tree","pathname":"/algo/binary-tree/2.-classical-questions/clone-binary-tree","siteSpaceId":"sitesp_sHtvd","description":"ID: 375; medium; 克隆二叉树","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"2. Classical Questions"}]},{"id":"-McV0Yf-jo1rRlRAJP29","title":"Sum Root to Leaf Numbers","pathname":"/algo/binary-tree/2.-classical-questions/sum-root-to-leaf-numbers","siteSpaceId":"sitesp_sHtvd","description":"ID: 1353; medium; 根节点到叶节点求和","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"2. Classical Questions"}]},{"id":"-McV4_C_4I2HWfuXO0bW","title":"Binary Tree Level Sum","pathname":"/algo/binary-tree/2.-classical-questions/binary-tree-level-sum","siteSpaceId":"sitesp_sHtvd","description":"ID: 482; easy; 二叉树的某层节点之和","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"2. Classical Questions"}]},{"id":"-MadEtInCh1b0wTEGeIp","title":"Binary Tree Paths","pathname":"/algo/binary-tree/2.-classical-questions/binary-tree-paths","siteSpaceId":"sitesp_sHtvd","description":"ID: 257; easy","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"2. Classical Questions"}]},{"id":"-Mdtta9oEBBDtsf2VUZZ","title":"3. Binary Search Tree","pathname":"/algo/binary-tree/3.-binary-search-tree","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"}]},{"id":"-MdUOi6mrKkXNDxi_PrX","title":"Insert Node in a Binary Search Tree","pathname":"/algo/binary-tree/3.-binary-search-tree/insert-node-in-a-binary-search-tree","siteSpaceId":"sitesp_sHtvd","description":"ID: 85; easy; 在二叉查找树中插入节点","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"3. Binary Search Tree"}]},{"id":"-MdUSp7GvbL1B1EpDnrz","title":"Remove Node in Binary Search Tree","pathname":"/algo/binary-tree/3.-binary-search-tree/remove-node-in-binary-search-tree","siteSpaceId":"sitesp_sHtvd","description":"ID: 87; hard; 删除二叉查找树的节点","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"3. Binary Search Tree"}]},{"id":"-MdUZJ38Gcygb4s1KRFw","title":"Validate Binary Search Tree","pathname":"/algo/binary-tree/3.-binary-search-tree/validate-binary-search-tree","siteSpaceId":"sitesp_sHtvd","description":"ID: 98; medium; 验证二叉查找树","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"3. Binary Search Tree"}]},{"id":"-MdUfug8Nwg_1BXVvdtX","title":"Trim a Binary Search Tree","pathname":"/algo/binary-tree/3.-binary-search-tree/trim-a-binary-search-tree","siteSpaceId":"sitesp_sHtvd","description":"ID: 701; medium; 修剪二叉搜索树","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"3. Binary Search Tree"}]},{"id":"-MdUpCk05zybUUcsnSBd","title":"Search Range in Binary Search Tree","pathname":"/algo/binary-tree/3.-binary-search-tree/search-range-in-binary-search-tree","siteSpaceId":"sitesp_sHtvd","description":"ID: 11; medium; 二叉查找树中搜索区间","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"3. Binary Search Tree"}]},{"id":"-MdZGS4bpZP9LwSXvefC","title":"Inorder Successor in BST","pathname":"/algo/binary-tree/3.-binary-search-tree/inorder-successor-in-bst","siteSpaceId":"sitesp_sHtvd","description":"ID: 448; medium; 二叉查找树的中序后继","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"3. Binary Search Tree"}]},{"id":"-MdZMn_kAJxcniwb68Zl","title":"Binary Search Tree Iterator","pathname":"/algo/binary-tree/3.-binary-search-tree/binary-search-tree-iterator","siteSpaceId":"sitesp_sHtvd","description":"ID: 86; hard; 二叉查找树迭代器","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"3. Binary Search Tree"}]},{"id":"-MdZlWwsKlPNIxwnXOSv","title":"Recover Binary Search Tree","pathname":"/algo/binary-tree/3.-binary-search-tree/recover-binary-search-tree","siteSpaceId":"sitesp_sHtvd","description":"ID: 691; medium; 恢复二叉搜索树","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"3. Binary Search Tree"}]},{"id":"-MdttflYtYcxbEiB51J1","title":"4. Divide and Conquer","pathname":"/algo/binary-tree/4.-divide-and-conquer","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"}]},{"id":"-Ma_4uqGFocBLrlkocc_","title":"Balanced Binary Tree","pathname":"/algo/binary-tree/4.-divide-and-conquer/balanced-binary-tree","siteSpaceId":"sitesp_sHtvd","description":"ID: 110; easy","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"4. Divide and Conquer"}]},{"id":"-Mdnv2NugJ-EIT8by1il","title":"Minimum Subtree","pathname":"/algo/binary-tree/4.-divide-and-conquer/minimum-subtree","siteSpaceId":"sitesp_sHtvd","description":"ID: 596; easy; 最小子树","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"4. Divide and Conquer"}]},{"id":"-MdnyZRRewMyeHbtFOA0","title":"Subtree with Maximum Average","pathname":"/algo/binary-tree/4.-divide-and-conquer/subtree-with-maximum-average","siteSpaceId":"sitesp_sHtvd","description":"ID: 597; easy","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"4. Divide and Conquer"}]},{"id":"-Mdo5frbs7m4_hEwZpbc","title":"Maximum Subtree","pathname":"/algo/binary-tree/4.-divide-and-conquer/maximum-subtree","siteSpaceId":"sitesp_sHtvd","description":"ID: 628; easy","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"4. Divide and Conquer"}]},{"id":"-MdoA8d7aVH6ROQJw856","title":"Lowest Common Ancestor of a Binary Tree","pathname":"/algo/binary-tree/4.-divide-and-conquer/lowest-common-ancestor-of-a-binary-tree","siteSpaceId":"sitesp_sHtvd","description":"ID: 88; medium","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"4. Divide and Conquer"}]},{"id":"-MdolvsTlW4jdGiWGT4m","title":"Lowest Common Ancestor II","pathname":"/algo/binary-tree/4.-divide-and-conquer/lowest-common-ancestor-ii","siteSpaceId":"sitesp_sHtvd","description":"ID: 474; easy","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"4. Divide and Conquer"}]},{"id":"-MdqGisd9ZygPY6UkySq","title":"Lowest Common Ancestor III","pathname":"/algo/binary-tree/4.-divide-and-conquer/lowest-common-ancestor-iii","siteSpaceId":"sitesp_sHtvd","description":"ID: 578; medium","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"4. Divide and Conquer"}]},{"id":"-MdtfLfL4ozwctvVIxCt","title":"Binary Tree Maximum Path Sum II","pathname":"/algo/binary-tree/4.-divide-and-conquer/binary-tree-maximum-path-sum-ii","siteSpaceId":"sitesp_sHtvd","description":"ID: 475; medium","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"4. Divide and Conquer"}]},{"id":"-MdtqZlf-pXaE9NW_K-a","title":"Binary Tree Maximum Path Sum","pathname":"/algo/binary-tree/4.-divide-and-conquer/binary-tree-maximum-path-sum","siteSpaceId":"sitesp_sHtvd","description":"ID: 94; medium","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"4. Divide and Conquer"}]},{"id":"-MduDtOWmvvdLqy6Kgse","title":"Path Sum III","pathname":"/algo/binary-tree/4.-divide-and-conquer/path-sum-iii","siteSpaceId":"sitesp_sHtvd","description":"ID: 437; medium","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"},{"label":"4. Divide and Conquer"}]},{"id":"-MaZWBQVNcJgM79YVKsc","title":"Convert Sorted Array to Binary Search Tree","pathname":"/algo/binary-tree/convert-sorted-array-to-binary-search-tree","siteSpaceId":"sitesp_sHtvd","description":"ID; 108; easy","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"}]},{"id":"-Ma_EceZYOiuGbAvSmvM","title":"Path Sum","pathname":"/algo/binary-tree/path-sum","siteSpaceId":"sitesp_sHtvd","description":"ID: 112; easy","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"}]},{"id":"-MadEc0LzwwgLWqkCa_p","title":"Lowest Common Ancestor of a Binary Search Tree","pathname":"/algo/binary-tree/lowest-common-ancestor-of-a-binary-search-tree","siteSpaceId":"sitesp_sHtvd","description":"ID: 235; easy","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"}]},{"id":"-MadPff_vUANn9_QqHUk","title":"Sum of Left Leaves","pathname":"/algo/binary-tree/sum-of-left-leaves","siteSpaceId":"sitesp_sHtvd","description":"ID: 404; easy","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"}]},{"id":"-MadbykooIgGf_Oe8EyQ","title":"Minimum Absolute Difference in BST","pathname":"/algo/binary-tree/minimum-absolute-difference-in-bst","siteSpaceId":"sitesp_sHtvd","description":"ID: 530; easy","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"}]},{"id":"-MafnmVlZhzwk6LUo8Q_","title":"Minimum Distance Between BST Nodes","pathname":"/algo/binary-tree/minimum-distance-between-bst-nodes","siteSpaceId":"sitesp_sHtvd","description":"ID: 783; easy","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"}]},{"id":"-Mg9D0lDWDdC5u47lWef","title":"Convert Sorted List to Binary Search Tree","pathname":"/algo/binary-tree/convert-sorted-list-to-binary-search-tree","siteSpaceId":"sitesp_sHtvd","description":"ID: 109; medium","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"}]},{"id":"-MgODk5hCDcTCEwpGizO","title":"Range Sum of BST","pathname":"/algo/binary-tree/range-sum-of-bst","siteSpaceId":"sitesp_sHtvd","description":"ID: 938; easy","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"}]},{"id":"-MgcrINMFD7FTXdzoeC2","title":"Kth Smallest Element in a BST","pathname":"/algo/binary-tree/kth-smallest-element-in-a-bst","siteSpaceId":"sitesp_sHtvd","description":"ID: 230; medium","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"}]},{"id":"-Mgx0yIlAgrk66tugd00","title":"Find Largest Value in Each Tree Row","pathname":"/algo/binary-tree/find-largest-value-in-each-tree-row","siteSpaceId":"sitesp_sHtvd","description":"ID: 515; medium","breadcrumbs":[{"label":"Algo"},{"label":"Binary Tree"}]},{"id":"-MduF7INFxYq7ucWfVcA","title":"Sorting","pathname":"/algo/sorting","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Algo"}]},{"id":"-MdyJnDmTwSE3Nno1PzM","title":"Sort Integers","pathname":"/algo/sorting/sort-integers","siteSpaceId":"sitesp_sHtvd","description":"ID: 463; naive","breadcrumbs":[{"label":"Algo"},{"label":"Sorting"}]},{"id":"-MdyWzZekHZpPrfeJdxJ","title":"Merge Two Sorted Arrays","pathname":"/algo/sorting/merge-two-sorted-arrays","siteSpaceId":"sitesp_sHtvd","description":"ID: 6; easy","breadcrumbs":[{"label":"Algo"},{"label":"Sorting"}]},{"id":"-MdzaAJEBzjgJkVpFaH1","title":"Reverse Pair","pathname":"/algo/sorting/reverse-pair","siteSpaceId":"sitesp_sHtvd","description":"ID: 532; medium","breadcrumbs":[{"label":"Algo"},{"label":"Sorting"}]},{"id":"-Me-jxzv7TnFCo0t7KXO","title":"Sort List","pathname":"/algo/sorting/sort-list","siteSpaceId":"sitesp_sHtvd","description":"ID: 98; medium","breadcrumbs":[{"label":"Algo"},{"label":"Sorting"}]},{"id":"-Me-os6KAtoCqO8Kg-XK","title":"Partition Array","pathname":"/algo/sorting/partition-array","siteSpaceId":"sitesp_sHtvd","description":"ID: 31; medium","breadcrumbs":[{"label":"Algo"},{"label":"Sorting"}]},{"id":"-MaJgp7CQFvHFktlyekS","title":"Sort Colors","pathname":"/algo/sorting/sort-colors-1","siteSpaceId":"sitesp_sHtvd","description":"ID: 75; medium","breadcrumbs":[{"label":"Algo"},{"label":"Sorting"}]},{"id":"-Me2wz3T49_7QGOgxjrY","title":"Kth Largest Element","pathname":"/algo/sorting/kth-largest-element","siteSpaceId":"sitesp_sHtvd","description":"ID: 5; medium","breadcrumbs":[{"label":"Algo"},{"label":"Sorting"}]},{"id":"-Me3eKpNkbjqYfyD7G6Q","title":"Multi-keyword Sort","pathname":"/algo/sorting/multi-keyword-sort","siteSpaceId":"sitesp_sHtvd","description":"ID: 846; easy","breadcrumbs":[{"label":"Algo"},{"label":"Sorting"}]},{"id":"-Me3eVqST3hbv41hfM9E","title":"Two Pointers","pathname":"/algo/two-pointers","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Algo"}]},{"id":"-Me3ebQiLHI5NfctFBrB","title":"Window Sum","pathname":"/algo/two-pointers/window-sum","siteSpaceId":"sitesp_sHtvd","description":"ID: 604; easy","breadcrumbs":[{"label":"Algo"},{"label":"Two Pointers"}]},{"id":"-Me3eq3RQjeBjSU5ZBSE","title":"Two Sum - Difference equals to target","pathname":"/algo/two-pointers/two-sum-difference-equals-to-target","siteSpaceId":"sitesp_sHtvd","description":"ID: 610; medium","breadcrumbs":[{"label":"Algo"},{"label":"Two Pointers"}]},{"id":"-Me3ey83FV2-BjjwPwwd","title":"Valid Palindrome","pathname":"/algo/two-pointers/valid-palindrome","siteSpaceId":"sitesp_sHtvd","description":"ID: 415; medium","breadcrumbs":[{"label":"Algo"},{"label":"Two Pointers"}]},{"id":"-M_MgMJh1M-UYJjClI61","title":"Remove Duplicates from Sorted Array","pathname":"/algo/two-pointers/remove-duplicates-from-sorted-array","siteSpaceId":"sitesp_sHtvd","description":"ID: 26: Easy","breadcrumbs":[{"label":"Algo"},{"label":"Two Pointers"}]},{"id":"-Me8pav0yC78RteFfvAj","title":"Recover Rotated Sorted Array","pathname":"/algo/two-pointers/recover-rotated-sorted-array","siteSpaceId":"sitesp_sHtvd","description":"ID: 39; easy","breadcrumbs":[{"label":"Algo"},{"label":"Two Pointers"}]},{"id":"-Ma5gE7xB1R6FOgflq2J","title":"Two Sum II - Input array is sorted","pathname":"/algo/two-pointers/two-sum-ii-input-array-is-sorted","siteSpaceId":"sitesp_sHtvd","description":"ID: 167; easy","breadcrumbs":[{"label":"Algo"},{"label":"Two Pointers"}]},{"id":"-Me91UGaLGRINHAZO34y","title":"Two Sum - Unique pairs","pathname":"/algo/two-pointers/two-sum-unique-pairs","siteSpaceId":"sitesp_sHtvd","description":"ID: 587; medium","breadcrumbs":[{"label":"Algo"},{"label":"Two Pointers"}]},{"id":"-MeYuWweM9bmei423Eti","title":"Two Sum - Closest to target","pathname":"/algo/two-pointers/two-sum-closest-to-target","siteSpaceId":"sitesp_sHtvd","description":"ID: 533; medium","breadcrumbs":[{"label":"Algo"},{"label":"Two Pointers"}]},{"id":"-MeZ0ri9Yl2Ku-gXUsab","title":"Queue & Stack","pathname":"/algo/queue-and-stack","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Algo"}]},{"id":"-MeZ1aSudVdYY5D-p6Zh","title":"Implement Queue by Interface","pathname":"/algo/queue-and-stack/implement-queue-by-interface","siteSpaceId":"sitesp_sHtvd","description":"ID: 546; easy","breadcrumbs":[{"label":"Algo"},{"label":"Queue & Stack"}]},{"id":"-Mebm3mpfCw1FPtNOAIz","title":"Implement Stack","pathname":"/algo/queue-and-stack/implement-stack","siteSpaceId":"sitesp_sHtvd","description":"ID: 495; easy","breadcrumbs":[{"label":"Algo"},{"label":"Queue & Stack"}]},{"id":"-MebosNl4IEJnmXj34Qa","title":"Implement Queue by Two Stacks","pathname":"/algo/queue-and-stack/implement-queue-by-two-stacks","siteSpaceId":"sitesp_sHtvd","description":"ID: 40; medium","breadcrumbs":[{"label":"Algo"},{"label":"Queue & Stack"}]},{"id":"-MebwqxBdsUd5hxafryM","title":"Implement Stack by Two Queues","pathname":"/algo/queue-and-stack/implement-stack-by-two-queues","siteSpaceId":"sitesp_sHtvd","description":"ID: 494; easy","breadcrumbs":[{"label":"Algo"},{"label":"Queue & Stack"}]},{"id":"-Mec4gYZ2mJqRbmenT7_","title":"Binary Tree Level Order Traversal","pathname":"/algo/queue-and-stack/binary-tree-level-order-traversal","siteSpaceId":"sitesp_sHtvd","description":"ID: 69; easy","breadcrumbs":[{"label":"Algo"},{"label":"Queue & Stack"}]},{"id":"-MaRDujc2xeUO5XsT3eK","title":"Valid Parentheses","pathname":"/algo/queue-and-stack/valid-parentheses","siteSpaceId":"sitesp_sHtvd","description":"ID: 20; easy","breadcrumbs":[{"label":"Algo"},{"label":"Queue & Stack"}]},{"id":"-MegqPKY5EHk8-210gli","title":"Min Stack","pathname":"/algo/queue-and-stack/min-stack","siteSpaceId":"sitesp_sHtvd","description":"ID: 12; medium","breadcrumbs":[{"label":"Algo"},{"label":"Queue & Stack"}]},{"id":"-MegxjMXQJ-urQQ5C-mb","title":"Largest Rectangle in Histogram","pathname":"/algo/queue-and-stack/largest-rectangle-in-histogram","siteSpaceId":"sitesp_sHtvd","description":"ID: 122; hard","breadcrumbs":[{"label":"Algo"},{"label":"Queue & Stack"}]},{"id":"-MeigAB7MyTM5JGPpvtp","title":"Evaluate Reverse Polish Notation","pathname":"/algo/queue-and-stack/evaluate-reverse-polish-notation","siteSpaceId":"sitesp_sHtvd","description":"ID: 424; medium","breadcrumbs":[{"label":"Algo"},{"label":"Queue & Stack"}]},{"id":"-MeitugoghcX73bgtVWH","title":"Implement Queue by Linked List II","pathname":"/algo/queue-and-stack/implement-queue-by-linked-list-ii","siteSpaceId":"sitesp_sHtvd","description":"ID: 493; easy","breadcrumbs":[{"label":"Algo"},{"label":"Queue & Stack"}]},{"id":"-MenmNw4XasH3Xtr5pAE","title":"Basic Calculator II","pathname":"/algo/queue-and-stack/basic-calculator-ii","siteSpaceId":"sitesp_sHtvd","description":"ID: 980; medium","breadcrumbs":[{"label":"Algo"},{"label":"Queue & Stack"}]},{"id":"-MhRIlIexDmHaVUIwrpr","title":"Moving Average from Data Stream","pathname":"/algo/queue-and-stack/moving-average-from-data-stream","siteSpaceId":"sitesp_sHtvd","description":"ID: 642; easy","breadcrumbs":[{"label":"Algo"},{"label":"Queue & Stack"}]},{"id":"-MhRQH7reGeyWVRTrn5t","title":"Reveal Cards In Increasing Order","pathname":"/algo/queue-and-stack/reveal-cards-in-increasing-order","siteSpaceId":"sitesp_sHtvd","description":"ID: 950; medium","breadcrumbs":[{"label":"Algo"},{"label":"Queue & Stack"}]},{"id":"-MjRhzfcGVV5lmIy0pwA","title":"Longest Valid Parentheses","pathname":"/algo/queue-and-stack/longest-valid-parentheses","siteSpaceId":"sitesp_sHtvd","description":"ID: 193; medium","breadcrumbs":[{"label":"Algo"},{"label":"Queue & Stack"}]},{"id":"-MetViNgDZxuzrGZ66nr","title":"Hash Table","pathname":"/algo/hash-table","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Algo"}]},{"id":"-MetVpQ02KsKhgH6Zbni","title":"Rehashing","pathname":"/algo/hash-table/rehashing","siteSpaceId":"sitesp_sHtvd","description":"ID: 129; medium","breadcrumbs":[{"label":"Algo"},{"label":"Hash Table"}]},{"id":"-MetdyQXcSi_Tx1ECNb6","title":"Valid Anagram","pathname":"/algo/hash-table/valid-anagram","siteSpaceId":"sitesp_sHtvd","description":"ID: 242; easy","breadcrumbs":[{"label":"Algo"},{"label":"Hash Table"}]},{"id":"-M_LxEM1jKRJgSvFQPIa","title":"Two Sum","pathname":"/algo/hash-table/two-sum","siteSpaceId":"sitesp_sHtvd","description":"ID: 1; Easy","breadcrumbs":[{"label":"Algo"},{"label":"Hash Table"}]},{"id":"-MetiuWLCKDgz5A-Pyk7","title":"Contiguous Array","pathname":"/algo/hash-table/contiguous-array","siteSpaceId":"sitesp_sHtvd","description":"ID: 525; medium","breadcrumbs":[{"label":"Algo"},{"label":"Hash Table"}]},{"id":"-MewTgztcc37u0tH8UFx","title":"Anagrams","pathname":"/algo/hash-table/anagrams","siteSpaceId":"sitesp_sHtvd","description":"ID: 171; medium","breadcrumbs":[{"label":"Algo"},{"label":"Hash Table"}]},{"id":"-MewaBXcjjKVry8ks9AU","title":"Remove Duplicate Numbers in Array","pathname":"/algo/hash-table/remove-duplicate-numbers-in-array","siteSpaceId":"sitesp_sHtvd","description":"ID: 521; easy","breadcrumbs":[{"label":"Algo"},{"label":"Hash Table"}]},{"id":"-Mewj9KQO9gBZC08hXvX","title":"Friendship Service","pathname":"/algo/hash-table/friendship-service","siteSpaceId":"sitesp_sHtvd","description":"ID: 560; easy","breadcrumbs":[{"label":"Algo"},{"label":"Hash Table"}]},{"id":"-Mexul1mHXeNuN8dKMTj","title":"Heap & Priority Queue","pathname":"/algo/heap-and-priority-queue","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Algo"}]},{"id":"-Mexuq8wxIU4X2KXEKe6","title":"Heapify","pathname":"/algo/heap-and-priority-queue/heapify","siteSpaceId":"sitesp_sHtvd","description":"ID: 130; medium","breadcrumbs":[{"label":"Algo"},{"label":"Heap & Priority Queue"}]},{"id":"-Mf0g0O_OYTnJQLgeLNl","title":"Top k Largest Numbers II","pathname":"/algo/heap-and-priority-queue/top-k-largest-numbers-ii","siteSpaceId":"sitesp_sHtvd","description":"ID: 545; medium","breadcrumbs":[{"label":"Algo"},{"label":"Heap & Priority Queue"}]},{"id":"-Mf0pAN6wKg_1yyKeT-n","title":"K Closest Points","pathname":"/algo/heap-and-priority-queue/k-closest-points","siteSpaceId":"sitesp_sHtvd","description":"ID: 612; medium; *","breadcrumbs":[{"label":"Algo"},{"label":"Heap & Priority Queue"}]},{"id":"-Mf5o_FjjNTEngNElmpY","title":"Kth Smallest Number in Sorted Matrix","pathname":"/algo/heap-and-priority-queue/kth-smallest-number-in-sorted-matrix","siteSpaceId":"sitesp_sHtvd","description":"ID: 401; medium","breadcrumbs":[{"label":"Algo"},{"label":"Heap & Priority Queue"}]},{"id":"-Mf6qkXC-v2BhXbALD-H","title":"Find Median from Data Stream","pathname":"/algo/heap-and-priority-queue/find-median-from-data-stream","siteSpaceId":"sitesp_sHtvd","description":"ID: 81; hard","breadcrumbs":[{"label":"Algo"},{"label":"Heap & Priority Queue"}]},{"id":"-MfHx1RSq7g_4jIDI-es","title":"Sliding Window Median","pathname":"/algo/heap-and-priority-queue/sliding-window-median","siteSpaceId":"sitesp_sHtvd","description":"ID: 360; hard","breadcrumbs":[{"label":"Algo"},{"label":"Heap & Priority Queue"}]},{"id":"-MfHxF31VdySDa2KlgFG","title":"Trapping Rain Water II","pathname":"/algo/heap-and-priority-queue/trapping-rain-water-ii","siteSpaceId":"sitesp_sHtvd","description":"ID: 364; hard","breadcrumbs":[{"label":"Algo"},{"label":"Heap & Priority Queue"}]},{"id":"-MfHxRfzII49vsTv1La-","title":"High Five","pathname":"/algo/heap-and-priority-queue/high-five","siteSpaceId":"sitesp_sHtvd","description":"ID: 613; medium","breadcrumbs":[{"label":"Algo"},{"label":"Heap & Priority Queue"}]},{"id":"-MgTAT_FvR1oTuUYFhKI","title":"BFS","pathname":"/algo/bfs","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Algo"}]},{"id":"-MgTAeoNFdd3HiZBviIc","title":"1. BFS in Binary Tree","pathname":"/algo/bfs/1.-bfs-in-binary-tree","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Algo"},{"label":"BFS"}]},{"id":"-MgTAmX9SmnhZ1mgKj5Z","title":"Check Full Binary Tree","pathname":"/algo/bfs/1.-bfs-in-binary-tree/check-full-binary-tree","siteSpaceId":"sitesp_sHtvd","description":"ID: 726; medium","breadcrumbs":[{"label":"Algo"},{"label":"BFS"},{"label":"1. BFS in Binary Tree"}]},{"id":"-MgTOtdOTgl6jH5kF4Jf","title":"Binary Tree Level Order Traversal II","pathname":"/algo/bfs/1.-bfs-in-binary-tree/binary-tree-level-order-traversal-ii","siteSpaceId":"sitesp_sHtvd","description":"ID: 70; medium","breadcrumbs":[{"label":"Algo"},{"label":"BFS"},{"label":"1. BFS in Binary Tree"}]},{"id":"-MgTWRw4RIs2D7aeHM_e","title":"Binary Tree Maximum Path Sum II","pathname":"/algo/bfs/1.-bfs-in-binary-tree/binary-tree-maximum-path-sum-ii","siteSpaceId":"sitesp_sHtvd","description":"ID: 475; medium","breadcrumbs":[{"label":"Algo"},{"label":"BFS"},{"label":"1. BFS in Binary Tree"}]},{"id":"-MgTWyKwCuFpb63KMLrz","title":"Convert Binary Tree to Linked Lists by Depth","pathname":"/algo/bfs/1.-bfs-in-binary-tree/convert-binary-tree-to-linked-lists-by-depth","siteSpaceId":"sitesp_sHtvd","description":"ID: 242; easy","breadcrumbs":[{"label":"Algo"},{"label":"BFS"},{"label":"1. BFS in Binary Tree"}]},{"id":"-MgTf9z8-KsNlTRKtiJP","title":"2. Connected Graph & Topologic Sorting","pathname":"/algo/bfs/2.-connected-graph-and-topologic-sorting","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Algo"},{"label":"BFS"}]},{"id":"-MgTfGsJUsawRMYP3eie","title":"Search Graph Nodes","pathname":"/algo/bfs/2.-connected-graph-and-topologic-sorting/search-graph-nodes","siteSpaceId":"sitesp_sHtvd","description":"ID: 618; medium","breadcrumbs":[{"label":"Algo"},{"label":"BFS"},{"label":"2. Connected Graph & Topologic Sorting"}]},{"id":"-MgUi_UqEfxelFAUifD3","title":"Graph Valid Tree","pathname":"/algo/bfs/2.-connected-graph-and-topologic-sorting/graph-valid-tree","siteSpaceId":"sitesp_sHtvd","description":"ID: 178; medium","breadcrumbs":[{"label":"Algo"},{"label":"BFS"},{"label":"2. Connected Graph & Topologic Sorting"}]},{"id":"-MgYdkEBxCrZQ78LFIny","title":"Connected Component in Undirected Graph","pathname":"/algo/bfs/2.-connected-graph-and-topologic-sorting/connected-component-in-undirected-graph","siteSpaceId":"sitesp_sHtvd","description":"ID: 431; medium","breadcrumbs":[{"label":"Algo"},{"label":"BFS"},{"label":"2. Connected Graph & Topologic Sorting"}]},{"id":"-Mgd407n9tX76m4-kVEm","title":"Topological Sorting","pathname":"/algo/bfs/2.-connected-graph-and-topologic-sorting/topological-sorting","siteSpaceId":"sitesp_sHtvd","description":"ID: 127; medium","breadcrumbs":[{"label":"Algo"},{"label":"BFS"},{"label":"2. Connected Graph & Topologic Sorting"}]},{"id":"-Mghtrm15l3ls1Ira70s","title":"Course Schedule","pathname":"/algo/bfs/2.-connected-graph-and-topologic-sorting/course-schedule","siteSpaceId":"sitesp_sHtvd","description":"ID: 615; medium","breadcrumbs":[{"label":"Algo"},{"label":"BFS"},{"label":"2. Connected Graph & Topologic Sorting"}]},{"id":"-Mgiv_9LVcxW41JgQmga","title":"Course Schedule II","pathname":"/algo/bfs/2.-connected-graph-and-topologic-sorting/course-schedule-ii","siteSpaceId":"sitesp_sHtvd","description":"ID: 616; medium","breadcrumbs":[{"label":"Algo"},{"label":"BFS"},{"label":"2. Connected Graph & Topologic Sorting"}]},{"id":"-Mgj3HrqZkVWKnr6XSh1","title":"Sequence Reconstruction","pathname":"/algo/bfs/2.-connected-graph-and-topologic-sorting/sequence-reconstruction","siteSpaceId":"sitesp_sHtvd","description":"ID: 605; medium","breadcrumbs":[{"label":"Algo"},{"label":"BFS"},{"label":"2. Connected Graph & Topologic Sorting"}]},{"id":"-MgsQOfP0xxck7J19yqU","title":"Clone Graph","pathname":"/algo/bfs/2.-connected-graph-and-topologic-sorting/clone-graph","siteSpaceId":"sitesp_sHtvd","description":"ID: 137; medium","breadcrumbs":[{"label":"Algo"},{"label":"BFS"},{"label":"2. Connected Graph & Topologic Sorting"}]},{"id":"-MgxTvhgyTNMRMalodDC","title":"Alien Dictionary","pathname":"/algo/bfs/2.-connected-graph-and-topologic-sorting/alien-dictionary","siteSpaceId":"sitesp_sHtvd","description":"ID: 892; hard","breadcrumbs":[{"label":"Algo"},{"label":"BFS"},{"label":"2. Connected Graph & Topologic Sorting"}]},{"id":"-M_LxBJFV6wnUK05gFZx","title":"Array","pathname":"/algo/array","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Algo"}]},{"id":"-M_MiwzpR7fl7u4O6lYI","title":"Remove Element","pathname":"/algo/array/remove-element","siteSpaceId":"sitesp_sHtvd","description":"ID: 27; Easy","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"-M_b25UfoL7JXC3YuBql","title":"Search Insert Position","pathname":"/algo/array/search-insert-position","siteSpaceId":"sitesp_sHtvd","description":"ID: 35; easy","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"-M_v72OzoneNoskRdpNJ","title":"Maximum Subarray","pathname":"/algo/array/maximum-subarray","siteSpaceId":"sitesp_sHtvd","description":"ID: 35; easy","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"-M_vQT05aiPMUq9bJlbU","title":"Plus One","pathname":"/algo/array/plus-one","siteSpaceId":"sitesp_sHtvd","description":"ID: 66; Easy","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"-M_v_vRdjVRtIYeXsEdy","title":"Merge Sorted Array","pathname":"/algo/array/merge-sorted-array","siteSpaceId":"sitesp_sHtvd","description":"ID: 88; easy","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"-Ma-a3iPAuJqBbSnDP_2","title":"Pascal's Triangle","pathname":"/algo/array/pascals-triangle","siteSpaceId":"sitesp_sHtvd","description":"ID: 118; easy","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"-Ma0lh3Ig7_Kn-Eg314W","title":"Pascal's Triangle II","pathname":"/algo/array/pascals-triangle-ii","siteSpaceId":"sitesp_sHtvd","description":"ID: 119; easy","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"-Ma5WfHEvL3xISmffWbU","title":"Best Time to Buy and Sell Stock","pathname":"/algo/array/best-time-to-buy-and-sell-stock","siteSpaceId":"sitesp_sHtvd","description":"ID: 121; easy","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"-Ma5dE_QOvWBa-F3oyaH","title":"Best Time to Buy and Sell Stock II","pathname":"/algo/array/best-time-to-buy-and-sell-stock-ii","siteSpaceId":"sitesp_sHtvd","description":"ID: 122; easy","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"-MaAC2UIBtFn9yu7Pl4p","title":"Majority Element","pathname":"/algo/array/majority-element","siteSpaceId":"sitesp_sHtvd","description":"ID: 169; easy","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"-MaAP8z2K58yLGr9FSBT","title":"Contains Duplicate","pathname":"/algo/array/contains-duplicate","siteSpaceId":"sitesp_sHtvd","description":"ID: 217; easy","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"-MaAP9Rl-a0EXFAg1qo5","title":"Contains Duplicate II","pathname":"/algo/array/contains-duplicate-ii","siteSpaceId":"sitesp_sHtvd","description":"ID: 219; easy","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"-MaAPAtPoxsl_LdGx4vc","title":"Summary Ranges","pathname":"/algo/array/summary-ranges","siteSpaceId":"sitesp_sHtvd","description":"ID: 228; easy","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"-MaAPBUqceogRUYywbg3","title":"Missing Number","pathname":"/algo/array/missing-number","siteSpaceId":"sitesp_sHtvd","description":"ID: 268; easy","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"-MaAPC1rEKwSwUcMaNwk","title":"Move Zeroes","pathname":"/algo/array/move-zeroes","siteSpaceId":"sitesp_sHtvd","description":"ID: 283; easy","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"-MaAPDuqq3WbzMTZbMrU","title":"Third Maximum Number","pathname":"/algo/array/third-maximum-number","siteSpaceId":"sitesp_sHtvd","description":"ID: 414; easy","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"-Ma4S_xkQWdBtP4qAOpM","title":"Binary Search","pathname":"/algo/array/binary-search","siteSpaceId":"sitesp_sHtvd","description":"ID: 704; easy","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"-Mj50Ortg8AQxn3grEB3","title":"Pairs of Songs With Total Durations Divisible by 60","pathname":"/algo/array/pairs-of-songs-with-total-durations-divisible-by-60","siteSpaceId":"sitesp_sHtvd","description":"ID: 1010; medium","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"9u43Ig5zTabDu21Tgdqb","title":"3Sum","pathname":"/algo/array/3sum","siteSpaceId":"sitesp_sHtvd","description":"ID: 15; medium","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"nr3Z8ZwoiGHBaIyQYmoH","title":"Median of Two Sorted Arrays","pathname":"/algo/array/median-of-two-sorted-arrays","siteSpaceId":"sitesp_sHtvd","description":"ID: 4; hard","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"i0hzVnpjbupdWEgCkRqg","title":"Running Sum of 1d Array","pathname":"/algo/array/running-sum-of-1d-array","siteSpaceId":"sitesp_sHtvd","description":"ID: 1480; easy","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"mfX12tiHWD7OGFyEGlzx","title":"Container With Most Water","pathname":"/algo/array/container-with-most-water","siteSpaceId":"sitesp_sHtvd","description":"ID: 11; medium","breadcrumbs":[{"label":"Algo"},{"label":"Array"}]},{"id":"-MaJjQYHSgdI8HMpEJbm","title":"String","pathname":"/algo/string","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Algo"}]},{"id":"-MaUK1gCqQPsEJcxBnXs","title":"Longest Substring Without Repeating Characters","pathname":"/algo/string/longest-substring-without-repeating-characters","siteSpaceId":"sitesp_sHtvd","description":"ID: 3; medium","breadcrumbs":[{"label":"Algo"},{"label":"String"}]},{"id":"-MaJjXURi81925ctLOUy","title":"Roman to Integer","pathname":"/algo/string/roman-to-integer","siteSpaceId":"sitesp_sHtvd","description":"ID: 13; easy","breadcrumbs":[{"label":"Algo"},{"label":"String"}]},{"id":"-MaU4B2WeIzbUOgfK8Xk","title":"Implement strStr()","pathname":"/algo/string/implement-strstr","siteSpaceId":"sitesp_sHtvd","description":"ID: 28; easy","breadcrumbs":[{"label":"Algo"},{"label":"String"}]},{"id":"-MavkpchjvrrK2k5efjh","title":"Reverse Words in a String","pathname":"/algo/string/reverse-words-in-a-string","siteSpaceId":"sitesp_sHtvd","description":"ID: 151; medium","breadcrumbs":[{"label":"Algo"},{"label":"String"}]},{"id":"-MeifEdIoCrrZiR6Ms54","title":"First Unique Character in a String","pathname":"/algo/string/first-unique-character-in-a-string","siteSpaceId":"sitesp_sHtvd","description":"ID: 209; easy","breadcrumbs":[{"label":"Algo"},{"label":"String"}]},{"id":"-Mj1AGoqx1XuH_-d1tEy","title":"Count Unique Characters of All Substrings of a Given String","pathname":"/algo/string/count-unique-characters-of-all-substrings-of-a-given-string","siteSpaceId":"sitesp_sHtvd","description":"ID: 828; hard","breadcrumbs":[{"label":"Algo"},{"label":"String"}]},{"id":"-MaEjzW-7UiunJvJ1USi","title":"Math","pathname":"/algo/math","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Algo"}]},{"id":"-MaEk35s0rfcj_KThH9F","title":"Pow(x, n)","pathname":"/algo/math/pow-x-n","siteSpaceId":"sitesp_sHtvd","description":"ID: 50; medium","breadcrumbs":[{"label":"Algo"},{"label":"Math"}]},{"id":"-Meh8M2A_3X2eUrMT9Iy","title":"Narcissistic Number","pathname":"/algo/math/narcissistic-number","siteSpaceId":"sitesp_sHtvd","description":"ID: 147; easy","breadcrumbs":[{"label":"Algo"},{"label":"Math"}]},{"id":"-Meh6v7k_DLe25Xt6OTs","title":"A + B Problem","pathname":"/algo/math/a-+-b-problem","siteSpaceId":"sitesp_sHtvd","description":"ID: 1; naive","breadcrumbs":[{"label":"Algo"},{"label":"Math"}]},{"id":"ZaSw1aq0naDD3pDTCz7E","title":"Dynamic Programming","pathname":"/algo/dynamic-programming","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Algo"}]},{"id":"rORld4Qa0PVMy04HmrsD","title":"Fibonacci Number","pathname":"/algo/dynamic-programming/fibonacci-number","siteSpaceId":"sitesp_sHtvd","description":"ID: 509; easy","breadcrumbs":[{"label":"Algo"},{"label":"Dynamic Programming"}]},{"id":"bByUQ3Q9GkuxPqPBjNho","title":"N-th Tribonacci Number","pathname":"/algo/dynamic-programming/n-th-tribonacci-number","siteSpaceId":"sitesp_sHtvd","description":"ID: 1137; easy","breadcrumbs":[{"label":"Algo"},{"label":"Dynamic Programming"}]},{"id":"JqdoJLIDiYNcm6zwFMJJ","title":"Climbing Stairs","pathname":"/algo/dynamic-programming/climbing-stairs","siteSpaceId":"sitesp_sHtvd","description":"ID: 70; easy","breadcrumbs":[{"label":"Algo"},{"label":"Dynamic Programming"}]},{"id":"UZFJZiOGtAx0RLZo0ggz","title":"Min Cost Climbing Stairs","pathname":"/algo/dynamic-programming/min-cost-climbing-stairs","siteSpaceId":"sitesp_sHtvd","description":"ID: 746; easy","breadcrumbs":[{"label":"Algo"},{"label":"Dynamic Programming"}]},{"id":"-MbNo64k6-2GcBRdOKLN","title":"LeetCode vs. LintCode Table","pathname":"/algo/leetcode-vs.-lintcode-table","siteSpaceId":"sitesp_sHtvd","description":"For counting duplicated submissions on both platforms","breadcrumbs":[{"label":"Algo"}]},{"id":"XqQVtDsd9mQaeeDyvdBy","title":"Optimizing Performance in React","pathname":"/react-notes/optimizing-performance-in-react","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"React Notes"}]},{"id":"-MXE7zieQB-jQkJq0xVQ","title":"Basics","pathname":"/golang-notes/basics","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"}]},{"id":"-MXDCFpxnY8Kdr6SgpKE","title":"Setup","pathname":"/golang-notes/basics/setup","siteSpaceId":"sitesp_sHtvd","description":"On Windows","breadcrumbs":[{"label":"Golang Notes"},{"label":"Basics"}]},{"id":"-MXDDq3HI5NJUTmWITcA","title":"Hello World","pathname":"/golang-notes/basics/hello-world","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Basics"}]},{"id":"-MXDFxDslYhSE_a7OmWD","title":"Structure","pathname":"/golang-notes/basics/structure","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Basics"}]},{"id":"-MXDI-_0dMKnHFn3MHhl","title":"Data Types","pathname":"/golang-notes/basics/data-types","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Basics"}]},{"id":"-MXE0aPQ35hfcr2NnueU","title":"Variables","pathname":"/golang-notes/basics/variables","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Basics"}]},{"id":"-MXE16QSIcnBP2rznxU_","title":"Operators","pathname":"/golang-notes/basics/operators","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Basics"}]},{"id":"-MXE9hkXJ4sBlGtmYFzt","title":"Constants","pathname":"/golang-notes/basics/constants","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Basics"}]},{"id":"-MXKeWhaNiwp0lIk7zEY","title":"Decision Making","pathname":"/golang-notes/basics/decision-making","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Basics"}]},{"id":"-MXKkXixILoXm18r8b6H","title":"Loops","pathname":"/golang-notes/basics/loops","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Basics"}]},{"id":"-MXKpG6M_EBktP7yqqpl","title":"Special Statements","pathname":"/golang-notes/basics/special-statements","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Basics"}]},{"id":"-MXKuCVfyWeZz2eoAwpB","title":"Official Tutorial Notes","pathname":"/golang-notes/official-tutorial-notes","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"}]},{"id":"-M_WLZHpd6n6rRYucKF1","title":"More Types","pathname":"/golang-notes/official-tutorial-notes/more-types","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"}]},{"id":"-MXKvcXI2QI0oXV2tl60","title":"Functions","pathname":"/golang-notes/official-tutorial-notes/more-types/functions","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"},{"label":"More Types"}]},{"id":"-MXL7j0gzG7o6tWw4m8_","title":"Pointers","pathname":"/golang-notes/official-tutorial-notes/more-types/pointers","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"},{"label":"More Types"}]},{"id":"-M_1cmq8vnuiuFHB5nm7","title":"Structs","pathname":"/golang-notes/official-tutorial-notes/more-types/structs","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"},{"label":"More Types"}]},{"id":"-M_1iho2ifa_N8Xsnfg9","title":"Arrays","pathname":"/golang-notes/official-tutorial-notes/more-types/arrays","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"},{"label":"More Types"}]},{"id":"-M_1k8kGjyJOWsZCsTxL","title":"Slices","pathname":"/golang-notes/official-tutorial-notes/more-types/slices","siteSpaceId":"sitesp_sHtvd","description":"This is a long section...","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"},{"label":"More Types"}]},{"id":"-M_4MrmUt3KC6KuumdsS","title":"Range","pathname":"/golang-notes/official-tutorial-notes/more-types/range","siteSpaceId":"sitesp_sHtvd","description":"For slice or map","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"},{"label":"More Types"}]},{"id":"-M_6z-yYSAG1S1ikGmbv","title":"Maps","pathname":"/golang-notes/official-tutorial-notes/more-types/maps","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"},{"label":"More Types"}]},{"id":"-M_72aX8Z2Kzdh6F7Aak","title":"More Functions","pathname":"/golang-notes/official-tutorial-notes/more-types/more-functions","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"},{"label":"More Types"}]},{"id":"-M_WLcuog4b4EclPnKr9","title":"Methods and Interfaces","pathname":"/golang-notes/official-tutorial-notes/methods-and-interfaces","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"}]},{"id":"-M_7JajbhoPvnGMGs1o_","title":"Methods","pathname":"/golang-notes/official-tutorial-notes/methods-and-interfaces/methods","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"},{"label":"Methods and Interfaces"}]},{"id":"-M_7NcIn78rmEUimvAYf","title":"Interfaces","pathname":"/golang-notes/official-tutorial-notes/methods-and-interfaces/interfaces","siteSpaceId":"sitesp_sHtvd","description":"This is a long section...","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"},{"label":"Methods and Interfaces"}]},{"id":"-M_O3_TkPbMbS7b_9SZz","title":"Stringers","pathname":"/golang-notes/official-tutorial-notes/methods-and-interfaces/stringers","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"},{"label":"Methods and Interfaces"}]},{"id":"-M_O6GG21ihSwdQgSTvq","title":"Errors","pathname":"/golang-notes/official-tutorial-notes/methods-and-interfaces/errors","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"},{"label":"Methods and Interfaces"}]},{"id":"-M_TfX7t8jGDeLBxxfAP","title":"Images","pathname":"/golang-notes/official-tutorial-notes/methods-and-interfaces/images","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"},{"label":"Methods and Interfaces"}]},{"id":"-M_SnV1rw4bsY_d3BYx1","title":"Readers","pathname":"/golang-notes/official-tutorial-notes/methods-and-interfaces/readers","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"},{"label":"Methods and Interfaces"}]},{"id":"-M_WLh1s4AMPHYtt7tjK","title":"Concurrency","pathname":"/golang-notes/official-tutorial-notes/concurrency","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"}]},{"id":"-M_aOu7MfBAoUbNTIPpT","title":"Goroutines","pathname":"/golang-notes/official-tutorial-notes/concurrency/goroutines","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"},{"label":"Concurrency"}]},{"id":"-M_aRPOTX_vBLjmj5aQK","title":"Channels","pathname":"/golang-notes/official-tutorial-notes/concurrency/channels","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"},{"label":"Concurrency"}]},{"id":"-M_aWPSqHhYMJnDWCf7p","title":"Range and Close","pathname":"/golang-notes/official-tutorial-notes/concurrency/range-and-close","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"},{"label":"Concurrency"}]},{"id":"-M_aZ7jG5uoGmhX8zLMR","title":"Select","pathname":"/golang-notes/official-tutorial-notes/concurrency/select","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"},{"label":"Concurrency"}]},{"id":"-M_ab3PA_eLDzXW6Zbpx","title":"Mutual Exclusion","pathname":"/golang-notes/official-tutorial-notes/concurrency/mutual-exclusion","siteSpaceId":"sitesp_sHtvd","description":"","breadcrumbs":[{"label":"Golang Notes"},{"label":"Official Tutorial Notes"},{"label":"Concurrency"}]},{"id":"-MdCoC5ftHzhe3E-UdD6","title":"Traveling to China During a Global Pandemic","pathname":"/miscellaneous/traveling-to-china-during-a-global-pandemic","siteSpaceId":"sitesp_sHtvd","description":"回国记：本文写于2021年6月底。","breadcrumbs":[{"label":"Miscellaneous"}]}]}