Grammarly Questions
Here are the LeetCode questions for Grammarly.
Total: 29
Easy: 7
Medium: 19
Hard: 3
Progress: 0%
Topic Frequency Analysis
All Topics
| Rank | Topic | Frequency | Percentage |
|---|---|---|---|
| 1 | Array | 16 | |
| 2 | Hash Table | 9 | |
| 3 | Dynamic Programming | 8 | |
| 4 | Math | 7 | |
| 5 | String | 6 | |
| 6 | Sorting | 5 | |
| 7 | Depth-First Search | 4 | |
| 8 | Binary Search | 3 | |
| 9 | Backtracking | 3 | |
| 10 | Design | 3 | |
| 11 | Memoization | 3 | |
| 12 | Breadth-First Search | 3 | |
| 13 | Trie | 3 | |
| 14 | Greedy | 2 | |
| 15 | Matrix | 2 | |
| 16 | Heap (Priority Queue) | 2 | |
| 17 | Combinatorics | 2 | |
| 18 | Stack | 2 | |
| 19 | Sliding Window | 2 | |
| 20 | Prefix Sum | 2 | |
| 21 | Union-Find | 1 | |
| 22 | Hash Function | 1 | |
| 23 | Rolling Hash | 1 | |
| 24 | Ordered Set | 1 | |
| 25 | Bit Manipulation | 1 | |
| 26 | Binary Tree | 1 | |
| 27 | Tree | 1 | |
| 28 | Two Pointers | 1 | |
| 29 | Data Stream | 1 | |
| 30 | Randomized | 1 | |
| 31 | Graph Theory | 1 | |
| 32 | Sweep Line | 1 | |
| 33 | Monotonic Stack | 1 | |
| 34 | Concurrency | 1 | |
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Maximum Palindromes After Operations | Visit | Medium | |
| 2 | Decode the Slanted Ciphertext | Visit | Medium | |
| 3 | Two Best Non-Overlapping Events | Visit | Medium | |
| 4 | Check If a String Contains All Binary Codes of Size K | Visit | Medium | |
| 5 | Remove All Adjacent Duplicates in String II | Visit | Medium | |
| 6 | Restricted | Restricted | Hard | |
| 7 | Restricted | Restricted | Hard | |
| 8 | Restricted | Restricted | Hard | |
| 9 | Restricted | Restricted | Hard | |
| 10 | Restricted | Restricted | Hard | |
| 11 | Restricted | Restricted | Hard | |
| 12 | Restricted | Restricted | Hard | |
| 13 | Restricted | Restricted | Hard | |
| 14 | Restricted | Restricted | Hard | |
| 15 | Restricted | Restricted | Hard |
Log in to access all 29 questions for free!
Log In