1700th LeetCode Problem Solved
The 1700th LC problem solved was a simple approach using frequency count and two-pointers for a linear solution in space and time. Code is down below, cheers, ACC. Mirror Frequency Distance - LeetCode You are given a string s consisting of lowercase English letters and digits. For each character, its mirror character is defined by reversing the order of its character set: For letters, the mirror of a character is the letter at the same position from the end of the alphabet. For example, the mirror of 'a' is 'z' , and the mirror of 'b' is 'y' , and so on. For digits, the mirror of a character is the digit at the same position from the end of the range '0' to '9' . For example, the mirror of '0' is '9' , and the mirror of '1' is '8' , and so on. For each unique character c in the string: Let m be its mirror character. Let f...