Grammarly Interview Questions

Note: ensure you read the disclaimer on the previous page reading the accuracy and sourcing of these problems.

Two Sum from BST

This problem is a fun combination of the famous Two Sum problem combined with a binary search lessons binary search technique tree. Given the root of a binary search lessons binary search technique tree, and a target integer K , return true if there exist two nodes in the said tree...

Difficulty: 7/10

How Many Strongly Connected

Given a directed graph lessons simple reference to graphs represented via an adjacency list, write a class StronglyConnectedComponents with a count method that would return the number of strongly connected components in a graph. The definition of a strong connected component is a subgr...

Difficulty: 8/10

Two Sum

This is a classic and very common interview problem. Given an array of integers, return the indices of the two numbers in it that add up to a specific "goal" number. Suppose we had an array 1, 3, 6, 7, 9 , and let's say our "goal" number was 10 . Our numbers to sum to it could be 3 and 7 , an...

Difficulty: 4/10

Detect Substring in String

How would you write a function to detect a substring in a string? If the substring can be found in the string, return the index at which it starts. Otherwise, return 1 . js function detectSubstring str, subStr return 1 Important do not use the native String clas...

Difficulty: 4/10

Find the Intersection of Two Linked Lists

Assume you have a Linked List implementation that has the following API: js prepend to start of list prepend val appends to end of list append val get an array of node values for testing toArray Can you write a method getIntersection list1, list2 to find the interse...

Difficulty: 4/10

Course Prerequisites

Here's a classic challenge that comes up in real life interviews surprisingly often. Interviewers like it as a way to assess your ability to find the right data structure for a non obvious and non trivial use case. The prompt is as follows: you're a university student currently trying to plan th...

Difficulty: 8/10

Sum All Primes

You're given a number n . Can you write a method sumOfAllPrimes that finds all prime numbers smaller than or equal to n , and returns a sum of them? For example, we're given the number 15 . All prime numbers smaller than 15 are: 2, 3, 5, 7, 11, 13 They sum up to 41 , so sumOfA...

Difficulty: 4/10

Dollar Sign Deletion

You're given an array of strings containing alphabetical characters and certain characters. A represents a DELETE action whereby the character before it is deleted. Each of these strings will be run through a method to operate on the DELETE action. We want to find out if the final string...

Difficulty: 4/10

Introduction to Machine Learning

Introduction In this series, AlgoDaily presents **machine learning**. You will start from scratch and slowly learn basic and then advanced algorithms in machine learning. We will walk you through many popular machine learning frameworks such as NumPy, Scikit learn, TensorFlow, and Keras. Yo...

Difficulty: 5/10

Application Mastery

**Unlock Your Full Potential with AlgoDaily!** We hope you're enjoying this course. At AlgoDaily, our aim is to transform complex coding challenges into engaging, bite sized lessons. And while our free lessons give you a glimpse of this transformative experience, there's so much more in store. ...

Difficulty: 5/10

Introduction to C# Programming

Introduction to C Programming Welcome to the world of C programming! In this lesson, we will provide an overview of the C programming language and its features. C pronounced C sharp is a modern, object oriented programming language developed by Microsoft. It is widely used for developing...

Difficulty: 5/10

Knapsack Problem

Introduction to Knapsack Problem The knapsack problem is a classic optimization problem in computer science and mathematics. It involves maximizing the value of items that can be packed into a knapsack given its weight capacity. In other words, we want to select the most valuable items while st...

Difficulty: 5/10

Interview Reports

70 Grammarly Interview Questions Answers...

Have you ever been caught stealing, or better yet, have you ever stole anything? What do you ultimately want to become? Tell me a difficult situation you have overcome in the workplace? Do you know an...

What interview questions does Grammarly ask? - Grammarly Questions | Compar...

Learn about Grammarly's Culture - What interview questions does Grammarly ask?

Grammarly Interview Questions | Glassdoor...

Grammarly interview details: 83 interview questions and 68 interview reviews posted anonymously by Grammarly interview candidates.

People at Grammarly Say

This information was sourced from reviews originally posted on Glassdoor.

Breadth of interesting problems/topics from distributed systems, nlp, functional programming, machine learning, deep neural networks

Amazing team culture across the company in all offices! Ownership mindset, grit, and commitment make it easy and enjoyable to work in a distributed team.

The company really appreciates individuals and interactions, understands that the team in the main value, and prefer data-driven decision making against disputes.

Grammarly is an amazing company to work for. The values they hold aren't just a poster on the wall, but they are actually embodied by the employees.