Given an array arr[] of N non-negative integers representing the height of blocks. If width of each block is 1, compute how much water can be trapped between the blocks during the rainy season. Example 1: Input: N = 6 arr[] Output: 10 = {3,0,0,2,0,4}

Describe preconditioning in a few words.

Select the for-loop which iterates through all even index values of an array.A. for(int idx = 0; idx < length; idx++)B. for(int idx = 0; idx < length; idx%2)C. for(int idx = 0; idx < length; idx+2)D. for(int idx = 0; idx < length; idx=idx+2)

Suppose the weekly hours for all employees are stored in a two-dimensional array. Each row records an employee's seven-day work hours with seven columns. For example, the following array stores the work hours for eight employees. Su MTW Th F Sa Su Employeel 0 Employee2 1 Employee3 2 Employee4 3 Employees 7 Employee6 5 Employee7 6 Employee8 7 52 2 2 13 7 34 4 3. 4 4 34 9 34 6 8 3 3. 32 2 by Java code 3 4 6. 3 4 4 6 3 4 374 8 3 8 6 35 9 87 4 4 27 Write a program that Prompt the user to enter number of employees Prompt the user to enter the employees names and save their names in a one dimensional array. (Check for availability if name exist, no duplicate names) For each employee, enter the seven-day work hours and save them in a two dimensional array. Compute the total hours worked by each employee and save them in one dimensional array. Compute the wages of employees as follows: up to 40 hours per week the hour price is 20 otherwise the overtime hour price is 1.2 regular hour price.…

You are given an array prices where prices[i] is the price of a given stock on the ith day.   You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.   Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.       Example 1:   Input: prices = [7,1,5,3,6,4] Output: 5 Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5. Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell. Example 2:   Input: prices = [7,6,4,3,1] Output: 0 Explanation: In this case, no transactions are done and the max profit = 0.   Please solve it in Java

public class ArraySection {     static void arraySection(int a[], int b[]) {        int k =  0;        int [] c = new int[a.length];        for(int i = 0; i < a.length; i++) {            for(int j = 0; j < b.length; j++)                if(a[i] == b[j])                    c[k++] = a[i];                                        }        for(int i = 0; i < k; i++)            System.out.println(c[i]);            System.out.println();    }    public static void main(String[] args) {         int a[] = { 1, 2, 3, 4, 5 };        int b[] = { 0, 2, 4,5 };                        arraySection(a,b);        }}   Calculate the algorithm step number and algorithm time complexity of the above program?

Python Programming

Given an integer array nums, rotate the array to the right by k steps, where k is non-negative.   Example 1: Input: nums = [1,2,3,4,5,6,7], k = 3Output: [5,6,7,1,2,3,4]Explanation:rotate 1 steps to the right: [7,1,2,3,4,5,6]rotate 2 steps to the right: [6,7,1,2,3,4,5]rotate 3 steps to the right: [5,6,7,1,2,3,4]Example 2: Input: nums = [-1,-100,3,99], k = 2Output: [3,99,-1,-100]Explanation: rotate 1 steps to the right: [99,-1,-100,3]rotate 2 steps to the right: [3,99,-1,-100]  Constraints: 1 <= nums.length <= 105-231 <= nums[i] <= 231 - 10 <= k <= 105  Follow up: Try to come up with as many solutions as you can. There are at least three different ways to solve this problem.Could you do it in-place with O(1) extra space?

The programming language used is Java

A majority element is an element that makes up more than half of the items inan array. Given a positive integers array, find the majority element. If there is no majority element,return -1. Do this in O(N) time and 0(1) space.Input: 1 2 5 9 5 9 5 5 5Output: 5