9:34

Find The Second Largest Item - Heap & Tracking Approach (Beginner Big N Interview Question)

11:55

LeetCode 66 - Plus ONE - C# - Solution

12:40

Compute The Next Permutation of A Numeric Sequence - Case Analysis ("Next Permutation" on Leetcode)

23:12

The Change Making Problem - Fewest Coins To Make Change Dynamic Programming

19:38

Max Contiguous Subarray Sum - Cubic Time To Kadane's Algorithm ("Maximum Subarray" on LeetCode)