Difference Check | GFG POTD| GeeksForGeeks| Problem of the Day | Java| Easy Solution

In this question I have solved gfg problem of the day using very simple and easy to understand approach.

problem link-https://www.geeksforgeeks.org/problem...


-----------------------------------------------------------------------------------------------------------------------
Difference Check

Given an array arr[] of time strings in 24-hour clock format "HH:MM:SS", return the minimum difference in seconds between any two time strings in the arr[].
The clock wraps around at midnight, so the time difference between "23:59:59" and "00:00:00" is 1 second.

Examples:

Input: arr[] = ["12:30:15", "12:30:45"]
Output: 30
Explanation: The minimum time difference is 30 seconds.
Input: arr[] = ["00:00:01", "23:59:59", "00:00:05"]
Output: 2
Explanation: The time difference is minimum between "00:00:01" and "23:59:59".
-------------------------------------------------------------------------------------------------------------------

***************************************************************************



#dsa #programming #gfg #gfgpotd #problemsolving #coding #softwareengineer #faang #competitiveprogramming #dsasheet #interviewpreparation #coding #gfg #geeksforgeeks #leetcode #potd #coding #india #easyexplaination #leetcode #leetcodechallenge #leetcodedailychallenge
#java #codinginterviews #problemoftheday #algorithm #datastructures #hindi #bitmanipulation #bits #competitiveprogramming