Update 24551- Odd-String-Difference.md

Author: AmruthaPariprolu

dsa-solutions/lc-solutions/2400-2499/24551- Odd-String-Difference.md

@@ -12,7 +12,7 @@ description: Problem solution of Odd String Difference Problem
 
 You are given an array of equal-length strings words. Assume that the length of each string is n.
 
-Each string words[i] can be converted into a difference integer array difference[i] of length n - 1 where difference[i][j] = words[i][j+1] - words[i][j] where 0 <= j <= n - 2. Note that the difference between two letters is the difference between their positions in the alphabet i.e. the position of 'a' is 0, 'b' is 1, and 'z' is 25.
+Each string words[i] can be converted into a difference integer array difference[i] of length n - 1 where difference[i][j] = words[i][j+1] - words[i][j] where 0 &lt;= j &lt;= n - 2. Note that the difference between two letters is the difference between their positions in the alphabet i.e. the position of 'a' is 0, 'b' is 1, and 'z' is 25.
 
 For example, for the string "acb", the difference integer array is [2 - 0, 1 - 2] = [2, -1].
 All the strings in words have the same difference integer array, except one. You should find that string.