Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Build a File-Backed Key-Value Store
Coding · File & Media Storage · Key-Value Stores
- Coding test: Given a simple mockup implement that UI. Some CSS is already provided and an API to fetch the data also exists. The recruiter prep doc talked about structuring the code well, making sure all functions work, write CSS and write tests. There is no way you can do it all in 1 hour, so it's probably best to ask the interviewer what they expect
Coding
- Concurrent file logger
Coding
- Configuration File Merger
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 2 records
Juniper Square
Leetcode 1487. Making File Names Unique
Reported Apr 22, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View sourceMeta
Leetcode 1487. Making File Names Unique
Reported Apr 10, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source