- 1301. Number of Paths with Max Score 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Dynamic Programming 🔗
- Matrix 🔗
|
|
- 1302. Deepest Leaves Sum 🔗 📝
|
🆓 |
✅ |
⭐️⭐️ |
- Tree 🔗
- Depth-First Search 🔗
- Breadth-First Search 🔗
- Binary Tree 🔗
|
|
- 1303. Find the Team Size 🔗 📝
|
💰 |
|
⭐️ |
- Database 🔗
|
|
- 1304. Find N Unique Integers Sum up to Zero 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Array 🔗
- Math 🔗
|
|
- 1305. All Elements in Two Binary Search Trees 🔗 📝
|
🆓 |
✅ |
⭐️⭐️ |
- Tree 🔗
- Depth-First Search 🔗
- Binary Search Tree 🔗
- Sorting 🔗
- Binary Tree 🔗
|
|
- 1306. Jump Game III 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Depth-First Search 🔗
- Breadth-First Search 🔗
|
- 45. Jump Game II 🔗 📝
- 55. Jump Game 🔗 📝
- 1871. Jump Game VII 🔗 📝
- 2297. Jump Game VIII 🔗 📝
|
- 1307. Verbal Arithmetic Puzzle 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Math 🔗
- String 🔗
- Backtracking 🔗
|
|
- 1308. Running Total for Different Genders 🔗 📝
|
💰 |
|
⭐️⭐️ |
- Database 🔗
|
- 1204. Last Person to Fit in the Bus 🔗 📝
|
- 1309. Decrypt String from Alphabet to Integer Mapping 🔗 📝
|
🆓 |
✅ |
⭐️ |
- String 🔗
|
|
- 1310. XOR Queries of a Subarray 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Bit Manipulation 🔗
- Prefix Sum 🔗
|
|
- 1311. Get Watched Videos by Your Friends 🔗 📝
|
🆓 |
✅ |
⭐️⭐️ |
- Array 🔗
- Hash Table 🔗
- Breadth-First Search 🔗
- Sorting 🔗
|
|
- 1312. Minimum Insertion Steps to Make a String Palindrome 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- String 🔗
- Dynamic Programming 🔗
|
- 2193. Minimum Number of Moves to Make Palindrome 🔗 📝
|
- 1313. Decompress Run-Length Encoded List 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Array 🔗
|
- 443. String Compression 🔗 📝
|
- 1314. Matrix Block Sum 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Matrix 🔗
- Prefix Sum 🔗
|
- 2132. Stamping the Grid 🔗 📝
|
- 1315. Sum of Nodes with Even-Valued Grandparent 🔗 📝
|
🆓 |
✅ |
⭐️⭐️ |
- Tree 🔗
- Depth-First Search 🔗
- Breadth-First Search 🔗
- Binary Tree 🔗
|
|
- 1316. Distinct Echo Substrings 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- String 🔗
- Dynamic Programming 🔗
- Trie 🔗
- Sliding Window 🔗
- Rolling Hash 🔗
- Hash Function 🔗
|
- 2156. Find Substring With Given Hash Value 🔗 📝
|
- 1317. Convert Integer to the Sum of Two No-Zero Integers 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Math 🔗
|
|
- 1318. Minimum Flips to Make a OR b Equal to c 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Bit Manipulation 🔗
|
- 2220. Minimum Bit Flips to Convert Number 🔗 📝
|
- 1319. Number of Operations to Make Network Connected 🔗 📝
|
🆓 |
✅ |
⭐️⭐️ |
- Depth-First Search 🔗
- Breadth-First Search 🔗
- Union Find 🔗
- Graph 🔗
|
|
- 1320. Minimum Distance to Type a Word Using Two Fingers 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- String 🔗
- Dynamic Programming 🔗
|
- 1974. Minimum Time to Type Word Using Special Typewriter 🔗 📝
|
- 1321. Restaurant Growth 🔗 📝
|
💰 |
|
⭐️⭐️ |
- Database 🔗
|
|
- 1322. Ads Performance 🔗 📝
|
💰 |
|
⭐️ |
- Database 🔗
|
|
- 1323. Maximum 69 Number 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Math 🔗
- Greedy 🔗
|
|
- 1324. Print Words Vertically 🔗 📝
|
🆓 |
✅ |
⭐️⭐️ |
- Array 🔗
- String 🔗
- Simulation 🔗
|
|
- 1325. Delete Leaves With a Given Value 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Tree 🔗
- Depth-First Search 🔗
- Binary Tree 🔗
|
|
- 1326. Minimum Number of Taps to Open to Water a Garden 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Dynamic Programming 🔗
- Greedy 🔗
|
|
- 1327. List the Products Ordered in a Period 🔗 📝
|
💰 |
|
⭐️ |
- Database 🔗
|
|
- 1328. Break a Palindrome 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- String 🔗
- Greedy 🔗
|
|
- 1329. Sort the Matrix Diagonally 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Sorting 🔗
- Matrix 🔗
|
|
- 1330. Reverse Subarray To Maximize Array Value 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Math 🔗
- Greedy 🔗
|
|
- 1331. Rank Transform of an Array 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Array 🔗
- Hash Table 🔗
- Sorting 🔗
|
- 1632. Rank Transform of a Matrix 🔗 📝
- 2089. Find Target Indices After Sorting Array 🔗 📝
|
- 1332. Remove Palindromic Subsequences 🔗 📝
|
🆓 |
|
⭐️ |
- Two Pointers 🔗
- String 🔗
|
|
- 1333. Filter Restaurants by Vegan-Friendly, Price and Distance 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Sorting 🔗
|
|
- 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Dynamic Programming 🔗
- Graph 🔗
- Shortest Path 🔗
|
- 2045. Second Minimum Time to Reach Destination 🔗 📝
|
- 1335. Minimum Difficulty of a Job Schedule 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Dynamic Programming 🔗
|
|
- 1336. Number of Transactions per Visit 🔗 📝
|
💰 |
|
⭐️⭐️⭐️ |
- Database 🔗
|
- 1613. Find the Missing IDs 🔗 📝
|
- 1337. The K Weakest Rows in a Matrix 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Array 🔗
- Binary Search 🔗
- Sorting 🔗
- Heap (Priority Queue) 🔗
- Matrix 🔗
|
|
- 1338. Reduce Array Size to The Half 🔗 📝
|
🆓 |
✅ |
⭐️⭐️ |
- Array 🔗
- Hash Table 🔗
- Greedy 🔗
- Sorting 🔗
- Heap (Priority Queue) 🔗
|
|
- 1339. Maximum Product of Splitted Binary Tree 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Tree 🔗
- Depth-First Search 🔗
- Binary Tree 🔗
|
- 2049. Count Nodes With the Highest Score 🔗 📝
|
- 1340. Jump Game V 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Dynamic Programming 🔗
- Sorting 🔗
|
- 1871. Jump Game VII 🔗 📝
- 2297. Jump Game VIII 🔗 📝
|
- 1341. Movie Rating 🔗 📝
|
💰 |
|
⭐️⭐️ |
- Database 🔗
|
|
- 1342. Number of Steps to Reduce a Number to Zero 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Math 🔗
- Bit Manipulation 🔗
|
- 2139. Minimum Moves to Reach Target Score 🔗 📝
- 2169. Count Operations to Obtain Zero 🔗 📝
|
- 1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold 🔗 📝
|
🆓 |
✅ |
⭐️⭐️ |
- Array 🔗
- Sliding Window 🔗
|
- 2090. K Radius Subarray Averages 🔗 📝
|
- 1344. Angle Between Hands of a Clock 🔗 📝
|
🆓 |
✅ |
⭐️⭐️ |
- Math 🔗
|
|
- 1345. Jump Game IV 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Hash Table 🔗
- Breadth-First Search 🔗
|
- 1871. Jump Game VII 🔗 📝
- 2297. Jump Game VIII 🔗 📝
|
- 1346. Check If N and Its Double Exist 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Array 🔗
- Hash Table 🔗
- Two Pointers 🔗
- Binary Search 🔗
- Sorting 🔗
|
- 2154. Keep Multiplying Found Values by Two 🔗 📝
|
- 1347. Minimum Number of Steps to Make Two Strings Anagram 🔗 📝
|
🆓 |
✅ |
⭐️⭐️ |
- Hash Table 🔗
- String 🔗
- Counting 🔗
|
- 1657. Determine if Two Strings Are Close 🔗 📝
- 2186. Minimum Number of Steps to Make Two Strings Anagram II 🔗 📝
|
- 1348. Tweet Counts Per Frequency 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Hash Table 🔗
- Binary Search 🔗
- Design 🔗
- Sorting 🔗
- Ordered Set 🔗
|
- 2254. Design Video Sharing Platform 🔗 📝
|
- 1349. Maximum Students Taking Exam 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Dynamic Programming 🔗
- Bit Manipulation 🔗
- Matrix 🔗
- Bitmask 🔗
|
|
- 1350. Students With Invalid Departments 🔗 📝
|
💰 |
|
⭐️ |
- Database 🔗
|
|
- 1351. Count Negative Numbers in a Sorted Matrix 🔗 📝
|
🆓 |
|
⭐️ |
- Array 🔗
- Binary Search 🔗
- Matrix 🔗
|
|
- 1352. Product of the Last K Numbers 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Math 🔗
- Design 🔗
- Queue 🔗
- Data Stream 🔗
|
|
- 1353. Maximum Number of Events That Can Be Attended 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Greedy 🔗
- Heap (Priority Queue) 🔗
|
- 1751. Maximum Number of Events That Can Be Attended II 🔗 📝
- 2008. Maximum Earnings From Taxi 🔗 📝
|
- 1354. Construct Target Array With Multiple Sums 🔗 📝
|
🆓 |
👀 |
⭐️⭐️⭐️ |
- Array 🔗
- Heap (Priority Queue) 🔗
|
- 2335. Minimum Amount of Time to Fill Cups 🔗 📝
|
- 1355. Activity Participants 🔗 📝
|
💰 |
|
⭐️⭐️ |
- Database 🔗
|
|
- 1356. Sort Integers by The Number of 1 Bits 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Array 🔗
- Bit Manipulation 🔗
- Sorting 🔗
- Counting 🔗
|
- 2099. Find Subsequence of Length K With the Largest Sum 🔗 📝
|
- 1357. Apply Discount Every n Orders 🔗 📝
|
🆓 |
✅ |
⭐️⭐️ |
- Array 🔗
- Hash Table 🔗
- Design 🔗
|
- 2288. Apply Discount to Prices 🔗 📝
|
- 1358. Number of Substrings Containing All Three Characters 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Hash Table 🔗
- String 🔗
- Sliding Window 🔗
|
- 2063. Vowels of All Substrings 🔗 📝
|
- 1359. Count All Valid Pickup and Delivery Options 🔗 📝
|
🆓 |
✅ |
⭐️⭐️⭐️ |
- Math 🔗
- Dynamic Programming 🔗
- Combinatorics 🔗
|
|
- 1360. Number of Days Between Two Dates 🔗 📝
|
🆓 |
|
⭐️ |
- Math 🔗
- String 🔗
|
|
- 1361. Validate Binary Tree Nodes 🔗 📝
|
🆓 |
✅ |
⭐️⭐️ |
- Tree 🔗
- Depth-First Search 🔗
- Breadth-First Search 🔗
- Union Find 🔗
- Graph 🔗
- Binary Tree 🔗
|
|
- 1362. Closest Divisors 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Math 🔗
|
|
- 1363. Largest Multiple of Three 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Dynamic Programming 🔗
- Greedy 🔗
|
|
- 1364. Number of Trusted Contacts of a Customer 🔗 📝
|
💰 |
|
⭐️⭐️ |
- Database 🔗
|
|
- 1365. How Many Numbers Are Smaller Than the Current Number 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Array 🔗
- Hash Table 🔗
- Sorting 🔗
- Counting 🔗
|
- 315. Count of Smaller Numbers After Self 🔗 📝
|
- 1366. Rank Teams by Votes 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Hash Table 🔗
- String 🔗
- Sorting 🔗
- Counting 🔗
|
- 911. Online Election 🔗 📝
|
- 1367. Linked List in Binary Tree 🔗 📝
|
🆓 |
✅ |
⭐️⭐️ |
- Linked List 🔗
- Tree 🔗
- Depth-First Search 🔗
- Breadth-First Search 🔗
- Binary Tree 🔗
|
|
- 1368. Minimum Cost to Make at Least One Valid Path in a Grid 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Breadth-First Search 🔗
- Graph 🔗
- Heap (Priority Queue) 🔗
- Matrix 🔗
- Shortest Path 🔗
|
- 2203. Minimum Weighted Subgraph With the Required Paths 🔗 📝
|
- 1369. Get the Second Most Recent Activity 🔗 📝
|
💰 |
|
⭐️⭐️⭐️ |
- Database 🔗
|
|
- 1370. Increasing Decreasing String 🔗 📝
|
🆓 |
|
⭐️ |
- Hash Table 🔗
- String 🔗
- Counting 🔗
|
|
- 1371. Find the Longest Substring Containing Vowels in Even Counts 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Hash Table 🔗
- String 🔗
- Bit Manipulation 🔗
- Prefix Sum 🔗
|
|
- 1372. Longest ZigZag Path in a Binary Tree 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Dynamic Programming 🔗
- Tree 🔗
- Depth-First Search 🔗
- Binary Tree 🔗
|
|
- 1373. Maximum Sum BST in Binary Tree 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Dynamic Programming 🔗
- Tree 🔗
- Depth-First Search 🔗
- Binary Search Tree 🔗
- Binary Tree 🔗
|
|
- 1374. Generate a String With Characters That Have Odd Counts 🔗 📝
|
🆓 |
✅ |
⭐️ |
- String 🔗
|
|
- 1375. Number of Times Binary String Is Prefix-Aligned 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
|
- 319. Bulb Switcher 🔗 📝
- 672. Bulb Switcher II 🔗 📝
|
- 1376. Time Needed to Inform All Employees 🔗 📝
|
🆓 |
✅ |
⭐️⭐️ |
- Tree 🔗
- Depth-First Search 🔗
- Breadth-First Search 🔗
|
- 104. Maximum Depth of Binary Tree 🔗 📝
- 124. Binary Tree Maximum Path Sum 🔗 📝
|
- 1377. Frog Position After T Seconds 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Tree 🔗
- Depth-First Search 🔗
- Breadth-First Search 🔗
- Graph 🔗
|
|
- 1378. Replace Employee ID With The Unique Identifier 🔗 📝
|
💰 |
|
⭐️ |
- Database 🔗
|
|
- 1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Tree 🔗
- Depth-First Search 🔗
- Breadth-First Search 🔗
- Binary Tree 🔗
|
|
- 1380. Lucky Numbers in a Matrix 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Array 🔗
- Matrix 🔗
|
|
- 1381. Design a Stack With Increment Operation 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Stack 🔗
- Design 🔗
|
|
- 1382. Balance a Binary Search Tree 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Divide and Conquer 🔗
- Greedy 🔗
- Tree 🔗
- Depth-First Search 🔗
- Binary Search Tree 🔗
- Binary Tree 🔗
|
|
- 1383. Maximum Performance of a Team 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Greedy 🔗
- Sorting 🔗
- Heap (Priority Queue) 🔗
|
- 2106. Maximum Fruits Harvested After at Most K Steps 🔗 📝
|
- 1384. Total Sales Amount by Year 🔗 📝
|
💰 |
|
⭐️⭐️⭐️ |
- Database 🔗
|
|
- 1385. Find the Distance Value Between Two Arrays 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Array 🔗
- Two Pointers 🔗
- Binary Search 🔗
- Sorting 🔗
|
|
- 1386. Cinema Seat Allocation 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Hash Table 🔗
- Greedy 🔗
- Bit Manipulation 🔗
|
- 2286. Booking Concert Tickets in Groups 🔗 📝
|
- 1387. Sort Integers by The Power Value 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Dynamic Programming 🔗
- Memoization 🔗
- Sorting 🔗
|
|
- 1388. Pizza With 3n Slices 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- Array 🔗
- Dynamic Programming 🔗
- Greedy 🔗
- Heap (Priority Queue) 🔗
|
|
- 1389. Create Target Array in the Given Order 🔗 📝
|
🆓 |
👀 |
⭐️ |
- Array 🔗
- Simulation 🔗
|
|
- 1390. Four Divisors 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Math 🔗
|
|
- 1391. Check if There is a Valid Path in a Grid 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Depth-First Search 🔗
- Breadth-First Search 🔗
- Union Find 🔗
- Matrix 🔗
|
- 2267.Check if There Is a Valid Parentheses String Path 🔗 📝
|
- 1392. Longest Happy Prefix 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- String 🔗
- Rolling Hash 🔗
- String Matching 🔗
- Hash Function 🔗
|
- 2223. Sum of Scores of Built Strings 🔗 📝
|
- 1393. Capital Gain/Loss 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Database 🔗
|
|
- 1394. Find Lucky Integer in an Array 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Array 🔗
- Hash Table 🔗
- Counting 🔗
|
|
- 1395. Count Number of Teams 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Array 🔗
- Dynamic Programming 🔗
- Binary Indexed Tree 🔗
|
|
- 1396. Design Underground System 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Hash Table 🔗
- String 🔗
- Design 🔗
|
- 2166. Design Bitset 🔗 📝
|
- 1397. Find All Good Strings 🔗 📝
|
🆓 |
|
⭐️⭐️⭐️ |
- String 🔗
- Dynamic Programming 🔗
- String Matching 🔗
|
|
- 1398. Customers Who Bought Products A and B but Not C 🔗 📝
|
💰 |
|
⭐️⭐️ |
- Database 🔗
|
|
- 1399. Count Largest Group 🔗 📝
|
🆓 |
✅ |
⭐️ |
- Hash Table 🔗
- Math 🔗
|
|
- 1400. Construct K Palindrome Strings 🔗 📝
|
🆓 |
|
⭐️⭐️ |
- Hash Table 🔗
- String 🔗
- Greedy 🔗
- Counting 🔗
|
|