The first round was held on HackerRank. There were 15 technical questions on OOP, DBMS, networks. There were 15 aptitude questions and 1 coding question. The technical and aptitude questions were fairly easy, but the coding question was a hard DP problem.

You are given two integer arrays A and B. You are allowed to perform the following operation any number of times on either array:

Choose any two elements from the array and replace them with their sum.

Effectively, this operation reduces the array length by one and groups the chosen elements into a single sum.

Your task is to determine the maximum possible length of identical arrays that can be obtained by performing any number of such operations on both arrays. Two arrays are considered identical if they have the same elements in the same order.