June 21, 2025

1 thought on “Solve the HackerRank Substring Challenge (Java Solution)

  1. public static int CountUniqueSubstrings(string s)
    {
    int count = 0;
    int n = s.Length;
    HashSet uniqueChars = new HashSet();
    for (int i = 0; i < n; i++)
    {
    uniqueChars.Clear();

    for (int j = i; j < n; j++)
    {
    if (uniqueChars.Contains(s[j]))
    {
    break;
    }
    uniqueChars.Add(s[j]);
    count++;
    }
    }
    return count;
    }

Leave a Reply

Your email address will not be published. Required fields are marked *