Longest Substring with At Most K Distinct Characters, is a LeetCode problem from String subdomain. In this post we will see how we can solve this challenge in Swift

Problem Description

You can find the full details of the problem Longest Substring with At Most K Distinct Characters at LeetCode

Solution

note to handle the end of string edge case

Note: k may be invalid, mention that with interviewer

Time Complexity: O(n), Space Complexity: O(n)

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu