git config core.hooksPath .githooks
chmod +x .githooks/pre-commitGenerate a review file listing all available updates:
./gradlew versionCatalogUpdate --interactiveThis writes gradle/libs.versions.updates.toml. Open it and comment out
(or delete) any entries you are not ready to update. To pin an entry
permanently across future runs, add a # @pin comment on the line above
it in gradle/libs.versions.toml.
Apply the reviewed updates:
./gradlew versionCatalogApplyUpdatesVerify the build:
./gradlew buildUpdate the Gradle wrapper (independent of the catalog):
./gradlew wrapper --gradle-version=latest- 1. Two Sum
- 2. Add Two Numbers
- 3. Longest Substring without Repeating Characters
- 6. Zigzag Conversion
- 11. Container with Most Water
- 12. Integer to Roman
- 13. Roman to Integer
- 14. Longest Common Prefix
- 15. 3Sum
- 17. Letter Combinations of a Phone Number
- 19. Remove Nth Node From End of List
- 20. Valid Parentheses
- 21. Merge Two Sorted Lists
- 22. Generate Parentheses
- 23. Merge k Sorted Lists
- 25. Reverse Nodes in k-Group
- 26. Remove Duplicates from Sorted Array
- 27. Remove Element
- 28. Find the Index of the First Occurrence in a String
- 30. Substring with Concatenation of All Words
- 33. Search in Rotated Sorted Array
- 35. Search Insert Position
- 36. Valid Sudoku
- 39. Combination Sum
- 41. First Missing Positive
- 42. Trapping Rain Water
- 45. Jump Game II
- 46. Permutations
- 48. Rotate Image
- 49. Group Anagrams
- 51. N-Queens
- 52. N-Queens II
- 53. Maximum Subarray
- 54. Spiral Matrix
- 55. Jump Game
- 56. Merge Intervals
- 57. Insert Interval
- 58. Length of Last Word
- 61. Rotate List
- 62. Unique Paths
- 64. Minimum Path Sum
- 67. Add Binary
- 68. Text Justification
- 70. Climbing Stairs
- 71. Simplify Path
- 73. Set Matrix Zeroes
- 76. Minimum Window Substring
- 77. Combinations
- 79. Word Search
- 80. Remove Duplicates from Sorted Array II
- 82. Remove Duplicates from Sorted List II
- 86. Partition List
- 88. Merge Sorted Array
- 91. Decode Ways
- 92. Reverse Linked List II
- 94. Binary Tree Inorder Traversal
- 98. Validate Binary Search Tree
- 100. Same Tree
- 101. Symmetric Tree
- 102. Binary Tree Level Order Traversal
- 103. Binary Tree Zigzag Level Order Traversal
- 104. Maximum Depth of Binary Tree
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- 106. Construct Binary Tree from Inorder and Postorder Traversal
- 108. Convert Sorted Array to Binary Search Tree
- 110. Balanced Binary Tree
- 112. Path Sum
- 114. Flatten Binary Tree to Linked List
- 117. Populating Next Right Pointers in Each Node II
- 121. Best Time to Buy and Sell Stock
- 122. Best Time to Buy and Sell Stock II
- 124. Binary Tree Maximum Path Sum
- 125. Valid Palindrome
- 127. Word Ladder
- 128. Longest Consecutive Sequence
- 129. Sum Root to Leaf Numbers
- 130. Surrounded Regions
- 133. Clone Graph
- 134. Gas Station
- 135. Candy
- 136. Single Number
- 138. Copy List with Random Pointer
- 141. Linked List Cycle
- 143. Reorder List
- 146. LRU Cache
- 148. Sort List
- 150. Evaluate Reverse Polish Notation
- 151. Reverse Words in a String
- 155. Min Stack
- 167. Two Sum II - Input Array Is Sorted
- 169. Majority Element
- 173. Binary Search Tree Iterator
- 189. Rotate Array
- 190. Reverse Bits
- 191. Number of 1 Bits
- 199. Binary Tree Right Side View
- 200. Number of Islands
- 202. Happy Number
- 205. Isomorphic Strings
- 206. Reverse Linked List
- 207. Course Schedule
- 208. Implement Trie (Prefix Tree)
- 209. Minimum Size Subarray Sum
- 210. Course Schedule II
- 211. Design Add and Search Words Data Structure
- 212. Word Search II
- 215. Kth Largest Element in an Array
- 217. Contains Duplicate
- 219. Contains Duplicate II
- 221. Maximal Square
- 222. Count Complete Tree Nodes
- 224. Basic Calculator
- 226. Invert Binary Tree
- 228. Summary Ranges
- 230. Kth Smallest Element in a BST
- 232. Implement Queue using Stacks
- 234. Palindrome Linked List
- 235. Lowest Common Ancestor of a Binary Search Tree
- 236. Lowest Common Ancestor of a Binary Tree
- 238. Product of Array Except Self
- 239. Sliding Window Maximum
- 242. Valid Anagram
- 252. Meeting Rooms
- 257. Binary Tree Paths
- 268. Missing Number
- 274. H-Index
- 278. First Bad Version
- 283. Move Zeroes
- 289. Game of Life
- 290. Word Pattern
- 295. Find Median from Data Stream
- 297. Serialize and Deserialize Binary Tree
- 300. Longest Increasing Subsequence
- 322. Coin Change
- 329. Longest Increasing Path in a Matrix
- 338. Counting Bits
- 344. Reverse String
- 347. Top K Frequent Elements
- 358. Rearrange String k Distance Apart
- 362. Design Hit Counter
- 373. Find K Pairs with Smallest Sums
- 380. Insert Delete GetRandom O(1)
- 383. Ransom Note
- 391. Perfect Rectangle
- 392. Is Subsequence
- 399. Evaluate Division
- 406. Queue Reconstruction by Height
- 409. Longest Palindrome
- 427. Construct Quad Tree
- 433. Minimum Genetic Mutation
- 435. Non-overlapping Intervals
- 443. String Compression
- 452. Minimum Number of Arrows to Burst Balloons
- 530. Minimum Absolute Difference in BST
- 543. Diameter of Binary Tree
- 547. Number of Provinces
- 561. Array Partition
- 572. Subtree of Another Tree
- 616. Add Bold Tag in String
- 637. Average of Levels in Binary Tree
- 647. Palindromic Substrings
- 652. Find Duplicate Subtrees
- 680. Valid Palindrome II
- 696. Count Binary Substrings
- 704. Binary Search
- 706. Design HashMap
- 733. Flood Fill
- 739. Daily Temperatures
- 819. Most Common Word
- 876. Middle of the Linked List
- 886. Possible Bipartition
- 909. Snakes and Ladders
- 937. Reorder Data in Log Files
- 938. Range Sum of BST
- 994. Rotting Oranges
- 1109. Corporate Flight Bookings
- 1143. Longest Common Subsequence
- 1146. Snapshot Array
- 1249. Minimum Remove to Make Valid Parentheses
- 1297. Maximum Number of Occurrences of a Substring
- 1347. Minimum Number of Steps to Make Two Strings Anagram
- 1391. Check If There is a Valid Path in a Grid
- 1424. Diagonal Traverse II
- 1481. Least Number of Unique Integers after K Removals
- 1593. Split a String Into the Max Number of Unique Substrings
- 1710. Maximum Units on a Truck
- 1774. Closest Dessert Cost
- 2446. Determine if Two Events Have Conflict
- 3169. Count Days Without Meetings
- 3185. Count Pairs That Form a Complete Day II
-
- Bronze
-
- Bronze
-
- Bronze
-
- Bronze
-
- Bronze
-
- Bronze
-
- Bronze
-
- Bronze
- Meta
- Apple
- Hyundai Autoever