Please enable JavaScript.
Coggle requires JavaScript to display documents.
FIA1 Task - Coggle Diagram
FIA1 Task
S3: Swapped 2 Characters
Implementation
"Swap window"?
Iterate between 2 characters
List comprehension?
Conditions
Assume contiguous
Efficiency
Under 10ms?
S1: Adjacent Key
Implementation
Levenshtein distance
Vectors?
Weighted/Unweighted?
DEALBREAKER: efficiency
Euclidean distance
Can loop characters instead of dictionary words
Efficient <10ms
Need to pre construct a mapping
Conditions
Assume only 1 typo is made
S2: Swapped 3 Characters
Conditions
Assume contiguous
Implementation
Similar with S3?
Increase swap window size to 3
High efficiency, follows S3
Permutations? Generate all possible cases in the window
Need to remove duplicates