Coursera Interview Questions — 11 DSA Problems
10 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked Coursera LeetCode questions for software engineering interviews.
- Text Justification (HARD) — Array, String, Simulation
- N-th Tribonacci Number (EASY) — Math, Dynamic Programming, Memoization
- Reaching Points (HARD) — Math
- Number of Music Playlists (HARD) — Math, Dynamic Programming, Combinatorics
- Highest Grade For Each Student (MEDIUM) — Database
- Minimum Moves to Equal Array Elements (MEDIUM) — Array, Math
- Minimum Increment to Make Array Unique (MEDIUM) — Array, Greedy, Sorting, Counting
- Special Binary String (HARD) — String, Recursion
- Rank Teams by Votes (MEDIUM) — Array, Hash Table, String, Sorting, Counting
- Search Suggestions System (MEDIUM) — Array, String, Binary Search, Trie, Sorting, Heap (Priority Queue)
- Wildcard Matching (HARD) — String, Dynamic Programming, Greedy, Recursion
C
Coursera
11 questions tracked10 with solutions
Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough
Showing 11 of 11 questions
2MathDynamic ProgrammingMemoization
4MathDynamic ProgrammingCombinatorics
5MediumHighest Grade For Each Student
Database
7ArrayGreedySortingCounting
9ArrayHash TableStringSorting+1
10ArrayStringBinary SearchTrie+2
11StringDynamic ProgrammingGreedyRecursion