Page Index - TengnanYao/daily_leetcode GitHub Wiki

633 page(s) in this GitHub Wiki:

• Home
• 1008. Construct Binary Search Tree from Preorder Traversal (Medium)
• Please reload this page
• 101. Symmetric Tree (Easy)
• Please reload this page
• 1011. Capacity To Ship Packages Within D Days (Medium)
• Please reload this page
• 1019. Next Greater Node In Linked List (Medium)
• Please reload this page
• 1028. Recover a Tree From Preorder Traversal (Hard)
• Please reload this page
• 1038. Binary Search Tree to Greater Sum Tree (Medium)
• Please reload this page
• 1039. Minimum Score Triangulation of Polygon (Medium)
• Please reload this page
• 1041. Robot Bounded In Circle (Medium)
• Please reload this page
• 1048. Longest String Chain (Medium)
• Please reload this page
• 105. Construct Binary Tree from Preorder and Inorder Traversal (Medium)
• Please reload this page
• 1052. Grumpy Bookstore Owner (Medium)
• Please reload this page
• 1056. Confusing Number (Easy)
• Please reload this page
• 106. Construct Binary Tree from Inorder and Postorder Traversal (Medium)
• Please reload this page
• 11. Container With Most Water (Medium)
• Please reload this page
• 1109. Corporate Flight Bookings (Medium)
• Please reload this page
• 1110. Delete Nodes And Return Forest (Medium)
• Please reload this page
• 112. Path Sum (Easy)
• Please reload this page
• 1124. Longest Well Performing Interval (Medium)
• Please reload this page
• 113. Path Sum II (Medium)
• Please reload this page
• 1130. Minimum Cost Tree From Leaf Values (Medium)
• Please reload this page
• 1143. Longest Common Subsequence (Medium)
• Please reload this page
• 1146. Snapshot Array (Medium)
• Please reload this page
• 115. Distinct Subsequences (Hard)
• Please reload this page
• 116. Populating Next Right Pointers in Each Node (Medium)
• Please reload this page
• 1176. Diet Plan Performance (Easy)
• Please reload this page
• 12. Integer to Roman (Medium)
• Please reload this page
• 1209. Remove All Adjacent Duplicates in String II (Medium)
• Please reload this page
• 1229. Meeting Scheduler (Medium)
• Please reload this page
• 1234. Replace the Substring for Balanced String (Medium)
• Please reload this page
• 1235. Maximum Profit in Job Scheduling (Hard)
• Please reload this page
• 1239. Maximum Length of a Concatenated String with Unique Characters (Medium)
• Please reload this page
• 1249. Minimum Remove to Make Valid Parentheses (Medium)
• Please reload this page
• 1254. Number of Closed Islands (Medium)
• Please reload this page
• 126. Word Ladder II (Hard)
• Please reload this page
• 1262. Greatest Sum Divisible by Three (Medium)
• Please reload this page
• 1265. Print Immutable Linked List in Reverse (Medium)
• Please reload this page
• 127. Word Ladder (Hard)
• Please reload this page
• 1277. Count Square Submatrices with All Ones (Medium)
• Please reload this page
• 128. Longest Consecutive Sequence (Medium)
• Please reload this page
• 1282. Group the People Given the Group Size They Belong To (Medium)
• Please reload this page
• 1283. Find the Smallest Divisor Given a Threshold (Medium)
• Please reload this page
• 1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix (Hard)
• Please reload this page
• 1288. Remove Covered Intervals (Medium)
• Please reload this page
• 129. Sum Root to Leaf Numbers (Medium)
• Please reload this page
• 1300. Sum of Mutated Array Closest to Target (Medium)
• Please reload this page
• 1302. Deepest Leaves Sum (Medium)
• Please reload this page
• 1306. Jump Game III (Medium)
• Please reload this page
• 1328. Break a Palindrome (Medium)
• Please reload this page
• 1339. Maximum Product of Splitted Binary Tree (Medium)
• Please reload this page
• 134. Gas Station (Medium)
• Please reload this page
• 1340. Jump Game V (Hard)
• Please reload this page
• 1345. Jump Game IV (Hard)
• Please reload this page
• 1353. Maximum Number of Events That Can Be Attended (Medium)
• Please reload this page
• 1371. Find the Longest Substring Containing Vowels in Even Counts (Medium)
• Please reload this page
• 1372. Longest ZigZag Path in a Binary Tree (Medium)
• Please reload this page
• 1381. Design a Stack With Increment Operation (Medium)
• Please reload this page
• 1383. Maximum Performance of a Team (Hard)
• Please reload this page
• 1395. Count Number of Teams (Medium)
• Please reload this page
• 140. Word Break II (Hard)
• Please reload this page
• 1402. Reducing Dishes (Hard)
• Please reload this page
• 1419. Minimum Number of Frogs Croaking (Medium)
• Please reload this page
• 143. Reorder List (Medium)
• Please reload this page
• 1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows (Hard)
• Please reload this page
• 1452. People Whose List of Favorite Companies Is Not a Subset of Another List (Medium)
• Please reload this page
• 146. LRU Cache (Medium)
• Please reload this page
• 1481. Least Number of Unique Integers after K Removals (Medium)
• Please reload this page
• 1482. Minimum Number of Days to Make m Bouquets (Medium)
• Please reload this page
• 1490. Clone N ary Tree (Medium)
• Please reload this page
• 1498. Number of Subsequences That Satisfy the Given Sum Condition (Medium)
• Please reload this page
• 15. 3Sum (Medium)
• Please reload this page
• 150. Evaluate Reverse Polish Notation (Medium)
• Please reload this page
• 1509. Minimum Difference Between Largest and Smallest Value in Three Moves (Medium)
• Please reload this page
• 1520. Maximum Number of Non Overlapping Substrings (Hard)
• Please reload this page
• 1525. Number of Good Ways to Split a String (Medium)
• Please reload this page
• 1526. Minimum Number of Increments on Subarrays to Form a Target Array (Hard)
• Please reload this page
• 1537. Get the Maximum Score (Hard)
• Please reload this page
• 1541. Minimum Insertions to Balance a Parentheses String (Medium)
• Please reload this page
• 1542. Find Longest Awesome Substring (Hard)
• Please reload this page
• 155. Min Stack (Easy)
• Please reload this page
• 1552. Magnetic Force Between Two Balls (Medium)
• Please reload this page
• 156. Binary Tree Upside Down (Medium)
• Please reload this page
• 1567. Maximum Length of Subarray With Positive Product (Medium)
• Please reload this page
• 1569. Number of Ways to Reorder Array to Get Same BST (Hard)
• Please reload this page
• 1570. Dot Product of Two Sparse Vectors (Medium)
• Please reload this page
• 1574. Shortest Subarray to be Removed to Make Array Sorted (Medium)
• Please reload this page
• 1577. Number of Ways Where Square of Number Is Equal to Product of Two Numbers (Medium)
• Please reload this page
• 1590. Make Sum Divisible by P (Medium)
• Please reload this page
• 1593. Split a String Into the Max Number of Unique Substrings (Medium)
• Please reload this page
• 16. 3Sum Closest (Medium)
• Please reload this page
• 1608. Special Array With X Elements Greater Than or Equal X (Easy)
• Please reload this page
• 162. Find Peak Element (Medium)
• Please reload this page
• 164. Maximum Gap (Hard)
• Please reload this page
• 1641. Count Sorted Vowel Strings (Medium)
• Please reload this page
• 1648. Sell Diminishing Valued Colored Balls (Medium)
• Please reload this page
• 1658. Minimum Operations to Reduce X to Zero (Medium)
• Please reload this page
• 1665. Minimum Initial Energy to Finish Tasks (Hard)
• Please reload this page
• 1673. Find the Most Competitive Subsequence (Medium)
• Please reload this page
• 1676. Lowest Common Ancestor of a Binary Tree IV (Medium)
• Please reload this page
• 1682. Longest Palindromic Subsequence II (Medium)
• Please reload this page
• 1690. Stone Game VII (Medium)
• Please reload this page
• 1696. Jump Game VI (Medium)
• Please reload this page
• 17. Letter Combinations of a Phone Number (Medium)
• Please reload this page
• 1718. Construct the Lexicographically Largest Valid Sequence (Medium)
• Please reload this page
• 173. Binary Search Tree Iterator (Medium)
• Please reload this page
• 1746. Maximum Subarray Sum After One Operation (Medium)
• Please reload this page
• 1755. Closest Subsequence Sum (Hard)
• Please reload this page
• 1769. Minimum Number of Operations to Move All Balls to Each Box (Medium)
• Please reload this page
• 1774. Closest Dessert Cost (Medium)
• Please reload this page
• 1775. Equal Sum Arrays With Minimum Number of Operations (Medium)
• Please reload this page
• 1778. Shortest Path in a Hidden Grid (Medium)
• Please reload this page
• 179. Largest Number (Medium)
• Please reload this page
• 1790. Check if One String Swap Can Make Strings Equal (Easy)
• Please reload this page
• 1793. Maximum Score of a Good Subarray (Hard)
• Please reload this page
• 18. 4Sum (Medium)
• Please reload this page
• 1802. Maximum Value at a Given Index in a Bounded Array (Medium)
• Please reload this page
• 1824. Minimum Sideway Jumps (Medium)
• Please reload this page
• 1825. Finding MK Average (Hard)
• Please reload this page
• 1827. Minimum Operations to Make the Array Increasing
• Please reload this page
• 1834. Single Threaded CPU (Medium)
• Please reload this page
• 1839. Longest Substring Of All Vowels in Order (Medium)
• Please reload this page
• 1856. Maximum Subarray Min Product (Medium)
• Please reload this page
• 1868. Product of Two Run Length Encoded Arrays (Medium)
• Please reload this page
• 1870. Minimum Speed to Arrive on Time (Medium)
• Please reload this page
• 1878. Get Biggest Three Rhombus Sums in a Grid (Medium)
• Please reload this page
• 1895. Largest Magic Square (Medium)
• Please reload this page
• 1898. Maximum Number of Removable Characters (Medium)
• Please reload this page
• 1906. Minimum Absolute Difference Queries (Medium)
• Please reload this page
• 191. Number of 1 Bits (Easy)
• Please reload this page
• 1947. Maximum Compatibility Score Sum (Medium)
• Please reload this page
• 1958. Check if Move is Legal (Medium)
• Please reload this page
• 1966. Binary Searchable Numbers in an Unsorted Array (Medium)
• Please reload this page
• 1971. Find if Path Exists in Graph (Easy)
• Please reload this page
• 198. House Robber (Medium)
• Please reload this page
• 1981. Minimize the Difference Between Target and Chosen Elements (Medium)
• Please reload this page
• 200. Number of Islands (Medium)
• Please reload this page
• 2002. Maximum Product of the Length of Two Palindromic Subsequences (Medium)
• Please reload this page
• 2013. Detect Squares (Medium)
• Please reload this page
• 2017. Grid Game (Medium)
• Please reload this page
• 2024. Maximize the Confusion of an Exam (Medium)
• Please reload this page
• 2027. Minimum Moves to Convert String (Easy)
• Please reload this page
• 2028. Find Missing Observations (Medium)
• Please reload this page
• 2032. Two Out of Three (Easy)
• Please reload this page
• 2033. Minimum Operations to Make a Uni Value Grid (Medium)
• Please reload this page
• 2034. Stock Price Fluctuation (Medium)
• Please reload this page
• 2038. Remove Colored Pieces if Both Neighbors are the Same Color (Medium)
• Please reload this page
• 2039. The Time When the Network Becomes Idle (Medium)
• Please reload this page
• 2054. Two Best Non Overlapping Events (Medium)
• Please reload this page
• 2055. Plates Between Candles (Medium)
• Please reload this page
• 2062. Count Vowel Substrings of a String (Easy)
• Please reload this page
• 2063. Vowels of All Substrings (Medium)
• Please reload this page
• 2069. Walking Robot Simulation II (Medium)
• Please reload this page
• 2070. Most Beautiful Item for Each Query (Medium)
• Please reload this page
• 2073. Time Needed to Buy Tickets (Easy)
• Please reload this page
• 2074. Reverse Nodes in Even Length Groups (Medium)
• Please reload this page
• 2075. Decode the Slanted Ciphertext (Medium)
• Please reload this page
• 2078. Two Furthest Houses With Different Colors (Easy)
• Please reload this page
• 2079. Watering Plants (Medium)
• Please reload this page
• 208. Implement Trie (Prefix Tree) (Medium)
• Please reload this page
• 2080. Range Frequency Queries (Medium)
• Please reload this page
• 2081. Sum of k Mirror Numbers (Hard)
• Please reload this page
• 209. Minimum Size Subarray Sum (Medium)
• Please reload this page
• 211. Design Add and Search Words Data Structure (Medium)
• Please reload this page
• 2111. Minimum Operations to Make the Array K Increasing (Hard)
• Please reload this page
• 2120. Execution of All Suffix Instructions Staying in a Grid (Medium)
• Please reload this page
• 2121. Intervals Between Identical Elements (Medium)
• Please reload this page
• 213. House Robber II (Medium)
• Please reload this page
• 2140. Solving Questions With Brainpower (Medium)
• Please reload this page
• 2145. Count the Hidden Sequences (Medium)
• Please reload this page
• 2146. K Highest Ranked Items Within a Price Range (Medium)
• Please reload this page
• 2147. Number of Ways to Divide a Long Corridor (Hard)
• Please reload this page
• 2148. Count Elements With Strictly Smaller and Greater Elements (Easy)
• Please reload this page
• 2149. Rearrange Array Elements by Sign (Medium)
• Please reload this page
• 2150. Find All Lonely Numbers in the Array (Medium)
• Please reload this page
• 2151. Maximum Good People Based on Statements (Hard)
• Please reload this page
• 218. The Skyline Problem (Hard)
• Please reload this page
• 221. Maximal Square (Medium)
• Please reload this page
• 222. Count Complete Tree Nodes (Medium)
• Please reload this page
• 23. Merge k Sorted Lists (Hard)
• Please reload this page
• 231. Power of Two (Easy)
• Please reload this page
• 235. Lowest Common Ancestor of a Binary Search Tree (Easy)
• Please reload this page
• 236. Lowest Common Ancestor of a Binary Tree (Medium)
• Please reload this page
• 238. Product of Array Except Self (Medium)
• Please reload this page
• 239. Sliding Window Maximum (Hard)
• Please reload this page
• 241. Different Ways to Add Parentheses (Medium)
• Please reload this page
• 265. Paint House II (Hard)
• Please reload this page
• 268. Missing Number (Easy)
• Please reload this page
• 272. Closest Binary Search Tree Value II (Hard)
• Please reload this page
• 275. H Index II (Medium)
• Please reload this page
• 280. Wiggle Sort (Medium)
• Please reload this page
• 282. Expression Add Operators (Hard)
• Please reload this page
• 285. Inorder Successor in BST (Medium)
• Please reload this page
• 296. Best Meeting Point (Hard)
• Please reload this page
• 298. Binary Tree Longest Consecutive Sequence (Medium)
• Please reload this page
• 303. Range Sum Query Immutable (Easy)
• Please reload this page
• 307. Range Sum Query Mutable (Medium)
• Please reload this page
• 310. Minimum Height Trees (Medium)
• Please reload this page
• 315. Count of Smaller Numbers After Self (Hard)
• Please reload this page
• 317. Shortest Distance from All Buildings (Hard)
• Please reload this page
• 32. Longest Valid Parentheses (Hard)
• Please reload this page
• 325. Maximum Size Subarray Sum Equals k (Medium)
• Please reload this page
• 329. Longest Increasing Path in a Matrix (Hard)
• Please reload this page
• 33. Search in Rotated Sorted Array (Medium)
• Please reload this page
• 331. Verify Preorder Serialization of a Binary Tree (Medium)
• Please reload this page
• 333. Largest BST Subtree (Medium)
• Please reload this page
• 336. Palindrome Pairs (Hard)
• Please reload this page
• 338. Counting Bits (Easy)
• Please reload this page
• 340. Longest Substring with At Most K Distinct Characters (Medium)
• Please reload this page
• 347. Top K Frequent Elements (Medium)
• Please reload this page
• 36. Valid Sudoku (Medium)
• Please reload this page
• 366. Find Leaves of Binary Tree (Medium)
• Please reload this page
• 368. Largest Divisible Subset (Medium)
• Please reload this page
• 370. Range Addition (Medium)
• Please reload this page
• 374. Guess Number Higher or Lower (Easy)
• Please reload this page
• 380. Insert Delete GetRandom O(1) (Medium)
• Please reload this page
• 381. Insert Delete GetRandom O(1) Duplicates allowed (Medium)
• Please reload this page
• 382. Linked List Random Node (Medium)
• Please reload this page
• 39. Combination Sum (Medium)
• Please reload this page
• 391. Perfect Rectangle (Hard)
• Please reload this page
• 394. Decode String (Medium)
• Please reload this page
• 398. Random Pick Index (Medium)
• Please reload this page
• 399. Evaluate Division (Medium)
• Please reload this page
• 4. Median of Two Sorted Arrays (Hard)
• Please reload this page
• 410. Split Array Largest Sum (Hard)
• Please reload this page
• 416. Partition Equal Subset Sum (Medium)
• Please reload this page
• 421. Maximum XOR of Two Numbers in an Array (Medium)
• Please reload this page
• 426. Convert Binary Search Tree to Sorted Doubly Linked List (Medium)
• Please reload this page
• 432. All O`one Data Structure (Hard)
• Please reload this page
• 435. Non overlapping Intervals (Medium)
• Please reload this page
• 437. Path Sum III (Medium)
• Please reload this page
• 442. Find All Duplicates in an Array (Medium)
• Please reload this page
• 45. Jump Game II (Medium)
• Please reload this page
• 450. Delete Node in a BST (Medium)
• Please reload this page
• 451. Sort Characters By Frequency (Medium)
• Please reload this page
• 452. Minimum Number of Arrows to Burst Balloons (Medium)
• Please reload this page
• 46. Permutations (Medium)
• Please reload this page
• 460. LFU Cache (Hard)
• Please reload this page
• 47. Permutations II (Medium)
• Please reload this page
• 470. Implement Rand10() Using Rand7() (Medium)
• Please reload this page
• 48. Rotate Image (Medium)
• Please reload this page
• 49. Group Anagrams (Medium)
• Please reload this page
• 491. Increasing Subsequences (Medium)
• Please reload this page
• 496. Next Greater Element I (Easy)
• Please reload this page
• 497. Random Point in Non overlapping Rectangles (Medium)
• Please reload this page
• 50. Pow(x, n) (Medium)
• Please reload this page
• 502. IPO (Hard)
• Please reload this page
• 503. Next Greater Element II (Medium)
• Please reload this page
• 51. N Queens (Hard)
• Please reload this page
• 526. Beautiful Arrangement (Medium)
• Please reload this page
• 528. Random Pick with Weight (Medium)
• Please reload this page
• 53. Maximum Subarray (Easy)
• Please reload this page
• 540. Single Element in a Sorted Array (Medium)
• Please reload this page
• 542. 01 Matrix (Medium)
• Please reload this page
• 543. Diameter of Binary Tree (Easy)
• Please reload this page
• 545. Boundary of Binary Tree (Medium)
• Please reload this page
• 549. Binary Tree Longest Consecutive Sequence II (Medium)
• Please reload this page
• 55. Jump Game (Medium)
• Please reload this page
• 56. Merge Intervals (Medium)
• Please reload this page
• 560. Subarray Sum Equals K (Medium)
• Please reload this page
• 567. Permutation in String (Medium)
• Please reload this page
• 57. Insert Interval (Medium)
• Please reload this page
• 572. Subtree of Another Tree (Easy)
• Please reload this page
• 581. Shortest Unsorted Continuous Subarray
• Please reload this page
• 630. Course Schedule III (Hard)
• Please reload this page
• 65. Valid Number (Hard)
• Please reload this page
• 654. Maximum Binary Tree (Medium)
• Please reload this page
• 655. Print Binary Tree (Medium)
• Please reload this page
• 658. Find K Closest Elements (Medium)
• Please reload this page
• 662. Maximum Width of Binary Tree (Medium)
• Please reload this page
• 673. Number of Longest Increasing Subsequence (Medium)
• Please reload this page
• 678. Valid Parenthesis String (Medium)
• Please reload this page
• 687. Longest Univalue Path (Medium)
• Please reload this page
• 690. Employee Importance (Easy)
• Please reload this page
• 694. Number of Distinct Islands (Medium)
• Please reload this page
• 695. Max Area of Island (Medium)
• Please reload this page
• 698. Partition to K Equal Sum Subsets (Medium)
• Please reload this page
• 718. Maximum Length of Repeated Subarray (Medium)
• Please reload this page
• 725. Split Linked List in Parts (Medium)
• Please reload this page
• 729. My Calendar I (Medium)
• Please reload this page
• 735. Asteroid Collision (Medium)
• Please reload this page
• 74. Search a 2D Matrix (Medium)
• Please reload this page
• 740. Delete and Earn (Medium)
• Please reload this page
• 745. Prefix and Suffix Search (Hard)
• Please reload this page
• 76. Minimum Window Substring (Hard)
• Please reload this page
• 763. Partition Labels (Medium)
• Please reload this page
• 767. Reorganize String (Medium)
• Please reload this page
• 77. Combinations (Medium)
• Please reload this page
• 782. Transform to Chessboard (Hard)
• Please reload this page
• 784. Letter Case Permutation (Medium)
• Please reload this page
• 79. Word Search (Medium)
• Please reload this page
• 815. Bus Routes (Hard)
• Please reload this page
• 827. Making A Large Island (Hard)
• Please reload this page
• 829. Consecutive Numbers Sum (Hard)
• Please reload this page
• 833. Find And Replace in String (Medium)
• Please reload this page
• 843. Guess the Word (Hard)
• Please reload this page
• 850. Rectangle Area II (Hard)
• Please reload this page
• 856. Score of Parentheses (Medium)
• Please reload this page
• 863. All Nodes Distance K in Binary Tree (Medium)
• Please reload this page
• 871. Minimum Number of Refueling Stops (Hard)
• Please reload this page
• 875. Koko Eating Bananas (Medium)
• Please reload this page
• 889. Construct Binary Tree from Preorder and Postorder Traversal (Medium)
• Please reload this page
• 89. Gray Code (Medium)
• Please reload this page
• 90. Subsets II (Medium)
• Please reload this page
• 927. Three Equal Parts (Hard)
• Please reload this page
• 929. Unique Email Addresses (Easy)
• Please reload this page
• 930. Binary Subarrays With Sum (Medium)
• Please reload this page
• 934. Shortest Bridge (Medium)
• Please reload this page
• 959. Regions Cut By Slashes (Medium)
• Please reload this page
• 962. Maximum Width Ramp (Medium)
• Please reload this page
• 971. Flip Binary Tree To Match Preorder Traversal (Medium)
• Please reload this page
• 975. Odd Even Jump (Hard)
• Please reload this page
• 980. Unique Paths III (Hard)
• Please reload this page
• 986. Interval List Intersections (Medium)
• Please reload this page
• 99. Recover Binary Search Tree (Hard)
• Please reload this page
• 993. Cousins in Binary Tree (Easy)
• Please reload this page
• 994. Rotting Oranges (Medium)
• Please reload this page
• 996. Number of Squareful Arrays (Hard)
• Please reload this page