Jaccard Distance


Difficulty: 3 | Problem written by mesakarghm
Problem reported in interviews at


The Jaccard Distance between two sentences is the complement of the Jaccard similarity between the given two sentences. 

Write a function jaccard_distance(list1,list2) which calculates the Jaccard distance between the given lists and returns it. 

Inputs will be two lists, with a vectorial representation of words (int values), and the output should be the Jaccard distance among the given two lists (float). 

Sample Input:
<class 'list'>
list1: [1, 0, 0, 1]
<class 'list'>
list2: [0, 1, 1]

Expected Output:
<class 'float'>

This is a premium problem, to view more details of this problem please sign up for MLPro Premium. MLPro premium offers access to actual machine learning and data science interview questions and coding challenges commonly asked at tech companies all over the world

MLPro Premium also allows you to access all our high quality MCQs which are not available on the free tier.

Not able to solve a problem? MLPro premium brings you access to solutions for all problems available on MLPro

Get access to Premium only exclusive educational content available to only Premium users.

Have an issue, the MLPro support team is available 24X7 to Premium users.

This is a premium feature.
To access this and other such features, click on upgrade below.

Log in to post a comment

Jump to comment-193
mo_venouziou • 1¬†month, 2¬†weeks ago


In the test case, both lists contain the same set of words {0, 1}, so shouldn't the distance = 0, rather than .6?


Input Test Case

Please enter only one test case at a time
numpy has been already imported as np (import numpy as np)