Grammarly Interview Questions — 27 DSA Problems

26 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Grammarly LeetCode questions for software engineering interviews.

• Merge Intervals (MEDIUM) — Array, Sorting
• Remove All Adjacent Duplicates In String (EASY) — String, Stack
• Remove All Adjacent Duplicates in String II (MEDIUM) — String, Stack
• Insert Delete GetRandom O(1) (MEDIUM) — Array, Hash Table, Math, Design, Randomized
• Generate Parentheses (MEDIUM) — String, Dynamic Programming, Backtracking
• Repeated DNA Sequences (MEDIUM) — Hash Table, String, Bit Manipulation, Sliding Window, Rolling Hash, Hash Function
• Vowel Spellchecker (MEDIUM) — Array, Hash Table, String
• Search in Rotated Sorted Array (MEDIUM) — Array, Binary Search
• Perfect Number (EASY) — Math
• Climbing Stairs (EASY) — Math, Dynamic Programming, Memoization
• Sqrt(x) (EASY) — Math, Binary Search
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Word Search (MEDIUM) — Array, String, Backtracking, Depth-First Search, Matrix
• Backspace String Compare (EASY) — Two Pointers, String, Stack, Simulation
• Word Break II (HARD) — Array, Hash Table, String, Dynamic Programming, Backtracking, Trie, Memoization
• Implement Trie (Prefix Tree) (MEDIUM) — Hash Table, String, Design, Trie
• Word Break (MEDIUM) — Array, Hash Table, String, Dynamic Programming, Trie, Memoization
• Logger Rate Limiter (EASY) — Hash Table, Design, Data Stream
• Special Binary String (HARD) — String, Recursion
• Decode the Slanted Ciphertext (MEDIUM) — String, Simulation
• Evaluate Reverse Polish Notation (MEDIUM) — Array, Math, Stack
• Sum of Left Leaves (EASY) — Tree, Depth-First Search, Breadth-First Search, Binary Tree
• Set Mismatch (EASY) — Array, Hash Table, Bit Manipulation, Sorting
• Maximum Palindromes After Operations (MEDIUM) — Array, Hash Table, String, Greedy, Sorting, Counting
• Clone Graph (MEDIUM) — Hash Table, Depth-First Search, Breadth-First Search, Graph
• Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
• Unique Paths (MEDIUM) — Math, Dynamic Programming, Combinatorics