| Counting Words With a Given Prefix |
Easy
|
|
|
| Count Prefix and Suffix Pairs 1 |
Easy
|
|
|
| Design a Sparse Array |
Easy
|
facebook
|
|
| String Matching in an Array |
Easy
|
amazon
|
|
| Design hit counter with range queries |
Easy
|
riot-games
|
|
| Check if target word exists in matrix horizontally or vertically |
Easy
|
microsoft
|
|
| Expected number of rounds to reach one remaining coin |
Easy
|
microsoft
|
|
| Check if doubly linked list is palindrome |
Easy
|
google
|
|
| Return two prime numbers that sum to a given even number |
Easy
|
alibaba
|
|
| Final Prices With a Special Discount in a Shop |
Easy
|
|
|
| Final Array State After K Multiplication Operations 1 Problem |
Easy
|
|
|
| Take Gifts From the Richest Pile |
Easy
|
|
|
| Duplicate each node in a binary search tree and add as its left child |
Easy
|
|
|
| Find a Corresponding Node of a Binary Tree in a Clone of That Tree |
Easy
|
facebook
|
|
| Find GCD of n numbers |
Easy
|
amazon
|
|
| Maximum in a Binary Search Tree |
Easy
|
|
|
| Maximum in a Binary Tree |
Easy
|
|
|
| Min Queue Problem |
Easy
|
|
|
| Minimum in a Binary Search Tree |
Easy
|
|
|
| Print or return all the full nodes in a binary tree |
Easy
|
|
|
| Range Sum Query - Immutable |
Easy
|
amazon
bloomberg
facebook
goldman-sachs
google
microsoft
palantir-technologies
|
|
| Return or print all leaf nodes of a binary tree |
Easy
|
|
|
| Search an element in a binary tree |
Easy
|
|
|
| Add Two Integers |
Easy
|
|
|
| Design an Ordered Stream Problem |
Easy
|
|
|
| Maximum Population Year |
Easy
|
|
|
| Minimum Operations to Exceed Threshold Value 1 |
Easy
|
|
|
| Number of Equivalent Domino Pairs |
Easy
|
amazon
|
|
| Check If a Word Occurs As a Prefix of Any Word in a Sentence Problem |
Easy
|
yelp
|
|
| Count Symmetric Integers |
Easy
|
|
|
| Matrix Diagonal Sum |
Easy
|
|
|
| Maximum Score After Splitting a String |
Easy
|
google
|
|
| Minimum Recolors to Get K Consecutive Black Blocks |
Easy
|
|
|
| Special Array 1 |
Easy
|
|
|
| Binary Tree Path Sum - Minimum Sum Root to Leaf path |
Easy
|
apple
|
|
| Rectangle Overlap |
Easy
|
adobe
amazon
apple
bloomberg
goldman-sachs
google
mathworks
microsoft
oracle
|
|
| Binary Tree Path - All root to leaf paths |
Easy
|
adobe
amazon
apple
facebook
google
microsoft
|
|
| Closest Binary Search Tree Value |
Easy
|
amazon
bloomberg
facebook
google
linkedin
microsoft
snapchat
|
|
| Defuse the Bomb Problem |
Easy
|
|
|
| Consecutive Characters Problem |
Easy
|
|
|
| Capitalize the Title Problem |
Easy
|
|
|
| Circular Sentence Problem |
Easy
|
|
|
| Delete Characters to Make Fancy String Problem |
Easy
|
|
|
| Row With Maximum Ones Problem |
Easy
|
|
|
| Minimum String Length After Removing Substrings Problem |
Easy
|
|
|
| Sentence Similarity |
Easy
|
google
|
|
| Rank Transform of an Array Problem |
Easy
|
google
|
|
| Minimum Absolute Difference |
Easy
|
audible
|
|
| Uncommon Words from Two Sentences Problem |
Easy
|
amazon
expedia
facebook
microsoft
|
|
| Count the Number of Consistent Strings Problem |
Easy
|
|
|