bfs using to find first valid string by currentStr[:j] + currentStr[j + 1:]

use two pointers and compare left and right num using abs

sort array, iterate over, avoid duplicates, move borders

fix the first two numbers using nested loops find the other two numbers using the two-pointer approach