Longest Distinct characters in string
Easy Accuracy: 40.58% Submissions: 8394 Points: 2

Given a string S, find length of the longest substring with all distinct characters.

Example 1:

Input:
S = "geeksforgeeks"
Output: 7
Explanation: "eksforg" is the longest
substring with all distinct characters.


â€‹Example 2:

Input:
S = "aaa"
Output: 1
Explanation: "a" is the longest substring
with all distinct characters.


You don't need to read input or print anything. Your task is to complete the function longestSubstrDitinctChars() which takes the string S as input and returns the length of the longest substring with all distinct characters.

Expected Time Complexity: O(|S|).
Expected Auxiliary Space: O(K), where K is Constant.

Constraints:
1<=|S|<=105

We are replacing the old Disqus forum with the new Discussions section given below.