Java Program for Check if a string can be formed from another string by at most X circular clockwise shifts

Given an integer X and two strings S1 and S2, the task is to check that string S1 can be converted to the string S2 by shifting characters circular clockwise atmost X times.

Input: S1 = "abcd", S2 = "dddd", X = 3 
Output: Yes 
Explanation: 
Given string S1 can be converted to string S2 as- 
Character "a" - Shift 3 times - "d" 
Character "b" - Shift 2 times - "d" 
Character "c" - Shift 1 times - "d" 
Character "d" - Shift 0 times - "d"

Input: S1 = "you", S2 = "ara", X = 6 
Output: Yes 
Explanation: 
Given string S1 can be converted to string S2 as - 
Character "y" - Circular Shift 2 times - "a" 
Character "o" - Shift 3 times - "r" 
Character "u" - Circular Shift 6 times - "a"  

Approach: The idea is to traverse the string and for each index and find the difference between the ASCII values of the character at the respective indices of the two strings. If the difference is less than 0, then for a circular shift, add 26 to get the actual difference. If for any index, the difference exceeds X, then S2 can't be formed from S1, otherwise possible. 
Below is the implementation of the above approach: 

YES

Time Complexity:O(N),N=Length(S1)

Auxiliary Space:O(1)