LeetCode Is Precious deposits

A group of Bupt coders, Coding every day!！

• The overall plan is as follows：

  • One day a question
  • In units of weeks, where the ratio of easy, medium, hard is 3: 2: 2
  • 8 o'clock every morning to publish the question, at 11 pm given the best submission today

• Title type order：

  • The first stage：array、string、tree、linkedlist、math
  • The second stage：HashTable、SortTopological Sort、Graph、Trie、MiniMax、Stack、Queue
  • The third stage：Binary Search、Two Pointers、Heap、Binary Search Tree、Binary Indexed Tree、Recursion、Greedy、Union Find、Map
  • The fourth stage：Depth-first Search、Breadth-first Search、Design、Backtracking、Dynamic Programming、Divide and Conquer、Segment Tree、Reservior sampling、Geometry、Memoization、Bit Manipulation

First Week (array)

• 643. Maximum Average Subarray I (Easy)
• 611. Valid Triangle Number I (Medium)
• 605. Can Place Flowers (Easy)
• 565. Array Nesting (Medium)
• 41. First Missing Positive (Hard)
• 57. Insert Interval (Hard)

Second Week (array)

• 661. Image Smoother(Easy)
• 495. Teemo Attacking(Medium)
• 560. Subarray Sum Equals K(Medium)
• 268. Missing Number(Easy)
• 442. Find All Duplicates in an Array(Medium)
• 537. Complex Number Multiplication (Medium)
• 657. Judge Route Circle (Easy)

Third Week (string)

• 647. Palindromic Substrings (Medium)
• 632. Smallest Range (Hard)
• 632. Construct String from Binary Tree (Easy)
• 551. Student Attendance Record I (Easy)
• 583. Delete Operation for Two Strings(Medium)
• 115. Distinct Subsequences(Hard)
• 541. Reverse String II(Easy)

Forth Week (string)

• 557. Reverse Words in a String III(Easy)
• 609. Find Duplicate File in System(Medium)
• 564. Find the Closest Palindrome(Hard)
• 28. Implement strStr()(Easy)
• 22. Generate Parentheses(Medium)
• 345. Reverse Vowels of a String(Easy)
• 97. Interleaving String(Hard)

Fifth Week (tree)

• 38. Count and Say(Easy)
• 662. Maximum Width of Binary Tree (Medium)
• 654. Maximum Binary Tree (Medium)
• 111. Minimum Depth of Binary Tree(easy)
• 99. Recover Binary Search Tree (Hard)
• 297. Serialize and Deserialize Binary Tree (Hard)
• 669. Trim a Binary Search Tree(Easy)

Sixth Week (tree)

• 515. Find Largest Value in Each Tree Row(Medium)
• 145. Binary Tree Postorder Traversal(Hard)
• 501. Find Mode in Binary Search Tree(Easy)
• 513. Find Bottom Left Tree Value(Medium)
• 124. Binary Tree Maximum Path Sum(Hard)
• 周六？？
• 112. Path Sum(Easy)

Seventh Week (hashtable)

• 周一？？
• 525. Contiguous Array(Medium)
• 76. Minimum Window Substring(Hard)
• 645. Set Mismatch(Easy)
• 451. Sort Characters By Frequency(Medium)

Eighth Week(hashtale)

• 599. Minimum Index Sum of Two Lists(Easy)
• 3. Longest Substring Without Repeating Characters(Medium)
• 18. 4Sum(Medium)
• 15. 3Sum(Medium)