Message on Whatsapp 8879355057 for DSA(OA + Interview) + Fullstack Dev Training + 1-1 Personalized Mentoring to get 10+LPA Guaranteed Job
1 like 0 dislike

Given two arrays arr1, arr2 of length n where 1 <=n <= 10^5.

Build a matrix mat of N*N where in the
mat[i][j] = arr1[i]^arr2[j].

Then return the summation of the matrix formed. I could able to solve it in O(N*N). Can this be solved in lesser time complexity ? Appericate any help here.

in Online Assessments by Expert (119,150 points) | 522 views

Please log in or register to answer this question.