Algorithm · Apple · Medium
Create a scoring function that measures how nearly a string forms a palindrome when it is not perfectly palindromic. Choose the similarity dimensions to measure, assign an explicit weight to each, and explain what the resulting value communicates. The score should be interpretable and should allow two imperfect strings to be ranked against each other. No fixed formula is mandated. Provide one complete, concrete proposal that specifies: all preprocessing or normalization…
Checking your access…