{"id":16562765,"url":"https://github.com/charmve/leetcode4flag","last_synced_at":"2025-03-16T20:30:47.217Z","repository":{"id":106310040,"uuid":"303429795","full_name":"Charmve/LeetCode4FLAG","owner":"Charmve","description":"🔥 🔥 High frequent interview LeetCode 100 for FaceBook，Linkedin，Amazon，Google，Microsoft. More importantly, the problems' solutions are provided，include C++, Python and Java.","archived":false,"fork":false,"pushed_at":"2022-06-09T08:37:52.000Z","size":474,"stargazers_count":112,"open_issues_count":0,"forks_count":32,"subscribers_count":2,"default_branch":"main","last_synced_at":"2024-05-23T09:32:10.492Z","etag":null,"topics":["amazon","bytedance","coding","coding-challenge","coding-interviews","cpp","facebook","google","google-interview","interview","interview-preparation","interview-questions","java","jobs","leetcode","leetcode-solutions","lintcode","lintcode-solutions","microsoft","offer"],"latest_commit_sha":null,"homepage":"https://github.com/Charmve","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Charmve.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2020-10-12T15:12:19.000Z","updated_at":"2024-05-01T04:12:29.000Z","dependencies_parsed_at":"2023-06-28T09:57:26.153Z","dependency_job_id":null,"html_url":"https://github.com/Charmve/LeetCode4FLAG","commit_stats":{"total_commits":404,"total_committers":1,"mean_commits":404.0,"dds":0.0,"last_synced_commit":"3ccb3b9e41281b05874bcddc38477b731299159f"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Charmve%2FLeetCode4FLAG","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Charmve%2FLeetCode4FLAG/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Charmve%2FLeetCode4FLAG/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Charmve%2FLeetCode4FLAG/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Charmve","download_url":"https://codeload.github.com/Charmve/LeetCode4FLAG/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243826798,"owners_count":20354221,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["amazon","bytedance","coding","coding-challenge","coding-interviews","cpp","facebook","google","google-interview","interview","interview-preparation","interview-questions","java","jobs","leetcode","leetcode-solutions","lintcode","lintcode-solutions","microsoft","offer"],"created_at":"2024-10-11T20:37:06.444Z","updated_at":"2025-03-16T20:30:46.856Z","avatar_url":"https://github.com/Charmve.png","language":"C++","readme":"\u003ch1\u003e LeetCode4FLAG\n  \u003csup\u003e\n    \u0026nbsp;\n    \u003ca class=\"ai-header-badge\" target=\"_blank\" href=\"https://www.zhihu.com/people/MaiweiE-com/posts\"\u003e\n          \u003cimg class=\"ai-header-badge-img\" src=\"https://img.shields.io/badge/style--5eba00.svg?label=Zhihu\u0026logo=zhihu\u0026style=social\"\u003e\n    \u003c/a\u003e\n    \u003ca class=\"ai-header-badge\" target=\"_blank\" href=\"https://linkedin.com/in/wei-zhang-647b29133/\"\u003e\n          \u003cimg src=\"https://img.shields.io/badge/style--5eba00.svg?label=LinkedIn\u0026logo=linkedin\u0026style=social\"\u003e\n    \u003c/a\u003e\n    \u003ca class=\"ai-header-badge\" target=\"_blank\" href=\"https://www.kaggle.com/yidazhang07\"\u003e\n          \u003cimg class=\"ai-header-badge-img\" src=\"https://img.shields.io/badge/style--5eba00.svg?label=Kaggle\u0026logo=kaggle\u0026style=social\"\u003e\n    \u003c/a\u003e\n    \u003ca class=\"ai-header-badge\" target=\"_blank\" href=\"https://github.com/Charmve/LeetCode4FLAG\"\u003e\n        \u003cimg class=\"ai-header-badge-img\" src=\"https://img.shields.io/github/stars/Charmve/LeetCode4FLAG.svg?style=social\u0026label=Star\"\u003e\n    \u003c/a\u003e\n  \u003c/sup\u003e\n\u003c/h1\u003e \n\n🌍 English | [简体中文](README-zh_CN.md)| [日本語](README-jp_JP.md) | [Українською](README-uk_UA.md)\n\u003cbr\u003e\n\n\u003cdiv align=\"center\"\u003e\n  \u003cdiv align=\"center\"\u003e\n    \u003cimg align=\"center\" src=\"FLAG.jpg\"\u003e\n    \u003cbr\u003e\u003cbr\u003e\n    \u003cp align=\"center\"\u003e\n        \u003ca href=\"https://circleci.com/gh/Charmve/computer-vision-in-action\"\u003e\u003cimg src=\"https://circleci.com/gh/Charmve/computer-vision-in-action.svg?style=svg\" alt=\"CircleCI\" title=\"CircleCI\"\u003e\u003c/a\u003e\n        \u003cimg src=\"https://badgen.net/badge/FLAG/V2.1/orange\" alt=\"Version No.\"\u003e\n        \u003ca href=\"https://gplv3.fsf.org/\" target=\"_blank\" style=\"display:inline-block\"\u003e\u003cimg src=\"https://img.shields.io/badge/license-GPL%203.0-red?logo=apache\" alt=\"Code License\"\u003e\u003c/a\u003e\n        \u003ca name=\"installation\"\u003e\u003c/a\u003e \u003ca href=\"\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/Wiki-简体中文-000000.svg?style=flat-square\u0026amp;logo=GitBook\" alt=\"Chinese Version\"\u003e\u003c/a\u003e\n    \u003c/p\u003e\n  \u003c/div\u003e\n    \u003cp\u003e\n     High frequent interview LeetCode test for \u003cb\u003eF\u003c/b\u003eaceBook, \u003cb\u003eL\u003c/b\u003einkedin, \u003cb\u003eA\u003c/b\u003emazon, \u003cb\u003eG\u003c/b\u003eoogle. More importantly, the problems' solutions are provided in C/C++, Python and Java. \u003cb\u003eOffer\u003c/b\u003e, \u003cb\u003eOffer\u003c/b\u003e, \u003cb\u003eOffer\u003c/b\u003e !\n    \u003c/p\u003e\n    \u003cp align=\"center\"\u003e\n        \u003ca href=\"\"\u003e高频合集\u003c/a\u003e •\n        \u003ca href=\"\"\u003e答题模板\u003c/a\u003e •\n        \u003ca href=\"https://imgconvert.csdnimg.cn/aHR0cHM6Ly9tbWJpei5xcGljLmNuL21tYml6X3BuZy9aTmRoV05pYjNJUkIzZk5ldWVGZEQ4YnZ4cXlzbXRtRktUTGdFSXZOMUdnTHhDNXV0Y1VBZVJ0T0lJa0hTZTVnVGowamVtZUVOQTJJMHhiU0xjQ3VrVVEvNjQw?x-oss-process=image/format,png\"\u003e打卡群\u003c/a\u003e  •\n        \u003ca href=\"\"\u003e📕 Docs\u003c/a\u003e \n    \u003c/p\u003e\n\u003c/div\u003e\n\n\n----\n\u003cb\u003eNote: Please raise an issue for any suggestions, corrections, and feedback.\u003c/b\u003e\n\n- [2020年最新FLAMG面试频率最高的127道题.xlsx](https://github.com/Charmve/LeetCode4FLAG/raw/main/2020最新-FLAMG面试频率最高的127道题.xlsx)\n- [Google最常考的40道动态规划题.xlsx](https://github.com/Charmve/LeetCode4FLAG/raw/main/Google最常考的40道动态规划题.xlsx)\n- [FaceBook高频题100道.xlsx](https://github.com/Charmve/LeetCode4FLAG/raw/main/Facebook高频题100道.xls)\n- CodeTop持续更新 https://codetop.cc/home\n\n\u003cbr\u003e\n\n\u003ca href=\"https://charmve.github.io/sponsor.html\" target=\"_blank\"\u003e\u003cimg src=\"https://cdn.buymeacoffee.com/buttons/v2/default-red.png\" alt=\"Buy Me A Coffee\" width=\"150\" \u003e\u003c/a\u003e\n\n## Index\n\n- 🔥 [Top100](#top100)\n- 💠 [Classification](#classification)\n- 📕 [算法思维+算法模板](#算法思维算法模板)\n- :open_file_folder: [面经C++/后端/算法](https://blog.csdn.net/charmve/category_9622929.html)\n- 👥 [Community](#community)\n- :sparkling_heart: [Support](#-support-this-project)\n\n\u003cbr\u003e\n\n## Top100\n\n\u003ctable class=\"table table-striped table-bordered table-vcenter\"\u003e\n\t\u003ctr\u003e\n\t  \u003ctd\u003e\n\t  \t\u003cstrong\u003eCompany\u003c/strong\u003e\n\t  \u003c/td\u003e\n\t  \u003ctd\u003e\n\t  \t\u003cstrong\u003eLevel\u003c/strong\u003e\n\t  \u003c/td\u003e\n\t  \u003ctd\u003e\n\t  \t\u003cstrong\u003eLeetCode Link\u003c/strong\u003e\n\t  \u003c/td\u003e\n\t  \u003ctd\u003e\n\t  \t\u003cstrong\u003eCode\u003c/strong\u003e\n\t  \u003c/td\u003e\n\t  \u003ctd\u003e\n\t  \t\u003cstrong\u003e ✅ AC\u003c/strong\u003e\n\t  \u003c/td\u003e\n\t\u003c/tr\u003e\n\t\u003ctr\u003e\n        \u003ctd colspan=\"1\" rowspan=\"17\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \t\u003cbr\u003e\n        \t\u003cimg class=\"ai-header-badge-img\" src=\"https://timgsa.baidu.com/timg?image\u0026quality=80\u0026size=b9999_10000\u0026sec=1606451319200\u0026di=2ab4f556738b77aab80f58c265f19827\u0026imgtype=0\u0026src=http%3A%2F%2Fpic2.zhimg.com%2Fv2-497e6c397419d313dc83d03ad3ed8655_1200x500.jpg\" width=\"78\" height=\"60\" alt=\"Amazon\"\u003e\n        \u003c/td\u003e\n        \u003ctd colspan=\"1\" rowspan=\"10\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \t\u003cfont color = green\u003eEasy\u003c/font\u003e\n        \u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/074.%20Search%20a%202D%20Matrix\"\u003e✂️ 74. Search a 2D Matrix\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\t\t\u003cdiv\u003e\n\t\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/074.%20Search%20a%202D%20Matrix/74_search-a-2d-matrix.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/074.%20Search%20a%202D%20Matrix/74_search-a-2d-matrix.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/074.%20Search%20a%202D%20Matrix/74_search-a-2d-matrix.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\t\t\u003c/div\u003e\n    \t\t\u003c/td\u003e\n\t\u003ctd\u003e\n\t  \t2021-09-30\n\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum\"\u003e🐼 1. Two Sum\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\t\t\u003cdiv\u003e\n\t\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\t\t\u003c/div\u003e\n    \t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/021.%20Merge%20Two%20Sorted%20Lists\"\u003e📈 21. Merge Two Sorted Lists\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\u003cdiv\u003e\n\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II\"\u003e🔎 107. Binary Tree Level Order Traversal II\u003c/a\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\n\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/032.%20Longest%20Valid%20Parentheses\"\u003e👑 32. Longest Valid Parentheses\u003c/a\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/032.%20Longest%20Valid%20Parentheses/32_longest-valid-parentheses.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/032.%20Longest%20Valid%20Parentheses/32_longest-valid-parentheses.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/032.%20Longest%20Valid%20Parentheses/32_longest-valid-parentheses.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n\t\u003ctr\u003e\n        \u003ctd\u003e\n            \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/020.%20Valid%20Parentheses\"\u003e🎡 20. Valid Parentheses\u003c/a\u003e\n        \u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/020.%20Valid%20Parentheses/20_valid-parentheses.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/020.%20Valid%20Parentheses/20_valid-parentheses.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/020.%20Valid%20Parentheses/20_valid-parentheses.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n    \t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/200.%20Number%20of%20Islands\"\u003e🌄 200. Number of Islands\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/200.%20Number%20of%20Islands/200_number-of-islands.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/200.%20Number%20of%20Islands/200_number-of-islands.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/200.%20Number%20of%20Islands/200_number-of-islands.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/202.%20Happy%20Number\"\u003e🐋 202. Happy Number\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/202.%20Happy%20Number/202_happy-number.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/202.%20Happy%20Number/202_happy-number.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/202.%20Happy%20Number/202_happy-number.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/1120.%20Maximum%20Average%20Subtree\"\u003e🐑 1120. Maximum Average Subtree\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/1120.%20Maximum%20Average%20Subtree/1120_maximum-average-subtree.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/1120.%20Maximum%20Average%20Subtree/1120_maximum-average-subtree.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/1120.%20Maximum%20Average%20Subtree/1120_maximum-average-subtree.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/543.%20Diameter%20of%20Binary%20Tree\"\u003e🐧 543. Diameter of Binary Tree\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/543.%20Diameter%20of%20Binary%20Tree/543_diameter-of-binary-tree.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/543.%20Diameter%20of%20Binary%20Tree/543_diameter-of-binary-tree.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/543.%20Diameter%20of%20Binary%20Tree/544_diameter-of-binary-tree.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \t\u003ctd colspan=\"1\" rowspan=\"4\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \t\u003cfont color = blue\u003eMedium\u003c/font\u003e\n        \u003c/td\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/297.%20Serialize%20and%20Deserialize%20Binary%20Tree\"\u003e⛺ 297. Serialize and Deserialize Binary Tree\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/297.%20Serialize%20and%20Deserialize%20Binary%20Tree/297_serialize-and-deserialize-binary-tree.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/297.%20Serialize%20and%20Deserialize%20Binary%20Tree/297_serialize-and-deserialize-binary-tree.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/297.%20Serialize%20and%20Deserialize%20Binary%20Tree/297_serialize-and-deserialize-binary-tree.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/240.%20Search%20a%202D%20Matrix%20II\"\u003e🌈 240. Search a 2D Matrix II\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/240.%20Search%20a%202D%20Matrix%20II/240_search-a-2d-matrix-ii.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/240.%20Search%20a%202D%20Matrix%20II/240_search-a-2d-matrix-ii.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/240.%20Search%20a%202D%20Matrix%20II/240_search-a-2d-matrix-ii.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/124.%20Binary%20Tree%20Maximum%20Path%20Sum\"\u003e🚀 124. Binary Tree Maximum Path Sum\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/124.%20Binary%20Tree%20Maximum%20Path%20Sum/124_binary-tree-maximum-path-sum.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/124.%20Binary%20Tree%20Maximum%20Path%20Sum/124_binary-tree-maximum-path-sum.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/124.%20Binary%20Tree%20Maximum%20Path%20Sum/124_binary-tree-maximum-path-sum.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n    \t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctd colspan=\"1\" rowspan=\"3\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \u003cfont color = red\u003eHard\u003c/font\u003e\n    \u003c/td\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/297.%20Serialize%20and%20Deserialize%20Binary%20Tree\"\u003e⛺ 297. Serialize and Deserialize Binary Tree\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/297.%20Serialize%20and%20Deserialize%20Binary%20Tree/297_serialize-and-deserialize-binary-tree.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/297.%20Serialize%20and%20Deserialize%20Binary%20Tree/297_serialize-and-deserialize-binary-tree.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/297.%20Serialize%20and%20Deserialize%20Binary%20Tree/297_serialize-and-deserialize-binary-tree.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/240.%20Search%20a%202D%20Matrix%20II\"\u003e🌈 240. Search a 2D Matrix II\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/240.%20Search%20a%202D%20Matrix%20II/240_search-a-2d-matrix-ii.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/240.%20Search%20a%202D%20Matrix%20II/240_search-a-2d-matrix-ii.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/240.%20Search%20a%202D%20Matrix%20II/240_search-a-2d-matrix-ii.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n\t\u003ctr\u003e\n        \u003ctd colspan=\"1\" rowspan=\"17\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \t\u003cbr\u003e\n       \t\t\u003cimg class=\"ai-header-badge-img\" src=\"https://ss1.bdstatic.com/70cFuXSh_Q1YnxGkpoWK1HF6hhy/it/u=2836168405,102812350\u0026fm=26\u0026gp=0.jpg\" width=\"78\" height=\"30\" alt=\"Google\"\u003e\n        \u003c/td\u003e\n        \u003ctd colspan=\"1\" rowspan=\"10\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \t\u003cfont color = green\u003eEasy\u003c/font\u003e\n        \u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/094.%20Binary%20Tree%20Inorder%20Traversal\"\u003e🚠 94. Binary Tree Inorder Traversal\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\t\t\u003cdiv\u003e\n\t\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/094.%20Binary%20Tree%20Inorder%20Traversal/94_binary-tree-inorder-traversal.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/094.%20Binary%20Tree%20Inorder%20Traversal/94_binary-tree-inorder-traversal.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/094.%20Binary%20Tree%20Inorder%20Traversal/94_binary-tree-inorder-traversal.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\t\t\u003c/div\u003e\n   \t\t \u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/863.%20All%20Nodes%20Distance%20K%20in%20Binary%20Tree\"\u003e⛵ 863. All Nodes Distance K in Binary Tree\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/863.%20All%20Nodes%20Distance%20K%20in%20Binary%20Tree/863_all-nodes-distance-k-in-binary-tree.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/863.%20All%20Nodes%20Distance%20K%20in%20Binary%20Tree/863_all-nodes-distance-k-in-binary-tree.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/863.%20All%20Nodes%20Distance%20K%20in%20Binary%20Tree/863_all-nodes-distance-k-in-binary-tree.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n    \t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n       \u003ctd\u003e\n\t\t\t\t\t\u003ca href=\"https://leetcode-cn.com/problems/merge-two-sorted-lists/\"\u003e📈 21. Merge Two Sorted Lists\u003c/a\u003e\n       \u003c/td\u003e\n    \t \u003ctd\u003e\n\t\t\t\t\u003cdiv\u003e\n\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\t\u003c/div\u003e\n   \t\t \u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\t\u003ctd\u003e\n\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II\"\u003e🔎 107. Binary Tree Level Order Traversal II\u003c/a\u003e\n\t\t\t\u003c/td\u003e\n\t\t\t\u003ctd\u003e\n\t\t\t\t\u003cdiv\u003e\n\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\t\u003c/div\u003e\n\t\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n    \t\u003ctd\u003e\n         \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/032.%20Longest%20Valid%20Parentheses\"\u003e👑 32. Longest Valid Parentheses\u003c/a\u003e\n\t\t\t\u003c/td\u003e\n\t\t\t\u003ctd\u003e\n\t\t\t\t\u003cdiv\u003e\n\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/032.%20Longest%20Valid%20Parentheses/32_longest-valid-parentheses.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/032.%20Longest%20Valid%20Parentheses/32_longest-valid-parentheses.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/032.%20Longest%20Valid%20Parentheses/32_longest-valid-parentheses.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\t\u003c/div\u003e\n\t\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\t\u003ctd\u003e\n\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/020.%20Valid%20Parentheses\"\u003e🎡 20. Valid Parentheses\u003c/a\u003e\n\t\t\t\u003c/td\u003e\n\t\t\t\u003ctd\u003e\n\t\t\t\t\u003cdiv\u003e\n\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/020.%20Valid%20Parentheses/20_valid-parentheses.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/020.%20Valid%20Parentheses/20_valid-parentheses.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/020.%20Valid%20Parentheses/20_valid-parentheses.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\t\u003c/div\u003e\n\t\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/200.%20Number%20of%20Islands\"\u003e🌄 200. Number of Islands\u003c/a\u003e\u003c/td\u003e\n\t\t\t\u003ctd\u003e\n\t\t\t\t\u003cdiv\u003e\n\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/200.%20Number%20of%20Islands/200_number-of-islands.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/200.%20Number%20of%20Islands/200_number-of-islands.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/200.%20Number%20of%20Islands/200_number-of-islands.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\t\u003c/div\u003e\n\t\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/202.%20Happy%20Number\"\u003e🐋 202. Happy Number\u003c/a\u003e\u003c/td\u003e\n\t\t\t\u003ctd\u003e\n\t\t\t\t\u003cdiv\u003e\n\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/202.%20Happy%20Number/202_happy-number.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/202.%20Happy%20Number/202_happy-number.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/202.%20Happy%20Number/202_happy-number.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\t\u003c/div\u003e\n\t\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n    \t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/1120.%20Maximum%20Average%20Subtree\"\u003e🐑 1120. Maximum Average Subtree\u003c/a\u003e\u003c/td\u003e\n    \t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/1120.%20Maximum%20Average%20Subtree/1120_maximum-average-subtree.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/1120.%20Maximum%20Average%20Subtree/1120_maximum-average-subtree.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/1120.%20Maximum%20Average%20Subtree/1120_maximum-average-subtree.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/diameter-of-binary-tree/\"\u003e🐏 543. Diameter of Binary Tree\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/543.%20Diameter%20of%20Binary%20Tree/543_diameter-of-binary-tree.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/543.%20Diameter%20of%20Binary%20Tree/543_diameter-of-binary-tree.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/543.%20Diameter%20of%20Binary%20Tree/544_diameter-of-binary-tree.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctd colspan=\"1\" rowspan=\"4\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \u003cfont color = blue\u003eMedium\u003c/font\u003e\n    \u003c/td\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/494.%20Target%20Sum\"\u003e⛵ 494. Target Sum\u003c/a\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/494.%20Target%20Sum/494_target-sum.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/494.%20Target%20Sum/494_target-sum.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/494.%20Target%20Sum/494_target-sum.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n    \t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/938.%20Range%20Sum%20of%20BST\"\u003e🚁 938. Range Sum of BST\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/938.%20Range%20Sum%20of%20BST/938_range-sum-of-bst.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/938.%20Range%20Sum%20of%20BST/938_range-sum-of-bst.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/938.%20Range%20Sum%20of%20BST/938_range-sum-of-bst.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/124.%20Binary%20Tree%20Maximum%20Path%20Sum\"\u003e🚀 124. Binary Tree Maximum Path Sum\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/124.%20Binary%20Tree%20Maximum%20Path%20Sum/124_binary-tree-maximum-path-sum.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/124.%20Binary%20Tree%20Maximum%20Path%20Sum/124_binary-tree-maximum-path-sum.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/124.%20Binary%20Tree%20Maximum%20Path%20Sum/124_binary-tree-maximum-path-sum.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctd colspan=\"1\" rowspan=\"3\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \u003cfont color = red\u003eHard\u003c/font\u003e\n    \u003c/td\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/173.%20Binary%20Search%20Tree%20Iterator\"\u003e⛺ 173. Binary Search Tree Iterator\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/173.%20Binary%20Search%20Tree%20Iterator/173_binary-search-tree-iterator.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/173.%20Binary%20Search%20Tree%20Iterator/173_binary-search-tree-iterator.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/173.%20Binary%20Search%20Tree%20Iterator/173_binary-search-tree-iterator.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/239.%20Sliding%20Window%20Maximum\"\u003e🌈 239. Sliding Window Maximum\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/239.%20Sliding%20Window%20Maximum/239_sliding-window-maximum.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/239.%20Sliding%20Window%20Maximum/239_sliding-window-maximum.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/239.%20Sliding%20Window%20Maximum/239_sliding-window-maximum.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\u003ctd colspan=\"1\" rowspan=\"10\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n\t\t\t\u003cbr\u003e\n\t\t   \u003cimg class=\"ai-header-badge-img\" src=\"https://timgsa.baidu.com/timg?image\u0026quality=80\u0026size=b9999_10000\u0026sec=1602665253114\u0026di=cfe13209f6eb18528ed16c833f82c222\u0026imgtype=0\u0026src=http%3A%2F%2Fwidefide.com%2Fwp-content%2Fuploads%2F2011%2F08%2Ffacebook_pic.jpg\" width=\"78\" height=\"30\" alt=\"FaceBook\"\u003e\n\t\t \u003c/td\u003e\n\t\t \u003ctd colspan=\"1\" rowspan=\"3\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n\t\t\t\u003cfont color = green\u003eEasy\u003c/font\u003e\n\t\t \u003c/td\u003e\n\t\t \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/833.%20Find%20And%20Replace%20in%20String\"\u003e🚠 833. Find And Replace in String\u003c/a\u003e\u003c/td\u003e\n\t\t \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/833.%20Find%20And%20Replace%20in%20String/833_find-and-replace-in-string.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/833.%20Find%20And%20Replace%20in%20String/833_find-and-replace-in-string.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/833.%20Find%20And%20Replace%20in%20String/833_find-and-replace-in-string.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/200.%20Number%20of%20Islands\"\u003e🌄 200. Number of Islands\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/200.%20Number%20of%20Islands/200_number-of-islands.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/200.%20Number%20of%20Islands/200_number-of-islands.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/200.%20Number%20of%20Islands/200_number-of-islands.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n\t\u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/067.%20Add%20Binary\"\u003e🐠 67. Add Binary\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/067.%20Add%20Binary/67_add-binary.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/067.%20Add%20Binary/67_add-binary.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/067.%20Add%20Binary/67_add-binary.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n   \t\u003ctd colspan=\"1\" rowspan=\"4\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \u003cfont color = blue\u003eMedium\u003c/font\u003e\n    \u003c/td\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/090.%20Subsets%20II\"\u003e🚩 90. Subsets II\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/090.%20Subsets%20II/90_subsets-ii.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/090.%20Subsets%20II/90_subsets-ii.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/090.%20Subsets%20II/90_subsets-ii.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/017.%20Letter%20Combinations%20of%20a%20Phone%20Number\"\u003e🍐 17. Letter Combinations of a Phone Number\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/017.%20Letter%20Combinations%20of%20a%20Phone%20Number/17_letter-combinations-of-a-phone-number.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/017.%20Letter%20Combinations%20of%20a%20Phone%20Number/17_letter-combinations-of-a-phone-number.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/017.%20Letter%20Combinations%20of%20a%20Phone%20Number/17_letter-combinations-of-a-phone-number.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/525.%20Contiguous%20Array\"\u003e🚁 525. Contiguous Array\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/525.%20Contiguous%20Array/525_contiguous-array.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/525.%20Contiguous%20Array/525_contiguous-array.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/525.%20Contiguous%20Array/525_contiguous-array.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctd colspan=\"1\" rowspan=\"3\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \u003cfont color = red\u003eHard\u003c/font\u003e\n    \u003c/td\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/126.%20Word%20Ladder%20II\"\u003e🎄 126. Word Ladder II\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/126.%20Word%20Ladder%20II/126_word-ladder-ii.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/126.%20Word%20Ladder%20II/126_word-ladder-ii.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/126.%20Word%20Ladder%20II/126_word-ladder-ii.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/085.%20Maximal%20Rectangle\"\u003e🎑 85. Maximal Rectangle\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/085.%20Maximal%20Rectangle/85_maximal-rectangle.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/085.%20Maximal%20Rectangle/85_maximal-rectangle.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/085.%20Maximal%20Rectangle/85_maximal-rectangle.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd colspan=\"1\" rowspan=\"8\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \u003cbr\u003e\n        \u003cimg class=\"ai-header-badge-img\" src=\"https://qph.fs.quoracdn.net/main-qimg-05f1ceb11a77b68fd6bf72da21b3400c\" width=\"78\" height=\"51\" alt=\"LinkedIn\"\u003e\n        \u003c/td\u003e\n        \u003ctd colspan=\"1\" rowspan=\"2\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \u003cfont color = green\u003eEasy\u003c/font\u003e\n        \u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/152.%20Maximum%20Product%20Subarray\"\u003e🎏 152. Maximum Product Subarray\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/152.%20Maximum%20Product%20Subarray/152_maximum-product-subarray.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/152.%20Maximum%20Product%20Subarray/152_maximum-product-subarray.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/152.%20Maximum%20Product%20Subarray/152_maximum-product-subarray.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/678.%20Valid%20Parenthesis%20String\"\u003e🍋 678. Valid Parenthesis String\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/678.%20Valid%20Parenthesis%20String/678_valid-parenthesis-string.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/678.%20Valid%20Parenthesis%20String/678_valid-parenthesis-string.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/678.%20Valid%20Parenthesis%20String/678_valid-parenthesis-string.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n   \t\u003ctd colspan=\"1\" rowspan=\"3\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \u003cfont color = blue\u003eMedium\u003c/font\u003e\n    \u003c/td\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/245.%20Shortest%20Word%20Distance%20III\"\u003e⛵ 245. Shortest Word Distance III\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/245.%20Shortest%20Word%20Distance%20III/245_shortest-word-distance-iii.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/245.%20Shortest%20Word%20Distance%20III/245_shortest-word-distance-iii.cpp\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/245.%20Shortest%20Word%20Distance%20III/245_shortest-word-distance-iii.cpp\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/178.%20Rank%20Scores\"\u003e🚁 178. Rank Scores\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/178.%20Rank%20Scores/178_rank-scores.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/178.%20Rank%20Scores/178_rank-scores.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/178.%20Rank%20Scores/178_rank-scores.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctd colspan=\"1\" rowspan=\"3\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \u003cfont color = red\u003eHard\u003c/font\u003e\n    \u003c/td\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/173.%20Binary%20Search%20Tree%20Iterator\"\u003e⛺ 173. Binary Search Tree Iterator\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/173.%20Binary%20Search%20Tree%20Iterator/173_binary-search-tree-iterator.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/173.%20Binary%20Search%20Tree%20Iterator/173_binary-search-tree-iterator.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/173.%20Binary%20Search%20Tree%20Iterator/173_binary-search-tree-iterator.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/239.%20Sliding%20Window%20Maximum\"\u003e🌈 239. Sliding Window Maximum\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/239.%20Sliding%20Window%20Maximum/239_sliding-window-maximum.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/239.%20Sliding%20Window%20Maximum/239_sliding-window-maximum.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/239.%20Sliding%20Window%20Maximum/239_sliding-window-maximum.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd colspan=\"1\" rowspan=\"8\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n\t\t\t\t\t\u003cbr\u003e\n\t\t\t\t\t\u003cimg class=\"ai-header-badge-img\" src=\"https://cdn.vox-cdn.com/thumbor/drG69iSTSbsYDNcckVzB3x97pDA=/7x0:633x417/920x613/filters:focal(7x0:633x417):format(webp)/cdn.vox-cdn.com/assets/1311169/mslogo.jpg\" width=\"78\" height=\"51\" alt=\"MicroSoft\"\u003e\n        \u003c/td\u003e\n        \u003ctd colspan=\"1\" rowspan=\"2\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \t\u003cfont color = green\u003eEasy\u003c/font\u003e\n        \u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/215.%20Kth%20Largest%20Element%20in%20an%20Array\"\u003e🎑 215. Kth Largest Element in an Array\u003c/a\u003e\n\t\t\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/215.%20Kth%20Largest%20Element%20in%20an%20Array/215_kth-largest-element-in-an-array.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/215.%20Kth%20Largest%20Element%20in%20an%20Array/215_kth-largest-element-in-an-array.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/215.%20Kth%20Largest%20Element%20in%20an%20Array/215_kth-largest-element-in-an-array.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/678.%20Valid%20Parenthesis%20String\"\u003e🍋 678. Valid Parenthesis String\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\t\t\u003cdiv\u003e\n\t\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/678.%20Valid%20Parenthesis%20String/678_valid-parenthesis-string.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/678.%20Valid%20Parenthesis%20String/678_valid-parenthesis-string.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/678.%20Valid%20Parenthesis%20String/678_valid-parenthesis-string.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\t\t\u003c/div\u003e\n    \t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n   \t\u003ctd colspan=\"1\" rowspan=\"3\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \u003cfont color = blue\u003eMedium\u003c/font\u003e\n    \u003c/td\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/236.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree\"\u003e⛵ 236. Lowest Common Ancestor of a Binary Tree\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/236.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/236_lowest-common-ancestor-of-a-binary-tree.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/236.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/236_lowest-common-ancestor-of-a-binary-tree.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/236.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/236_lowest-common-ancestor-of-a-binary-tree.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n    \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/shu-zu-zhong-de-ni-xu-dui-lcof/\"\u003e🚁 剑指 Offer 51. 数组中的逆序对\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/468.%20Validate%20IP%20Address/468_validate-ip-address.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/468.%20Validate%20IP%20Address/468_validate-ip-address.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/468.%20Validate%20IP%20Address/468_validate-ip-address.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctd colspan=\"1\" rowspan=\"3\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \u003cfont color = red\u003eHard\u003c/font\u003e\n    \u003c/td\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/binary-search-tree-iterator/\"\u003e⛺ 99. Recover Binary Search Tree\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/099.%2Recover%2Binary%2Search%2Tree/99_recover-binary-search-tree.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/099.%2Recover%2Binary%2Search%2Tree/99_recover-binary-search-tree.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/099.%2Recover%2Binary%2Search%2Tree/99_recover-binary-search-tree.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/239.%20Sliding%20Window%20Maximum\"\u003e🌈 239. Sliding Window Maximum\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/239.%20Sliding%20Window%20Maximum/239_sliding-window-maximum.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/239.%20Sliding%20Window%20Maximum/239_sliding-window-maximum.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/239.%20Sliding%20Window%20Maximum/239_sliding-window-maximum.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n\u003c/table\u003e\n\n\u003cbr\u003e\n\n[Index](#index)\n\n\u003ca href=\"https://charmve.github.io/sponsor.html\" target=\"_blank\"\u003e\u003cimg src=\"https://cdn.buymeacoffee.com/buttons/v2/default-red.png\" alt=\"Buy Me A Coffee\" width=\"150\" \u003e\u003c/a\u003e\n\n\u003cbr\u003e\n\n## Classification\n\n\u003ctable class=\"table table-striped table-bordered table-vcenter\"\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\n        \t\u003cstrong\u003eAlgorithm\u003c/strong\u003e\n        \u003c/td\u003e\n        \u003ctd\u003e\n        \t\u003cstrong\u003eLeetCode Link\u003c/strong\u003e\n        \u003c/td\u003e\n        \u003ctd\u003e\n        \t\u003cstrong\u003eLevel\u003c/strong\u003e\n        \u003c/td\u003e\n        \u003ctd\u003e\n        \t\u003cstrong\u003eCode\u003c/strong\u003e\n        \u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cstrong\u003e ✅ AC\u003c/strong\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctd colspan=\"1\" rowspan=\"9\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n    \t\u003cbr\u003e\u003cfont  size = 4\u003eDynamic Programming\u003cbr\u003e动态规划\n      \u003cbr\u003e\u003cbr\u003e --\u003e \u003ca href=\"./题解模板.md#动态规划-dynamic-programming\"\u003e解题模板\u003c/a\u003e\u003c/font\u003e\n    \u003c/td\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/568.%20Maximum%20Vacation%20Days\"\u003e⛺ 568. Maximum Vacation Days\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/568.%20Maximum%20Vacation%20Days/568_maximum-vacation-days.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/568.%20Maximum%20Vacation%20Days/568_maximum-vacation-days.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/568.%20Maximum%20Vacation%20Days/568_maximum-vacation-days.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n    \t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/070.%20Climbing%20Stairs\"\u003e🌈 70. Climbing Stairs\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\u003cfont color = green\u003e⭐⭐\u003c/font\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/070.%20Climbing%20Stairs/70_climbing-stairs.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/070.%20Climbing%20Stairs/70_climbing-stairs.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/070.%20Climbing%20Stairs/70_climbing-stairs.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/010.%20Regular%20Expression%20Matching\"\u003e🚀 10. Regular Expression Matching\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/010.%20Regular%20Expression%20Matching/10_regular-expression-matching.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/010.%20Regular%20Expression%20Matching/10_regular-expression-matching.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/010.%20Regular%20Expression%20Matching/10_regular-expression-matching.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/198.%20House%20Robber\"\u003e⛺ 198. House Robber\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = red\u003e⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/198.%20House%20Robber/198_house-robber.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/198.%20House%20Robber/198_house-robber.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/198.%20House%20Robber/198_house-robber.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/139.%20Word%20Break\"\u003e🌈 139. Word Break\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\u003cfont color = red\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/139.%20Word%20Break/139_word-break.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/139.%20Word%20Break/139_word-break.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/139.%20Word%20Break/139_word-break.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/152.%20Maximum%20Product%20Subarray\"\u003e🎏 152. Maximum Product Subarray\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/152.%20Maximum%20Product%20Subarray/152_maximum-product-subarray.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/152.%20Maximum%20Product%20Subarray/152_maximum-product-subarray.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/152.%20Maximum%20Product%20Subarray/152_maximum-product-subarray.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/091.%20Decode%20Ways\"\u003e🌈 91. Decode Ways\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/091.%20Decode%20Ways/91_decode-ways.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/091.%20Decode%20Ways/91_decode-ways.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/091.%20Decode%20Ways/91_decode-ways.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/072.%20Edit%20Distance\"\u003e🐼 72. Edit Distance\u003c/a\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/072.%20Edit%20Distance/72_edit-distance.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/072.%20Edit%20Distance/72_edit-distance.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/072.%20Edit%20Distance/72_edit-distance.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd colspan=\"1\" rowspan=\"5\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \t\u003cbr\u003e\u003cfont  size = 4\u003eDivide \u0026 Conquer\u003cbr\u003e分治思想\n          \u003cbr\u003e\u003cbr\u003e --\u003e \u003ca href=\"./题解模板.md#二分法-binary-search\"\u003e解题模板\u003c/a\u003e\u003c/font\u003e\n        \u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/004.%20Median%20of%20Two%20Sorted%20Arrays\"\u003e✂️ 4. Median of Two Sorted Arrays\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/004.%20Median%20of%20Two%20Sorted%20Arrays/4_median-of-two-sorted-arrays.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/004.%20Median%20of%20Two%20Sorted%20Arrays/4_median-of-two-sorted-arrays.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/004.%20Median%20of%20Two%20Sorted%20Arrays/4_median-of-two-sorted-arrays.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n    \t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/023.%20Merge%20k%20Sorted%20Lists\"\u003e🐼 23. Merge k Sorted Lists\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/023.%20Merge%20k%20Sorted%20Lists/23_merge-k-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/023.%20Merge%20k%20Sorted%20Lists/23_merge-k-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/023.%20Merge%20k%20Sorted%20Lists/23_merge-k-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/110.%20Balanced%20Binary%20Tree\"\u003e📈 110. Balanced Binary Tree\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/110.%20Balanced%20Binary%20Tree/110_balanced-binary-tree.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/110.%20Balanced%20Binary%20Tree/110_balanced-binary-tree.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/110.%20Balanced%20Binary%20Tree/110_balanced-binary-tree.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/124.%20Binary%20Tree%20Maximum%20Path%20Sum\"\u003e🚀 124. Binary Tree Maximum Path Sum\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/124.%20Binary%20Tree%20Maximum%20Path%20Sum/124_binary-tree-maximum-path-sum.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/124.%20Binary%20Tree%20Maximum%20Path%20Sum/124_binary-tree-maximum-path-sum.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/124.%20Binary%20Tree%20Maximum%20Path%20Sum/124_binary-tree-maximum-path-sum.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/098.%20Validate%20Binary%20Search%20Tree\"\u003e🐼 98. Validate Binary Search Tree\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/098.%20Validate%20Binary%20Search%20Tree/98_validate-binary-search-tree.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/098.%20Validate%20Binary%20Search%20Tree/98_validate-binary-search-tree.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/098.%20Validate%20Binary%20Search%20Tree/98_validate-binary-search-tree.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e    \n    \u003ctr\u003e\n        \u003ctd colspan=\"1\" rowspan=\"5\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \t\u003cbr\u003e\u003cfont  size = 4\u003eDichotomy\u003cbr\u003e二分法\n          \u003cbr\u003e\u003cbr\u003e --\u003e \u003ca href=\"./题解模板.md#二分法-binary-search\"\u003e解题模板\u003c/a\u003e\u003c/font\u003e\n        \u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array\"\u003e✂️ 153. Find Minimum in Rotated Sorted Array\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array/153_find-minimum-in-rotated-sorted-array.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array/153_find-minimum-in-rotated-sorted-array.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array/153_find-minimum-in-rotated-sorted-array.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n    \t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/033.%20Search%20in%20Rotated%20Sorted%20Array\"\u003e🐼 33. Search in Rotated Sorted Array\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/033.%20Search%20in%20Rotated%20Sorted%20Array/33_search-in-rotated-sorted-array.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/033.%20Search%20in%20Rotated%20Sorted%20Array/33_search-in-rotated-sorted-array.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/033.%20Search%20in%20Rotated%20Sorted%20Array/33_search-in-rotated-sorted-array.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/069.%20Sqrt(x)\"\u003e📈 69. Sqrt(x)\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/069.%20Sqrt(x)/69_sqrtx.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/069.%20Sqrt(x)/69_sqrtx.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/069.%20Sqrt(x)/69_sqrtx.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/029.%20Divide%20Two%20Integers\"\u003e🔎 29. Divide Two Integers\u003c/a\u003e\n\t\t\t\u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/029.%20Divide%20Two%20Integers/29_divide-two-integers.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/029.%20Divide%20Two%20Integers/29_divide-two-integers.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/029.%20Divide%20Two%20Integers/29_divide-two-integers.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/162.%20Find%20Peak%20Element\"\u003e🐼 162. Find Peak Element\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\u003cdiv\u003e\n\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/162.%20Find%20Peak%20Element/162_find-peak-element.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/162.%20Find%20Peak%20Element/162_find-peak-element.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/162.%20Find%20Peak%20Element/162_find-peak-element.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd colspan=\"1\" rowspan=\"6\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \t\u003cbr\u003e\u003cfont  size = 4\u003eRecursion\u003cbr\u003e递归\n          \u003cbr\u003e\u003cbr\u003e --\u003e \u003ca href=\"./题解模板.md#二分法-binary-search\"\u003e解题模板\u003c/a\u003e\u003c/font\u003e\n        \u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/generate-parentheses/\"\u003e✂️ 22. 括号生成\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/074.%20Search%20a%202D%20Matrix/74_search-a-2d-matrix.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/074.%20Search%20a%202D%20Matrix/74_search-a-2d-matrix.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/074.%20Search%20a%202D%20Matrix/74_search-a-2d-matrix.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n    \t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/gray-code/\"\u003e🐼 89. 格雷编码\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\u003cdiv\u003e\n\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n\t\u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/balanced-binary-tree/\"\u003e📈 110. 平衡二叉树\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\u003cdiv\u003e\n\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/\"\u003e📈 17. 电话号码的字母组合\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\u003cdiv\u003e\n\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/permutations/\"\u003e📈 46. 全排列\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\u003cdiv\u003e\n\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003ca href=\"https://leetcode-cn.com/problems/binary-tree-maximum-path-sum/\"\u003e🔎 124. 二叉树中的最大路径和\u003c/a\u003e\n\t\t\t\u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n\t\t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd colspan=\"1\" rowspan=\"8\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \t\u003cbr\u003e\u003cfont  size = 4\u003eSorting Algorithm\u003cbr\u003e排序算法\n          \u003cbr\u003e\u003cbr\u003e --\u003e \u003ca href=\"./题解模板.md#二分法-binary-search\"\u003e解题模板\u003c/a\u003e\u003c/font\u003e\n        \u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/kth-largest-element-in-an-array/\"\u003e✂️ 215. 数组中的第K个最大元素\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/074.%20Search%20a%202D%20Matrix/74_search-a-2d-matrix.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/074.%20Search%20a%202D%20Matrix/74_search-a-2d-matrix.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/074.%20Search%20a%202D%20Matrix/74_search-a-2d-matrix.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n    \t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://zhuanlan.zhihu.com/p/157708020\"\u003e🐼 LintCode. 无序数组K小元素\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\u003c/td\u003e\n    \u003c/tr\u003e\n\t\u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/k-inverse-pairs-array/\"\u003e📈 629. K个逆序对数组\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/shu-zu-zhong-de-ni-xu-dui-lcof/\"\u003e🐼 剑指 Offer 51. 数组中的逆序对\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/count-of-range-sum/\"\u003e📈 327. 区间和的个数\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n    \u003ctd\u003e\n        \u003ca href=\"https://blog.csdn.net/cumt_cx/article/details/47820137/\"\u003e🔎 LintCode 399.Nuts \u0026 Bolts Problem-Nuts 和 Bolts 的问题\u003c/a\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n    \u003c/td\u003e\n    \u003ctd\u003e\n        \u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n    \u003ctd\u003e\n        \u003ca href=\"https://leetcode-cn.com/problems/orderly-queue/\"\u003e🐼 899. 有序队列\u003c/a\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n    \u003c/td\u003e\n    \u003ctd\u003e\n        \u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n    \u003ctd\u003e\n        \u003ca href=\"https://leetcode-cn.com/problems/wiggle-subsequence/\"\u003e🔎 376. 摆动序列\u003c/a\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n    \u003c/td\u003e\n    \u003ctd\u003e\n        \u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd colspan=\"1\" rowspan=\"7\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \t\u003cbr\u003e\u003cfont  size = 4\u003eTraverse/Visit\u003cbr\u003e遍历\n          \u003cbr\u003e\u003cbr\u003e --\u003e \u003ca href=\"./题解模板.md#二分法-binary-search\"\u003e解题模板\u003c/a\u003e\u003c/font\u003e\n        \u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii/\"\u003e✂️ 123. 买卖股票的最佳时机 III\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/074.%20Search%20a%202D%20Matrix/74_search-a-2d-matrix.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/074.%20Search%20a%202D%20Matrix/74_search-a-2d-matrix.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/074.%20Search%20a%202D%20Matrix/74_search-a-2d-matrix.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n    \t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://blog.csdn.net/zjwreal/article/details/100023373\"\u003e🐼 644. 最大子段和 II\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n\t\u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/binary-tree-level-order-traversal/\"\u003e📈 102. 二叉树的层序遍历\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/binary-tree-preorder-traversal/\"\u003e🐼 144. 二叉树的前序遍历\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/binary-tree-postorder-traversal/\"\u003e📈 145. 二叉树的后序遍历\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n    \u003ctd\u003e\n        \u003ca href=\"https://leetcode-cn.com/problems/vertical-order-traversal-of-a-binary-tree/\"\u003e🔎 987. 二叉树的垂序遍历\u003c/a\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n    \u003c/td\u003e\n    \u003ctd\u003e\n        \u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n    \u003ctd\u003e\n        \u003ca href=\"https://leetcode-cn.com/problems/binary-tree-paths/\"\u003e🔎 257. 二叉树的所有路径\u003c/a\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐\u003c/font\u003e\u003c/td\u003e\n    \u003c/td\u003e\n    \u003ctd\u003e\n        \u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd colspan=\"1\" rowspan=\"6\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \t\u003cbr\u003e\u003cfont  size = 4\u003eDual Pointer Algorithm\u003cbr\u003e双指针算法\n          \u003cbr\u003e\u003cbr\u003e --\u003e \u003ca href=\"./题解模板.md#二分法-binary-search\"\u003e解题模板\u003c/a\u003e\u003c/font\u003e\n        \u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof/\"\u003e✂️ 剑指 Offer 48. 最长不含重复字符的子字符串\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/003.%20Longest%20Substring%20Without%20Repeating%20Characters/3.longest-substring-without-repeating-characters.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/003.%20Longest%20Substring%20Without%20Repeating%20Characters/3.longest-substring-without-repeating-characters.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/003.%20Longest%20Substring%20Without%20Repeating%20Characters/3.longest-substring-without-repeating-characters.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n    \t\u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/container-with-most-water/\"\u003e🐼 11. 盛最多水的容器\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/trapping-rain-water/\"\u003e📈 42. 接雨水\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\n        #双指针-two-pointers\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/palindromic-substrings/\"\u003e📈 647. 回文子串\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/reverse-linked-list-ii/\"\u003e✂️ 92. 反转链表 II\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n    \u003ctd\u003e\n        \u003ca href=\"https://leetcode-cn.com/problems/linked-list-cycle-ii/\"\u003e🔎 142. 环形链表 II\u003c/a\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n    \u003c/td\u003e\n    \u003ctd\u003e\n        \u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd colspan=\"1\" rowspan=\"6\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \t\u003cbr\u003e\u003cfont  size = 4\u003eBreadth First Search\u003cbr\u003e宽度/广度优先搜索\n          \u003cbr\u003e\u003cbr\u003e --\u003e \u003ca href=\"./题解模板.md#宽度优先搜索-bfs\"\u003e解题模板\u003c/a\u003e\u003c/font\u003e\n        \u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/word-ladder\"\u003e✂️ 127. 单词接龙\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/074.%20Search%20a%202D%20Matrix/74_search-a-2d-matrix.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/074.%20Search%20a%202D%20Matrix/74_search-a-2d-matrix.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/074.%20Search%20a%202D%20Matrix/74_search-a-2d-matrix.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n    \t\u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/number-of-islands/\"\u003e🐼 200. 岛屿数量\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n\t\u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/binary-tree-level-order-traversal/\"\u003e📈 102. 二叉树的层序遍历\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/clone-graph\"\u003e📈 133. 克隆图\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii/\"\u003e📈 107. 二叉树的层序遍历 II\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n    \u003ctd\u003e\n        \u003ca href=\"https://leetcode-cn.com/problems/binary-tree-right-side-view/\"\u003e🔎 199. 二叉树的右视图\u003c/a\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n    \u003c/td\u003e\n    \u003ctd\u003e\n        \u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd colspan=\"1\" rowspan=\"6\" class=\"top100-algorithm-table-points ai-orange-link\"\u003e\n        \t\u003cbr\u003e\u003cfont  size = 4\u003eDepth First Search\u003cbr\u003e深度优先搜索\n          \u003cbr\u003e\u003cbr\u003e --\u003e \u003ca href=\"./题解模板.md#深度优先搜索-dfs\"\u003e解题模板\u003c/a\u003e\u003c/font\u003e\n        \u003c/td\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/minimum-depth-of-binary-tree/\"\u003e✂️ 111. 二叉树的最小深度\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\t\t\u003cdiv\u003e\n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/074.%20Search%20a%202D%20Matrix/74_search-a-2d-matrix.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/074.%20Search%20a%202D%20Matrix/74_search-a-2d-matrix.py\"\u003e🐍 Python \u003c/a\u003e | \n\t\t\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/074.%20Search%20a%202D%20Matrix/74_search-a-2d-matrix.java\"\u003e♨️ Java \u003c/a\u003e\n\t\t\t\u003c/div\u003e\n    \t\u003c/td\u003e\n\t\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/insert-into-bits-lcci/\"\u003e🐼 面试题 05.01. 插入\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/001.%20Two%20Sum/1_two-sum.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n    \u003c/tr\u003e\n\t\u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/word-ladder-ii/\"\u003e📈 126. 单词接龙 II\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/palindrome-partitioning/\"\u003e📈 131. 分割回文串\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n        \u003ctd\u003e\u003ca href=\"https://leetcode-cn.com/problems/n-queens/\"\u003e📈 51. N 皇后\u003c/a\u003e\u003c/td\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n        \u003ctd\u003e\n\t\u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/blob/main/021.%20Merge%20Two%20Sorted%20Lists/21_merge-two-sorted-lists.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n    \u003ctr\u003e\n    \u003ctd\u003e\n        \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II\"\u003e🔎 107. Binary Tree Level Order Traversal II\u003c/a\u003e\n        \u003ctd\u003e\u003cfont color = green\u003e⭐⭐⭐\u003c/font\u003e\u003c/td\u003e\n    \u003c/td\u003e\n    \u003ctd\u003e\n        \u003cdiv\u003e\n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.cpp\"\u003e:shipit: C++\u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.py\"\u003e🐍 Python \u003c/a\u003e | \n\t  \u003ca href=\"https://github.com/Charmve/LeetCode4FLAG/tree/main/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II/107_binary-tree-level-order-traversal-ii.java\"\u003e♨️ Java \u003c/a\u003e\n\t\u003c/div\u003e\n    \u003c/td\u003e\n\t\u003ctd\u003e\n\t\t\u003c/td\u003e\n    \u003c/tr\u003e\n\u003c/table\u003e\n\n\u003cbr\u003e\n\n[Index](#index)\n\u003cbr\u003e\n\n# 算法思维+[\u003cb\u003e算法模板\u003c/b\u003e](./题解模板.md)\n## 回溯\n```\nresult = []\ndef backtrack(路径, 选择列表):\n    if 满足结束条件:\n        result.add(路径)\n        return\n\n    for 选择 in 选择列表:\n        做选择\n        backtrack(路径, 选择列表)\n        撤销选择\n```\n\u003cdetails\u003e\u003csummary\u003e\u003cb\u003eLeetCode 22. Generate Parentheses\u003c/b\u003e https://leetcode-cn.com/problems/generate-parentheses/\u003c/summary\u003e\n\n\u003cbr\u003eGiven ``n`` pairs of parentheses, write a function to generate all combinations of well-formed parentheses.\n\n**Example 1:**\n```\nInput: n = 3\nOutput: [\"((()))\",\"(()())\",\"(())()\",\"()(())\",\"()()()\"]\n```\n**Example 2:**\n```\nInput: n = 1\nOutput: [\"()\"]\n```\n\n**Constraints:**\n\n``1 \u003c= n \u003c= 8``\n\u003c/details\u003e\n\n```\nvoid backtrack(int n, int i, string\u0026 track) {\n    // i 代表当前的位置，共 2n 个位置\n    // 穷举到最后一个位置了，得到一个长度为 2n 组合\n    if (i == 2 * n) {\n        print(track);\n        return;\n    }\n\n    // 对于每个位置可以是左括号或者右括号两种选择\n    for choice in ['(', ')'] {\n        track.push(choice); // 做选择\n        // 穷举下一个位置\n        backtrack(n, i + 1, track);\n        track.pop(choice); // 撤销选择\n    }\n}\n```\n\nSee more -\u003e [\u003cb\u003e题解模板.md\u003c/b\u003e](./题解模板.md)\n\n\u003cbr\u003e\n\n[Index](#index)\n\u003cbr\u003e\n\n# Community\n\n- We have a discord server! [![Discord](https://img.shields.io/discord/744385009028431943.svg?label=\u0026logo=discord\u0026logoColor=ffffff\u0026color=7389D8\u0026labelColor=6A7EC2)](https://discord.gg/9BBt5BndMx) This should be your first stop to talk with other Coding friends. Why don't you introduce yourself right now? [Join the Coding channel in LeetCode4FLAG Discord](https://discord.gg/9BBt5BndMx)\n- You can also interact through [GitHub issues](https://github.com/Charmve/LeetCode4FLAG/issues). If there is any problem, or a change needs to be made to the repo, this is the place to start the conversation. Read more [here](CONTRIBUTING.md).\n- Subscribe to our [Offical Account with WeChat](https://github.com/Charmve/PaperWeeklyAI/blob/master/MaiweiAI-com.png?raw=true).\n\n\u003cbr\u003e\n\n[Index](#index)\n\u003cbr\u003e\n\n# License\n\n\u003ca rel=\"license\" href=\"http://creativecommons.org/licenses/by-nc-sa/4.0/\"\u003e\u003cimg alt=\"知识共享许可协议\" style=\"border-width:0\" src=\"https://i.creativecommons.org/l/by-nc-sa/4.0/88x31.png\" /\u003e\u003c/a\u003e\n\n\u003cbr\u003e\n\n[Index](#index)\n\u003cbr\u003e\n\n\n## :rocket: 知识星球\n\n专为求职面试中算法与数据结构的小伙伴，创了学习交流/刷题群（知识星球）！想要最快的提升算法与数据结构技能，和更多小伙伴一起来吧！进阶面试八股文，大厂面经\n\n\u003cdiv align=\"center\"\u003e\n  \u003ca href=\"https://github.com/Charmve/CppMaster\"\u003e\n\t\u003cimg src=\"https://github.com/Charmve/CppMaster/blob/main/src/header.svg\" width=\"50%\" alt=\"Click to see the more details\"\u003e\n  \u003c/a\u003e \u003cbr\u003e\n  \u003ca href=\"https://charmve.github.io/CppMaster/src/maiwei-planet.jpg\"\u003e\n\t\u003cimg src=\"https://github.com/Charmve/CppMaster/blob/main/src/maiwei-planet.jpg\" width=\"36%\" alt=\"Click to see the more details\"\u003e\n  \u003c/a\u003e\n\u003c/div\u003e\n\n## 💖 Support this project\nDonating to help me continue working on this project. \u003ca href=\"https://charmve.github.io/sponsor.html\"\u003e\u003cimg src=\"https://img.shields.io/badge/style--5eba00.svg?label=Coffee\u0026amp;logo=ko-fi\u0026amp;style=social\" alt=\"BuymeaCoffee\"/\u003e\u003c/a\u003e\n\n\u003ca href=\"https://www.buymeacoffee.com/Charmve\" target=\"_blank\"\u003e\u003cimg src=\"https://cdn.buymeacoffee.com/buttons/v2/default-red.png\" alt=\"Buy Me A Coffee\" width=\"150\" \u003e\u003c/a\u003e\n\n\u003ca href=\"https://www.paypal.com/paypalme/Charmve\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/-PayPal-lightblue.svg?logo=paypal\" alt=\"Donate with Paypal\"\u003e\u003c/a\u003e \u0026nbsp;\u0026nbsp;\u0026nbsp;\n\u003ca href=\"https://charmve.github.io/sponsor.html\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/-AliPay-blue.svg?logo=AliPay\" alt=\"Donate with AliPay\"\u003e\u003c/a\u003e | \u003ca href=\"https://charmve.github.io/sponsor.html\" target=\"_blank\"\u003e\u003cimg src=\"https://img.shields.io/badge/-WeChat-green.svg?logo=WeChat\" alt=\"Donate with WeChat\"\u003e\u003c/a\u003e\n\n\n\n\u003cp align=\"right\"\u003e\n\t2021 ©  \u003ca href=\"https://github.com/Charmve\"\u003eCharmve\u003c/a\u003e.\n\u003c/p\u003e\n\n\n\u003c!--\nhttps://zhuanlan.zhihu.com/p/26001155\nhttps://www.zhihu.com/question/19805213/answer/158841993\nhttps://www.zhihu.com/question/34814570/answer/340820231\n微软 https://zhuanlan.zhihu.com/p/269873152\n---\u003e\n","funding_links":["https://www.buymeacoffee.com/Charmve","https://www.paypal.com/paypalme/Charmve"],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcharmve%2Fleetcode4flag","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcharmve%2Fleetcode4flag","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcharmve%2Fleetcode4flag/lists"}