539. Minimum Time Difference | sorting | string | Leetcode Daily Challenge | DSA | Java | hindi

Problem Name:
539. Minimum Time Difference

Problem Statement:
Given a list of 24-hour clock time points in "HH:MM" format, return the minimum minutes difference between any two time-points in the list.

Problem Link:

Solution Link:

Graph Playlist:

Java Plus DSA Placement Course Playlist:

Java Plus DSA Sheet:

Notes:

Telegram Link:

Ultimate Recursion Series Playlist:

Samsung Interview Experience:

Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung

Timestamp:
0:00 - Introduction
0:37 - timestamp concept
2:54 - hours:min to minutes
4:57 - sorting approach
5:46 - wrapping edge case
8:50 - bucket sort
15:10 - code
19:19 - important message

#ShashwatTiwari #coding​​ #problemsolving​

[rohanshenoy]

great video, understood a lot 🙌🙌Thank you

[ritikshandilya]

amazing explanation, thanks for solution

[shashwat_tiwari_st]

like target for this video is 120. Please do like if you have understood the explanation as well as the code!!😄😄

[ArpitKhandelwal-wr]

sir please can you make a video on yesterday question

[yashgupta]

Don't stop making videos on leet code daily challenge

[ThePurshottamKumar]

Thanks for the explanation, really helped a lot

[Reaps-]

Sir, can you make a video on the problem for day 15th of september