Two sum problem | Java program

Given an array of integers nums and an integer target, return indices of the two numbers 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.

You can return the answer in any order.

Example 1:

Example 2:

Example 3:

Method 1 : Brute force(Loop)

JAVApackage bracecoder;

import java.util.Scanner;

public class TwoSum {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
				
		Scanner scan=new Scanner(System.in);
		System.out.println("Enter number of count: ");
		int n=scan.nextInt();
		int[] nums=new int[n];
		System.out.println("Enter the number one by one: ");
		for(int i=0;i

OUTPUT

Method 2 : Hashmap

" style="position:absolute;top:0;left:0;width:100%;height:100%;border:0;" allowfullscreen>

JAVA
package bracecoder;

import java.util.HashMap;
import java.util.Scanner;

public class TwoSum2 {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
				
		Scanner scan=new Scanner(System.in);
		System.out.println("Enter number of count: ");
		int n=scan.nextInt();
		int[] nums=new int[n];
		System.out.println("Enter the number one by one: ");
		for(int i=0;i

OUTPUT