| Alice Joins Probability Student Club by Calculating Expected Values of Probabilistic Games |
Hard
|
two-sigma
|
|
| Length of the longest path in a weighted tree |
Hard
|
uber
|
|
| Minimum Cost to Make at Least One Valid Path in a Grid |
Hard
|
google
|
|
| Sort a list using reverse sublist operation |
Hard
|
|
|
| Implement 3 stacks in 1 list |
Hard
|
microsoft
|
|
| Find all starting indices of anagrams of a word in a string |
Hard
|
|
|
| Find Minimum Diameter After Merging Two Trees |
Hard
|
|
|
| Maximum Number of K-Divisible Components |
Hard
|
|
|
| Alien Dictionary |
Hard
|
airbnb
amazon
apple
bloomberg
cohesity
doordash
facebook
flipkart
google
microsoft
pinterest
pocket-gems
snapchat
square
twitter
uber
vmware
|
|
| Amount of New Area Painted Each Day |
Hard
|
|
|
| Create Sorted Array through Instructions |
Hard
|
|
|
| Delivering Boxes from Storage to Ports |
Hard
|
|
|
| Falling Squares |
Hard
|
amazon
square
uber
|
|
| Fancy Sequence |
Hard
|
|
|
| Longest Substring of One Repeating Character |
Hard
|
|
|
| Minimum Possible Integer After at Most K Adjacent Swaps On Digits |
Hard
|
|
|
| My Calendar 3 |
Hard
|
amazon
google
|
|
| Apply Operations on Array to Maximize Sum of Squares |
Hard
|
|
|
| Beautiful Pairs |
Hard
|
|
|
| Block Placement Queries |
Hard
|
|
|
| Bricks Falling When Hit |
Hard
|
google
|
|
| Build Binary Expression Tree From Infix Expression |
Hard
|
|
|
| Check if DFS Strings Are Palindromes |
Hard
|
|
|
| Check If String Is Transformable With Substring Sort Operations |
Hard
|
|
|
| Check if There Is a Valid Parentheses String Path |
Hard
|
|
|
| Checking Existence of Edge Length Limited Paths II |
Hard
|
|
|
| Choose Numbers From Two Arrays in Range |
Hard
|
|
|
| Closest Room |
Hard
|
|
|
| Coin Path |
Hard
|
google
|
|
| Collect Coins in a Tree |
Hard
|
|
|
| Confusing Number II |
Hard
|
google
|
|
| Construct String with Minimum Cost |
Hard
|
|
|
| Convert JSON String to Object |
Hard
|
|
|
| Count Almost Equal Pairs II |
Hard
|
|
|
| Count Anagrams |
Hard
|
|
|
| Count Complete Substrings |
Hard
|
|
|
| Count Houses in a Circular Street II |
Hard
|
|
|
| Count Pairs With XOR in a Range |
Hard
|
|
|
| Count Palindromic Subsequences |
Hard
|
|
|
| Count Special Integers |
Hard
|
|
|
| Count Substrings That Can Be Rearranged to Contain a String II |
Hard
|
|
|
| Count Substrings That Satisfy K-Constraint II |
Hard
|
|
|
| Count the Number of Good Partitions |
Hard
|
|
|
| Count the Number of Incremovable Subarrays II |
Hard
|
|
|
| Count the Number of Infection Sequences |
Hard
|
|
|
| Count the Number of Inversions |
Hard
|
|
|
| Count the Number of K-Big Indices |
Hard
|
|
|
| Count the Number of Powerful Integers |
Hard
|
|
|
| Find Building Where Alice and Bob Can Meet |
Hard
|
|
|
| Find the Original Typed String II |
Hard
|
|
|