💻
leetcode
CtrlK
  • README
  • leetcode
    • 901-1000
      • 981. Time Based Key-Value Store
      • 931. Minimum Falling Path Sum
      • 946. Validate Stack Sequences
      • 983. Minimum Cost For Tickets
      • 969. Pancake Sorting
      • 980. Unique Paths III
    • 101-200
      • 188. Best Time to Buy and Sell Stock IV
      • 169. Majority Element
      • 128. Longest Consecutive Sequence
      • 142. Linked List Cycle II
      • 154. Find Minimum in Rotated Sorted Array II
      • 160. Intersection of Two Linked Lists
      • 146. LRU Cache
      • 153. Find Minimum in Rotated Sorted Array
      • 141. Linked List Cycle
      • 144. Binary Tree Preorder Traversal
      • 113. Path Sum II
      • 105. Construct Binary Tree from Preorder and Inorder Traversal
      • 133. Clone Graph
      • 102. Binary Tree Level Order Traversal
      • 101. Symmetric Tree
      • 106. Construct Binary Tree from Inorder and Postorder Traversal
      • 122. Best Time to Buy and Sell Stock II
      • 145. Binary Tree Postorder Traversal
      • 165. Compare Version Numbers
      • 110. Balanced Binary Tree
      • 162. Find Peak Element
      • 111. Minimum Depth of Binary Tree
      • 187. Repeated DNA Sequences
      • 143. Reorder List
      • 132. Palindrome Partitioning II
      • 131. Palindrome Partitioning
      • 191. Number of 1 Bits
      • 123. Best Time to Buy and Sell Stock III
      • 103. Binary Tree Zigzag Level Order Traversal
      • 138. Copy List with Random Pointer
      • 155. Min Stack
      • 174. Dungeon Game
      • 104. Maximum Depth of Binary Tree
      • 124. Binary Tree Maximum Path Sum
    • 1001-2000
      • 1227. Airplane Seat Assignment Probability
      • 1095. Find in Mountain Array
      • 1485. Clone Binary Tree With Random Pointer
      • 1603. Design Parking System
      • 1277. Count Square Submatrices with All Ones
      • 1619. Mean of Array After Removing Some Elements
      • 1453. Maximum Number of Darts Inside of a Circular Dartboard
      • 1504. Count Submatrices With All Ones
      • 1610. Maximum Number of Visible Points
      • 1306. Jump Game III
      • 1155. Number of Dice Rolls With Target Sum
      • 1563. Stone Game V
      • 1604. Alert Using Same Key-Card Three or More Times in a One Hour Period
      • 1392. Longest Happy Prefix
      • 1606. Find Servers That Handled Most Number of Requests
      • 1605. Find Valid Matrix Given Row and Column Sums
      • 1529. Bulb Switcher IV
      • 1621. Number of Sets of K Non-Overlapping Line Segments
      • 1406. Stone Game III
      • 1510. Stone Game IV
      • 1043. Partition Array for Maximum Sum
      • 1206. Design Skiplist
      • 1620. Coordinate With Maximum Network Quality
      • 1140. Stone Game II
    • 301-400
      • 303. Range Sum Query - Immutable
      • 309. Best Time to Buy and Sell Stock with Cooldown
      • 312. Burst Balloons
      • 357. Count Numbers with Unique Digits
      • 338. Counting Bits
      • 315. Count of Smaller Numbers After Self
      • 337. House Robber III
      • 328. Odd Even Linked List
      • 371. Sum of Two Integers
      • 363. Max Sum of Rectangle No Larger Than K
      • 377. Combination Sum IV
      • 343. Integer Break
      • 324. Wiggle Sort II
    • some summay
      • 01 knapsack
      • 堆排序
      • 约瑟夫环
      • Skip list
      • Array经典题
      • N sum
      • Quick Select
      • 股票买卖
      • Tree Postorder traversal
      • union find
      • LRU
      • intervals
      • Tree Preorder traversal
      • 94. Binary Tree Inorder Traversal
    • 1-100
      • 36. Valid Sudoku
      • 4. Median of Two Sorted Arrays
      • 13. Roman to Integer
      • 18. 4Sum
      • 29. Divide Two Integers
      • 94. Binary Tree Inorder Traversal
      • 45. Jump Game II
      • 15. 3Sum
      • 8. String to Integer (atoi)
      • 61. Rotate List
      • 12. Integer to Roman
      • 62. Unique Paths
      • 35. Search Insert Position
      • 48. Rotate Image
      • 87. Scramble String
      • 56. Merge Intervals
      • 63. Unique Paths II
      • 19. Remove Nth Node From End of List
      • 70. Climbing Stairs
      • 55. Jump Game
      • 44. Wildcard Matching
      • 53. Maximum Subarray
      • 31. Next Permutation
      • 98. Validate Binary Search Tree
      • 71. Simplify Path
      • 10. Regular Expression Matching
      • 16. 3Sum Closest
      • 32. Longest Valid Parentheses
      • 60. Permutation Sequence
      • 74. Search a 2D Matrix
      • 59. Spiral Matrix II
      • 6. ZigZag Conversion
      • 99. Recover Binary Search Tree
      • 9. Palindrome Number
      • 92. Reverse Linked List II
      • 25. Reverse Nodes in k-Group
      • 91. Decode Ways
      • 23. Merge k Sorted Lists
      • 50. Pow(x, n)
      • 33. Search in Rotated Sorted Array
      • 17. Letter Combinations of a Phone Number
      • 97. Interleaving String
      • 22. Generate Parentheses
      • 52. N-Queens II
      • 46. Permutations
      • 49. Group Anagrams
      • 21. Merge Two Sorted Lists
      • 37. Sudoku Solver
      • 24. Swap Nodes in Pairs
      • 20. Valid Parentheses
      • 95. Unique Binary Search Trees II
      • 3. Longest Substring Without Repeating Characters
      • 81. Search in Rotated Sorted Array II
      • 30. Substring with Concatenation of All Words
      • 69. Sqrt(x)
      • 96. Unique Binary Search Trees
      • 11. Container With Most Water
      • 5. Longest Palindromic Substring
      • 75. Sort Colors
      • 39. Combination Sum
      • 54. Spiral Matrix
      • 43. Multiply Strings
      • 27. Remove Element
      • 72. Edit Distance
      • 28. Implement strStr()
      • 47. Permutations II
      • 51. N-Queens
      • 34. Find First and Last Position of Element in Sorted Array
      • 100. Same Tree
      • 1. Two Sum
      • 42. Trapping Rain Water
      • 14. Longest Common Prefix
      • 40. Combination Sum II
      • 67. Add Binary
      • 2. Add Two Numbers
      • 41. First Missing Positive
      • 38. Count and Say
      • 26. Remove Duplicates from Sorted Array
      • 66. Plus One
      • 64. Minimum Path Sum
    • 201-300
      • 259. 3Sum Smaller
      • 236. Lowest Common Ancestor of a Binary Tree
      • 297. Serialize and Deserialize Binary Tree
      • 215. Kth Largest Element in an Array
      • 295. Find Median from Data Stream
      • 230. Kth Smallest Element in a BST
      • 263. Ugly Number
      • 247. Strobogrammatic Number II
      • 240. Search a 2D Matrix II
      • 235. Lowest Common Ancestor of a Binary Search Tree
      • 206. Reverse Linked List
      • 300. Longest Increasing Subsequence
      • 224. Basic Calculator
      • 216. Combination Sum III
      • 264. Ugly Number II
      • 232. Implement Queue using Stacks
      • 273. Integer to English Words
    • 801-900
      • 827. Making A Large Island
      • 862. Shortest Subarray with Sum at Least K
      • 894. All Possible Full Binary Trees
      • 885. Spiral Matrix III
      • 852. Peak Index in a Mountain Array
      • 876. Middle of the Linked List
      • 877. Stone Game
    • 501-600
      • 547. Friend Circles
      • 581. Shortest Unsorted Continuous Subarray
      • 678. Valid Parenthesis String
      • 560. Subarray Sum Equals K
    • 701-800
      • 746. Min Cost Climbing Stairs
      • 765. Couples Holding Hands
      • 712. Minimum ASCII Delete Sum for Two Strings
      • 779. K-th Symbol in Grammar
    • 401-500
      • 423. Reconstruct Original Digits from English
      • 485. Max Consecutive Ones
      • 494. Target Sum
      • 454. 4Sum II
      • 419. Battleships in a Board
      • 452. Minimum Number of Arrows to Burst Balloons
      • 416. Partition Equal Subset Sum
      • 470. Implement Rand10() Using Rand7()
      • 468. Validate IP Address
      • 493. Reverse Pairs
      • 450. Delete Node in a BST
      • 426. Convert Binary Search Tree to Sorted Doubly Linked List
Powered by GitBook
On this page

Was this helpful?

  1. leetcode

some summay

01 knapsack堆排序约瑟夫环Skip listArray经典题N sumQuick Select股票买卖Tree Postorder traversalunion findLRUintervalsTree Preorder traversal94. Binary Tree Inorder Traversal
Previous324. Wiggle Sort IINext01 knapsack

Last updated 4 years ago

Was this helpful?