LeetCode Daily Challenge

一个记录 leetcode 每日一题的仓库

汇总（按题目序号排列）

• 1. Two Sum(easy)
• 2. Add Two Numbers(medium)
• 3. Longest Substring Without Repeating Characters(medium)
• 5. Longest Palindromic Substring(medium)
• 6. Zigzag Conversion(medium)
• 7. Reverse Integer(medium)
• 8. String to Integer (atoi)(medium)
• 9. Palindrome Number(easy)
• 11. Container With Most Water(medium)
• 12. Integer to Roman(medium)
• 14. Longest Common Prefix(easy)
• 15. 3Sum(medium)
• 16. 3Sum Closest(medium)
• 17. Letter Combinations of a Phone Number(medium)
• 18. 4Sum(medium)
• 19. Remove Nth Node From End of List(medium)
• 20. Valid Parentheses(easy)
• 21. Merge Two Sorted Lists(easy)
• 22. Generate Parentheses(medium)
• 23. Merge k Sorted Lists(hard)
• 24. Swap Nodes in Pairs(medium)
• 25. Reverse Nodes in k-Group(hard)
• 26. Remove Duplicates from Sorted Array(easy)
• 27. Remove Element(easy)
• 28. Find the Index of the First Occurrence in a String(easy)
• 29. Divide Two Integers(medium)
• 31. Next Permutation(medium)
• 32. Longest Valid Parentheses(hard)
• 33. Search in Rotated Sorted Array(medium)
• 34. Find First and Last Position of Element in Sorted Array(medium)
• 35. Search Insert Position(easy)
• 36. Valid Sudoku(medium)
• 39. Combination Sum(medium)
• 40. Combination Sum II(medium)
• 41. First Missing Positive(hard)
• 42. Trapping Rain Water(hard)
• 43. Multiply Strings(medium)
• 45. Jump Game II(medium)
• 46. Permutations(medium)
• 47. Permutations II(medium)
• 48. Rotate Image(medium)
• 49. Group Anagrams(medium)
• 50. Pow(x, n)(medium)
• 51. N-Queens(hard)
• 52. N-Queens II(hard)
• 53. Maximum Subarray(medium)
• 54. Spiral Matrix(medium)
• 55. Jump Game(medium)
• 56. Merge Intervals(medium)
• 57. Insert Interval(medium)
• 58. Length of Last Word(easy)
• 59. Spiral Matrix II(medium)
• 61. Rotate List(medium)
• 62. Unique Paths(medium)
• 63. Unique Paths II(medium)
• 64. Minimum Path Sum(medium)
• 66. Plus One(easy)
• 67. Add Binary(easy)
• 69. Sqrt(x)(easy)
• 70. Climbing Stairs(easy)
• 71. Simplify Path(medium)
• 72. Edit Distance(medium)
• 73. Set Matrix Zeroes(medium)
• 74. Search a 2D Matrix(medium)
• 75. Sort Colors(medium)
• 76. Minimum Window Substring(hard)
• 77. Combinations(medium)
• 78. Subsets(medium)
• 81. Search in Rotated Sorted Array II(medium)
• 83. Remove Duplicates from Sorted List(easy)
• 84. Largest Rectangle in Histogram(hard)
• 86. Partition List(medium)
• 88. Merge Sorted Array(easy)
• 89. Gray Code(medium)
• 90. Subsets II(medium)
• 91. Decode Ways(medium)
• 92. Reverse Linked List II(medium)
• 93. Restore IP Addresses(medium)
• 98. Validate Binary Search Tree(medium)
• 99. Recover Binary Search Tree(medium)
• 101. Symmetric Tree(easy)
• 102. Binary Tree Level Order Traversal(medium)
• 104. Maximum Depth of Binary Tree(easy)
• 105. Construct Binary Tree from Preorder and Inorder Traversal(medium)
• 108. Convert Sorted Array to Binary Search Tree(easy)
• 114. Flatten Binary Tree to Linked List(medium)
• 117. Populating Next Right Pointers in Each Node II(medium)
• 118. Pascal's Triangle(easy)
• 119. Pascal's Triangle II(easy)
• 120. Triangle(medium)
• 121. Best Time to Buy and Sell Stock(easy)
• 124. Binary Tree Maximum Path Sum(hard)
• 128. Longest Consecutive Sequence(medium)
• 131. Palindrome Partitioning(medium)
• 135. Candy(hard)
• 136. Single Number(easy)
• 138. Copy List with Random Pointer(medium)
• 139. Word Break(medium)
• 141. Linked List Cycle(easy)
• 142. Linked List Cycle II(medium)
• 143. Reorder List(medium)
• 146. LRU Cache(medium)
• 151. Reverse Words in a String(medium)
• 152. Maximum Product Subarray(medium)
• 153. Find Minimum in Rotated Sorted Array(medium)
• 155. Min Stack(medium)
• 160. Intersection of Two Linked Lists(easy)
• 162. Find Peak Element(medium)
• 165. Compare Version Numbers(medium)
• 166. Fraction to Recurring Decimal(medium)
• 167. Two Sum II - Input Array Is Sorted(medium)
• 169. Majority Element(easy)
• 173. Binary Search Tree Iterator(medium)
• 189. Rotate Array(medium)
• 191. Number of 1 Bits(easy)
• 198. House Robber(medium)
• 199. Binary Tree Right Side View(medium)
• 200. Number of Islands(medium)
• 206. Reverse Linked List(easy)
• 207. Course Schedule(medium)
• 208. Implement Trie (Prefix Tree)(medium)
• 215. Kth Largest Element in an Array(medium)
• 216. Combination Sum III(medium)
• 225. Implement Stack using Queues(easy)
• 226. Invert Binary Tree(easy)
• 230. Kth Smallest Element in a BST(medium)
• 234. Palindrome Linked List(easy)
• 236. Lowest Common Ancestor of a Binary Tree(medium)
• 238. Product of Array Except Self(medium)
• 239. Sliding Window Maximum(hard)
• 240. Search a 2D Matrix II(medium)
• 268. Missing Number(easy)
• 279. Perfect Squares(medium)
• 283. Move Zeroes(easy)
• 284. Peeking Iterator(medium)
• 287. Find the Duplicate Number(medium)
• 289. Game of Life(medium)
• 295. Find Median from Data Stream(hard)
• 300. Longest Increasing Subsequence(medium)
• 304. Range Sum Query 2D - Immutable(medium)
• 316. Remove Duplicate Letters(medium)
• 318. Maximum Product of Word Lengths(medium)
• 322. Coin Change(medium)
• 328. Odd Even Linked List(medium)
• 329. Longest Increasing Path in a Matrix(hard)
• 330. Patching Array(hard)
• 334. Increasing Triplet Subsequence(medium)
• 341. Flatten Nested List Iterator(medium)
• 344. Reverse String(easy)
• 345. Reverse Vowels of a String(easy)
• 347. Top K Frequent Elements(medium)
• 354. Russian Doll Envelopes(hard)
• 374. Guess Number Higher or Lower(easy)
• 376. Wiggle Subsequence(medium)
• 392. Is Subsequence(easy)
• 394. Decode String(medium)
• 399. Evaluate Division(medium)
• 406. Queue Reconstruction by Height(medium)
• 407. Trapping Rain Water II(hard)
• 410. Split Array Largest Sum(hard)
• 416. Partition Equal Subset Sum(medium)
• 417. Pacific Atlantic Water Flow(medium)
• 429. N-ary Tree Level Order Traversal(medium)
• 435. Non-overlapping Intervals(medium)
• 437. Path Sum III(medium)
• 438. Find All Anagrams in a String(medium)
• 443. String Compression(medium)
• 450. Delete Node in a BST(medium)
• 452. Minimum Number of Arrows to Burst Balloons(medium)
• 456. 132 Pattern(medium)
• 462. Minimum Moves to Equal Array Elements II(medium)
• 474. Ones and Zeroes(medium)
• 535. Encode and Decode TinyURL(medium)
• 538. Convert BST to Greater Tree(medium)
• 543. Diameter of Binary Tree(easy)
• 547. Number of Provinces(medium)
• 560. Subarray Sum Equals K(medium)
• 581. Shortest Unsorted Continuous Subarray(medium)
• 583. Delete Operation for Two Strings(medium)
• 605. Can Place Flowers(easy)
• 611. Valid Triangle Number(medium)
• 633. Sum of Square Numbers(medium)
• 643. Maximum Average Subarray I(easy)
• 647. Palindromic Substrings(medium)
• 649. Dota2 Senate(medium)
• 665. Non-decreasing Array(medium)
• 669. Trim a Binary Search Tree(medium)
• 680. Valid Palindrome II(easy)
• 682. Baseball Game(easy)
• 700. Search in a Binary Search Tree(easy)
• 703. Kth Largest Element in a Stream(easy)
• 704. Binary Search(easy)
• 705. Design HashSet(easy)
• 706. Design HashMap(easy)
• 714. Best Time to Buy and Sell Stock with Transaction Fee(medium)
• 717. 1-bit and 2-bit Characters(easy)
• 724. Find Pivot Index(easy)
• 726. Number of Atoms(hard)
• 735. Asteroid Collision(medium)
• 739. Daily Temperatures(medium)
• 746. Min Cost Climbing Stairs(easy)
• 763. Partition Labels(medium)
• 769. Max Chunks To Make Sorted(medium)
• 778. Swim in Rising Water(hard)
• 785. Is Graph Bipartite?(medium)
• 790. Domino and Tromino Tiling(medium)
• 812. Largest Triangle Area(easy)
• 820. Short Encoding of Words(medium)
• 826. Most Profit Assigning Work(medium)
• 844. Backspace String Compare(easy)
• 867. Transpose Matrix(easy)
• 872. Leaf-Similar Trees(easy)
• 875. Koko Eating Bananas(medium)
• 897. Increasing Order Search Tree(easy)
• 901. Online Stock Span(medium)
• 905. Sort Array By Parity(easy)
• 912. Sort an Array(medium)
• 923. 3Sum With Multiplicity(medium)
• 933. Number of Recent Calls(easy)
• 966. Vowel Spellchecker(medium)
• 968. Binary Tree Cameras(hard)
• 976. Largest Perimeter Triangle(easy)
• 994. Rotting Oranges(medium)
• 1004. Max Consecutive Ones III(medium)
• 1009. Complement of Base 10 Integer(easy)
• 1015. Smallest Integer Divisible by K(medium)
• 1018. Binary Prefix Divisible By 5(easy)
• 1029. Two City Scheduling(medium)
• 1039. Minimum Score Triangulation of Polygon(medium)
• 1046. Last Stone Weight(easy)
• 1047. Remove All Adjacent Duplicates In String(easy)
• 1048. Longest String Chain(medium)
• 1052. Grumpy Bookstore Owner(medium)
• 1071. Greatest Common Divisor of Strings(easy)
• 1091. Shortest Path in Binary Matrix(medium)
• 1110. Delete Nodes And Return Forest(medium)
• 1137. N-th Tribonacci Number(easy)
• 1143. Longest Common Subsequence(medium)
• 1161. Maximum Level Sum of a Binary Tree(medium)
• 1190. Reverse Substrings Between Each Pair of Parentheses(medium)
• 1192. Critical Connections in a Network(hard)
• 1202. Smallest String With Swaps(medium)
• 1207. Unique Number of Occurrences(easy)
• 1209. Remove All Adjacent Duplicates in String II(medium)
• 1260. Shift 2D Grid(easy)
• 1262. Greatest Sum Divisible by Three(medium)
• 1268. Search Suggestions System(medium)
• 1302. Deepest Leaves Sum(medium)
• 1304. Find N Unique Integers Sum up to Zero(easy)
• 1317. Convert Integer to the Sum of Two No-Zero Integers(easy)
• 1318. Minimum Flips to Make a OR b Equal to c(medium)
• 1332. Remove Palindromic Subsequences(easy)
• 1337. The K Weakest Rows in a Matrix(easy)
• 1342. Number of Steps to Reduce a Number to Zero(easy)
• 1352. Product of the Last K Numbers(medium)
• 1372. Longest ZigZag Path in a Binary Tree(medium)
• 1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree(medium)
• 1380. Lucky Numbers in a Matrix(easy)
• 1396. Design Underground System(medium)
• 1423. Maximum Points You Can Obtain from Cards(medium)
• 1431. Kids With the Greatest Number of Candies(easy)
• 1437. Check If All 1's Are at Least Length K Places Away(easy)
• 1448. Count Good Nodes in Binary Tree(medium)
• 1456. Maximum Number of Vowels in a Substring of Given Length(medium)
• 1461. Check If a String Contains All Binary Codes of Size K(medium)
• 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts(medium)
• 1475. Final Prices With a Special Discount in a Shop(easy)
• 1482. Minimum Number of Days to Make m Bouquets(medium)
• 1488. Avoid Flood in The City(medium)
• 1493. Longest Subarray of 1's After Deleting One Element(medium)
• 1513. Number of Substrings With Only 1s(medium)
• 1518. Water Bottles(easy)
• 1526. Minimum Number of Increments on Subarrays to Form a Target Array(hard)
• 1530. Number of Good Leaf Nodes Pairs(medium)
• 1552. Magnetic Force Between Two Balls(medium)
• 1578. Minimum Time to Make Rope Colorful(medium)
• 1584. Min Cost to Connect All Points(medium)
• 1598. Crawler Log Folder(easy)
• 1625. Lexicographically Smallest String After Applying Operations(medium)
• 1631. Path With Minimum Effort(medium)
• 1636. Sort Array by Increasing Frequency(easy)
• 1641. Count Sorted Vowel Strings(medium)
• 1642. Furthest Building You Can Reach(medium)
• 1653. Minimum Deletions to Make String Balanced(medium)
• 1657. Determine if Two Strings Are Close(medium)
• 1658. Minimum Operations to Reduce X to Zero(medium)
• 1679. Max Number of K-Sum Pairs(medium)
• 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers(medium)
• 1695. Maximum Erasure Value(medium)
• 1710. Maximum Units on a Truck(easy)
• 1716. Calculate Money in Leetcode Bank(easy)
• 1717. Maximum Score From Removing Substrings(medium)
• 1721. Swapping Nodes in a Linked List(medium)
• 1732. Find the Highest Altitude(easy)
• 1733. Minimum Number of People to Teach(medium)
• 1768. Merge Strings Alternately(easy)
• 1912. Design Movie Rental System(hard)
• 1926. Nearest Exit from Entrance in Maze(medium)
• 1930. Unique Length-3 Palindromic Subsequences(medium)
• 1935. Maximum Number of Words You Can Type(easy)
• 2011. Final Value of Variable After Performing Operations(easy)
• 2043. Simple Bank System(medium)
• 2048. Next Greater Numerically Balanced Number(medium)
• 2095. Delete the Middle Node of a Linked List(medium)
• 2096. Step-By-Step Directions From a Binary Tree Node to Another(medium)
• 2125. Number of Laser Beams in a Bank(medium)
• 2130. Maximum Twin Sum of a Linked List(medium)
• 2154. Keep Multiplying Found Values by Two(easy)
• 2169. Count Operations to Obtain Zero(easy)
• 2191. Sort the Jumbled Numbers(medium)
• 2196. Create Binary Tree From Descriptions(medium)
• 2197. Replace Non-Coprime Numbers in Array(hard)
• 2215. Find the Difference of Two Arrays(easy)
• 2221. Find Triangular Sum of an Array(medium)
• 2257. Count Unguarded Cells in the Grid(medium)
• 2273. Find Resultant Array After Removing Anagrams(easy)
• 2300. Successful Pairs of Spells and Potions(medium)
• 2327. Number of People Aware of a Secret(medium)
• 2336. Smallest Number in Infinite Set(medium)
• 2352. Equal Row and Column Pairs(medium)
• 2353. Design a Food Rating System(medium)
• 2390. Removing Stars From a String(medium)
• 2415. Reverse Odd Levels of Binary Tree(medium)
• 2418. Sort the People(easy)
• 2462. Total Cost to Hire K Workers(medium)
• 2471. Minimum Number of Operations to Sort a Binary Tree by Level(medium)
• 2536. Increment Submatrices by One(medium)
• 2542. Maximum Subsequence Score(medium)
• 2598. Smallest Missing Non-negative Integer After Operations(medium)
• 2636. Promise Pool(medium)
• 2654. Minimum Number of Operations to Make All Array Elements Equal to 1(medium)
• 2749. Minimum Operations to Make the Integer Zero(medium)
• 2751. Robot Collisions(hard)
• 2785. Sort Vowels in a String(medium)
• 2872. Maximum Number of K-Divisible Components(hard)
• 3005. Count Elements With Maximum Frequency(easy)
• 3025. Find the Number of Ways to Place People I(medium)
• 3027. Find the Number of Ways to Place People II(hard)
• 3100. Water Bottles II(medium)
• 3147. Taking Maximum Energy From the Mystic Dungeon(medium)
• 3186. Maximum Total Damage With Spell Casting(medium)
• 3190. Find Minimum Operations to Make All Elements Divisible by Three(easy)
• 3217. Delete Nodes From Linked List Present in Array(medium)
• 3227. Vowels Game in a String(medium)
• 3228. Maximum Number of Operations to Move Ones to the End(medium)
• 3264. Final Array State After K Multiplication Operations I(easy)
• 3289. The Two Sneaky Numbers of Digitville(easy)
• 3318. Find X-Sum of All K-Long Subarrays I(easy)
• 3346. Maximum Frequency of an Element After Performing Operations I(medium)
• 3347. Maximum Frequency of an Element After Performing Operations II(hard)
• 3349. Adjacent Increasing Subarrays Detection I(easy)
• 3350. Adjacent Increasing Subarrays Detection II(medium)
• 3354. Make Array Elements Equal to Zero(easy)
• 3370. Smallest Number With All Set Bits(easy)
• 3381. Maximum Subarray Sum With Length Divisible by K(medium)
• 3397. Maximum Number of Distinct Elements After Operations(medium)
• 3408. Design Task Manager(medium)
• 3461. Check If Digits Are Equal in String After Operations I(easy)
• 3484. Design Spreadsheet(medium)
• 3495. Minimum Operations to Make Array Elements Zero(hard)
• 3508. Implement Router(medium)
• 3512. Minimum Operations to Make Array Sum Divisible by K(easy)
• 3516. Find Closest Person(easy)
• 3541. Find Most Frequent Vowel and Consonant(easy)
• 3542. Minimum Operations to Convert All Elements to Zero(medium)
• 3607. Power Grid Maintenance(medium)