This is a challenge I completed at CodeSignal.
You are given an array of desired filenames in the order of their creation. Since two files cannot have equal names, the one which comes later will have an addition to its name in a form of (k)
, where k
is the smallest positive integer such that the obtained name is not used yet.
Return an array of names that will be given to the files.
Example
For names = ["doc", "doc", "image", "doc(1)", "doc"]
, the output should be
fileNaming(names) = ["doc", "doc(1)", "image", "doc(1)(1)", "doc(2)"]
.
function fileNaming(names) {
arr = []
for (let i = 0; i < names.length; i++) {
if (!arr.includes(names[i])) {
arr.push(names[i])
} else {
for (let j=1; ; j++) {
const str = `${names[i]}(${j})`
if (!arr.includes(str)) {
arr.push(str)
break
}
}
}
}
return arr
}
The code passed all tests at CodeSignal.