| Reachable Nodes In Subdivided Graph |
Hard
|
|
|
| Reaching Points |
Hard
|
coursera
goldman-sachs
google
quora
salesforce
twitter
uber
|
|
| Rearranging Array Elements by Index Mapping |
Medium
|
facebook
|
|
| Reduce Array Size to The Half |
Medium
|
akuna-capital
|
|
| Redundant Braces |
Easy
|
amazon
|
|
| Relative Sort Array |
Easy
|
amazon
de-shaw
ebay
google
microsoft
|
|
| Remove All Adjacent Duplicates in String 2 |
Medium
|
bloomberg
facebook
factset
goldman-sachs
google
vmware
|
|
| Remove duplicate in Binary Search Tree BST |
Medium
|
|
|
| Remove duplicates from unsorted array |
Easy
|
|
|
| Remove Palindromic Subsequences |
Easy
|
amazon
|
|
| Reorder Data in Log Files |
Medium
|
amazon
apple
audible
|
|
| Reorder Routes to Make All Paths Lead to the City Zero |
Medium
|
google
|
|
| Restore The Array |
Hard
|
|
|
| Right propagate the rightmost 1-bit |
Easy
|
|
|
| Rod Cutting Problem |
Medium
|
|
|
| Russian Doll Envelopes |
Hard
|
amazon
google
microsoft
|
|
| Scheduling to minimize lateness |
Easy
|
|
|
| Search for Target in Bitonic Array |
Medium
|
|
|
| Search target in nearly sorted array |
Medium
|
|
|
| Searching in a sorted array of strings with empty strings |
Medium
|
|
|
| Seat Reservation Manager |
Medium
|
|
|
| Select a Random Node from a Binary Tree with Equal Probability |
Medium
|
|
|
| Select a random number from stream |
Medium
|
|
|
| Self Crossing |
Hard
|
amazon
google
|
|
| Set the n-th bit |
Easy
|
|
|
| Shopping Offers |
Medium
|
google
|
|
| 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
|
|
| Shortest Path Visiting All Nodes |
Hard
|
amazon
google
meituan
|
|
| Shuffle an Array |
Medium
|
amazon
apple
bloomberg
cisco
facebook
google
linkedin
microsoft
salesforce
tripadvisor
two-sigma
yahoo
|
|
| Single-Threaded CPU |
Medium
|
|
|
| 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 String With Swaps |
Medium
|
|
|
| Smallest Sufficient Team |
Hard
|
google
|
|
| Solve Magnet Puzzle |
|
|
|
| Sort a nearly sorted K sorted array |
Medium
|
palantir
|
|
| Sort Array - Odds Ascending and Before Evens Descending |
Easy
|
|
|
| Sort Array By Parity |
Easy
|
amazon
apple
cisco
facebook
google
microsoft
oracle
vmware
|
|
| Sort Binary Array |
Easy
|
|
|
| Sort Names by their Last Names |
|
|
|
| Sort Strings by Anagram Key |
Medium
|
|
|
| Sort Three Numbers Without Conditionals |
|
|
|
| Sort Transformed Array |
Medium
|
facebook
google
|
|
| Sorting a 2GB file with one string per line |
Medium
|
|
|
| Soup Servings |
Medium
|
google
|
|
| Split Array into Consecutive Subsequences |
Medium
|
google
|
|
| Split Two Strings to Make Palindrome |
Medium
|
|
|
| Splitting a String Into Descending Consecutive Values |
Medium
|
|
|