function longestCommonPrefix() {
	var prefix;
	var list;
	var str;
	var ch;
	var M;
	var N;
	var i;
	var j;

	if ( arguments.length === 1 && isArrayLikeObject( arguments[ 0 ] ) ) {
		list = arguments[ 0 ];
	} else {
		list = [];
		for ( i = 0; i < arguments.length; i++ ) {
			list.push( arguments[ i ] );
		}
	}
	M = list.length;
	if ( M === 0 ) {
		return '';
	}
	prefix = list[ 0 ];
	if ( !isString( prefix ) ) {
		throw new TypeError( format( 'invalid argument. Must provide a string. Value: `%s`.', prefix ) );
	}
	if ( M === 1 ) {
		return prefix;
	}
	N = prefix.length;
	for ( i = 0; i < N; i++ ) {
		ch = prefix[ i ];
		for ( j = 1; j < M; j++ ) {
			str = list[ j ];
			if ( !isString( str ) ) {
				throw new TypeError( format( 'invalid argument. Must provide a string. Value: `%s`.', str ) );
			}
			if ( i >= str.length || str[ i ] !== ch ) {
				return prefix.substring( 0, i );
			}
		}
	}
	return prefix;
}
Returns the longest common prefix.

## Notes

-   The algorithmic complexity is `O(M*N)` where `M` is the number of strings and `N` is the length of the first string.

@private
@param {(string|StringArray)} arg - a string or list of strings
@param {string} [...str] - strings
@throws {TypeError} must provide strings
@returns {string} longest common prefix

@example
var prefix = longestCommonPrefix( 'beep', 'bebop' );
// returns 'be'

@example
var prefix = longestCommonPrefix( [ 'beep', 'bebop' ] );
// returns 'be'