We’ve put together this coding challenge to give you a sense of the type of problems we tackle at Sortable. Use any language you’d like as long as we can compile and run it on Linux systems.
The goal is to match product listings from a 3rd party retailer, e.g. “Nikon D90 12.3MP Digital SLR Camera (Body Only)” against a set of known products, e.g. “Nikon D90”.
We’ll provide you with a set of products and a set of price listings matching some of those products. The task is to match each listing to the correct product. Precision is critical. We much prefer missed matches (lower recall) over incorrect matches, so try hard to avoid false positives. A single price listing may match at most one product.
At Sortable we do a lot of data integration. A simplified example: product specifications might come from one data source, product pricing from another, and product reviews from a third. A major challenge in working with all this data is determining when two pieces of information from disparate data sources are actually talking about the same product. In academic circles this problem is sometimes called Record Linkage, Entity Resolution, Reference Reconciliation, or a host of other fancy terms. We describe this problem very technically as “matching.”
How to enter
- Complete the challenge in any language you like (that we can build and run on Linux)
- Make sure your output conforms to our spec below, use our validator service to check:
- curl -XPOST -F file=@/path/to/your/results.txt https://challenge-check.sortable.com/validate
- Put the source code for your solution up on your GitHub account (please don’t send a tarball or zip file)
- Make it easy for us to run your solution
- e.g. “clone my repository and run go.sh”
- Note: Requiring an IDE to run the solution is not acceptable, sorry!
- Email email@example.com with
- The location of your GitHub repo
- Your resume
- Any other relevant info
What we’re looking for
- Readable, efficient code
- Precision – do you make many false matches?
- Recall – how many correct matches did you make?
- Appropriate data structure and algorithm choices
The inputs and outputs for this challenge are in the so-called JSON lines format. That is, one valid JSON object per line, with newline separators.
"product_name": String // A unique id for the product
"family": String // optional grouping of products
"announced-date": String // ISO-8601 formatted date string, e.g. 2011-04-28T19:00:00.000-05:00
"title": String // description of product for sale
"manufacturer": String // who manufactures the product for sale
"currency": String // currency code, e.g. USD, CAD, GBP, etc.
"price": String // price, e.g. 19.99, 100.00
A file full of Result objects is what your solution will be generating. A Result simply associates a Product with a list of matching Listing objects.
Contains two files:
- products.txt – Contains around 700 products
- listings.txt – Contains about 20,000 product listings
Products file (products.txt)
- Text file with one Product object per line.
Listings file (listings.txt)
- Text file with one Listing object per line.
The output your solution creates should be a text file with one Result object per line.