Brute Force

Algorithm

Iterate through the array using a for loop from 0th index to sizeofArray - 1, to take all possible starting points of the substring into consideration.
Check if the current character is already in the hash array, if so, break out of the loop. Otherwise, as it is not visited yet, mark the character as 1 in the hash array, signifying that the current character is now visited.
Now, calculate the length of current substring and update the maximum length of the substrings found so far. Finally, return the maximum length.

Code

#include <bits/stdc++.h>
using namespace std;

c