Problem:
Write a class named solution. In this class, you will define a class method named longestSubArrayNoRepeat which should:
Given an input array of integers, find the length of the longest subarray without repeating integers.
Example:
Input: nums = [2, 5, 6, 2, 3, 1, 5, 6] Output: 5 Explanation: [5, 6, 2, 3, 1] or [6, 2, 3, 1, 5] are both valid and of maximum length 5