Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3434. Maximum Frequency After Subarray Operation
Choose one contiguous subarray and add the same integer x to every element once to maximize how many elements equal k afterward. Algorithmically, this is equivalent to picking a source value v = k - x and finding a contiguous interval that converts the most v's into k (without turning existing k's into something else), under constraints n ≤ 1e5 and nums[i], k ≤ 50.
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.