You 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.

,Write a program to implement hashcode and equals.

In this problem you will implement a function called triangle_countwhich will take as input a graph object G, representing an undirectedgraph G, and will return the number of triangles in G. Do not use anyimports for this problem. To simplify the problem you may assume thateach edge is stored twice in G. That is if an edge goes from u to v then vwill be in u’s collection and u will be in v’s collection. If you would prefer,you may assume that an edge is only stored once. In either case G willneed to be regarded as undirected.

Write the implementation of a static method, called evenElements, that takes one input parameter, called inputS, of type IntStackInterface. The method extracts all even numbers from inputS and returns as output an IntArrayStack that includes all the extracted numbers. All other odd or zero elements must remain in inputS unchanged and in the same order.

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 .

The Problem The Mastermind game board game is a code breaking game with two players. One player (your program) becomes the codemaker, the other the codebreaker. The codemaker (your program) creates a 4 digit secret code which is randomly generated by the supplied code below and the codebreaker tries to guess the 4 digit pattern. import randomsecretCode =[]for i in range (0,4): n = random.randint(1,9) secretCode.append(str(n)) print (secretCode) # take this out when you are playing the game for real because it is a secret The secret code pattern generated above will consist of any of the digits 1-9 and can contain multiples of the same digit. Your program should then tells the codebreaker which digits should be in their guess by displaying a sorted list of the digit characters contained in the secret code python list . Use the loopfor digit in sorted(secretCode): #display each digit on the same line for the player to see; there could be duplicate digits in the secret Prompt...