Coursera Interview Guide

Showing 3 of 8 questions

Ranking

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

Question

Frequency

Difficulty

Text Justification

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

Very likely

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

Hard

#1. Text Justification

Hard

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

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

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.

ArraysGreedy Algorithms