Question 1

Text Justification — Coursera Interview Question

Accepted Answer

"Text Justification" is a hard difficulty problem asked at Coursera interviews. It covers the following topics: Array, String, Simulation. You can practice it on LeetCode: https://leetcode.com/problems/text-justification

Question 2

N-th Tribonacci Number — Coursera Interview Question

Accepted Answer

"N-th Tribonacci Number" is a easy difficulty problem asked at Coursera interviews. It covers the following topics: Math, Dynamic Programming, Memoization. You can practice it on LeetCode: https://leetcode.com/problems/n-th-tribonacci-number

Question 3

Reaching Points — Coursera Interview Question

Accepted Answer

"Reaching Points" is a hard difficulty problem asked at Coursera interviews. It covers the following topics: Math. You can practice it on LeetCode: https://leetcode.com/problems/reaching-points

Question 4

Number of Music Playlists — Coursera Interview Question

Accepted Answer

"Number of Music Playlists" is a hard difficulty problem asked at Coursera interviews. It covers the following topics: Math, Dynamic Programming, Combinatorics. You can practice it on LeetCode: https://leetcode.com/problems/number-of-music-playlists

Question 5

Highest Grade For Each Student — Coursera Interview Question

Accepted Answer

"Highest Grade For Each Student" is a medium difficulty problem asked at Coursera interviews. It covers the following topics: Database. You can practice it on LeetCode: https://leetcode.com/problems/highest-grade-for-each-student

Question 6

Minimum Moves to Equal Array Elements — Coursera Interview Question

Accepted Answer

"Minimum Moves to Equal Array Elements" is a medium difficulty problem asked at Coursera interviews. It covers the following topics: Array, Math. You can practice it on LeetCode: https://leetcode.com/problems/minimum-moves-to-equal-array-elements

#	Question Title	Difficulty	Frequency	Topics
1	Text Justification	HARD	100.0	ArrayStringSimulation
2	N-th Tribonacci Number	EASY	100.0	MathDynamic ProgrammingMemoization
3	Reaching Points	HARD	97.8	Math
4	Number of Music Playlists	HARD	97.8	MathDynamic ProgrammingCombinatorics
5	Highest Grade For Each Student	MEDIUM	97.8	Database
6	Minimum Moves to Equal Array Elements	MEDIUM	97.8	ArrayMath
7	Minimum Increment to Make Array Unique	MEDIUM	97.8	ArrayGreedySorting+1
8	Special Binary String	HARD	97.8	StringRecursion
9	Rank Teams by Votes	MEDIUM	89.6	ArrayHash TableString+2
10	Search Suggestions System	MEDIUM	70.0	ArrayStringBinary Search+3

Explore 450+ Companies

Companies

Coursera

Want to see more?

Coursera Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Coursera

Want to see more?

Coursera Interview Questions

Ai Assistant Kas