| Count K-Reducible Numbers Less Than N |
Hard
|
|
|
| Count K-Subsequences of a String With Maximum Beauty |
Hard
|
|
|
| Count Number of Possible Root Nodes |
Hard
|
|
|
| Count Number of Special Subsequences |
Hard
|
|
|
| Count of Sub-Multisets With Bounded Sum |
Hard
|
|
|
| Count Pairs Of Nodes |
Hard
|
|
|
| Count Paths That Can Form a Palindrome in a Tree |
Hard
|
|
|
| Count Stepping Numbers in Range |
Hard
|
|
|
| Count Subtrees With Max Distance Between Cities |
Hard
|
|
|
| Count the Number of Houses at a Certain Distance II |
Hard
|
|
|
| Count The Number of Winning Sequences |
Hard
|
|
|
| Count Unique Characters of All Substrings of a Given String |
Hard
|
forusall
microsoft
twitch
|
|
| Count Visited Nodes in a Directed Graph |
Hard
|
|
|
| Couples Holding Hands |
Hard
|
amazon
google
|
|
| Delete Duplicate Folders in System |
Hard
|
|
|
| Design a Text Editor |
Hard
|
|
|
| Design Movie Rental System |
Hard
|
|
|
| Distribute Elements Into Two Arrays II |
Hard
|
|
|
| Earliest Second to Mark Indices II |
Hard
|
|
|
| Encrypt and Decrypt Strings |
Hard
|
|
|
| Equal Rational Numbers |
Hard
|
microsoft
|
|
| Erect the Fence |
Hard
|
google
|
|
| Escape a Large Maze |
Hard
|
google
uipath
|
|
| Find a Good Subset of the Matrix |
Hard
|
|
|
| Find All People With Secret |
Hard
|
|
|
| Find All Possible Stable Binary Arrays II |
Hard
|
|
|
| Find Beautiful Indices in the Given Array II |
Hard
|
|
|
| Find Number of Ways to Reach the K-th Stair |
Hard
|
|
|
| Find Products of Elements of Big Array |
Hard
|
|
|
| Find Servers That Handled Most Number of Requests |
Hard
|
|
|
| Find Subarray With Bitwise OR Closest to K |
Hard
|
|
|
| Find Substring With Given Hash Value |
Hard
|
|
|
| Find the K-Sum of an Array |
Hard
|
|
|
| Find the K-th Character in String Game II |
Hard
|
|
|
| Find the Largest Palindrome Divisible by K |
Hard
|
|
|
| Find the Maximum Length of a Good Subsequence II |
Hard
|
|
|
| Find the Maximum Number of Fruits Collected |
Hard
|
|
|
| Find the Maximum Sequence Value of Array |
Hard
|
|
|
| Find the Median of the Uniqueness Array |
Hard
|
|
|
| Find the Number of Possible Ways for an Event |
Hard
|
|
|
| Find the Number of Subarrays Where Boundary Elements Are Maximum |
Hard
|
|
|
| Find the Number of Subsequences With Equal GCD |
Hard
|
|
|
| Find the Occurrence of First Almost Equal Substring |
Hard
|
|
|
| Find the Sum of Subsequence Powers |
Hard
|
|
|
| Find the Sum of the Power of All Subsequences |
Hard
|
|
|
| Find X-Sum of All K-Long Subarrays II |
Hard
|
|
|
| Find XOR Sum of All Pairs Bitwise AND |
Hard
|
|
|
| Frog Position After T Seconds |
Hard
|
google
|
|
| Greatest Common Divisor Traversal |
Hard
|
|
|
| Groups of Strings |
Hard
|
|
|