Implement a function to determine if two strings are one edit away from being the same string. An edit can be an insertion, deletion, or replacement of a character. Please implement the following function: ```python def isOneEditAway(first: str, second: str) -> bool: ``` ### Constraints: - 0 <= first.length, second.length <= 100 - Both strings consist of lowercase English letters. ### Example 1: Input: first = "pale", second = "ple" Output: true ### Example 2: Input: first = "pales", second = "pal" Output: false

``` def isOneEditAway(first: str, second: str) -> bool: len1, len2 = len(first), len(second) if abs(len1 - len2) > 1: return False edits = 0 i, j = 0, 0 while i < len1 and j < len2: if first[i] != second[j]: edits += 1 if edits > 1: return False if len1 > len2: i += 1 elif len1 < len2: j += 1 else: i += 1 j += 1 else: i += 1 j += 1 return True ```