Core
Deduplication and LSH
Exact duplicates fall out of hashing the normalized content, but near-duplicates (the same record with a typo, a reordered address, boilerplate that repeats across documents) need similarity, not equality. MinHash estimates Jaccard similarity cheaply, and Locality-Sensitive Hashing buckets similar signatures so you only compare likely pairs instead of all O(n^2). This is a constant reflex when merging messy enterprise data and when curating training corpora.
a free account unlocks the core curriculum tier · no card
Related course lessons
- Profile the data and turn uncertainty into a scoped plan →
28 min · Free with sign-in
Foundations of Forward Deployed Engineering · syllabus - Resolve identities without hiding uncertain or unmatched records →
30 min · Free with sign-in
Foundations of Forward Deployed Engineering · syllabus - Keep link evidence, uncertainty and history in the query →
30 min · Free with sign-in
The FDE Engagement · syllabus
Related concepts
Practise this in questions
Coding & DSAFind near-duplicate documents in a 1TB corpus without comparing every pair. →hard · PremiumSQL & Data EngineeringA table has duplicate rows for the same business key. Write SQL to keep only the latest version of each. →easy · FreeCoding & DSAParse server logs and report the top-K users by error count per hour, handling malformed lines →medium · Free with sign-inCoding & DSASessionize a support-event stream: a gap over 30 minutes starts a new session; dedupe events →medium · Free with sign-inCoding & DSABuild a CSV diff tool: report added, removed, and changed rows between two files, with composite keys →medium · Free with sign-inBehavioral & Customer ScenariosMid-deployment, the data is far dirtier than scoped and the timeline is now impossible. Draft the conversation with the exec sponsor. →hard · Premium
