2 sum coding problem смотреть онлайн

sorry for the video cutting just learning editing i dont know anyhing about it
2 sum is very popular coding problem often asked in interview
Brute force :-
import java.util.HashMap;
import java.util.Scanner;
import java.util.Map;
class TwoSum {
// Time complexity: O(n^2)
private static int[] findTwoSum_BruteForce(int[] nums, int target) {
for (int i = 0; i &it nums.length; i++) {
for (int j = i + 1; j &it nums.length; j++) {
if (nums[i] + nums[j] == target) {
return new int[] { i, j };
}
}
}
return new int[] {};
}


public static void main(String[] args) {
Scanner keyboard = new Scanner(System.in);

int n = keyboard.nextInt();
int[] nums = new int[n];
for(int i = 0; i &it n; i++) {
nums[i] = keyboard.nextInt();
}
int target = keyboard.nextInt();

int[] indices = findTwoSum_BruteForce(nums, target);

if (indices.length == 2) {
System.out.println(indices[0] + " " + indices[1]);
} else {
System.out.println("No solution found!");
}
}
}

Window method:-
class TwoSum {

// Time complexity: O(n*log(n))
private static int[] findTwoSum_Sorting(int[] nums, int target) {
Arrays.sort(nums);
int left = 0;
int right = nums.length - 1;
while(left &it right) {
if(nums[left] + nums[right] == target) {
return new int[] {nums[left], nums[right]};
} else if (nums[left] + nums[right] &it target) {
left++;
} else {
right--;
}
}
return new int[] {};
}
}