Coursera LeetCode interview questions

Explore Coursera questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

Solved

0 / 9

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
N-th Tribonacci Number Math Dynamic Programming Memoization EASY	Easy	100.0%	0.6%
Minimum Increment to Make Array Unique Array Greedy Sorting +1 MEDIUM	Medium	100.0%	0.6%
Reaching Points Math Euclidean Algorithm Greatest Common Divisor HARD	Hard	97.3%	0.3%
Number of Music Playlists Math Dynamic Programming Combinatorics HARD	Hard	97.3%	0.6%
Highest Grade For Each Student Database MEDIUM	Medium	97.3%	0.7%
Minimum Moves to Equal Array Elements Array Math MEDIUM	Medium	97.3%	0.6%
Special Binary String String Divide and Conquer Sorting HARD	Hard	97.3%	0.8%
Rank Teams by Votes Array Hash Table String +2 MEDIUM	Medium	74.7%	0.6%
Text Justification Array String Simulation HARD	Hard	65.3%	0.5%

Showing 1–9 of 9 matching problems · All Problems