ou are given an array of integers nums and an integer target. Return the indices of two numbers in the array such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. Implement a function in Java to solve this problem using a hash map, and explain the time and space complexity of your solution.

Use java and use proper code indentation.

Can you give me example of quadratic probing in C++ ? The quadratic problem function has one input, call it m where m is a int. The return type is an int. For example, you have the serial number 2232012, quadProb(2232012) will return an int. Assume that the hash table size is 450. Assume that you are working with an uninitialized 2D array. Also write an insert() function to populate this 2D array.

,Write a program to implement hashcode and equals.

Implement the following method in Java:public static void shuffle(Object[] obj){}It shuffles an array in nlog(n) time using recursion. You must not use helper methods or change parameters.Assume calls to the Random library happen in constant time. It should be possible for any element to re-position to any other position.After completion, explain why your algorithm runs in nlog(n) time.Hint: Think about merge sort.

The "dynamic array" data structure is used as the basis of Java's ArrayList library class. Describe this data structure and explain how it achieves (amortized) constant-time adding of elements, while also giving constant-time random access of elements. As part of your answer, make sure to explain what "amortized" means for the data structure.

Implement a function in Java to find the largest and smallest elements in an array of integers, and return them in a pair. The function should have a time complexity of O(n) and a space complexity of O(1).

//From what I can tell, the answer provided does not answer my question. Asking again. Please read. Write a Java program that implements both Linear Search and Binary Search. The program willtake a collection of objects (generic type data) as input and print the number of comparisons neededto find a target element within that collection.You will create the following two Java classes:1. SearchCombo.java : Code for both linearSearch and binarySearch will be in this class. Youmay take help from the textbook Chapter 9, Section 9.1. However, note that the design require-ments are different from the textbook code.•Both search methods must use the Comparable<T> interface and the compareTo() method.•Your program must be able to handle different data types, i.e., use generics.•For binarySearch, if you decide to use a midpoint computation formula that is different fromthe textbook, explain that formula briefly as a comment within your code. 2. Tester.java : This class will contain...

The exercise consists of Hashing. Note you are notallowed to rely on Java library classes in your implementation. Part 3Implement in Java a function that takes as input an integer n  2 and generates n differentstrings all hashing to the same value when the following hash function is used.public int hashCode(String s) { int hash = 0; int skip = Math.max(1, s.length() / 3); for (int i = 0; i < s.length(); i += skip) hash = (hash * 37) + s.charAt(i); return hash;}Assume ASCII characters. and please Briefly describe your implementation .