| Calculate Score After Performing Instructions |
Medium
|
|
|
| Find Subsequence of Length K With the Largest Sum |
Easy
|
|
|
| Longest Subsequence Repeated k Times |
Hard
|
|
|
| Kth Smallest Product of Two Sorted Arrays |
Hard
|
|
|
| Sum of k-Mirror Numbers |
Hard
|
|
|
| Divide a String Into Groups of Size k |
Easy
|
|
|
| Minimum Deletions to Make String K-Special |
Medium
|
|
|
| Maximum Manhattan Distance After K Changes |
Medium
|
|
|
| Partition Array Such That Maximum Difference Is K |
Medium
|
|
|
| Divide Array Into Arrays With Max Difference |
Medium
|
|
|
| Count the Number of Arrays with K Matching Adjacent Elements |
Hard
|
|
|
| Maximum Difference Between Increasing Elements |
Easy
|
|
|
| Max Difference You Can Get From Changing an Integer |
Medium
|
|
|
| Maximum Difference by Remapping a Digit |
Easy
|
|
|
| Maximum Difference Between Adjacent Elements in a Circular Array |
Easy
|
|
|
| Maximum Difference Between Even and Odd Frequency II |
Hard
|
|
|
| Maximum Difference Between Even and Odd Frequency I |
Easy
|
|
|
| Using a Robot to Print the Lexicographically Smallest String |
Medium
|
|
|
| Apply Substitutions |
Medium
|
|
|
| Find the Lexicographically Largest String From the Box I |
Medium
|
|
|
| Angle Between Hands of a Clock |
Medium
|
amazon
microsoft
|
|
| Ant on the Boundary |
Easy
|
|
|
| Amount of Time for Binary Tree to Be Infected |
Medium
|
|
|
| Ambiguous Coordinates |
Medium
|
google
|
|
| Distribute Candies Among Children III |
Hard
|
|
|
| Distribute Candies Among Children I |
Easy
|
|
|
| Distribute Candies |
Easy
|
liveramp
microsoft
|
|
| Maximum Candies You Can Get from Boxes |
Hard
|
airbnb
|
|
| Alternating Groups 3 |
Hard
|
|
|
| Alternating Groups 1 |
Easy
|
|
|
| Alphabet Board Path |
Medium
|
google
zulily
|
|
| All Divisions With the Highest Score of a Binary Array |
Medium
|
|
|
| All Elements in Two Binary Search Trees |
Medium
|
amazon
facebook
oracle
|
|
| Alert Using Same Key-Card Three or More Times in a One Hour Period |
Medium
|
|
|
| Advantage Shuffle |
Medium
|
|
|
| Adjacent Increasing Subarrays Detection II |
Medium
|
|
|
| Adjacent Increasing Subarrays Detection I |
Easy
|
|
|
| Adding Two Negabinary Numbers |
Medium
|
grab
|
|
| Add Minimum Number of Rungs |
Medium
|
|
|
| Add Edges to Make Degrees of All Nodes Even |
Hard
|
|
|
| Account Balance After Rounded Purchase |
Easy
|
|
|
| Abbreviating the Product of a Range |
Hard
|
|
|
| Distribute Candies Among Children II |
Medium
|
|
|
| 1-bit and 2-bit Characters |
Easy
|
google
ixl
microsoft
quora
|
|
| 24 Game |
Hard
|
amazon
facebook
google
microsoft
twitter
uber
|
|
| 4 Keys Keyboard |
Medium
|
google
microsoft
|
|
| 3Sum With Multiplicity |
Medium
|
quora
|
|
| Maximize the Number of Target Nodes After Connecting Trees II |
Hard
|
|
|
| Maximize the Number of Target Nodes After Connecting Trees I |
Medium
|
|
|
| Divisible and Non-divisible Sums Difference |
Easy
|
|
|