Duplicate Zeroes Given a fixed length array arr of integers, duplicate each occurrence of zero, shifting the remaining elements to the right. Note that elements beyond the length of the original array are not written. Do the above modifications to the input array in place , do not return anything from your function. Example 1: Input: [1,0,2,3,0,4,5,0] Output: null Explanation : After calling your function, the input array is modified to: [1,0,0,2,3,0,0,4] Example 2: Input: [1,2,3] Output: null Explanation: After calling your function, the input array is modified to: [1,2,3] Note: 1 <= arr.length <= 10000 0 <= arr[i] <= 9 C++ Code : void duplicateZeros(vector<int>& arr) { int n=arr.size(); int newLength=n+count(arr.begin(),arr.end(),0); vector<int>newArray; int ind=0; for(in...
Squares of a Sorted Array Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order . Example1: Input: nums = [-4,-1,0,3,10] Output: [0,1,9,16,100] Explanation: After squaring, the array becomes [16,1,0,9,100]. After sorting, it becomes [0,1,9,16,100]. Example2: Input: nums = [-7,-3,2,3,11] Output: [4,9,9,49,121] Constraints: 1 <= nums.length <= 10 4 -10 4 <= nums[i] <= 10 4 nums is sorted in non-decreasing order. C++ Code: vector<int> sortedSquares(vector<int>& nums) { for(int i=0;i<nums.size();i++){ nums[i]*=nums[i]; } sort(nums.begin(),nums.end()); return nums; } _____________________________________________________...