Name		Name	Last commit message	Last commit date
Latest commit History 626 Commits
.github/workflows		.github/workflows
c		c
cc		cc
cmake-build-debug-gcc/CMakeFiles		cmake-build-debug-gcc/CMakeFiles
java		java
python		python
LICENSE		LICENSE
README.md		README.md
exercise.iml		exercise.iml

Repository files navigation

ACM

About

Learn a new algorithm every day!

LeetCode

1-100

No. 1. Two Sum (Easy)
No. 2. Add Two Numbers (Medium)
No. 3. Longest Substring Without Repeating Characters (Medium)
No. 4. Median of Two Sorted Arrays (Hard)
No. 5. Longest Palindromic Substring (Medium)
No. 6. Zigzag Conversion (Medium)
No. 7. Reverse Integer (Medium)
No. 8. String to Integer (atoi) (Medium)
No. 10. Regular Expression Matching (Hard)
No. 11. Container With Most Water (Medium)
No. 12. Integer to Roman (Medium)
No. 13. Roman to Integer (Easy)
No. 14. Longest Common Prefix (Eash)
No. 15. 3Sum (Medium)
No. 16. 3Sum Closest (Medium)
No. 17. Letter Combinations of a Phone Number (Medium)
No. 18. 4Sum (Medium)
No. 19. Remove Nth Node From End of List (Medium)
No. 20. Valid Parentheses (Easy)
No. 21. Merge Two Sorted Lists (Easy)
No. 22. Generate Parentheses (Medium)
No. 23. Merge k Sorted Lists (Hard)
No. 24. Swap Nodes in Pairs (Medium)
No. 25. Reverse Nodes in k-Group (Hard)
No. 26. Remove Duplicates from Sorted Array (Easy)
No. 27. Remove Element (Easy)
No. 29. Divide Two Integers (Medium)
No. 30. Substring with Concatenation of All Words (Hard)
No. 31. Next Permutation (Medium)
No. 32. Longest Valid Parentheses (Medium)
No. 33. Search in Rotated Sorted Array (Medium)
No. 34. Find First and Last Position of Element in Sorted Array (Medium)
No. 35. Search Insert Position (Easy)
No. 36. Valid Sudoku (Medium)
No. 37. Sudoku Solver (Hard)
No. 38. Count and Say (Medium)
No. 39. Combination Sum (Medium)
No. 40. Combination Sum II (Medium)
No. 41. First Missing Positive (Hard)
No. 42. Trapping Rain Water (Hard)
No. 43. Multiply Strings (Medium)
No. 45. Jump Game II (Medium)
No. 46. Permutations (Medium)
No. 47. Permutations II (Medium)
No. 48. Rotate Image (Medium)
No. 49. Group Anagrams (Medium)
No. 51. N-Queens (Hard)
No. 52. N-Queens II (Hard)
No. 53. Maximum Subarray (Medium)
No. 55. Jump Game (Medium)
No. 56. Merge Intervals (Medium)
No. 57. Insert Interval (Medium)
No. 59. Spiral Matrix II (Medium)
No. 61. Rotate List (Medium)
No. 62. Unique Paths (Medium)
No. 63. Unique Paths II (Medium)
No. 67. Add Binary (Easy)
No. 70. Climbing Stairs (Easy)
No. 71. Simplify Path (Medium)
No. 74. Search a 2D Matrix (Medium)
No. 76. Minimum Window Substring (Hard)
No. 78. Subsets (Medium)
No. 79. Word Search (Medium)
No. 80. Remove Duplicates from Sorted Array II (Medium)
No. 81. Search in Rotated Sorted Array II (Medium)
No. 82. Remove Duplicates from Sorted List II (Medium)
No. 83. Remove Duplicates from Sorted List (Easy)
No. 84. Largest Rectangle in Histogram (Hard)
No. 86. Partition List (Medium)
No. 88. Merge Sorted Array (Easy)
No. 91. Decode Ways (Medium)
No. 92. Reverse Linked List II (Medium)
No. 93. Restore IP Addresses (Medium)
No. 94. Binary Tree Inorder Traversal (Easy)
No. 97. Interleaving String (Medium)
No. 98. Validate Binary Search Tree (Medium)
No. 99. Recover Binary Search Tree (Medium)
No. 100. Same Tree (Easy)

101-200

No. 101. Symmetric Tree (Easy)
No. 102. Binary Tree Level Order Traversal (Medium)
No. 104. Maximum Depth of Binary Tree (Easy)
No. 105. Construct Binary Tree from Preorder and Inorder Traversal (Medium)
No. 106. Construct Binary Tree from Inorder and Postorder Traversal (Medium)
No. 108. Convert Sorted Array to Binary Search Tree (Easy)
No. 109. Convert Sorted List to Binary Search Tree (Medium)
No. 112. Path Sum (Easy)
No. 113. Path Sum II (Medium)
No. 114. Flatten Binary Tree to Linked List (Medium)
No. 116. Populating Next Right Pointers in Each Node (Medium)
No. 117. Populating Next Right Pointers in Each Node II (Medium)
No. 118. Pascal's Triangle (Easy)
No. 120. Triangle (Medium)
No. 121. Best Time to Buy and Sell Stock (Easy)
No. 124. Binary Tree Maximum Path Sum (Hard)
No. 126. Word Ladder II (Hard)
No. 127. Word Ladder (Hard)
No. 128. Longest Consecutive Sequence (Medium)
No. 129. Sum Root to Leaf Numbers (Medium)
No. 131. Palindrome Partitioning (Medium)
No. 133. Clone Graph (Medium)
No. 134. Gas Station (Medium)
No. 135. Candy (Hard)
No. 136. Single Number (Easy)
No. 138. Copy List with Random Pointer (Medium)
No. 141. Linked List Cycle (Easy)
No. 142. Linked List Cycle II (Medium)
No. 143. Reorder List (Medium)
No. 144. Binary Tree Preorder Traversal (Easy)
No. 145. Binary Tree Postorder Traversal (Easy)
No. 147. Insertion Sort List (Medium)
No. 148. Sort List (Medium)
No. 149. Max Points on a Line (Hard)
No. 150. Evaluate Reverse Polish Notation (Medium)
No. 151. Reverse Words in a String (Medium)
No. 160. Intersection of Two Linked Lists (Easy)
No. 165. Compare Version Numbers (Medium)
No. 167. Two Sum II - Input Array Is Sorted (Medium)
No. 169. Majority Element (Easy)
No. 171. Excel Sheet Column Number (Easy)
No. 173. Binary Search Tree Iterator (Medium)
No. 188. Best Time to Buy and Sell Stock IV (Hard)
No. 189. Rotate Array (Medium)
No. 191. Number of 1 Bits (Easy)
No. 198. House Robber (Medium)
No. 199. Binary Tree Right Side View (Medium)
No. 200. Number of Islands (Medium)

201-300

No. 202. Happy Number (Easy)
No. 203. Remove Linked List Elements (Easy)
No. 204. Count Primes (Medium)
No. 206. Reverse Linked List (Easy)
No. 210. Course Schedule II (Medium)
No. 211. Design Add and Search Words Data Structure (Medium)
No. 212. Word Search II (Hard)
No. 215. Kth Largest Element in an Array (Medium)
No. 216. Combination Sum III (Medium)
No. 217. Contains Duplicate (Easy)
No. 218. The Skyline Problem (Hard)
No. 219. Contains Duplicate II (Easy)
No. 221. Maximal Square (Medium)
No. 222. Count Complete Tree Nodes (Medium)
No. 223. Rectangle Area (Medium)
No. 224. Basic Calculator (Hard)
No. 225. Implement Stack using Queues (Easy)
No. 226. Invert Binary Tree (Easy)
No. 227. Basic Calculator II (Medium)
No. 228. Summary Ranges (Easy)
No. 230. Kth Smallest Element in a BST (Medium)
No. 231. Power of Two (Easy)
No. 232. Implement Queue using Stacks (Easy)
No. 234. Palindrome Linked List (Easy)
No. 235. Lowest Common Ancestor of a Binary Search Tree (Easy)
No. 236. Lowest Common Ancestor of a Binary Tree (Medium)
No. 237. Delete Node in a Linked List (Medium)
No. 240. Search a 2D Matrix II (Medium)
No. 242. Valid Anagram (Easy)
No. 258. Add Digits (Easy)
No. 260. Single Number III (Medium)
No. 263. Ugly Number (Easy)
No. 268. Missing Number (Easy)
No. 274. H-Index (Medium)
No. 275. H-Index II (Medium)
No. 279. Perfect Squares (Medium)
No. 284. Peeking Iterator (Medium)
No. 287. Find the Duplicate Number (Medium)
No. 289. Game of Life (Medium)
No. 290. Word Pattern (Easy)
No. 295. Find Median from Data Stream (Hard)
No. 300. Longest Increasing Subsequence (Medium)

301-400

No. 304. Range Sum Query 2D - Immutable (Medium)
No. 307. Range Sum Query - Mutable (Medium)
No. 309. Best Time to Buy and Sell Stock with Cooldown (Medium)
No. 310. Minimum Height Trees (Medium)
No. 312. Burst Balloons (Hard)
No. 315. Count of Smaller Numbers After Self (Hard)
No. 316. Remove Duplicate Letters (Medium)
No. 318. Maximum Product of Word Lengths (Medium)
No. 322. Coin Change (Medium)
No. 326. Power of Three (Easy)
No. 328. Odd Even Linked List (Medium)
No. 329. Longest Increasing Path in a Matrix (Hard)
No. 334. Increasing Triplet Subsequence (Medium)
No. 336. Palindrome Pairs (Hard)
No. 338. Counting Bits (Easy)
No. 341. Flatten Nested List Iterator (Medium)
No. 342. Power of Four (Easy)
No. 344. Reverse String (Easy)
No. 345. Reverse Vowels of a String (Easy)
No. 347. Top K Frequent Elements (Medium)
No. 350. Intersection of Two Arrays II (Easy)
No. 352. Data Stream as Disjoint Intervals (Hard)
No. 354. Russian Doll Envelopes (Hard)
No. 363. Max Sum of Rectangle No Larger Than K (Hard)
No. 374. Guess Number Higher or Lower (Easy)
No. 376. Wiggle Subsequence (Medium)
No. 377. Combination Sum IV (Medium)
No. 378. Kth Smallest Element in a Sorted Matrix (Medium)
No. 380. Insert Delete GetRandom O(1) (Meidum)
No. 382. Linked List Random Node (Medium)
No. 383. Ransom Note (Easy)
No. 387. First Unique Character in a String (Easy)
No. 389. Find the Difference (Easy)
No. 392. Is Subsequence (Easy)
No. 393. UTF-8 Validation (Medium)
No. 394. Decode String (Medium)
No. 399. Evaluate Division (Medium)

401-500

No. 402. Remove K Digits (Medium)
No. 406. Queue Reconstruction by Height (Medium)
No. 410. Split Array Largest Sum (Hard)
No. 413. Arithmetic Slices (Medium)
No. 414. Third Maximum Number (Easy)
No. 416. Partition Equal Subset Sum (Medium)
No. 417. Pacific Atlantic Water Flow (Medium)
No. 421. Maximum XOR of Two Numbers in an Array (Medium)
No. 429. N-ary Tree Level Order Traversal (Medium)
No. 433. Minimum Genetic Mutation (Medium)
No. 438. Find All Anagrams in a String (Medium)
No. 446. Arithmetic Slices II - Subsequence (Hard)
No. 452. Minimum Number of Arrows to Burst Balloons (Medium)
No. 454. 4Sum II (Medium)
No. 456. 132 Pattern (Medium)
No. 458. Poor Pigs (Hard)
No. 460. LFU Cache (Hard)
No. 462. Minimum Moves to Equal Array Elements II (Medium)
No. 473. Matchsticks to Square (Medium)
No. 474. Ones and Zeroes (Medium)
No. 476. Number Complement (Easy)
No. 491. Non-decreasing Subsequences (Medium)

501-600

No. 509. Fibonacci Number (Easy)
No. 520. Detect Capital (Easy)
No. 523. Continuous Subarray Sum (Medium)
No. 525. Contiguous Array (Medium)
No. 532. K-diff Pairs in an Array (Medium)
No. 535. Encode and Decode TinyURL (Medium)
No. 538. Convert BST to Greater Tree (Medium)
No. 557. Reverse Words in a String III (Easy)
No. 560. Subarray Sum Equals K (Medium)
No. 563. Binary Tree Tilt (Easy)
No. 566. Reshape the Matrix (Easy)
No. 567. Permutation in String (Medium)
No. 576. Out of Boundary Paths (Medium)
No. 581. Shortest Unsorted Continuous Subarray (Medium)
No. 583. Delete Operation for Two Strings (Medium)
No. 587. Erect the Fence (Hard)

601-700

No. 605. Can Place Flowers (Easy)
No. 606. Construct String from Binary Tree (Easy)
No. 609. Find Duplicate File in System (Medium)
No. 622. Design Circular Queue (Medium)
No. 623. Add One Row to Tree (Medium)
No. 629. K Inverse Pairs Array (Hard)
No. 630. Course Schedule III (Hard)
No. 637. Average of Levels in Binary Tree (Easy)
No. 645. Set Mismatch (Easy)
No. 647. Palindromic Substrings (Medium)
No. 653. Two Sum IV - Input is a BST (Easy)
No. 658. Find K Closest Elements (Medium)
No. 659. Split Array into Consecutive Subsequences (Medium)
No. 662. Maximum Width of Binary Tree (Medium)
No. 665. Non-decreasing Array (Medium)
No. 669. Trim a Binary Search Tree (Medium)
No. 680. Valid Palindrome II (Easy)
No. 682. Baseball Game (Easy)
No. 692. Top K Frequent Words (Medium)
No. 695. Max Area of Island (Medium)
No. 700. Search in a Binary Search Tree (Easy)

701-800

No. 701. Insert into a Binary Search Tree (Medium)
No. 703. Kth Largest Element in a Stream (Easy)
No. 704. Binary Search (Easy)
No. 705. Design HashSet (Easy)
No. 706. Design HashMap (Easy)
No. 718. Maximum Length of Repeated Subarray (Medium)
No. 729. My Calendar I (Medium)
No. 732. My Calendar III (Hard)
No. 739. Daily Temperatures (Medium)
No. 740. Delete and Earn (Medium)
No. 743. Network Delay Time (Medium)
No. 745. Prefix and Suffix Search (Hard)
No. 746. Min Cost Climbing Stairs (Easy)
No. 763. Partition Labels (Medium)
No. 766. Toeplitz Matrix (Easy)
No. 783. Minimum Distance Between BST Nodes (Easy)
No. 785. Is Graph Bipartite? (Medium)
No. 790. Domino and Tromino Tiling (Medium)
No. 792. Number of Matching Subsequences (Medium)
No. 797. All Paths From Source to Target (Medium)
No. 799. Champagne Tower (Medium)

801-900

No. 804. Unique Morse Code Words (Easy)
No. 814. Binary Tree Pruning (Medium)
No. 820. Short Encoding of Words (Medium)
No. 823. Binary Trees With Factors (Medium)
No. 834. Sum of Distances in Tree (Hard)
No. 835. Image Overlap (Medium)
No. 838. Push Dominoes (Medium)
No. 841. Keys and Rooms (Medium)
No. 844. Backspace String Compare (Easy)
No. 847. Shortest Path Visiting All Nodes (Hard)
No. 849. Maximize Distance to Closest Person (Medium)
No. 856. Score of Parentheses (Medium)
No. 858. Mirror Reflection (Medium)
No. 867. Transpose Matrix (Easy)
No. 869. Reordered Power of 2 (Medium)
No. 871. Minimum Number of Refueling Stops (Hard)
No. 872. Leaf-Similar Trees (Easy)
No. 875. Koko Eating Bananas (Medium)
No. 876. Middle of the Linked List (Easy)
No. 878. Nth Magical Number (Hard)
No. 881. Boats to Save People (Medium)
No. 886. Possible Bipartition (Medium)
No. 890. Find and Replace Pattern (Medium)
No. 895. Maximum Frequency Stack (Hard)
No. 897. Increasing Order Search Tree (Easy)
No. 899. Orderly Queue (Hard)

901-1000

No. 901. Online Stock Span (Medium)
No. 902. Numbers At Most N Given Digit Set (Hard)
No. 904. Fruit Into Baskets (Medium)
No. 905. Sort Array By Parity (Easy)
No. 907. Sum of Subarray Minimums (Medium)
No. 912. Sort an Array (Medium)
No. 916. Word Subsets (Medium)
No. 918. Maximum Sum Circular Subarray (Medium)
No. 923. 3Sum With Multiplicity (Medium)
No. 926. Flip String to Monotone Increasing (Medium)
No. 931. Minimum Falling Path Sum (Medium)
No. 936. Stamping The Sequence (Hard)
No. 938. Range Sum of BST (Easy)
No. 941. Valid Mountain Array (Easy)
No. 944. Delete Columns to Make Sorted (Easy)
No. 946. Validate Stack Sequences (Medium)
No. 948. Bag of Tokens (Medium)
No. 953. Verifying an Alien Dictionary (Easy)
No. 958. Check Completeness of a Binary Tree (Medium)
No. 967. Numbers With Same Consecutive Differences (Medium)
No. 968. Binary Tree Cameras (Hard)
No. 973. K Closest Points to Origin (Medium)
No. 974. Subarray Sums Divisible by K (Medium)
No. 976. Largest Perimeter Triangle (Easy)
No. 980. Unique Paths III (Hard)
No. 981. Time Based Key-Value Store (Medium)
No. 985. Sum of Even Numbers After Queries (Medium)
No. 987. Vertical Order Traversal of a Binary Tree (Hard)
No. 990. Satisfiability of Equality Equations (Medium)
No. 991. Broken Calculator (Medium)
No. 997. Find the Town Judge (Easy)

1001-1100

No. 1007. Minimum Domino Rotations For Equal Row (Medium)
No. 1009. Complement of Base 10 Integer (Easy)
No. 1010. Pairs of Songs With Total Durations Divisible by 60 (Medium)
No. 1011. Capacity To Ship Packages Within D Days (Medium)
No. 1015. Smallest Integer Divisible by K (Medium)
No. 1022. Sum of Root To Leaf Binary Numbers (Easy)
No. 1026. Maximum Difference Between Node and Ancestor (Medium)
No. 1029. Two City Scheduling (Medium)
No. 1041. Robot Bounded In Circle (Medium)
No. 1046. Last Stone Weight (Easy)
No. 1047. Remove All Adjacent Duplicates In String (Easy)
No. 1048. Longest String Chain (Medium)
No. 1061. Lexicographically Smallest Equivalent String (Medium)
No. 1071. Greatest Common Divisor of Strings (Easy)
No. 1074. Number of Submatrices That Sum to Target (Hard)
No. 1090. Convert Binary Number in a Linked List to Integer (Easy)
No. 1091. Shortest Path in Binary Matrix (Medium)
No. 1094. Car Pooling (Medium)

1101-1200

No. 1137. N-th Tribonacci Number (Easy)
No. 1143. Longest Common Subsequence (Medium)
No. 1155. Number of Dice Rolls With Target Sum (Medium)
No. 1162. As Far from Land as Possible (Medium)
No. 1192. Critical Connections in a Network (Hard)
No. 1200. Minimum Absolute Difference (Easy)

1201-1300

No. 1202. Smallest String With Swaps (Medium)
No. 1209. Remove All Adjacent Duplicates in String II (Medium)
No. 1220. Count Vowels Permutation (Hard)
No. 1235. Maximum Profit in Job Scheduling (Hard)
No. 1239. Maximum Length of a Concatenated String with Unique Characters (Medium)
No. 1249. Minimum Remove to Make Valid Parentheses (Medium)
No. 1254. Number of Closed Islands (Medium)
No. 1260. Shift 2D Grid (Easy)
No. 1268. Search Suggestions System (Medium)
No. 1207. Unique Number of Occurrences (Easy)
No. 1288. Remove Covered Intervals (Medium)
No. 1291. Sequential Digits (Medium)
No. 1293. Shortest Path in a Grid with Obstacles Elimination (Hard)

1301-1400

No. 1302. Deepest Leaves Sum (Medium)
No. 1305. All Elements in Two Binary Search Trees (Medium)
No. 1306. Jump Game III (Medium)
No. 1319. Number of Operations to Make Network Connected (Medium)
No. 1323. Maximum 69 Number (Easy)
No. 1328. Break a Palindrome (Medium)
No. 1329. Sort the Matrix Diagonally (Medium)
No. 1332. Remove Palindromic Subsequences (Easy) No. 1335. Minimum Difficulty of a Job Schedule (Hard)
No. 1337. The K Weakest Rows in a Matrix (Easy)
No. 1338. Reduce Array Size to The Half (Medium)
No. 1339. Maximum Product of Splitted Binary Tree (Medium)
No. 1342. Number of Steps to Reduce a Number to Zero (Easy)
No. 1345. Jump Game IV (Hard)
No. 1354. Construct Target Array With Multiple Sums (Hard)
No. 1359. Count All Valid Pickup and Delivery Options (Hard)
No. 1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree (Medium)
No. 1383. Maximum Performance of a Team (Hard)
No. 1396. Design Underground System (Medium)

1401-1500

No. 1423. Maximum Points You Can Obtain from Cards (Medium)
No. 1443. Minimum Time to Collect All Apples in a Tree (Medium)
No. 1444. Number of Ways of Cutting a Pizza (Hard)
No. 1446. Consecutive Characters (Easy)
No. 1448. Count Good Nodes in Binary Tree (Medium)
No. 1457. Pseudo-Palindromic Paths in a Binary Tree (Medium)
No. 1461. Check If a String Contains All Binary Codes of Size K (Medium)
No. 1463. Cherry Pickup II (Hard)
No. 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts (Medium)
No. 1466. Reorder Routes to Make All Paths Lead to the City Zero (Medium)
No. 1470. Shuffle the Array (Easy)
No. 1473. Paint House III (Hard)
No. 1480. Running Sum of 1d Array (Easy)

1501-1600

No. 1510. Stone Game IV (Hard)
No. 1519. Number of Nodes in the Sub-Tree With the Same Label (Medium)
No. 1531. String Compression II (Hard)
No. 1539. Kth Missing Positive Number (Easy)
No. 1544. Make The String Great (Easy)
No. 1578. Minimum Time to Make Rope Colorful (Medium)
No. 1584. Min Cost to Connect All Points (Medium)

1601-1700

No. 1626. Best Team With No Conflicts (Medium)
No. 1631. Path With Minimum Effort (Medium)
No. 1641. Count Sorted Vowel Strings (Medium)
No. 1642. Furthest Building You Can Reach (Medium)
No. 1647. Minimum Deletions to Make Character Frequencies Unique (Medium)
No. 1657. Determine if Two Strings Are Close (Medium)
No. 1658. Minimum Operations to Reduce X to Zero (Medium)
No. 1662. Check If Two String Arrays are Equivalent (Easy)
No. 1663. Smallest String With A Given Numeric Value (Medium)
No. 1672. Richest Customer Wealth (Easy)
No. 1675. Minimize Deviation in Array (Hard)
No. 1679. Max Number of K-Sum Pairs (Medium)
No. 1680. Concatenation of Consecutive Binary Numbers (Medium)
No. 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers (Medium)
No. 1695. Maximum Erasure Value (Medium)
No. 1696. Jump Game VI (Medium)

1701-1800

No. 1704. Determine if String Halves Are Alike (Easy)
No. 1706. Where Will the Ball Fall (Medium)
No. 1710. Maximum Units on a Truck (Easy)
No. 1721. Swapping Nodes in a Linked List (Medium)
No. 1770. Maximum Score from Performing Multiplication Operations (Medium)

1801-1900

No. 1832. Check if the Sentence Is Pangram (Easy)
No. 1833. Maximum Ice Cream Bars (Medium)
No. 1834. Single-Threaded CPU (Medium)
No. 1838. Frequency of the Most Frequent Element (Medium)
No. 1877. Minimize Maximum Pair Sum in Array (Medium)

1901-2000

No. 1926. Nearest Exit from Entrance in Maze (Medium)
No. 1962. Remove Stones to Minimize the Total (Medium)
No. 1971. Find if Path Exists in Graph (Easy)
No. 1980. Find Unique Binary String (Medium)
No. 1996. The Number of Weak Characters in the Game (Medium)

2001-2100

No. 2007. Find Original Array From Doubled Array (Medium)
No. 2095. Delete the Middle Node of a Linked List (Medium)

2101-2200

No. 2103. Rings and Rods (Easy)
No. 2131. Longest Palindrome by Concatenating Two Letter Words (Medium)
No. 2136. Earliest Possible Day of Full Bloom (Hard)

2201-2300

No. 2216. Minimum Deletions to Make Array Beautiful (Medium)
No. 2225. Find Players With Zero or One Losses (Medium)
No. 2244. Minimum Rounds to Complete All Tasks (Medium)
No. 2246. Longest Path With Different Adjacent Characters (Hard)
No. 2256. Minimum Average Difference (Medium)
No. 2279. Maximum Bags With Full Capacity of Rocks (Medium)
No. 2300. Successful Pairs of Spells and Potions (Medium)

2301-2400

No. 2306. Naming a Company (Hard)
No. 2316. Count Unreachable Pairs of Nodes in an Undirected Graph (Medium)
No. 2348. Number of Zero-Filled Subarrays (Medium)
No. 2389. Longest Subsequence With Limited Sum (Easy)

2401-2500

No. 2421. Number of Good Paths (Hard)
No. 2433. Find The Original Array of Prefix Xor (Medium)
No. 2477. Minimum Fuel Cost to Report to the Capital (Medium)

2501-2600

No. 2530. Maximal Score After Applying K Operations (Medium)
No. 2558. Take Gifts From the Richest Pile (Easy)
No. 2586. Count the Number of Vowel Strings in Range (Easy)

2601-2700

No. 2609. Find the Longest Balanced Substring of a Binary String (Easy)
No. 2652. Sum Multiples (Easy)
No. 2656. Maximum Sum With Exactly K Elements (Easy)

About

Learn a new algorithm every day!

Apache-2.0 license

Report repository

Releases

No releases published

Packages

No packages published

Languages