All companies
Grammarly
7 Easy19 Medium4 Hard30 total
| No. | Problem | Difficulty | Frequency |
|---|---|---|---|
| 56 | Merge Intervals | Medium | |
| 1209 | Remove All Adjacent Duplicates in String II | Medium | |
| 70 | Climbing Stairs | Easy | |
| 1047 | Remove All Adjacent Duplicates In String | Easy | |
| 966 | Vowel Spellchecker | Medium | |
| 380 | Insert Delete GetRandom O(1) | Medium | |
| 33 | Search in Rotated Sorted Array | Medium | |
| 22 | Generate Parentheses | Medium | |
| 187 | Repeated DNA Sequences | Medium | |
| 507 | Perfect Number | Easy | |
| 359 | Logger Rate Limiter | Easy | |
| 404 | Sum of Left Leaves | Easy | |
| 69 | Sqrt(x) | Easy | |
| 35 | Search Insert Position | Easy | |
| 435 | Non-overlapping Intervals | Medium | |
| 2054 | Two Best Non-Overlapping Events | Medium | |
| 150 | Evaluate Reverse Polish Notation | Medium | |
| 1028 | Recover a Tree From Preorder Traversal | Hard | |
| 139 | Word Break | Medium | |
| 140 | Word Break II | Hard | |
| 200 | Number of Islands | Medium | |
| 79 | Word Search | Medium | |
| 761 | Special Binary String | Hard | |
| 2075 | Decode the Slanted Ciphertext | Medium | |
| 208 | Implement Trie (Prefix Tree) | Medium | |
| 3035 | Maximum Palindromes After Operations | Medium | |
| 42 | Trapping Rain Water | Hard | |
| 62 | Unique Paths | Medium | |
| 1461 | Check If a String Contains All Binary Codes of Size K | Medium | |
| 3144 | Minimum Substring Partition of Equal Character Frequency | Medium |