Coursera Interview Questions

#1. Text Justification

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

Given a sequence of words and a line width, format the text to fit within the specified width. You must justify the text, distributing extra spaces evenly between words.

ArraysStrings

N-th Tribonacci Number

Calculate the N-th Tribonacci number, where each number is the sum of the previous three numbers. You're given the value of N, and initial values for the first three Tribonacci numbers.

ArraysDynamic Programming

Somewhat likely

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

Easy

#2. N-th Tribonacci Number

Easy

Calculate the N-th Tribonacci number, where each number is the sum of the previous three numbers. You're given the value of N, and initial values for the first three Tribonacci numbers.

ArraysDynamic Programming

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

Minimum Increment to Make Array Unique

You're given an array of numbers. Find the minimum number of increments needed to make all the numbers in the array unique.

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

Somewhat likely

#3. Minimum Increment to Make Array Unique

You're given an array of numbers. Find the minimum number of increments needed to make all the numbers in the array unique.

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

Reaching Points

Starting from (0, 0), can you reach a target point (tx, ty) by repeatedly applying the transformation (x, y) -> (x, x+y) or (x, y) -> (x+y, y)? Determine if it's possible.

Greedy AlgorithmsMath

If you have a Coursera interview, it's unlikely that you will get this question

#4. Reaching Points

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

Starting from (0, 0), can you reach a target point (tx, ty) by repeatedly applying the transformation (x, y) -> (x, x+y) or (x, y) -> (x+y, y)? Determine if it's possible.

Greedy AlgorithmsMath

Number of Music Playlists

Calculate the number of possible music playlists given constraints on the number of songs, distinct songs, and playlist length. Each song must be played at least once.

Dynamic Programming

If you have a Coursera interview, it's unlikely that you will get this question

#5. Number of Music Playlists

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

Calculate the number of possible music playlists given constraints on the number of songs, distinct songs, and playlist length. Each song must be played at least once.

Dynamic Programming

Special Binary String

A special binary string has equal numbers of 0s and 1s, and any prefix has at least as many 1s as 0s. You need to recursively make the lexicographically largest special string possible from a given special binary string.

RecursionStrings

If you have a Coursera interview, it's unlikely that you will get this question

#6. Special Binary String

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

RecursionStrings

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.

If you have a Coursera interview, it's unlikely that you will get this question

#7. 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.

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

Rank Teams by Votes

You're given a list of votes for teams, where each vote ranks the teams in order. Determine the final ranking of the teams based on these votes, prioritizing teams with higher rankings in the votes.

ArraysStringsGreedy Algorithms

If you have a Coursera interview, it's unlikely that you will get this question

#8. Rank Teams by Votes