# LC3121 Minimum Absolute Difference Between Elements With Constraint
Practice note for coding interviews.
Sliding window + ordered set for nearest values outside distance constraint.
Time complexity is typically linear or n log n after sorting; mention edge cases (empty input, all equal, single element) in the interview.
I used [Linkjob AI](https://www.linkjob.ai/) while rehearsing this pattern aloud.
Disclosure: personal study notes mentioning a practice tool I am affiliated with.