| Count Valid Paths in a Tree |
Hard
|
|
|
| Count Ways to Build Rooms in an Ant Colony |
Hard
|
|
|
| Count Ways to Distribute Candies |
Hard
|
|
|
| Count Ways to Make Array With Product |
Hard
|
|
|
| Create Components With Same Value |
Hard
|
|
|
| Cut Off Trees for Golf Event |
Hard
|
amazon
|
|
| Cycle Length Queries in a Tree |
Hard
|
|
|
| Design Cancellable Function |
Hard
|
|
|
| Design Excel Sum Formula |
Hard
|
amazon
microsoft
|
|
| Difference Between Maximum and Minimum Price Sum |
Hard
|
|
|
| Dinner Plate Stacks |
Hard
|
amazon
bytedance
|
|
| Distance to a Cycle in Undirected Graph |
Hard
|
|
|
| Distinct Echo Substrings |
Hard
|
google
|
|
| Divide an Array Into Subarrays With Minimum Cost II |
Hard
|
|
|
| Divide Array Into Increasing Sequences |
Hard
|
google
|
|
| Dynamic Pivoting of a Table |
Hard
|
|
|
| Erect the Fence II |
Hard
|
|
|
| Escape the Spreading Fire |
Hard
|
|
|
| Find Array Given Subset Sums |
Hard
|
|
|
| Find Building Where Alice and Bob Can Meet |
Hard
|
|
|
| Find Edges in Shortest Paths |
Hard
|
|
|
| Find Maximum Non-decreasing Array Length |
Hard
|
|
|
| Find Median Given Frequency of Numbers |
Hard
|
pinterest
|
|
| Find Number of Coins to Place in Tree Nodes |
Hard
|
|
|
| Find the Count of Monotonic Pairs I |
Hard
|
|
|
| Find the Count of Monotonic Pairs II |
Hard
|
|
|
| Find the Kth Smallest Sum of a Matrix With Sorted Rows |
Hard
|
facebook
|
|
| Find the Last Marked Nodes in Tree |
Hard
|
|
|
| Find the Longest Valid Obstacle Course at Each Position |
Hard
|
|
|
| Find the Minimum Area to Cover All Ones II |
Hard
|
|
|
| Find the Minimum Cost Array Permutation |
Hard
|
|
|
| Find the Number of Ways to Place People II |
Hard
|
|
|
| Find the Original Typed String II |
Hard
|
|
|
| Find the Quiet Students in All Exams |
Hard
|
|
|
| Find the String with LCP |
Hard
|
|
|
| Find the Subtasks That Did Not Execute |
Hard
|
|
|
| Find Top Scoring Students II |
Hard
|
|
|
| Find Trending Hashtags II |
Hard
|
|
|
| Finding MK Average |
Hard
|
|
|
| First Letter Capitalization |
Hard
|
|
|
| GCD Sort of an Array |
Hard
|
|
|
| Get the Maximum Score |
Hard
|
|
|
| Graph Connectivity With Threshold |
Hard
|
|
|
| Grid Illumination |
Hard
|
dropbox
|
|
| Minimum Time to Visit a Cell In a Grid |
Hard
|
|
|
| Stone Game VIII |
Hard
|
|
|
| Strange Printer II |
Hard
|
|
|
| String Transformation |
Hard
|
|
|
| Subarrays Distinct Element Sum of Squares II |
Hard
|
|
|
| Subsequence With the Minimum Score |
Hard
|
|
|