539. Minimum Time Difference | All approaches | Bucket Sort | Bitsets | Indepth Leetcode Solution

539. Minimum Time Difference LeetCode Solution using all approaches from Brute - Better - Optimal Problem Link: https://leetcode.com/problems/minimum-time-difference/description/ Solution Link: https://leetcode.com/submissions/detail/1391561357/ In depth explanation of how you should approach the problem and move from conventional sorting to Bucket Sort. Also gave a trick of using bitsets in C++ in later part of the video. Watch the full video to get intuition of bucket sort possibilities. Feel Free to raise any kind of queries, I am happy to help. Chapters: 0:00 - 0:55 - Problem Statement 0:56 - 4:50 - Thought Process 4:51 - 6:30 - Sorting Approach 6:31 - 13:36 - Scope of Improvement? 13:37 - 15:26 - Coding Sorting Approach 15:27 - 17:20 - Bucket Sort Intuition 17:21 - 22:28 - Building Bucket Sort 22:29 - 28:26 - Pseudo Code for Bucket Sort 28:27 - 34:35 - Coding Bucket Sort 34:36 - 36:57 - Bitset Trick