I don't agree with official solution its way to complicated and not practice for interview session

class Solution:

  '''
    first sort the array 

    Then for each array element at i, j 

    add elements at i and j

    now we need to find the remaining elements 

    define start pointer that goes --> and pointer end that goes <-- to find the remaining elements 

    since the array is sorted we know when move a start or end pointer

    add the elements at position start and end and see if this + the i, j additions = target

    -3, -1, 1, 1, 1, 1, 1, 2, 4
     i   j  s  -->        <-- e
  '''
  def searchQuadruplets(self, arr, target):
    quadruplets = []
    seen = set()
    
    arr.sort()
    
    for i in range(len(arr) - 3):
      for j in range(i + 1, len(arr) 

import java.util.*;

class Solution {

  public List<List<Integer>> searchQuadruplets(int[] arr, int target) {
    List<List<Integer>> quadruplets = new ArrayList<>();
    Arrays.sort(arr);
    for(int i = 0; i < arr.length - 3; i++){
        while(i > 0 && arr[i-1] == arr[i]){
          continue;
        }
        findAndPushTriplet(arr, i, quadruplets, target);
    }
    return quadruplets;
  }

  public static void findAndPushTriplet(int[] arr, int firstIndex, List<List<Integer>> quadruplets, int requiredTarget){
    boolean first = true;
    int j = firstIndex + 1;
    while(j < arr.length - 2){
        
        while(!first && arr[j] == arr[j-1] && j < arr.length - 2 ){
          j++;
        } 

        int left = j+1;
        int right = arr.length - 1;
        first =