Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3460. Longest Common Prefix After at Most One Removal
Given an array of strings, you may remove at most one string — choose the removal (or none) that yields the longest common prefix among the remaining strings and return that prefix (or its length). The core challenge is identifying the possible outlier to drop and efficiently computing the resulting common prefix across all other strings.
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.