| Minimum Swaps To Make Sequences Increasing | Hard | amazon
facebook
google | |
| Minimum Vertex Cover | Hard | | |
| Non-negative Integers without Consecutive Ones | Hard | pocket-gems | |
| Number of Digit One | Hard | amazon
apple | |
| Number of Islands II | Hard | amazon
facebook
google
microsoft
oracle
snapchat
uber | |
| Number of Music Playlists | Hard | coursera
google
twitter
apple | |
| Number of Paths with Max Score | Hard | samsung | |
| Number of Ways to Rearrange Sticks With K Sticks Visible | Hard | facebook | |
| Number of Ways to Wear Different Hats to Each Other | Hard | | |
| Numbers At Most N Given Digit Set | Hard | amazon | |
| Numbers Of Length N and Values Less Than K | Hard | google | |
| Numbers With Repeated Digits | Hard | google | |
| Pizza With 3n Slices | Hard | google | |
| Poor Pigs | Hard | | |
| Race Car | Hard | google | |
| Randomly generate m integers from an array of size n | Hard | | |
| Reachable Nodes In Subdivided Graph | Hard | | |
| Reaching Points | Hard | coursera
goldman-sachs
google
quora
salesforce
twitter
uber | |
| Restore The Array | Hard | | |
| Russian Doll Envelopes | Hard | amazon
google
microsoft | |
| Self Crossing | Hard | amazon
google | |
| Shortest Distance from All Buildings | Hard | amazon
bytedance
facebook
goldman-sachs
google
mathworks
microsoft
snapchat
splunk
uber
zenefits | |
| Shortest Path Visiting All Nodes | Hard | amazon
google
meituan | |
| Sliding Window Minimum | Hard | | |
| Smallest Integer Having At Least N Divisors | Hard | | |
| Smallest Range Covering Elements from K Lists | Hard | amazon
apple
facebook
google
lyft
microsoft
pinterest
snapchat | |
| Smallest Sufficient Team | Hard | google | |
| Stone Game III | Hard | google | |
| Stone Game IV | Hard | microsoft | |
| Stone Game V | Hard | | |
| Swim in Rising Water | Hard | facebook
google | |
| Tallest Billboard | Hard | | |
| Traveling Salesman Problem | Hard | | |
| Triples with Bitwise AND Equal To Zero | Hard | flipkart
google | |
| Valid Permutations for DI Sequence | Hard | | |
| Painting a Grid With Three Different Colors | Hard | | |
| Total Characters in String After Transformations II | Hard | | |
| Count Number of Balanced Permutations | Hard | | |
| Maximum Number of Tasks You Can Assign | Hard | | |
| Count Subarrays With Score Less Than K | Hard | | |
| Count Subarrays With Fixed Bounds | Hard | | |
| Count the Number of Ideal Arrays | Hard | | |
| Count Good Triplets in an Array | Hard | | |
| Find the Count of Good Integers | Hard | | |
| Design and implement Connect 4 | Hard | salesforce | |
| Count of Range Sum | Hard | google | |
| Online Majority Element In Subarray | Hard | google
nutanix | |
| Super Egg Drop | Hard | facebook
goldman-sachs
google
microsoft | |
| Put Marbles in Bags | Hard | | |
| Apply Operations to Maximize Score | Hard | | |