Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2068. Check Whether Two Strings are Almost Equivalent
Determine whether two equal-length lowercase strings are "almost equivalent" by verifying that for every letter 'a'–'z' the absolute difference in their frequencies is at most 3; return true if all letters satisfy this, otherwise false.
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.