docs: public static <T> boolean hasIntersection(T[] from, T[] target) {
          if (isEmpty(target)) {
              return true;
          }
  
          if (isEmpty(from)) {
              return false;
          }
  
          for (int i = 0; i < from.length; i++) {
              for (int j = 0; j < target.length; j++) {
                  if (from[i] == target[j]) {
                      return true;
                  }
              }
          }
          return false;
      }