NEED IT URGENT IN C++/JAVA. PLEASE DO IT FAST.
Given a LinkedList, where each node contains small case characters, you he asked to form a strong password is chancers & the one in which no two characters are repeating The output password must be a continuous subset of the given Lidd Find the length of the strongest password that can be formed using the input takes
Example 1
inputs - abc-abc>bəb
Output 3
Explanation: The ariewer is abc, with the length of 3.
Example 2:
Input spowow>k->e-w
Output 3
Explanation: The answer is w-k-e, with the length of 3 Notice that the answer must be a continuous subset, powke is a subset and not a continuous subset
Expected Time Complexity: O(n)
Expected Space Complexity: O(1)