Next Bigger Integer with Same Number of 1-Bits |
Medium
|
facebook
|
|
Implement Elo Rating System |
Medium
|
facebook
|
|
Qux Color Transformation |
Medium
|
facebook
|
|
Minimum and Maximum in an array with Optimal Comparisons |
Medium
|
facebook
|
|
All Elements in Two Binary Search Trees |
Medium
|
amazon
facebook
oracle
|
|
24 Game |
Hard
|
amazon
facebook
google
microsoft
twitter
uber
|
|
Bulb Switcher |
Medium
|
amazon
facebook
mathworks
|
|
Count Different Palindromic Subsequences |
Hard
|
facebook
google
linkedin
pure-storage
|
|
Data Stream as Disjoint Intervals |
Hard
|
amazon
facebook
google
oracle
|
|
Design Snake Game |
Medium
|
amazon
apple
bloomberg
facebook
google
salesforce
uber
zillow
|
|
Find if there is a path between two vertices in a directed graph |
Easy
|
google
facebook
amazon
microsoft
|
|
Find K Pairs with Smallest Sums |
Medium
|
amazon
apple
facebook
google
linkedin
microsoft
uber
|
|
Flatten 2D Vector |
Medium
|
airbnb
apple
facebook
google
lyft
salesforce
twitter
uber
zenefits
|
|
Frog Jump |
Hard
|
amazon
apple
bytedance
facebook
google
microsoft
nutanix
oracle
snapchat
|
|
Insert Delete Search and GetRandom in Constant Time 1 - Dupes not allowed |
Medium
|
adobe
affirm
amazon
appdynamics
apple
bloomberg
databricks
facebook
flipkart
goldman-sachs
google
indeed
linkedin
microsoft
oracle
pinterest
pocket-gems
pure-storage
quora
salesforce
twilio
twitter
two-sigma
uber
visa
vmware
yandex
yelp
|
|
Insert Delete Search and GetRandom in Constant Time 2 - Duplicates allowed |
Hard
|
affirm
amazon
apple
databricks
facebook
google
linkedin
microsoft
uber
yelp
|
|
Largest Plus Sign |
Medium
|
facebook
google
|
|
Letter Case Permutation |
Medium
|
amazon
bloomberg
facebook
microsoft
spotify
yelp
|
|
Longest Increasing Path in a Matrix |
Hard
|
adobe
amazon
apple
bloomberg
bytedance
facebook
google
microsoft
snapchat
uber
|
|
Max Sum of Rectangle No Larger Than K |
Hard
|
facebook
google
|
|
Maximum Length of Pair Chain |
Medium
|
amazon
bloomberg
facebook
uber
|
|
Minimum Swaps To Make Sequences Increasing |
Hard
|
amazon
facebook
google
|
|
Minimum Time to Collect All Apples in a Tree |
Medium
|
facebook
|
|
Number of Islands II |
Hard
|
amazon
facebook
google
microsoft
oracle
snapchat
uber
|
|
Number of Longest Increasing Subsequence |
Medium
|
amazon
bloomberg
facebook
|
|
Number of Ways to Rearrange Sticks With K Sticks Visible |
Hard
|
facebook
|
|
Queue Reconstruction by Height |
Medium
|
amazon
apple
bloomberg
bytedance
facebook
google
microsoft
|
|
Random Pick with Weight |
Medium
|
amazon
apple
atlassian
doordash
facebook
google
linkedin
microsoft
rubrik
tripadvisor
twitter
two-sigma
uber
wish
yelp
|
|
Rearranging Array Elements by Index Mapping |
Medium
|
facebook
|
|
Remove All Adjacent Duplicates in String 2 |
Medium
|
bloomberg
facebook
factset
goldman-sachs
google
vmware
|
|
Shortest Bridge |
Medium
|
facebook
google
mckinsey
microsoft
uber
|
|
Shortest Distance from All Buildings |
Hard
|
amazon
bytedance
facebook
goldman-sachs
google
mathworks
microsoft
snapchat
splunk
uber
zenefits
|
|
Shuffle an Array |
Medium
|
amazon
apple
bloomberg
cisco
facebook
google
linkedin
microsoft
salesforce
tripadvisor
two-sigma
yahoo
|
|
Smallest Range Covering Elements from K Lists |
Hard
|
amazon
apple
facebook
google
lyft
microsoft
pinterest
snapchat
|
|
Sort Array By Parity |
Easy
|
amazon
apple
cisco
facebook
google
microsoft
oracle
vmware
|
|
Sort Transformed Array |
Medium
|
facebook
google
|
|
Swim in Rising Water |
Hard
|
facebook
google
|
|
Third Maximum Number |
Easy
|
amazon
bloomberg
facebook
google
microsoft
|
|
Two City Scheduling |
Medium
|
amazon
bloomberg
facebook
google
|
|
Walls and Gates |
Medium
|
amazon
apple
bloomberg
bytedance
facebook
google
microsoft
spotify
uber
|
|
Wiggle Sort 2 - No Adjacent Duplicates |
Medium
|
airbnb
akuna-capital
facebook
google
paypal
|
|
Wiggle Subsequence |
Medium
|
amazon
facebook
uber
|
|
Range Sum Query 2D - Mutable |
Medium
|
facebook
google
microsoft
|
|
Super Egg Drop |
Hard
|
facebook
goldman-sachs
google
microsoft
|
|
Lowest Common Ancestor of Deepest Leaves |
Medium
|
bloomberg
facebook
google
|
|
Construct Binary Tree from Preorder and Postorder Traversal |
Medium
|
amazon
bloomberg
facebook
google
uber
|
|
Making A Large Island |
Hard
|
amazon
facebook
google
uber
|
|
Balance Parentheses with Minimum Insertions and Deletions |
Hard
|
facebook
|
|
Check if a graph is minimally-connected |
Medium
|
facebook
|
|
Validate Mastermind Game Guesses |
Medium
|
facebook
|
|