Write a JAVA program to find the unique element which is present only once in the given array. All the remaining elements are repeated twice in the array. int []a = {2, 14, 6, 22, 2, 34, 22, 8, 6, 14, 8}; Use constant space and linear time.

Java Programming Question Given an array of integers, find out the smallest positive integer missing from the array. Example: Array = [-1, -3, 3, 2, 8,6] Output: 1.

Use Java to write a program that prompts the user for a positive odd integer , generates a normal magic square of order size of that integer, and prints it with numbers right-justified and aligned in evenly-spaced columns. (Magic square definition: https://en.wikipedia.org/wiki/Magic_square. Can assume that the numbers in the square are 3 digits or less (i.e. size ≤ 31). Have the construction of the 2D integer array magic square take place in a public static method getMagicSquare that takes in an integer n as a parameter and returns the 2D integer array magic square as specified.  Your main method should perform input and output (I/O) and call this method to perform the computation.    Methods for generating a magic square : Assign 1 to our initial current position: the bottom row, middle column.  Place each successive value (up to size * size) in the first of the following positions that is unoccupied: (1) one space down and to the right, or (2) one space up.  Positions wrap around…

Given an array below, write a Java program to take input an integer n from the user and print the "True" or "False" depending upon the number n is present twice in the array or not. int [Jarr = {12,-67,13, 15, 12, 15, -67, 0, 1,1}