Easiest and unique approach with better time complexity than sliding window - Longest Substring with At Least K Repeating Characters