Mathworks | On-Campus HackerRank OA 2026 | Array Nullification | Minimum Complexity Level |Cracking the Mathworks Coding Round | Array Operations & Conference Scheduling Optimization

Question 1: Array Nullification Problem Statement: You are given two arrays, change and arr, of lengths n and m, respectively. In each operation, you can perform one of the following: You can decrement any element of arr by 1. If change[i] > 0 and arr[change[i]] = 0, you can change that element to NULL. Assume 1-based indexing and find the minimum number of operations required to change all elements of the array to NULL, or report -1 if not possible. ...