K-diff Pairs in an Array |
Medium
|
amazon
bloomberg
goldman-sachs
microsoft
oracle
paypal
salesforce
twilio
twitter
|
|
K-Similar Strings |
Hard
|
amazon
google
|
|
Largest Unique Number |
Easy
|
amazon
|
|
Logical OR of Two Binary Grids Represented as Quad-Trees |
Medium
|
amazon
google
sumologic
|
|
Longest Repeating Substring |
Medium
|
amazon
facebook
google
microsoft
|
|
Longest Word in Dictionary |
Medium
|
amazon
goldman-sachs
google
pinterest
|
|
Max Consecutive Ones |
Easy
|
amazon
google
microsoft
|
|
Max Consecutive Ones III |
Medium
|
amazon
facebook
microsoft
yandex
|
|
Maximize Distance to Closest Person |
Medium
|
amazon
google
|
|
Maximize Sum Of Array After K Negations |
Easy
|
amazon
druva
|
|
Maximum Average Subtree |
Medium
|
amazon
atlassian
|
|
Maximum Depth of N-ary Tree |
Easy
|
amazon
bloomberg
google
sap
|
|
Maximum Number of Vowels in a Substring of Given Length |
Medium
|
amazon
|
|
Minimum Area Rectangle II |
Medium
|
amazon
facebook
google
|
|
Minimum Cost to Connect Sticks |
Medium
|
amazon
google
|
|
Minimum Knight Moves |
Medium
|
amazon
apple
facebook
google
indeed
microsoft
oracle
|
|
Minimum Number of K Consecutive Bit Flips |
Hard
|
akuna
akuna-capital
amazon
facebook
|
|
Minimum Swaps to Make Strings Equal |
Medium
|
amazon
jp-morgan-chase
|
|
Minimum Window Subsequence |
Hard
|
amazon
bloomberg
ebay
google
houzz
microsoft
|
|
Next Closest Time |
Medium
|
adobe
amazon
bytedance
facebook
google
microsoft
uber
|
|
Next Greater Node In Linked List |
Medium
|
amazon
facebook
microsoft
uber
|
|
Number of Days Between Two Dates |
Easy
|
amazon
facebook
|
|
Number of Distinct Islands |
Medium
|
amazon
apple
bloomberg
facebook
google
lyft
microsoft
oracle
uber
|
|
Number of Equivalent Domino Pairs |
Easy
|
amazon
|
|
Number of Matching Subsequences |
Medium
|
amazon
facebook
google
|
|
Optimal Division |
Medium
|
amazon
|
|
Path With Maximum Minimum Value |
Medium
|
amazon
google
|
|
Prime Number of Set Bits in Binary Representation |
Easy
|
amazon
|
|
Prime Palindrome |
Medium
|
amazon
|
|
Prison Cells After N Days |
Medium
|
amazon
bloomberg
|
|
Range Sum of BST |
Easy
|
amazon
apple
facebook
google
microsoft
oracle
|
|
Reformat Department Table |
Easy
|
amazon
google
|
|
Repeated String Match |
Medium
|
adobe
amazon
facebook
google
|
|
Sales Analysis I |
Easy
|
amazon
|
|
Sales Analysis III |
Easy
|
amazon
|
|
Second Minimum Node In a Binary Tree |
Easy
|
amazon
linkedin
microsoft
uber
|
|
Smallest Subsequence of Distinct Characters |
Medium
|
amazon
factset
|
|
Split Array With Same Average |
Hard
|
amazon
google
microsoft
uber
|
|
Sum of Digits in the Minimum Number |
Easy
|
amazon
|
|
The K Weakest Rows in a Matrix |
Easy
|
amazon
|
|
Traffic Light Controlled Intersection |
Easy
|
amazon
|
|
Uncrossed Lines |
Medium
|
amazon
|
|
Vowel Spellchecker |
Medium
|
amazon
facebook
thumbtack
|
|
Web Crawler |
Medium
|
amazon
dropbox
facebook
microsoft
oracle
|
|
Web Crawler Multithreaded |
Medium
|
amazon
databricks
dropbox
facebook
oracle
|
|
Array Partition |
Easy
|
adobe
amazon
apple
|
|
Average of Levels in Binary Tree |
Easy
|
amazon
facebook
|
|
Complete Binary Tree Inserter |
Medium
|
amazon
google
|
|
Complex Number Multiplication |
Medium
|
amazon
|
|
Contiguous Array |
Medium
|
adobe
amazon
apple
facebook
google
microsoft
quora
robinhood
vmware
|
|