Add Java solution for 2451. Odd String Difference

[rachelrowe898]

Pull Request Template

Description

The 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.

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.

Return the string in words that has different difference integer array.

Time complexity: O(n * m) where n is the number of words and m is the length of words.

Space complexity: O(1) as we make no allocations and don't use recursion.

Difficulty: Easy

Put check marks:

Have you made changes in README file ?

• Added problem & solution under correct topic.
• Specified Space & Time complexity.
• Specified difficulty level, tag & Note(if any).

Make sure all below guidelines are followed else PR will get Reject:

• My code follows the style guidelines of this project
• I have performed a self-review of my own code
• I have commented my code so that it is easy to understand
• I have made corresponding changes to the documentation
• My changes generate no new warnings
• Any dependent changes have been merged and published in downstream modules

[welcome]

I can tell this is your first pull request! Thank you I'm so honored. 🎉🎉🎉 I'll take a look at it ASAP!