Leetcode 1487. Making File Names Unique

Given an array of folder names, simulate creating them so that each duplicate gets the smallest positive integer suffix "(k)" to make it unique, and return the actual assigned names. The core challenge is efficiently finding the minimal k for collisions (including when names already contain parentheses) across up to 5×10^4 entries.