1266 | Minimum Time Visiting All Points | Easy |
1269 | Number of Ways to Stay in the Same Place After Some Steps | Hard |
1282 | Group the People Given the Group Size They Belong To | Medium |
1287 | Element Appearing More Than 25% In Sorted Array | Easy |
1289 | Minimum Falling Path Sum II | Hard |
1291 | Sequential Digits | Medium |
1318 | Minimum Flips to Make a OR b Equal to c | Medium |
1335 | Minimum Difficulty of a Job Schedule | Hard |
1341 | Split a String in Balanced Strings | Easy |
1347 | Minimum Number of Steps to Make Two Strings Anagram | Medium |
1359 | Count All Valid Pickup and Delivery Options | Hard |
1361 | Validate Binary Tree Nodes | Medium |
1420 | Build Array Where You Can Find The Maximum Exactly K Comparisons | Hard |
1422 | Maximum Score After Splitting a String | Easy |
1424 | Diagonal Traverse II | Medium |
1425 | Constrained Subsequence Sum | Hard |
1436 | Destination City | Easy |
1441 | Build an Array With Stack Operations | Medium |
1443 | Minimum Time to Collect All Apples in a Tree | Medium |
1456 | Maximum Number of Vowels in a Substring of Given Length | Medium |
1457 | Pseudo-Palindromic Paths in a Binary Tree | Medium |
1458 | Max Dot Product of Two Subsequences | Hard |
1464 | Maximum Product of Two Elements in an Array | Easy |
1475 | Final Prices With a Special Discount in a Shop | Easy |
1481 | Least Number of Unique Integers after K Removals | Medium |
1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard |
1493 | Longest Subarray of 1's After Deleting One Element | Medium |
1496 | Path Crossing | Easy |
1498 | Number of Subsequences That Satisfy the Given Sum Condition | Medium |
1502 | Can Make Arithmetic Progression From Sequence | Easy |