Hacker's Team

Problem Statement

Hacker's Team Problem Description A cyber security firm is building a team of hackers from two groups, A and B. The skill level of the i-th hacker in team A is team_a[i], and in team B is team_b[i]. A team is considered strong if, for each position i, a hacker is selected from either team A or team B, and the skill levels of the selected team are in non-decreasing order. Given two arrays team_a and team_b of equal length, find the maximum possible length of a subarray (i.e., a contiguous segment of indices) such that selecting hackers from either team_a or team_b for each position in that subarray results in a strong team. Function Signature Complete the function getMaxSubarrayLen in the editor. The function is expected to return an INTEGER. The function accepts the following parameters: - INTEGER_ARRAY team_a - INTEGER_ARRAY team_b def getMaxSubarrayLen(team_a, team_b): # Write your code here Examples Example 1: Input: n = 3 team_a = [2, 7, 3] team_b = [4, 2, 6] Output: 3 Explanation: