Count unique substrings of a string S present in a wraparound string

import java.util.*;
class GFG 
{
  
    // Function to find the count of
    // non-empty substrings of p present in s
    static void findSubstringInWraproundString(String p)
    {
      
        // Stores the required answer
        int ans = 0;

        // Stores the length of
        // substring present in p
        int curLen = 0;

        // Stores the current length
        // of substring that is
        // present in string s starting
        // from each character of p
        int arr[] = new int[26];

        // Iterate over the characters of the string
        for (int i = 0; i < p.length(); i++)
        {

            int curr = p.charAt(i) - 'a';

            // Check if the current character
            // can be added with previous substring
            // to form the required substring
            if (i > 0
                && (p.charAt(i - 1)
                    != ((curr + 26 - 1) % 26 + 'a'))) 
            {
                curLen = 0;
            }

            // Increment current length
            curLen++;
            if (curLen > arr[curr])
            {

                // To avoid repetition
                ans += (curLen - arr[curr]);

                // Update arr[cur]
                arr[curr] = curLen;
            }
        }

        // Print the answer
        System.out.println(ans);
    }

    // Driver Code
    public static void main(String args[])
    {
        String p = "zab";

        // Function call to find the
        // count of non-empty substrings
        // of p present in s
        findSubstringInWraproundString(p);
    }
}

// This code is contributed by hemanth gadarla

// Java code to count the number of distinct substrings in a wraparound string

import java.util.Arrays;

public class Main {
    public static int countSubstringsInWraparoundString(String p) {
        // Initialize an array to store the count
        // of distinct substrings starting with each letter
        int[] count = new int[26];
        Arrays.fill(count, 0);
        
        // Initialize the length of the longest increasing
        // substring ending at each position to 0
        int[] len_inc_substring = new int[p.length()];
        Arrays.fill(len_inc_substring, 0);
        
        // Iterate over the characters of the string
        for (int i = 0; i < p.length(); i++) {
            // Update the length of the longest increasing
            // substring ending at the current position
            if (i > 0 && (p.charAt(i) - p.charAt(i-1) + 26) % 26 == 1) {
                len_inc_substring[i] = len_inc_substring[i-1] + 1;
            }
            else {
                len_inc_substring[i] = 1;
            }
                
            // Update the count of distinct substrings
            // starting with the current letter
            count[p.charAt(i)-'a'] = Math.max(count[p.charAt(i)-'a'], len_inc_substring[i]);
        }
            
        // Return the sum of counts for all letters
        int total_count = 0;
        for (int i = 0; i < 26; i++) {
            total_count += count[i];
        }
        return total_count;
    }

    public static void main(String[] args) {
        String p = "zab";
        System.out.println(countSubstringsInWraparoundString(p)); // Output: 6
    }
}