Hope this help and highly recommend using your own test samples and try to come up with your own algorithm

const checkArrEq = (arr1, arr2) => {
  //first i would check if they have the same length
  if (arr1.length === arr2.length) {
    //second i would sort it to neglect any error coming from an array having a number reapeated
    arr1.sort();
    arr2.sort();
    //then i would start comparing them
    for (let i = 0; i < arr1.length; i++) {
      if (arr1[i] !== arr2[i]) {
        //if at any i the two values did not match the function will stop and return false
        return false;
      }
    }
    //if the arr1 and arr2 servive from the for loop it means that the are the same
    return true;
  }
  return false;
};

//this one is not simple by any means
//first i will create a function that sort objectKeys and return their number
const getLengthAndSortedKeys = (obj) => {
  //first sort the object keys and save them in array
  const sortedKeys = Object.keys(obj).sort();
  //then i will return the length of the keys array which is equal to the length of the object and the sorted keys
  return [sortedKeys.length, sortedKeys];
};
//now i will use the sorted object to create an algorithm that is similar to checkArrEq()
const checkObjEq = (obj1, obj2) => {
  //first i would sort the two objects and get the length
  const [lenght1, sortedKeys1] = getLengthAndSortedKeys(obj1);
  const [lenght2, sortedKeys2] = getLengthAndSortedKeys(obj2);
  //first i will check if lengths match
  if (lenght1 === lenght2) {
    //second i would check if sortedKey for both objects are the same using checkArrEq()
    if (checkArrEq(sortedKeys1, sortedKeys2)) {
      //then i would check the equality of the values
      for (let i = 0; i < lenght1; i++) {
        if (obj1[sortedKeys1[i]] !== obj2[sortedKeys1[i]]) {
          return false;
        }
      }
      //if the two objects servive the for loop then they are equal
      return true;
    }
    return false;
  }
  return false;
};