One possible implementation could be:
function isAbsentValue(value) {
  return value === null || value === undefined;
}

function findValue(item, keys) {
  if (typeof item !== 'object') {
    return item;
  } else if (typeof item === 'object' &amp;&amp; !keys.length) {
    return null;
  }

  for (let i = 0; i &lt; keys.length; i++) {
    let currentKey = keys[i];

    if (!Object.prototype.hasOwnProperty.call(item, currentKey)) {
      return null;
    }

    return findValue(item[currentKey], keys.slice(1));
  }
}

function sortBy(collection, property) {
  // DO NOT REMOVE
  'use strict';

  // write your code below

  const isCollectionInvalid = !collection || !Array.isArray(collection);
  const isPropertyInvalid = !property || !property.trim().length;

  // early escape if input params are incorrect
  if (isCollectionInvalid || isPropertyInvalid) {
    throw new TypeError('Invalid params');
  }

  // cloning the array
  // as we need to avoid input array mutation
  const cloned = window.structuredClone(collection);

  // converting property path to array
  const keys = property.split('.');

  // checking if path is nested or not
  const isNestedKey = keys.length &gt; 1;

  // sorting
  cloned.sort((x, y) =&gt; {
    let valueOne = x[keys[0]];
    let valueTwo = y[keys[0]];

    if (!isNestedKey) {
      // if valueOne is missing
      // keep then push it to the back
      if (isAbsentValue(valueOne)) {
        return 1;
      } else if (isAbsentValue(valueTwo)) {
        // if valueTwo is missing
        // keep then push it to the back
        return -1;
      }

      // if non-nested object then sort here only
      return valueOne &gt; valueTwo ? 1 : -1;
    }

    // find values from nested objects
    valueOne = findValue(x, keys);
    valueTwo = findValue(y, keys);

    // if valueOne is missing
    // keep then push it to the back
    if (isAbsentValue(valueOne)) {
      return 1;
    } else if (isAbsentValue(valueTwo)) {
      // if valueTwo is missing
      // keep then push it to the back
      return -1;
    }

    // sorting
    return valueOne &gt; valueTwo ? 1 : -1;
  });
  
  // return the final sorted array
  return cloned;
}
Do you see value in our efforts?

How to Sort an Array of Objects by Property Values? | Frontend Problem Solving | JavaScript Interview Questions | Lodash Polyfill

@Devtools Tech
