Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2306. Naming a Company
Count the number of ordered pairs of distinct words (A, B) from a list such that swapping their first letters produces two new words that do not appear in the original list. The challenge is to do this efficiently for up to 5·10^4 words by exploiting the structure of shared suffixes and overlaps among first-letter groups.
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.