| Find Third Transaction |
Medium
|
|
|
| Flight Occupancy and Waitlist Analysis |
Medium
|
|
|
| Friday Purchases I |
Medium
|
|
|
| Height of Special Binary Tree |
Medium
|
|
|
| Immediate Food Delivery III |
Medium
|
|
|
| Is Array a Preorder of Some ‌Binary Tree |
Medium
|
|
|
| JSON Deep Equal |
Medium
|
|
|
| Make Object Immutable |
Medium
|
|
|
| Make the Prefix Sum Non-negative |
Medium
|
|
|
| Manager of the Largest Department |
Medium
|
|
|
| Maximal Range That Each Element Is Maximum in It |
Medium
|
|
|
| Maximum Length of Semi-Decreasing Subarrays |
Medium
|
|
|
| Maximum Number of Integers to Choose From a Range II |
Medium
|
|
|
| Maximum Profitable Triplets With Increasing Prices I |
Medium
|
|
|
| Most Expensive Item That Can Not Be Bought |
Medium
|
|
|
| Number of Divisible Triplet Sums |
Medium
|
|
|
| Number of Equal Numbers Blocks |
Medium
|
|
|
| Number of Good Binary Strings |
Medium
|
|
|
| Number of Self-Divisible Permutations |
Medium
|
|
|
| Promise Pool |
Medium
|
|
|
| Smallest Number With Given Digit Product |
Medium
|
|
|
| The Knight’s Tour |
Medium
|
|
|
| Account Balance |
Medium
|
|
|
| Choose Edges to Maximize Score in a Tree |
Medium
|
|
|
| Count Positions on Street With Required Brightness |
Medium
|
|
|
| Count Strictly Increasing Subarrays |
Medium
|
|
|
| Design SQL |
Medium
|
|
|
| Drop Type 1 Orders for Customers With Type 0 Orders |
Medium
|
|
|
| Elements in Array After Removing and Replacing Elements |
Medium
|
|
|
| Jump Game VIII |
Medium
|
|
|
| Maximize Total Tastiness of Purchased Fruits |
Medium
|
|
|
| Maximum Alternating Subarray Sum |
Medium
|
|
|
| Maximum Profit From Trading Stocks |
Medium
|
|
|
| Maximum Sum Score of Array |
Medium
|
|
|
| Merge Operations to Turn Array Into a Palindrome |
Medium
|
|
|
| Minimum Adjacent Swaps to Make a Valid Array |
Medium
|
|
|
| Minimum Cost to Buy Apples |
Medium
|
|
|
| Minimum Cost to Reach City With Discounts |
Medium
|
|
|
| Minimum Cost to Separate Sentence Into Rows |
Medium
|
|
|
| Minimum Number of Lines to Cover Points |
Medium
|
|
|
| Minimum Split Into Subarrays With GCD Greater Than One |
Medium
|
|
|
| Minimum Subarrays in a Valid Split |
Medium
|
|
|
| Number of Accounts That Did Not Stream |
Medium
|
|
|
| Number of People That Can Be Seen in a Grid |
Medium
|
|
|
| Number of Spaces Cleaning Robot Cleaned |
Medium
|
|
|
| Number of Subarrays Having Even Product |
Medium
|
|
|
| Number of Ways to Build House of Cards |
Medium
|
|
|
| Number of Ways to Build Sturdy Brick Wall |
Medium
|
|
|
| Order Two Columns Independently |
Medium
|
|
|
| Paths in Maze That Lead to Same Room |
Medium
|
|
|