leetcodeood问题-Crack-LeetCode:为有价值的LeetCode问题提供分析和总结

[{"title":"（ 52 个子文件 8.54MB ） leetcodeood问题-Crack-LeetCode:为有价值的LeetCode问题提供分析和总结","children":[{"title":"Crack-LeetCode-main","children":[{"title":"AlgoTogether_program","children":[{"title":"week1","children":[{"title":"required","children":[{"title":"299.md <span style='color:#111;'> 2.18KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true},{"title":"template.md <span style='color:#111;'> 358B </span>","children":null,"spread":false},{"title":"CONTRIBUTING.md <span style='color:#111;'> 5.63KB </span>","children":null,"spread":false},{"title":"LICENSE <span style='color:#111;'> 1.04KB </span>","children":null,"spread":false},{"title":"README.md <span style='color:#111;'> 2.90KB </span>","children":null,"spread":false},{"title":"Questions","children":[{"title":"GameSimulation","children":[{"title":"723. Candy Crush.md <span style='color:#111;'> 2.14KB </span>","children":null,"spread":false}],"spread":true},{"title":"Greedy","children":[{"title":"1648. Sell Diminishing-Valued Colored Balls.md <span style='color:#111;'> 1.67KB </span>","children":null,"spread":false}],"spread":true},{"title":"Graph","children":[{"title":"MHT2.jpeg <span style='color:#111;'> 2.79MB </span>","children":null,"spread":false},{"title":"1274. Number of Ships in a Rectangle.md <span style='color:#111;'> 1.18KB </span>","children":null,"spread":false},{"title":"407. Trapping Rain Water II.md <span style='color:#111;'> 1.52KB </span>","children":null,"spread":false},{"title":"417. Pacific Atlantic Water Flow.md <span style='color:#111;'> 1.88KB </span>","children":null,"spread":false},{"title":"MHT1.jpeg <span style='color:#111;'> 2.99MB </span>","children":null,"spread":false},{"title":"MHT3.jpeg <span style='color:#111;'> 2.32MB </span>","children":null,"spread":false},{"title":"1102. Path With Maximum Minimum Value.md <span style='color:#111;'> 2.44KB </span>","children":null,"spread":false},{"title":"1631. Path With Minimum Effort.md <span style='color:#111;'> 2.88KB </span>","children":null,"spread":false},{"title":"310. Minimum Height Trees.md <span style='color:#111;'> 1.67KB </span>","children":null,"spread":false}],"spread":true},{"title":"Tree","children":[{"title":"563. Binary Tree Tilt.md <span style='color:#111;'> 453B </span>","children":null,"spread":false},{"title":"1026. Maximum Difference Between Node and Ancestor.md <span style='color:#111;'> 601B </span>","children":null,"spread":false},{"title":"662. Maximum Width of Binary Tree.md <span style='color:#111;'> 2.55KB </span>","children":null,"spread":false},{"title":"99. Recover Binary Search Tree.md <span style='color:#111;'> 1.66KB </span>","children":null,"spread":false},{"title":"116. Populating Next Right Pointers in Each Node.md <span style='color:#111;'> 1.60KB </span>","children":null,"spread":false}],"spread":true},{"title":"BinarySearch","children":[{"title":"981. Time Based Key-Value Store.md <span style='color:#111;'> 1.17KB </span>","children":null,"spread":false}],"spread":true},{"title":"Stack","children":[{"title":"394. Decode String.md <span style='color:#111;'> 2.70KB </span>","children":null,"spread":false}],"spread":true},{"title":"Array","children":[{"title":"532. K-diff Pairs in an Array.md <span style='color:#111;'> 648B </span>","children":null,"spread":false},{"title":"BinarySearch.md <span style='color:#111;'> 3.62KB </span>","children":null,"spread":false},{"title":"845. Longest Mountain in Array.md <span style='color:#111;'> 3.02KB </span>","children":null,"spread":false},{"title":"849.md <span style='color:#111;'> 2.06KB </span>","children":null,"spread":false},{"title":"611. Valid Triangle Number.md <span style='color:#111;'> 1.00KB </span>","children":null,"spread":false},{"title":"162.jpg <span style='color:#111;'> 161.50KB </span>","children":null,"spread":false},{"title":"Meeting Rooms.md <span style='color:#111;'> 6.25KB </span>","children":null,"spread":false},{"title":"33.jpg <span style='color:#111;'> 192.76KB </span>","children":null,"spread":false}],"spread":true},{"title":"String","children":[{"title":"1209. Remove All Adjacent Duplicates in String II.md <span style='color:#111;'> 1.24KB </span>","children":null,"spread":false}],"spread":false},{"title":"TwoPointers","children":[{"title":"209. Minimum Size Subarray Sum.md <span style='color:#111;'> 823B </span>","children":null,"spread":false},{"title":"287. Find the Duplicate Number.md <span style='color:#111;'> 1.25KB </span>","children":null,"spread":false}],"spread":false},{"title":"Math","children":[{"title":"902. Numbers At Most N Given Digit Set.md <span style='color:#111;'> 1.35KB </span>","children":null,"spread":false}],"spread":false},{"title":"SystemDesign","children":[{"title":"1396. Design Underground System.md <span style='color:#111;'> 2.45KB </span>","children":null,"spread":false}],"spread":false},{"title":"LinkedList","children":[{"title":"445. Add Two Numbers II.md <span style='color:#111;'> 3.84KB </span>","children":null,"spread":false}],"spread":false}],"spread":false},{"title":"docs","children":[{"title":"Dijkstra.pdf <span style='color:#111;'> 438.67KB </span>","children":null,"spread":false}],"spread":true},{"title":"CODE_OF_CONDUCT.md <span style='color:#111;'> 3.28KB </span>","children":null,"spread":false},{"title":".gitignore <span style='color:#111;'> 280B </span>","children":null,"spread":false},{"title":"Companies","children":[{"title":"AkunaCapital2021PrepareOA.md <span style='color:#111;'> 15.42KB </span>","children":null,"spread":false},{"title":"Bloomberg","children":[{"title":"README.md <span style='color:#111;'> 3.72KB </span>","children":null,"spread":false}],"spread":true},{"title":"Amazon","children":[{"title":"README.md <span style='color:#111;'> 14.03KB </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"GeneralAlgo","children":[{"title":"Graph","children":[{"title":"Dijkstra.md <span style='color:#111;'> 1.69KB </span>","children":null,"spread":false}],"spread":true},{"title":"BinarySearch","children":[{"title":"BinarySearch.java <span style='color:#111;'> 2.11KB </span>","children":null,"spread":false},{"title":"BinarySearch.py <span style='color:#111;'> 1.93KB </span>","children":null,"spread":false}],"spread":true},{"title":"TwoPointers","children":[{"title":"LongestStringWithoutDuplicate.py <span style='color:#111;'> 1.15KB </span>","children":null,"spread":false},{"title":"LongestStringWithoutDuplicate.java <span style='color:#111;'> 1.81KB </span>","children":null,"spread":false},{"title":"Presum.py <span style='color:#111;'> 377B </span>","children":null,"spread":false},{"title":"Presum.java <span style='color:#111;'> 672B </span>","children":null,"spread":false},{"title":"At_Most_K_or_K_distinct_characters.java <span style='color:#111;'> 1.40KB </span>","children":null,"spread":false},{"title":"At_Most_K_or_K_distinct_characters.py <span style='color:#111;'> 820B </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":false}],"spread":true}]