java getDup accepts an array and returns an int. If there is any element is duplicated, the method counts how many of those present in the array. Example :   getDup(["1","2","aa"',"1"])   returns:2 ("1" is duplicated and there are two "1"s so return is 2)   class Main {      public static int getDup(String[] r) {              }   public static void main(String[] args) {       Scanner in = new Scanner(System.in);       String [] strs = new String[in.nextInt()];       for(int i=0; i < strs.length; i++) {         strs[i] = in.next();       }     System.out.println(getDup(strs));   }  } hint: you will need a nested array the will run on the array we get from the method argument. inside the nested loop you will need to check if the main array element is equal to the current

public class ArrayCommonOperations{    public static void main(String [] args)    {         //*** Task #1: Define and instantiate an array of integer numbers, with 10 elements         //*** Task #2: Fill in the array with integer numbers from 1 to 100         //*** Task #3:     define another array, named temp, and copy the initial array in it.        //*                This allows to preserve the original array         //*** Task #4:  Define the variables you need to calculate the following values,        //*                and initialize them with appropriate values.         //*** Task #5:     Print the original array         //*** Task #6:     Calculate the sum of all values         //*** Task #7:     Count the number of even values         //*** Task #8:     Calculate the minimum value in the array         //*** Task #9:     Calculate the maximum value in the array         //*** Task #10: Replace the elements that are divisible by 3, with their value plus 2         //*** Task #11:…

X42: frontPiece Given an int array of any length, return a new array of its first 2 elements. If the array is smaller than length 2, use whatever elements are present. Examples: frontPiece ({1, 2, 3}) -> {1, 2} frontPiece ({1, 2}) -> {1, 2} Your Answer: Feedback Your feedback will appear here when you check 1 public int[] frontPiece(int[] nums) 2 { your answer. 3 4 }

public int[] selectionSort(int[] array) {for (int i = 0; i < array.length - 1; i++) {int min = array[i];int minIndex = i;for (int j = i + 1; j < array.length; j++) {if (min > array[j]) {min = array[j];minIndex = j;}}if (minIndex == i) {array[minIndex] = array[i];array[i] = min;}}return array;}

C++

1. Array splitting in Java Create an integer array with 10 integer numbers, initialize the array arbitrarily but make sure there are both positive and negative integers. Then generate two arrays out of the original array, one array with all natural numbers (positive numbers or zeros) and another one with all negative numbers. Print out the number of elements and the detailed elements in each array.

1. Given a string of at least 3 characters as input, if the length of the string is odd return the character in the middle as a string. If the string is even return the two characters at the midpoint.   public class Class1 {    public static String midString(String str) { //Enter code here } }   -----------   2. Given an array of integers return the sum of the values stored in the first and last index of the array. The array will have at least 2 elements in it   public class Class1 {    public static int endSum(int[] values) { //Enter code here }    }   -----------   3. The method takes a string as a parameter. The method prints treat if the string is candy or chocolate (of any case, such as CaNdY) Otherwise print trick   import java.util.Scanner;   public class Class1 { public static void trickOrTreat(String str) { //Enter code here }    public static void main(String[] args) { Scanner s = new Scanner(System.in); trickOrTreat(s.nextLine()); } }

Enhanced selection sort algorithm SelectionSortDemo.java  package chapter7; /** This program demonstrates the selectionSort method in the ArrayTools class. */ public class SelectionSortDemo { public static void main(String[] arg) { int[] values = {5, 7, 2, 8, 9, 1}; // Display the unsorted array. System.out.println("The unsorted values are:"); for (int i = 0; i < values.length; i++) System.out.print(values[i] + " "); System.out.println(); // Sort the array. selectionSort(values); // Display the sorted array. System.out.println("The sorted values are:"); for (int i = 0; i < values.length; i++) System.out.print(values[i] + " "); System.out.println(); } /** The selectionSort method performs a selection sort on an int array. The array is sorted in ascending order. @param array The array to sort. */ public static void selectionSort(int[] array) { int startScan, index, minIndex, minValue; for (startScan = 0; startScan < (array.length-1); startScan++) { minIndex = startScan; minValue…

Method Details getCountInRange public static int getCountInRange​(int[] array, int lower, int upper) Returns the number of values in the range defined by lower (inclusive) and upper (inclusive) Parameters: array - integer array lower - lower limit upper - upper limit Returns: Number of values found  Throws: java.lang.IllegalArgumentException - if array is null or lower is greater than upper Any error message is fine (e.g., "Invalid parameters(s)")

Please help with this java problem