Microsoft Mock Coding Interview: Coin Change in Python
Watch a full mock coding interview with a senior Microsoft engineer covering two classic algorithm problems: Coin Change and Find Median from Data Stream. Both problems are solved live in Python with real-time feedback from the interviewer on approach, code quality, and optimization.
The first problem (Coin Change) starts with a brute force recursive approach before being optimized into a clean bottom-up dynamic programming solution with O(n * amount) time complexity. The second problem (Find Median from Data Stream) covers the two-heap technique using a min-heap and max-heap to achieve O(log n) insertion and O(1) median lookup. This mock interview is aimed at anyone preparing for coding interviews at Microsoft or other top tech companies.
0:00 Introduction and problem statement (Coin Change)
1:15 Clarifying the problem: denominations and infinite supply
2:00 Brute force recursive approach and complexity analysis
4:30 Transition to dynamic programming approach
6:00 Building the 1D DP array walkthrough
8:30 Coding the DP solution in Python
11:00 Testing edge cases and verifying output
12:30 Problem 2: Find Median from Data Stream
13:45 Two-heap approach explanation (min-heap and max-heap)
15:30 Complexity analysis: O(log n) insert, O(1) median
16:30 Interviewer feedback and wrap-up
Problems covered:
Coin Change (LeetCode #322): https://leetcode.com/problems/coin-ch...
Find Median from Data Stream (LeetCode #295): https://leetcode.com/problems/find-me...
On this page of the site you can watch the video online Microsoft Mock Coding Interview: Coin Change in Python with a duration of hours minute second in good quality, which was uploaded by the user abrar 15 January 2019, share the link with friends and acquaintances, this video has already been watched 3,336 times on youtube and it was liked by 31 viewers. Enjoy your viewing!
