| Concatenation of Consecutive Binary Numbers |
Medium
|
|
|
| Maximum Level Sum of a Binary Tree |
Medium
|
amazon
google
|
|
| Maximum Value at a Given Index in a Bounded Array |
Medium
|
|
|
| Minimum Flips to Make a OR b Equal to c |
Medium
|
microsoft
|
|
| Total Hamming Distance |
Medium
|
facebook
google
|
|
| Maximum Star Sum of a Graph |
Medium
|
|
|
| Number of Pairs of Interchangeable Rectangles |
Medium
|
|
|
| Maximum Subarray Sum |
Medium
|
adobe
alibaba
amazon
apple
asana
atlassian
bloomberg
bytedance
capital-one
cisco
citadel
ebay
expedia
facebook
goldman-sachs
google
ibm
intel
jpmorgan
linkedin
microsoft
morgan-stanley
nvidia
oracle
palantir-technologies
paypal
qualcomm
salesforce
sap
two-sigma
uber
visa
wayfair
yahoo
zillow
|
|
| Time Based Key-Value Store |
Medium
|
amazon
apple
atlassian
databricks
facebook
flexport
google
linkedin
lyft
microsoft
netflix
oracle
square
stripe
sumologic
twitter
uber
vmware
zillow
|
|
| Add One Row to Tree |
Medium
|
gilt-groupe
|
|
| Bulb Switcher II |
Medium
|
microsoft
|
|
| Matrix Block Sum |
Medium
|
google
|
|
| Minimum Increment to Make Array Unique |
Medium
|
coursera
ixl
twitter
|
|
| Number of Good Leaf Nodes Pairs |
Medium
|
google
|
|
| Hand of Straights |
Medium
|
bloomberg
coupang
ebay
google
|
|
| Fraction Addition and Subtraction |
Medium
|
goldman-sachs
ixl
|
|
| Maximum Difference Between Node and Ancestor |
Medium
|
amazon
facebook
google
|
|
| Minimum Number of Vertices to Reach All Nodes |
Medium
|
|
|
| Mirror Reflection |
Medium
|
|
|
| Convert Binary Search Tree to Sorted Doubly Linked List |
Medium
|
amazon
bloomberg
databricks
facebook
google
lyft
microsoft
oracle
uber
vmware
|
|
| Deepest Leaves Sum |
Medium
|
google
|
|
| Sort Vowels in a String |
Medium
|
|
|
| Sparse Matrix Multiplication |
Medium
|
amazon
apple
bloomberg
facebook
google
linkedin
microsoft
snapchat
uber
|
|
| Find Duplicate File in System |
Medium
|
amazon
apple
dropbox
facebook
google
microsoft
oracle
vmware
|
|
| Bag of Tokens |
Medium
|
google
|
|
| Longest Palindrome by Concatenating Two Letter Words |
Medium
|
|
|
| Minimum Genetic Mutation |
Medium
|
amazon
google
twitter
|
|
| N-ary Tree Level Order Traversal |
Medium
|
amazon
|
|
| The Time When the Network Becomes Idle |
Medium
|
|
|
| Find Closest Node to Given Two Nodes |
Medium
|
|
|
| Most Stones Removed with Same Row or Column |
Medium
|
google
|
|
| Restore the Array From Adjacent Pairs |
Medium
|
|
|
| As Far from Land as Possible |
Medium
|
amazon
uipath
|
|
| Lexicographically Smallest Equivalent String |
Medium
|
|
|
| Number of Nodes in the Sub-Tree With the Same Label |
Medium
|
samsung
|
|
| Shortest Path with Alternating Colors |
Medium
|
amazon
|
|
| Battleships in a Board |
Medium
|
amazon
apple
facebook
google
microsoft
|
|
| Evaluate Division |
Medium
|
adobe
amazon
bloomberg
facebook
google
microsoft
uber
|
|
| Integer Replacement |
Medium
|
amazon
baidu
bloomberg
google
microsoft
|
|
| Longest Substring with At Least K Repeating Characters |
Medium
|
adobe
amazon
baidu
bloomberg
bytedance
facebook
google
uber
|
|
| Minimum Time Difference |
Medium
|
amazon
palantir-technologies
|
|
| Nth Digit |
Medium
|
facebook
google
|
|
| Rotate Function |
Medium
|
amazon
|
|
| Valid Square |
Medium
|
facebook
google
pure-storage
|
|
| Minimum Rounds to Complete All Tasks |
Medium
|
|
|
| Online Stock Span |
Medium
|
amazon
google
microsoft
|
|
| Count Number of Homogenous Substrings |
Medium
|
|
|
| Game Analysis IV |
Medium
|
facebook
gsn-games
|
|
| Most Frequent Subtree Sum |
Medium
|
amazon
apple
|
|
| Delete the Middle Node of a Linked List |
Medium
|
|
|