Write an algorithm such that if an element in an MxN matrix is 0, its entire row and column are set to 0. To achieve the best time complexity of O(M*N) and space complexity of O(1), you can use the following algorithm:
In the given array , return indices of 2 numbers should match the target while they add Ex: 1 Input: nums = [1,2,7,11], target =3Output: [0,1]Explanation: nums[0]+nums[1]==3, we return [0,1] So we can solve the Two Sum problem in Java using a hashmap to store the values you’ve seen so far and their indices. Here’s a Java code… Read More »