A higher resolution is required to access the IDE
- 1
Learning Opportunities
This puzzle can be solved using the following concepts. Practice using these concepts and improve your skills.
Statement
Goal
In our interconnected world, people across different time zones often coordinate meetings and events. Sometimes, purely by coincidence, the time displayed on clocks in two different time zones uses exactly the same digits arranged differently - creating what we call "synchronized scrambles."Given two time zones represented by their UTC offsets (in format ±HHMM), find all distinct time points where the clock readings in both zones are anagrams of each other when represented as 4-digit strings (in 24-hour HHMM format).
Two time readings are considered anagrams if they use exactly the same digits with the same frequency. For example,
Example:
Time zones: UTC+0200 and UTC+0530 (3.5 hours difference)
At UTC time
UTC+0200:
UTC+0530:
These are anagrams.
At UTC time
UTC+0200:
UTC+0530:
These are NOT anagrams (different digit frequencies).
Output all such anagram time pairs that occur within a 24-hour period, ensuring each represents the same moment in time across both zones.
Note: The possible values of timezone offsets come from this Wikipedia page: https://en.wikipedia.org/wiki/List_of_tz_database_time_zones#Further_reading and could include offsets not currently in use.
Note: Ignore leap seconds, daylight savings and other timezone shenanigans and treat the timezone offset as is.
Input
Two UTC offset strings separated by a space
offset1 offset2
Output
Time pairs in the format ,
HHMMrepresenting the time in the two timezones printed one per line. The entries must be sorted in lexicographical order and separated by a comma and space, HHMM
Constraints
offset1 ≠offset2
Each case is guaranteed to have at least one anagram time pair.
Each case is guaranteed to have at least one anagram time pair.
Example
Input
-0930 -0044
Output
1205, 2051
A higher resolution is required to access the IDE