Indeed Interview Questions

Courses

Jobs

Interviews

Discussions

Indeed Interview Questions

Showing 7 questions

Ranking

A question's ranking corresponds to how commonly it's asked by Indeed. The higher the ranking, the more likely you'll encounter it in a Indeed interview.

Question

Frequency

Difficulty

Sum of Even Numbers After Queries

You are given an array of integers and a series of update queries. For each query, update a value in the array and then calculate the sum of all the even numbers.

Arrays

Very likely

If you have a Indeed interview, it's very likely that you will get this question

Medium

#1. Sum of Even Numbers After Queries

Medium

You are given an array of integers and a series of update queries. For each query, update a value in the array and then calculate the sum of all the even numbers.

Arrays

This question is very likely to be asked in your Indeed interview

Find Players With Zero or One Losses

You are given a list of match results. Determine which players have lost zero games and which players have lost only one game.

Arrays

Somewhat likely

If you have a Indeed interview, you might get this question

Medium

#2. Find Players With Zero or One Losses

Medium

You are given a list of match results. Determine which players have lost zero games and which players have lost only one game.

Arrays

This question is somewhat likely to be asked in your Indeed interview

Binary Tree Tilt

Calculate the tilt of each node in a binary tree, where the tilt is the absolute difference between the sum of left subtree node values and the sum of right subtree node values. Return the total tilt of the entire tree.

TreesRecursion

Somewhat likely

If you have a Indeed interview, you might get this question

Easy

#3. Binary Tree Tilt

Easy

TreesRecursion

This question is somewhat likely to be asked in your Indeed interview

Minimum Cost to Split an Array

Given an array of numbers, find the minimum cost to split it into one or more subarrays. The cost of a split is a fixed value plus the sum of lengths of all subarrays that are not "important".

ArraysDynamic Programming

Not likely

If you have a Indeed interview, it's unlikely that you will get this question. Indeed does ask it, but it's rare

Hard

#4. Minimum Cost to Split an Array

Hard

Given an array of numbers, find the minimum cost to split it into one or more subarrays. The cost of a split is a fixed value plus the sum of lengths of all subarrays that are not "important".

ArraysDynamic Programming

This question is not likely to be asked in your Indeed interview

Minimum Moves to Equal Array Elements

Find the minimum number of moves required to make all elements in an array equal, where a move consists of incrementing n - 1 elements by 1.

Arrays

Not likely

If you have a Indeed interview, it's unlikely that you will get this question. Indeed does ask it, but it's rare

Medium

#5. Minimum Moves to Equal Array Elements

Medium

Find the minimum number of moves required to make all elements in an array equal, where a move consists of incrementing n - 1 elements by 1.

Arrays

This question is not likely to be asked in your Indeed interview

Check if Every Row and Column Contains All Numbers

Determine if every row and every column in a given square matrix contains all the numbers from 1 to n, where n is the size of the matrix. Effectively, check if it's a valid Sudoku (without subgrids).

Arrays

Not likely

If you have a Indeed interview, it's unlikely that you will get this question. Indeed does ask it, but it's rare

Easy

#6. Check if Every Row and Column Contains All Numbers

Easy

Determine if every row and every column in a given square matrix contains all the numbers from 1 to n, where n is the size of the matrix. Effectively, check if it's a valid Sudoku (without subgrids).

Arrays

This question is not likely to be asked in your Indeed interview

Merge k Sorted Lists

You are given k sorted lists. Combine all of their elements into a single sorted list and return it.

Linked ListsRecursion

Not likely

If you have a Indeed interview, it's unlikely that you will get this question. Indeed does ask it, but it's rare

Hard

#7. Merge k Sorted Lists

Hard

You are given k sorted lists. Combine all of their elements into a single sorted list and return it.

Linked ListsRecursion

This question is not likely to be asked in your Indeed interview