- 2301. Match Substring After Replacement 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Hash Table 🔗
- String 🔗
- String Matching 🔗
|
- 211. Design Add and Search Words Data Structure 🔗 📝
|
- 2302. Count Subarrays With Score Less Than K 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Binary Search 🔗
- Sliding Window 🔗
- Prefix Sum 🔗
|
- 53. Maximum Subarray 🔗 📝
- 713. Subarray Product Less Than K 🔗 📝
- 930. Binary Subarrays With Sum 🔗 📝
|
- 2303. Calculate Amount Paid in Taxes 🔗 📝
|
🆓 |
|
⭐️ |
- Array 🔗
- Simulation 🔗
|
|
- 2304. Minimum Path Cost in a Grid 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Dynamic Programming 🔗
- Matrix 🔗
|
- 62. Unique Paths 🔗 📝
- 63. Unique Paths II 🔗 📝
- 64. Minimum Path Sum 🔗 📝
- 174. Dungeon Game 🔗 📝
- 256. Paint House 🔗 📝
|
- 2305. Fair Distribution of Cookies 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Dynamic Programming 🔗
- Backtracking 🔗
- Bit Manipulation 🔗
- Bitmask 🔗
|
- 410. Split Array Largest Sum 🔗 📝
- 548. Split Array with Equal Sum 🔗 📝
- 698. Partition to K Equal Sum Subsets 🔗 📝
- 1879. Minimum XOR Sum of Two Arrays 🔗 📝
- 1986. Minimum Number of Work Sessions to Finish the Tasks 🔗 📝
- 1994. The Number of Good Subsets 🔗 📝
- 2035. Partition Array Into Two Arrays to Minimize Sum Difference 🔗 📝
|
- 2306. Naming a Company 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Hash Table 🔗
- String 🔗
- Bit Manipulation 🔗
- Enumeration 🔗
|
|
- 2307. Check for Contradictions in Equations 🔗 📝
|
💰 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Depth-First Search 🔗
- Union Find 🔗
- Graph 🔗
|
- 399. Evaluate Division 🔗 📝
|
- 2308. Arrange Table by Gender 🔗 📝
|
💰 |
|
⭐️⭐️ |
- Database 🔗
|
|
- 2309. Greatest English Letter in Upper and Lower Case 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Hash Table 🔗
- String 🔗
- Enumeration 🔗
|
|
- 2310. Sum of Numbers With Units Digit K 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Math 🔗
- Dynamic Programming 🔗
- Greedy 🔗
- Enumeration 🔗
|
- 1067. Digit Count in Range 🔗 📝
- 2180. Count Integers With Even Digit Sum 🔗 📝
|
- 2311. Longest Binary Subsequence Less Than or Equal to K 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- String 🔗
- Dynamic Programming 🔗
- Greedy 🔗
- Memoization 🔗
|
- 1702. Maximum Binary String After Change 🔗 📝
|
- 2312. Selling Pieces of Wood 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Dynamic Programming 🔗
- Memoization 🔗
|
- 1240. Tiling a Rectangle with the Fewest Squares 🔗 📝
- 1444. Number of Ways of Cutting a Pizza 🔗 📝
|
- 2313. Minimum Flips in Binary Tree to Get Result 🔗 📝
|
💰 |
|
⭐️⭐️⭐️ |
- Dynamic Programming 🔗
- Tree 🔗
- Depth-First Search 🔗
- Binary Tree 🔗
|
- 1612. Check If Two Expression Trees are Equivalent 🔗 📝
- 1628. Design an Expression Tree With Evaluate Function 🔗 📝
- 2331. Evaluate Boolean Binary Tree 🔗 📝
|
- 2314. The First Day of the Maximum Recorded Degree in Each City 🔗 📝
|
💰 |
|
⭐️⭐️ |
- Database 🔗
|
|
- 2315. Count Asterisks 🔗 📝
|
🆓 |
✅ |
⭐️ |
- String 🔗
|
|
- 2316. Count Unreachable Pairs of Nodes in an Undirected Graph 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Depth-First Search 🔗
- Breadth-First Search 🔗
- Union Find 🔗
- Graph 🔗
|
- 200. Number of Islands 🔗 📝
|
- 2317. Maximum XOR After Operations 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Math 🔗
- Bit Manipulation 🔗
|
- 421. Maximum XOR of Two Numbers in an Array 🔗 📝
|
- 2318. Number of Distinct Roll Sequences 🔗 📝
|
🆓 |
✅ |
⭐️⭐️⭐️ |
- Dynamic Programming 🔗
- Memoization 🔗
|
- 1223. Dice Roll Simulation 🔗 📝
- 1473. Paint House III 🔗 📝
|
- 2319. Check if Matrix Is X-Matrix 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Array 🔗
- Matrix 🔗
|
- 1572. Matrix Diagonal Sum 🔗 📝
|
- 2320. Count Number of Ways to Place Houses 🔗 📝
|
🆓 |
✅ |
⭐️⭐️ |
- Dynamic Programming 🔗
|
- 70. Climbing Stairs 🔗 📝
- 198. House Robber 🔗 📝
|
- 2321. Maximum Score Of Spliced Array 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Dynamic Programming 🔗
|
- 53. Maximum Subarray 🔗 📝
|
- 2322. Minimum Score After Removals on a Tree 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Bit Manipulation 🔗
- Tree 🔗
- Depth-First Search 🔗
|
|
- 2323. Find Minimum Time to Finish All Jobs II 🔗 📝
|
💰 |
|
⭐️⭐️ |
- Array 🔗
- Greedy 🔗
- Sorting 🔗
|
- 621. Task Scheduler 🔗 📝
- 1723. Find Minimum Time to Finish All Jobs 🔗 📝
- 1986. Minimum Number of Work Sessions to Finish the Tasks 🔗 📝
|
- 2324. Product Sales Analysis IV 🔗 📝
|
💰 |
|
⭐️⭐️ |
- Database 🔗
|
- 1068. Product Sales Analysis I 🔗 📝
- 1069. Product Sales Analysis II 🔗 📝
- 1070. Product Sales Analysis III 🔗 📝
|
- 2325. Decode the Message 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Hash Table 🔗
- String 🔗
|
|
- 2326. Spiral Matrix IV 🔗 📝
|
🆓 |
✅ |
⭐️⭐️ |
- Array 🔗
- Linked List 🔗
- Matrix 🔗
- Simulation 🔗
|
- 54. Spiral Matrix 🔗 📝
- 59. Spiral Matrix II 🔗 📝
- 885. Spiral Matrix III 🔗 📝
|
- 2327. Number of People Aware of a Secret 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Dynamic Programming 🔗
- Queue 🔗
- Simulation 🔗
|
|
- 2328. Number of Increasing Paths in a Grid 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Dynamic Programming 🔗
- Depth-First Search 🔗
- Breadth-First Search 🔗
- Graph 🔗
- Topological Sort 🔗
- Memoization 🔗
- Matrix 🔗
|
- 329. Longest Increasing Path in a Matrix 🔗 📝
- 797. All Paths From Source to Target 🔗 📝
|
- 2329. Product Sales Analysis V 🔗 📝
|
💰 |
|
⭐️ |
- Database 🔗
|
- 1068. Product Sales Analysis I 🔗 📝
- 1069. Product Sales Analysis II 🔗 📝
- 1070. Product Sales Analysis III 🔗 📝
|
- 2330. Valid Palindrome IV 🔗 📝
|
💰 |
|
⭐️⭐️ |
- Two Pointers 🔗
- String 🔗
|
- 125. Valid Palindrome 🔗 📝
- 680. Valid Palindrome II 🔗 📝
- 1216. Valid Palindrome III 🔗 📝
|
- 2331. Evaluate Boolean Binary Tree 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Binary Search 🔗
- Tree 🔗
- Depth-First Search 🔗
|
- 1612. Check If Two Expression Trees are Equivalent 🔗 📝
- 1628. Design an Expression Tree With Evaluate Function 🔗 📝
- 2313. Minimum Flips in Binary Tree to Get Result 🔗 📝
|
- 2332. The Latest Time to Catch a Bus 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Two Pointers 🔗
- Binary Search 🔗
- Sorting 🔗
|
- 1870. Minimum Speed to Arrive on Time 🔗 📝
|
- 2333. Minimum Sum of Squared Difference 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Math 🔗
- Sorting 🔗
- Heap (Priority Queue) 🔗
|
- 1818. Minimum Absolute Sum Difference 🔗 📝
- 2035. Partition Array Into Two Arrays to Minimize Sum Difference 🔗 📝
|
- 2334. Subarray With Elements Greater Than Varying Threshold 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Stack 🔗
- Union Find 🔗
- Monotonic Stack 🔗
|
- 1856. Maximum Subarray Min-Product 🔗 📝
- 2030. Smallest K-Length Subsequence With Occurrences of a Letter 🔗 📝
- 2261. K Divisible Elements Subarrays 🔗 📝
|
- 2335. Minimum Amount of Time to Fill Cups 🔗 📝
|
🆓 |
|
⭐️ |
- Array 🔗
- Greedy 🔗
- Heap (Priority Queue) 🔗
|
- 1354. Construct Target Array With Multiple Sums 🔗 📝
- 1753. Maximum Score From Removing Stones 🔗 📝
- 2141. Maximum Running Time of N Computers 🔗 📝
|
- 2336. Smallest Number in Infinite Set 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Hash Table 🔗
- Design 🔗
- Heap (Priority Queue) 🔗
|
- 41. First Missing Positive 🔗 📝
|
- 2337. Move Pieces to Obtain a String 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Two Pointers 🔗
- String 🔗
|
- 20. Valid Parentheses 🔗 📝
- 777. Swap Adjacent in LR String 🔗 📝
|
- 2338. Count the Number of Ideal Arrays 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Math 🔗
- Dynamic Programming 🔗
- Combinatorics 🔗
- Number Theory 🔗
|
- 1735. Count Ways to Make Array With Product 🔗 📝
|
- 2339. All the Matches of the League 🔗 📝
|
💰 |
|
⭐️ |
- Database 🔗
|
|
- 2340. Minimum Adjacent Swaps to Make a Valid Array 🔗 📝
|
💰 |
|
⭐️⭐️ |
- Array 🔗
- Greedy 🔗
|
- 1703. Minimum Adjacent Swaps for K Consecutive Ones 🔗 📝
|
- 2341. Maximum Number of Pairs in Array 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Array 🔗
- Hash Table 🔗
- Counting 🔗
|
- 451. Sort Characters By Frequency 🔗 📝
- 692. Top K Frequent Words 🔗 📝
- 1636. Sort Array by Increasing Frequency 🔗 📝
|
- 2342. Max Sum of a Pair With Equal Sum of Digits 🔗 📝
|
🆓 |
✅ |
⭐️⭐️ |
- Array 🔗
- Hash Table 🔗
- Sorting 🔗
- Heap (Priority Queue) 🔗
|
|
- 2343. Query Kth Smallest Trimmed Number 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- String 🔗
- Divide and Conquer 🔗
- Sorting 🔗
- Heap (Priority Queue) 🔗
- Radix Sort 🔗
- Quickselect 🔗
|
|
- 2344. Minimum Deletions to Make Array Divisible 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Math 🔗
- Sorting 🔗
- Heap (Priority Queue) 🔗
- Number Theory 🔗
|
- 1497. Check If Array Pairs Are Divisible by k 🔗 📝
|
- 2345. Finding the Number of Visible Mountains 🔗 📝
|
💰 |
|
⭐️⭐️ |
- Array 🔗
- Stack 🔗
- Sorting 🔗
- Monotonic Stack 🔗
|
- 1762. Buildings With an Ocean View 🔗 📝
|
- 2346. Compute the Rank as a Percentage 🔗 📝
|
💰 |
|
⭐️⭐️ |
- Database 🔗
|
|
- 2347. Best Poker Hand 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Array 🔗
- Hash Table 🔗
- Counting 🔗
|
|
- 2348. Number of Zero-Filled Subarrays 🔗 📝
|
🆓 |
✅ |
⭐️⭐️ |
- Array 🔗
- Math 🔗
|
- 413. Arithmetic Slices 🔗 📝
- 2110. Number of Smooth Descent Periods of a Stock 🔗 📝
|
- 2349. Design a Number Container System 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Hash Table 🔗
- Design 🔗
- Heap (Priority Queue) 🔗
- Ordered Set 🔗
|
- 1845. Seat Reservation Manager 🔗 📝
- 2353. Design a Food Rating System 🔗 📝
|
- 2350. Shortest Impossible Sequence of Rolls 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Hash Table 🔗
- Greedy 🔗
|
|
- 2351. First Letter to Appear Twice 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Hash Table 🔗
- String 🔗
- Counting 🔗
|
- 1. Two Sum 🔗 📝
- 387. First Unique Character in a String 🔗 📝
|
- 2352. Equal Row and Column Pairs 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Hash Table 🔗
- Matrix 🔗
- Simulation 🔗
|
|
- 2353. Design a Food Rating System 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Hash Table 🔗
- Design 🔗
- Heap (Priority Queue) 🔗
- Ordered Set 🔗
|
- 2349. Design a Number Container System 🔗 📝
|
- 2354. Number of Excellent Pairs 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Hash Table 🔗
- Binary Search 🔗
- Bit Manipulation 🔗
|
- 1. Two Sum 🔗 📝
|
- 2355. Maximum Number of Books You Can Take 🔗 📝
|
💰 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Dynamic Programming 🔗
- Stack 🔗
- Monotonic Stack 🔗
|
- 300. Longest Increasing Subsequence 🔗 📝
- 1800. Maximum Ascending Subarray Sum 🔗 📝
|
- 2356. Number of Unique Subjects Taught by Each Teacher 🔗 📝
|
💰 |
|
⭐️ |
- Database 🔗
|
|
- 2357. Make Array Zero by Subtracting Equal Amounts 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Array 🔗
- Hash Table 🔗
- Sorting 🔗
- Heap (Priority Queue) 🔗
- Simulation 🔗
|
- 217. Contains Duplicate 🔗 📝
|
- 2358. Maximum Number of Groups Entering a Competition 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Math 🔗
- Binary Search 🔗
- Greedy 🔗
|
- 1691. Maximum Height by Stacking Cuboids 🔗 📝
|
- 2359. Find Closest Node to Given Two Nodes 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Depth-First Search 🔗
- Graph 🔗
|
|
- 2360. Longest Cycle in a Graph 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Depth-First Search 🔗
- Graph 🔗
- Topological Sort 🔗
|
- 1591. Strange Printer II 🔗 📝
|
- 2361. Minimum Costs Using the Train Line 🔗 📝
|
💰 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Dynamic Programming 🔗
|
- 815. Bus Routes 🔗 📝
- 1184. Distance Between Bus Stops 🔗 📝
|
- 2362. Generate the Invoice 🔗 📝
|
💰 |
|
⭐️⭐️⭐️ |
- Database 🔗
|
|
- 2363. Merge Similar Items 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Array 🔗
- Hash Table 🔗
- Sorting 🔗
- Ordered Set 🔗
|
|
- 2364. Count Number of Bad Pairs 🔗 📝
|
🆓 |
✅ |
⭐️⭐️ |
- Array 🔗
- Hash Table 🔗
|
- 532. K-diff Pairs in an Array 🔗 📝
- 974. Subarray Sums Divisible by K 🔗 📝
- 1814. Count Nice Pairs in an Array 🔗 📝
- 2006. Count Number of Pairs With Absolute Difference K 🔗 📝
- 2176. Count Equal and Divisible Pairs in an Array 🔗 📝
|
- 2365. Task Scheduler II 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Hash Table 🔗
- Simulation 🔗
|
- 621. Task Scheduler 🔗 📝
- 849. Maximize Distance to Closest Person 🔗 📝
- 1437. Check If All 1's Are at Least Length K Places Away 🔗 📝
|
- 2366. Minimum Replacements to Sort the Array 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Math 🔗
- Greedy 🔗
|
- 1827. Minimum Operations to Make the Array Increasing 🔗 📝
|
- 2367. Number of Arithmetic Triplets 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Array 🔗
- Hash Table 🔗
- Two Pointers 🔗
- Enumeration 🔗
|
- 1. Two Sum 🔗 📝
- 15. 3Sum 🔗 📝
|
- 2368. Reachable Nodes With Restrictions 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Hash Table 🔗
- Tree 🔗
- Depth-First Search 🔗
- Breadth-First Search 🔗
- Graph 🔗
|
- 752. Open the Lock 🔗 📝
- 1654. Minimum Jumps to Reach Home 🔗 📝
|
- 2369. Check if There is a Valid Partition For The Array 🔗 📝
|
🆓 |
✅ |
⭐️⭐️ |
- Array 🔗
- Dynamic Programming 🔗
|
|
- 2370. Longest Ideal Subsequence 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Hash Table 🔗
- String 🔗
- Dynamic Programming 🔗
|
- 300. Longest Increasing Subsequence 🔗 📝
|
- 2371. Minimize Maximum Value in a Grid 🔗 📝
|
💰 |
|
⭐️⭐️⭐️ |
|
- 135. Candy 🔗 📝
|
- 2372. Calculate the Influence of Each Salesperson 🔗 📝
|
💰 |
|
⭐️⭐️ |
|
|