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
|
|
|
Largest Color Value in a Directed Graph |
Hard
|
|
|
Find Words Containing Character |
Easy
|
|
|
Find the Maximum Sum of Node Values |
Hard
|
|
|
Print all unique substrings of a given string |
|
|
|
Print all substrings of a given string |
Easy
|
|
|
Number of elements greater than K in the range L to R |
Medium
|
|
|
Print Expression Tree Graphically |
|
|
|
Painting a Grid With Three Different Colors |
Hard
|
|
|
Longest Unequal Adjacent Groups Subsequence II |
Medium
|
|
|
Longest Unequal Adjacent Groups Subsequence I |
Easy
|
|
|
Total Characters in String After Transformations II |
Hard
|
|
|
Total Characters in String After Transformations I |
Medium
|
|
|
Finding 3-Digit Even Numbers |
Easy
|
|
|
Count Number of Balanced Permutations |
Hard
|
|
|
Find Minimum Time to Reach Last Room II |
Medium
|
|
|
Find Minimum Time to Reach Last Room I |
Medium
|
|
|
Minimum Domino Rotations For Equal Row |
Medium
|
amazon
google
|
|
Push Dominoes |
Medium
|
google
|
|
Maximum Number of Tasks You Can Assign |
Hard
|
|
|
Count Subarrays With Score Less Than K |
Hard
|
|
|
Count Subarrays With Fixed Bounds |
Hard
|
|
|
Count of Interesting Subarrays |
Medium
|
|
|
Count Complete Subarrays in an Array |
Medium
|
|
|
Count Largest Group |
Easy
|
|
|
Count the Number of Ideal Arrays |
Hard
|
|
|
Count the Hidden Sequences |
Medium
|
|
|
Rabbits in Forest |
Medium
|
wish
|
|
Count Equal and Divisible Pairs in an Array |
Easy
|
|
|
Count the Number of Good Subarrays |
Medium
|
|
|
Count Good Triplets in an Array |
Hard
|
|
|