src/07-file-names.js
/**
 * There's a list of file, since two files cannot have equal names,
 * the one which comes later will have a suffix (k),
 * where k is the smallest integer such that the found name is not used yet.
 *
 * Return an array of names that will be given to the files.
 *
 * @param {Array} names
 * @return {Array}
 *
 * @example
 * For input ["file", "file", "image", "file(1)", "file"],
 * the output should be ["file", "file(1)", "image", "file(1)(1)", "file(2)"]
 *
 */
There's a list of file, since two files cannot have equal names,
the one which comes later will have a suffix (k),
where k is the smallest integer such that the found name is not used yet.

Return an array of names that will be given to the files.

@param {Array} names
@return {Array}


There ' s a list of file since two files cannot have equal names the one which comes later will have a suffix ( k ) where k is the smallest integer such that the found name is not used yet . Return an array of names that will be given to the files . @param { Array } names @return { Array }
function renameFiles(names) {
  const arr = names;
  const items = {};
  const res = [];
  arr.forEach((el) => {
    if (items[el]) {
      const c = `${el}(${items[el]})`;
      res.push(`${el}(${items[el]})`);
      items[el] += 1;
      items[c] = 1;
    } else {
      res.push(el);
      items[el] = 1;
    }
  });
  return res;
}
function renameFiles ( names ) { const arr = names ; const items = { } ; const res = [ ] ; arr . forEach ( ( el ) => { if ( items [ el ] ) { const c = ` ${ el } ${ items [ el ] } ` ; res . push ( ` ${ el } ${ items [ el ] } ` ) ; items [ el ] += 1 ; items [ c ] = 1 ; } else { res . push ( el ) ; items [ el ] = 1 ; } } ) ; return res ; }
There's a list of file, since two files cannot have equal names,
 the one which comes later will have a suffix (k),
 where k is the smallest integer such that the found name is not used yet.
There ' s a list of file since two files cannot have equal names the one which comes later will have a suffix ( k ) where k is the smallest integer such that the found name is not used yet .