Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.