{"version":1,"pages":[{"id":"-MUt7Y7vhsijUwEjLSdB","title":"Introduction","pathname":"/algorithm-notes","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZmrgQhKsH9vsZnY","title":"Search & Backtracking 搜索与回溯","pathname":"/algorithm-notes/search_and_backtracking_sou_suo_yu_hui_su","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZmsL_CfLL-S7QYK","title":"Tree 与 BackTracking 的比较","pathname":"/algorithm-notes/search_and_backtracking_sou_suo_yu_hui_su/414","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Search & Backtracking 搜索与回溯"}]},{"id":"-MUt7ZmtD4Nun7xROtzK","title":"Subsets, Combination 与 Permutation","pathname":"/algorithm-notes/search_and_backtracking_sou_suo_yu_hui_su/517_search_and_recursion_1","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Search & Backtracking 搜索与回溯"}]},{"id":"-MUt7ZmupJASkU8U3D-J","title":"Subsets & Combinations & Combination Sum","pathname":"/algorithm-notes/search_and_backtracking_sou_suo_yu_hui_su/subsets_and_combinations_and_combination_sum","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Search & Backtracking 搜索与回溯"}]},{"id":"-MUt7ZmvouVrs69ZK7-a","title":"枚举法","pathname":"/algorithm-notes/search_and_backtracking_sou_suo_yu_hui_su/520_search_and_recursion_7","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Search & Backtracking 搜索与回溯"}]},{"id":"-MUt7Zmwy_XPzU2_VAlb","title":"N 皇后 + 矩阵 Index Trick","pathname":"/algorithm-notes/search_and_backtracking_sou_suo_yu_hui_su/518_search_and_recursion_3","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Search & Backtracking 搜索与回溯"}]},{"id":"-MUt7Zmxb_1IvQgX7wsF","title":"Sudoku 数独 + 矩阵 Index Trick","pathname":"/algorithm-notes/search_and_backtracking_sou_suo_yu_hui_su/521_er_wei_ju_zhen_trick__sudoku","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Search & Backtracking 搜索与回溯"}]},{"id":"-MUt7ZmymTJjNAyL5yiD","title":"Word Ladder I & II","pathname":"/algorithm-notes/search_and_backtracking_sou_suo_yu_hui_su/518_search_and_recursion_4","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Search & Backtracking 搜索与回溯"}]},{"id":"-MUt7ZmzXYfm0UkEV8fz","title":"Number of ways 类","pathname":"/algorithm-notes/search_and_backtracking_sou_suo_yu_hui_su/number_of_ways","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Search & Backtracking 搜索与回溯"}]},{"id":"-MUt7Zn-fFvuj88e5bM6","title":"DFS flood filling","pathname":"/algorithm-notes/search_and_backtracking_sou_suo_yu_hui_su/519_search_and_recursion_6","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Search & Backtracking 搜索与回溯"}]},{"id":"-MUt7Zn067ApPWxnCWdE","title":"Strobogrammatic 数生成","pathname":"/algorithm-notes/search_and_backtracking_sou_suo_yu_hui_su/strobogrammatic_shu_sheng_cheng","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Search & Backtracking 搜索与回溯"}]},{"id":"-MUt7Zn1Q7S-4MPu6W8a","title":"String 构造式 DFS + Backtracking","pathname":"/algorithm-notes/search_and_backtracking_sou_suo_yu_hui_su/string_gou_zao_shi_dfs_+_backtracking","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Search & Backtracking 搜索与回溯"}]},{"id":"-MUt7Zn2S7D4f9DwgM4K","title":"Word Pattern I & II","pathname":"/algorithm-notes/search_and_backtracking_sou_suo_yu_hui_su/word_pattern_i_and_ii","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Search & Backtracking 搜索与回溯"}]},{"id":"-MUt7Zn3RbXiARIA-MwX","title":"(G) Binary Watch","pathname":"/algorithm-notes/search_and_backtracking_sou_suo_yu_hui_su/g_binary_watch","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Search & Backtracking 搜索与回溯"}]},{"id":"-MUt7Zn4a1dJm79w8dMx","title":"(FB) Phone Letter Combination","pathname":"/algorithm-notes/search_and_backtracking_sou_suo_yu_hui_su/fb_phone_letter_combination","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Search & Backtracking 搜索与回溯"}]},{"id":"-MUt7Zn5Pabg6zCWL2xQ","title":"常见搜索问题的迭代解法","pathname":"/algorithm-notes/search_and_backtracking_sou_suo_yu_hui_su/subsets_lei_wen_ti_de_201c_die_dai_201d_yu_201c_we","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Search & Backtracking 搜索与回溯"}]},{"id":"-MUt7Zn6Ffgvk7ylLzRF","title":"String，字符串类","pathname":"/algorithm-notes/stringff0c_zi_fu_chuan_lei","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7Zn7lMo8m9PNqEmj","title":"多步翻转法","pathname":"/algorithm-notes/stringff0c_zi_fu_chuan_lei/522_string","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"String，字符串类"}]},{"id":"-MUt7Zn8lechJaBcVvlC","title":"Substring 结构和遍历","pathname":"/algorithm-notes/stringff0c_zi_fu_chuan_lei/522string__2","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"String，字符串类"}]},{"id":"-MUt7Zn9mst2No6wO5_O","title":"Palindrome 问题","pathname":"/algorithm-notes/stringff0c_zi_fu_chuan_lei/523_string-_palindrome_wen_ti","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"String，字符串类"}]},{"id":"-MUt7ZnADpACYc4q8WVq","title":"Palindrome Continued","pathname":"/algorithm-notes/stringff0c_zi_fu_chuan_lei/524_string-_palindrome_continued","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"String，字符串类"}]},{"id":"-MUt7ZnBzFwrCtUHbamo","title":"String / LinkedList 大数运算","pathname":"/algorithm-notes/stringff0c_zi_fu_chuan_lei/525_string_za_ti","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"String，字符串类"}]},{"id":"-MUt7ZnC5CN3LxT5Q_jL","title":"序列化与压缩","pathname":"/algorithm-notes/stringff0c_zi_fu_chuan_lei/526_string","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"String，字符串类"}]},{"id":"-MUt7ZnDK4SGI0hSn73r","title":"5/24 String 杂题","pathname":"/algorithm-notes/stringff0c_zi_fu_chuan_lei/524_string_za_ti","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"String，字符串类"}]},{"id":"-MUt7ZnE42AlCRQfasJq","title":"Knuth–Morris–Pratt 字符串匹配","pathname":"/algorithm-notes/stringff0c_zi_fu_chuan_lei/524_string-_kmp_de_ying_yong","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"String，字符串类"}]},{"id":"-MUt7ZnFmYsKKtcl9GXc","title":"Lempel–Ziv–Welch 字符串压缩算法","pathname":"/algorithm-notes/stringff0c_zi_fu_chuan_lei/lempelzivwelch_zi_fu_chuan_ya_suo_suan_fa","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"String，字符串类"}]},{"id":"-MUt7ZnGtZE_1wuO9s-r","title":"(G) Decode String","pathname":"/algorithm-notes/stringff0c_zi_fu_chuan_lei/g_decode_string","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"String，字符串类"}]},{"id":"-MUt7ZnHVrIa4PaCM7zz","title":"(G) UTF-8 Validation","pathname":"/algorithm-notes/stringff0c_zi_fu_chuan_lei/g_utf-8_validation","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"String，字符串类"}]},{"id":"-MUt7ZnIVW1qmfWNUQzh","title":"Binary Tree，二叉树","pathname":"/algorithm-notes/binary_tree","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZnJHN4rBUN3xVke","title":"各种 Binary Tree 定义","pathname":"/algorithm-notes/binary_tree/61_tree_-_ge_zhong_binary_tree_ding_yi","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Tree，二叉树"}]},{"id":"-MUt7ZnKoJ0PKuktVrbr","title":"LCA 类问题","pathname":"/algorithm-notes/binary_tree/lca_lei_wen_ti","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Tree，二叉树"}]},{"id":"-MUt7ZnLASZAzzx7gd_z","title":"三序遍历，vertical order","pathname":"/algorithm-notes/binary_tree/529_tree","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Tree，二叉树"}]},{"id":"-MUt7ZnMl0OsYWz_ZqGw","title":"Post order traversal 的应用","pathname":"/algorithm-notes/binary_tree/post_order_traversal_de_ying_yong","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Tree，二叉树"}]},{"id":"-MUt7ZnN_BrBYUvWZ-Hl","title":"Min/Max/Balanced Depth","pathname":"/algorithm-notes/binary_tree/530_tree","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Tree，二叉树"}]},{"id":"-MUt7ZnOOgtVcIUQ7dIJ","title":"BST","pathname":"/algorithm-notes/binary_tree/531_tree-_bst","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Tree，二叉树"}]},{"id":"-MUt7ZnPOnTRrVe45c89","title":"子树结构","pathname":"/algorithm-notes/binary_tree/61_tree","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Tree，二叉树"}]},{"id":"-MUt7ZnQeJ-GMlz-XwTv","title":"Level Order traversal","pathname":"/algorithm-notes/binary_tree/62-_tree-_level_order_traversal","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Tree，二叉树"}]},{"id":"-MUt7ZnRuC0rm967Zk0V","title":"Morris 遍历","pathname":"/algorithm-notes/binary_tree/63-_tree-_morris_bian_li","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Tree，二叉树"}]},{"id":"-MUt7ZnShPiRj8pNW535","title":"修改结构","pathname":"/algorithm-notes/binary_tree/63-_tree","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Tree，二叉树"}]},{"id":"-MUt7ZnToNLGrzCeyXxn","title":"创建 / 序列化","pathname":"/algorithm-notes/binary_tree/67-_tree-_chuang_jian__xu_lie_hua","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Tree，二叉树"}]},{"id":"-MUt7ZnUqSDf4W6Wkvyz","title":"子树组合，BST query","pathname":"/algorithm-notes/binary_tree/68-_tree","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Tree，二叉树"}]},{"id":"-MUt7ZnVPcMagEnFdwdf","title":"路径与路径和","pathname":"/algorithm-notes/binary_tree/lu_jing_yu_lu_jing_he","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Tree，二叉树"}]},{"id":"-MUt7ZnWK749tnOQx4NR","title":"NestedInteger 类","pathname":"/algorithm-notes/binary_tree/nestedinteger_lei","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Tree，二叉树"}]},{"id":"-MUt7ZnX-MRSzBBQjQJ6","title":"(FB) 从 Binary Tree Path 看如何递归转迭代","pathname":"/algorithm-notes/binary_tree/fbgao_989129_ru_he_di_gui_zhuan_die_dai","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Tree，二叉树"}]},{"id":"-MUt7ZnYyqtn4QKSKD79","title":"(FB) Binary Tree Path 比较路径大小","pathname":"/algorithm-notes/binary_tree/fb_binary_tree_path_bi_jiao_lu_jing_da_xiao","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Tree，二叉树"}]},{"id":"-MUt7ZnZfNdspIcR0JLW","title":"比较好玩的 Binary Tree 概率题","pathname":"/algorithm-notes/binary_tree/bi_jiao_hao_wan_de_binary_tree_gai_lv_ti","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Tree，二叉树"}]},{"id":"-MUt7Zn_ksKIVRdc1bBq","title":"Segment & Fenwick Tree，区间树","pathname":"/algorithm-notes/segment_and_fenwick_tree","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZnahFr0AY_s_iCN","title":"Segment Tree 基础操作","pathname":"/algorithm-notes/segment_and_fenwick_tree/65-_tree-_segment_tree","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Segment & Fenwick Tree，区间树"}]},{"id":"-MUt7ZnbqfG5eFn0LvlG","title":"Segment Tree 的应用","pathname":"/algorithm-notes/segment_and_fenwick_tree/65_tree-_segment_tree_de_ying_yong","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Segment & Fenwick Tree，区间树"}]},{"id":"-MUt7ZncDCkfBERcc19Z","title":"Fenwick Tree (Binary Indexed Tree)","pathname":"/algorithm-notes/segment_and_fenwick_tree/66-_tree-_fenwick_tree_binary_indexed_tree","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Segment & Fenwick Tree，区间树"}]},{"id":"-MUt7ZndtCdMcRow5Dn4","title":"Range Sum Query 2D - Immutable","pathname":"/algorithm-notes/segment_and_fenwick_tree/range_sum_query_2d_-_immutable","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Segment & Fenwick Tree，区间树"}]},{"id":"-MUt7ZneWsPw61gRaSFj","title":"Union-Find，并查集","pathname":"/algorithm-notes/union-findff0c_bing_cha_ji","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZnfpTZQva7dDlxx","title":"Union-Find，并查集基础","pathname":"/algorithm-notes/union-findff0c_bing_cha_ji/66-_union-findff0c_bing_cha_ji_ji_chu","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Union-Find，并查集"}]},{"id":"-MUt7ZngPrpuG61zsuUh","title":"Union-Find, 并查集应用","pathname":"/algorithm-notes/union-findff0c_bing_cha_ji/67-_union-find-_bing_cha_ji_ying_yong","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Union-Find，并查集"}]},{"id":"-MUt7ZnhiVxji68fNPSD","title":"Dynamic Programming, 动态规划","pathname":"/algorithm-notes/dong_tai_gui_hua","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZniSjfw6tZ-hobj","title":"6/20, 入门 House Robber","pathname":"/algorithm-notes/dong_tai_gui_hua/620-_dong_tai_gui_hua","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Dynamic Programming, 动态规划"}]},{"id":"-MUt7ZnjTdUZ1FudjMrq","title":"7/12, Paint Fence / House","pathname":"/algorithm-notes/dong_tai_gui_hua/qi_zha_lan_ff0c_qi_qiang_ff0c_zai_qi_fang","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Dynamic Programming, 动态规划"}]},{"id":"-MUt7Znke5mrxqryeg8e","title":"6/24, 滚动数组","pathname":"/algorithm-notes/dong_tai_gui_hua/624-_dong_tai_gui_hua","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Dynamic Programming, 动态规划"}]},{"id":"-MUt7Znl2Sm5JQn1iUR9","title":"6/24, 记忆化搜索","pathname":"/algorithm-notes/dong_tai_gui_hua/624-_dong_tai_gui_hua_ff0c_ji_yi_hua_sou_suo","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Dynamic Programming, 动态规划"}]},{"id":"-MUt7Znmq2KUo6F3l-Zd","title":"6/24, 博弈类 DP","pathname":"/algorithm-notes/dong_tai_gui_hua/624-_dong_tai_gui_hua_ff0c_bo_yi_lei_dp","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Dynamic Programming, 动态规划"}]},{"id":"-MUt7Znn7xJk4dM_M00k","title":"博弈类DP, Flip Game","pathname":"/algorithm-notes/dong_tai_gui_hua/flip_game","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Dynamic Programming, 动态规划"}]},{"id":"-MUt7ZnoYrcvx8TrUcuz","title":"6/25, 区间类DP","pathname":"/algorithm-notes/dong_tai_gui_hua/625-_dong_tai_gui_hua_ff0c_qu_jian_lei_dp","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Dynamic Programming, 动态规划"}]},{"id":"-MUt7Znp97GvwZA3PFJA","title":"6/27, subarray 划分类，股票","pathname":"/algorithm-notes/dong_tai_gui_hua/626-_dong_tai_gui_hua_ff0c_subarray_lei","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Dynamic Programming, 动态规划"}]},{"id":"-MUt7ZnqYRYFTEXCn2Oy","title":"7/2, 字符串类","pathname":"/algorithm-notes/dong_tai_gui_hua/72-_dong_tai_gui_hua_ff0c_zi_fu_chuan_lei","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Dynamic Programming, 动态规划"}]},{"id":"-MUt7Znr6bBT4HqxQdhA","title":"Bomb Enemies","pathname":"/algorithm-notes/dong_tai_gui_hua/bomb_enemies","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Dynamic Programming, 动态规划"}]},{"id":"-MUt7ZnsoOSTgUutqlpW","title":"8/2，背包问题","pathname":"/algorithm-notes/dong_tai_gui_hua/82ff0c_bei_bao_wen_ti","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Dynamic Programming, 动态规划"}]},{"id":"-MUt7ZntJbi3cI-tqR29","title":"(G) Max Vacation","pathname":"/algorithm-notes/dong_tai_gui_hua/g_max_vacation","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Dynamic Programming, 动态规划"}]},{"id":"-MUt7Znu7Q4x-2v6R4bj","title":"(11/4新增) AST 子树结构 DP","pathname":"/algorithm-notes/dong_tai_gui_hua/xin_589e29_boolean_cao_zuo_fu_zu_he_dp","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Dynamic Programming, 动态规划"}]},{"id":"-MUt7Znve5AtOTUuO8dc","title":"LinkedList，链表","pathname":"/algorithm-notes/linkedlistff0c_lian_biao","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZnwXi0PlJF5vDfL","title":"6/9, LinkedList，反转与删除","pathname":"/algorithm-notes/linkedlistff0c_lian_biao/69-_linkedlistff0c_lian_biao_ji_chu","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"LinkedList，链表"}]},{"id":"-MUt7ZnxqD9HZq65SRZc","title":"6/11, LinkedList 杂题","pathname":"/algorithm-notes/linkedlistff0c_lian_biao/611-_linkedlist_za_ti","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"LinkedList，链表"}]},{"id":"-MUt7Znyxg0NNo8fV2aB","title":"(FB) 链表的递归与倒序打印","pathname":"/algorithm-notes/linkedlistff0c_lian_biao/fb_lian_biao_de_di_gui_yu_dao_xu_da_yin","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"LinkedList，链表"}]},{"id":"-MUt7Znz0WDMSlbInuab","title":"LinkedIn 面经，算法题","pathname":"/algorithm-notes/linkedin_mian_jing","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7Zo-blA8bRUrMPJC","title":"6/17, LinkedIn 面经题","pathname":"/algorithm-notes/linkedin_mian_jing/617-_linkedin_mian_jing_ti","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"LinkedIn 面经，算法题"}]},{"id":"-MUt7Zo0BCtc-WoarNke","title":"6/28, LinkedIn 面经题","pathname":"/algorithm-notes/linkedin_mian_jing/628-_linkedin_mian_jing_ti","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"LinkedIn 面经，算法题"}]},{"id":"-MUt7Zo1c8COHcaQXJaF","title":"7/6, LinkedIn 面经","pathname":"/algorithm-notes/linkedin_mian_jing/76-_linkedin_mian_jing","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"LinkedIn 面经，算法题"}]},{"id":"-MUt7Zo2SYwD9udKVosy","title":"Shortest Word Distance 类","pathname":"/algorithm-notes/linkedin_mian_jing/shortest_word_distance_lei","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"LinkedIn 面经，算法题"}]},{"id":"-MUt7Zo3ZHaEw_NWni0D","title":"DFA Parse Integer","pathname":"/algorithm-notes/linkedin_mian_jing/dfa_parse_integer","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"LinkedIn 面经，算法题"}]},{"id":"-MUt7Zo44y3BwQksdalF","title":"Two Pointers，双指针","pathname":"/algorithm-notes/two_pointers","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7Zo5yWs_By6Ipbp7","title":"3 Sum, 3 Sum Closest / Smaller, 4 Sum","pathname":"/algorithm-notes/two_pointers/3_sum-_3_sum_closest__smaller-_4_sum","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Two Pointers，双指针"}]},{"id":"-MUt7Zo6ETjAo7B3WSjm","title":"对撞型，灌水类","pathname":"/algorithm-notes/two_pointers/613-_two_pointers-_shuang_zhi_zhen","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Two Pointers，双指针"}]},{"id":"-MUt7Zo7riPSec41WwXS","title":"对撞型，partition类","pathname":"/algorithm-notes/two_pointers/613-_two_pointersff0c_dui_zhuang_xing_ff0c_partiti","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Two Pointers，双指针"}]},{"id":"-MUt7Zo82fnceibTOct5","title":"Wiggle Sort I & II","pathname":"/algorithm-notes/two_pointers/614-_two_pointers-_shuang_zhi_zhen","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Two Pointers，双指针"}]},{"id":"-MUt7Zo9hWMaFvISEiXD","title":"双指针，窗口类","pathname":"/algorithm-notes/two_pointers/614-_two_pointers-_shuang_zhi_zhen_ff0c_chuang_kou","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Two Pointers，双指针"}]},{"id":"-MUt7ZoAlCj9MzcX-KUN","title":"双指针，窗口类","pathname":"/algorithm-notes/two_pointers/615-_two_pointers-_shuang_zhi_zhen_ff0c_chuang_kou","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Two Pointers，双指针"}]},{"id":"-MUt7ZoBx317TR5oVX1Q","title":"Heap，排序 matrix 中的 two pointers","pathname":"/algorithm-notes/two_pointers/heapff0c_pai_xu_array__matrix_xuan_kth","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Two Pointers，双指针"}]},{"id":"-MUt7ZoCjE82_GsgbNdI","title":"Bit & Math，位运算与数学","pathname":"/algorithm-notes/bit_and_mathff0c_wei_yun_suan_yu_shu_xue","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZoD-AkRQX9GKUAY","title":"Bit Manipulation，对于 '1' 位的操作","pathname":"/algorithm-notes/bit_and_mathff0c_wei_yun_suan_yu_shu_xue/bit_manipulationff0c_shu__1__bits","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Bit & Math，位运算与数学"}]},{"id":"-MUt7ZoE0K1LR1Sth5a0","title":"Math & Bit Manipulation, Power of X","pathname":"/algorithm-notes/bit_and_mathff0c_wei_yun_suan_yu_shu_xue/63-_math_and_bit_manipulation-_power_of_x","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Bit & Math，位运算与数学"}]},{"id":"-MUt7ZoFZO8rGGPtemVK","title":"坐标系 & 数值计算类","pathname":"/algorithm-notes/bit_and_mathff0c_wei_yun_suan_yu_shu_xue/zuo_biao_xi_and_shu_zhi_ji_suan_lei","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Bit & Math，位运算与数学"}]},{"id":"-MUt7ZoGjpcCkYIddYXw","title":"Add Digits","pathname":"/algorithm-notes/bit_and_mathff0c_wei_yun_suan_yu_shu_xue/add_digits","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Bit & Math，位运算与数学"}]},{"id":"-MUt7ZoHRDebKlwgDZJz","title":"用 int 做字符串 signature","pathname":"/algorithm-notes/bit_and_mathff0c_wei_yun_suan_yu_shu_xue/yong_int_zuo_zi_fuchuan_signature","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Bit & Math，位运算与数学"}]},{"id":"-MUt7ZoIgT3OUeZct7z8","title":"Interval 与 扫描线","pathname":"/algorithm-notes/interval_yu_sao_miao_xian","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZoJtDG3PmJrGalf","title":"Range Addition & LCS","pathname":"/algorithm-notes/interval_yu_sao_miao_xian/range_addition","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Interval 与 扫描线"}]},{"id":"-MUt7ZoKcfmBr3witMmA","title":"7/5, Interval 类，扫描线","pathname":"/algorithm-notes/interval_yu_sao_miao_xian/75-_interval_lei","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Interval 与 扫描线"}]},{"id":"-MUt7ZoLXyBFh9fuorZJ","title":"Trie，字典树","pathname":"/algorithm-notes/trieff0c_zi_dian_shu","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZoMD6yTHJVqHcMt","title":"6/9, Trie, 字典树","pathname":"/algorithm-notes/trieff0c_zi_dian_shu/69-_trie-_zi_dian_shu","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Trie，字典树"}]},{"id":"-MUt7ZoN2UVutz3A7SSY","title":"单调栈，LIS","pathname":"/algorithm-notes/lisff0c_dan_diao_zhan_lei","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZoO-tZH_a2y6mPL","title":"4/13  LIS","pathname":"/algorithm-notes/lisff0c_dan_diao_zhan_lei/chapter1","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"单调栈，LIS"}]},{"id":"-MUt7ZoPc5YxYJNZmg9w","title":"栈， 单调栈","pathname":"/algorithm-notes/lisff0c_dan_diao_zhan_lei/zhan_ff0c_dan_diao_zhan","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"单调栈，LIS"}]},{"id":"-MUt7ZoQtSPPNoIrnEpD","title":"Largest Divisible Subset","pathname":"/algorithm-notes/lisff0c_dan_diao_zhan_lei/largest_divisible_subset","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"单调栈，LIS"}]},{"id":"-MUt7ZoRWp90XU-yg8Bi","title":"Binary Search 类","pathname":"/algorithm-notes/binary_search_lei","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZoS3eezAj6_2fGg","title":"Matrix Binary Search","pathname":"/algorithm-notes/binary_search_lei/matrix_binary_search","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Search 类"}]},{"id":"-MUt7ZoTru-Smzn_LS5W","title":"Array Binary Search","pathname":"/algorithm-notes/binary_search_lei/array_binary_search","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Search 类"}]},{"id":"-MUt7ZoU-6JMwocpDrVh","title":"Find Peak Element I & II","pathname":"/algorithm-notes/binary_search_lei/find_peak_element_i_and_ii","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Search 类"}]},{"id":"-MUt7ZoVrBbRLXi1Kufl","title":"**Median of Two Sorted Arrays","pathname":"/algorithm-notes/binary_search_lei/median_of_two_sorted_arrays","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Binary Search 类"}]},{"id":"-MUt7ZoWRMschik7Of6n","title":"Graph & Topological Sort，图 & 拓扑排序","pathname":"/algorithm-notes/topological_sortff0c_tuo_pu_pai_xu","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZoXWlEU1SzqG9eq","title":"有向 / 无向 图的基本性质和操作","pathname":"/algorithm-notes/topological_sortff0c_tuo_pu_pai_xu/you_xiang__wu_xiang_tu_de_ji_ben_xing_zhi_he_cao_z","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Graph & Topological Sort，图 & 拓扑排序"}]},{"id":"-MUt7ZoYondq6BUhWAwL","title":"拓扑排序, DFS 做法","pathname":"/algorithm-notes/topological_sortff0c_tuo_pu_pai_xu/tuo_pu_pai_xu_yuan_ti","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Graph & Topological Sort，图 & 拓扑排序"}]},{"id":"-MUt7ZoZKW296bA9sZO4","title":"拓扑排序, BFS 做法","pathname":"/algorithm-notes/topological_sortff0c_tuo_pu_pai_xu/tuo_pu_pai_xu_ff0c_bfs_zuo_fa","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Graph & Topological Sort，图 & 拓扑排序"}]},{"id":"-MUt7Zo_Qf-R7vpBEL-F","title":"Course Schedule I & II","pathname":"/algorithm-notes/topological_sortff0c_tuo_pu_pai_xu/course_schedule_i_and_ii","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Graph & Topological Sort，图 & 拓扑排序"}]},{"id":"-MUt7ZoaAAEcBopg5od7","title":"Alien Dictionary","pathname":"/algorithm-notes/topological_sortff0c_tuo_pu_pai_xu/alien_dictionary","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Graph & Topological Sort，图 & 拓扑排序"}]},{"id":"-MUt7ZobqbAuZAIibMIV","title":"Undirected Graph, BFS","pathname":"/algorithm-notes/topological_sortff0c_tuo_pu_pai_xu/undirected_graph-_bfs","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Graph & Topological Sort，图 & 拓扑排序"}]},{"id":"-MUt7Zocrq3Ck-9VyRRT","title":"Undirected Graph, DFS","pathname":"/algorithm-notes/topological_sortff0c_tuo_pu_pai_xu/undirected_graph-_dfs","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Graph & Topological Sort，图 & 拓扑排序"}]},{"id":"-MUt7ZodH90zqapcygT4","title":"矩阵，BFS 最短距离探索","pathname":"/algorithm-notes/topological_sortff0c_tuo_pu_pai_xu/ju_zhen_ff0c_bfs_zui_duan_ju_li_tan_suo","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Graph & Topological Sort，图 & 拓扑排序"}]},{"id":"-MUt7ZoeB4xKOmNmeVhk","title":"欧拉回路，Hierholzer算法","pathname":"/algorithm-notes/topological_sortff0c_tuo_pu_pai_xu/ou_la_hui_lu_ff0c_hierholzer_suan_fa","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Graph & Topological Sort，图 & 拓扑排序"}]},{"id":"-MUt7ZofEG5s_7_xTB43","title":"AI, 迷宫生成","pathname":"/algorithm-notes/topological_sortff0c_tuo_pu_pai_xu/ai-_mi_gong_sheng_cheng","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Graph & Topological Sort，图 & 拓扑排序"}]},{"id":"-MUt7ZogKglG6T9sJJZR","title":"AI, 迷宫寻路算法","pathname":"/algorithm-notes/topological_sortff0c_tuo_pu_pai_xu/ai-_mi_gong_xun_lu_suan_fa","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Graph & Topological Sort，图 & 拓扑排序"}]},{"id":"-MUt7Zohr9IhSBLlYpZR","title":"(G) Deep Copy 无向图成有向图","pathname":"/algorithm-notes/topological_sortff0c_tuo_pu_pai_xu/g_deep_copy_wu_xiang_tu_cheng_you_xiang_tu","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Graph & Topological Sort，图 & 拓扑排序"}]},{"id":"-MUt7Zoi57sZhYIftB4W","title":"括号与数学表达式的计算","pathname":"/algorithm-notes/kuo_hao_ff0c_shu_zhi_ff0c_yu_ji_suan_qi","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZojNEjFE_ycvMnN","title":"Iterator 类","pathname":"/algorithm-notes/iterator_lei","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZokrjIlXCf7m2Ae","title":"Majority Element，Moore's Voting","pathname":"/algorithm-notes/majority_element","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZolQK5Nf4_KXDlX","title":"Matrix Inplace Operations","pathname":"/algorithm-notes/matrix_index_trick","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZomQedCvYUL0iuK","title":"常见数据结构设计","pathname":"/algorithm-notes/shu_ju_jie_gou_de_li_yong_ff0c_chu_li_steam_data","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7Zon8n6rX_8tqqHz","title":"(G) Design / OOD 类算法题","pathname":"/algorithm-notes/g_design__ood_lei_suan_fa_ti","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7Zoo48WxKX9sAfa9","title":"随机算法 & 数据结构","pathname":"/algorithm-notes/sui_ji_suan_fa_and_shu_ju_jie_gou","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZopCtSsOdXhrwyF","title":"(FB) I/O Buffer","pathname":"/algorithm-notes/728-_fb_tag_ti","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZoqOZ51fBofd8-H","title":"(FB) Simplify Path, H-Index I & II","pathname":"/algorithm-notes/728-_fb-_simplify_path-_h-index_i_and_ii","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZorpyiLKTtNCOup","title":"(FB) Excel Sheet, Remove Duplicates","pathname":"/algorithm-notes/729-_fb-_excel_sheet","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZosNTmwITPWJLy2","title":"Integer 的构造，操作，序列化","pathname":"/algorithm-notes/integer_de_gou_zao_ff0c_cao_zuo_ff0c_xu_lie_hua","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7Zoto738YxAxdg6i","title":"Frequency 类问题","pathname":"/algorithm-notes/frequency_lei_wen_ti","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7Zou9Q6FBG89YteK","title":"Missing Number 类，元素交换，数组环形跳转","pathname":"/algorithm-notes/missing_number_lei","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZovlCbhDHlTbz1V","title":"8/10, Google Tag","pathname":"/algorithm-notes/810-_google_tag","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZoweChkmJIWk5F6","title":"(FB) Rearrange String k Distance Apart","pathname":"/algorithm-notes/gao_989129_rearrange_string_k_distance_apart","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZoxiEea8MG33iKh","title":"Abstract Algebra","pathname":"/algorithm-notes/abstract_algebra","siteSpaceId":"sitesp_cGmOt","description":""},{"id":"-MUt7ZoyFm9aQdujavh3","title":"Chap1 -- Why Abstract Algebra ?","pathname":"/algorithm-notes/abstract_algebra/chap1_--_why_abstract_algebra","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Abstract Algebra"}]},{"id":"-MUt7Zoz_SfLrgGb0d39","title":"Chap2 -- Operations","pathname":"/algorithm-notes/abstract_algebra/chap2_--_operations","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Abstract Algebra"}]},{"id":"-MUt7Zp-b1C4J_j7fEm2","title":"Chap3 -- The Definition of Groups","pathname":"/algorithm-notes/abstract_algebra/chap3_--_the_definition_of_groups","siteSpaceId":"sitesp_cGmOt","description":"","breadcrumbs":[{"label":"Abstract Algebra"}]}]}