| Fraction Addition and Subtraction | Medium | goldman-sachs
ixl | |
| Greatest Common Divisor of Strings | Easy | atlassian
capital-one | |
| K Inverse Pairs Array | Hard | works-applications | |
| 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 | | |
| Verifying an Alien Dictionary | Easy | airbnb
amazon
facebook
microsoft | |
| Sparse Matrix Multiplication | Medium | amazon
apple
bloomberg
facebook
google
linkedin
microsoft
snapchat
uber | |
| Vertical Order Traversal of a Binary Tree | Hard | adobe
amazon
bloomberg
databricks
facebook
google
linkedin
microsoft
reddit
samsung | |
| 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 | |
| N-ary Tree Postorder Traversal | Easy | amazon | |
| N-ary Tree Preorder Traversal | Easy | | |
| Reverse String 2 | Easy | amazon
google
microsoft | |
| The Time When the Network Becomes Idle | Medium | | |
| Find Closest Node to Given Two Nodes | Medium | | |
| Find the Town Judge | Easy | amazon
arista
facebook
google | |
| Most Stones Removed with Same Row or Column | Medium | google | |
| N-th Tribonacci Number | Easy | coursera
facebook | |
| Bus Routes | Hard | amazon
didi
google
uber | |
| Design Graph With Shortest Path Calculator | Hard | | |
| Restore the Array From Adjacent Pairs | Medium | | |
| As Far from Land as Possible | Medium | amazon
uipath | |
| Lexicographically Smallest Equivalent String | Medium | | |
| Longest Path With Different Adjacent Characters | Hard | | |
| Naming a Company | Hard | | |
| Number of Good Paths | Hard | | |
| 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 | |
| Maximum 69 Number | Easy | hrt | |
| Minimum Time Difference | Medium | amazon
palantir-technologies | |
| Nth Digit | Medium | facebook
google | |
| Orderly Queue | Hard | amazon | |
| Perfect Rectangle | Hard | apple
google
uber | |
| Rotate Function | Medium | amazon | |
| Valid Square | Medium | facebook
google
pure-storage | |
| Minimum Rounds to Complete All Tasks | Medium | | |
| Sum of All Odd Length Subarrays | Easy | | |
| Online Stock Span | Medium | amazon
google
microsoft | |
| Count Number of Homogenous Substrings | Medium | | |