Edgeverve Coding Round | Reorder It Array Manipulation | Jan 16th Slot | Reorder Arrays for Lexicographically Smallest Hash | Edgeverve interview question

Question: Reorder It Problem Statement: You are given two arrays A, B of length N and an integer denoting P which will be used for hashing. An array C is formed as follows: c_i = (a_i + b_i) mod N. It is given that the length of C will be min(N, P). You can reorder one of the arrays A or B but not both. You want the array C to be lexicographically smallest. Your task is to print the ...