Coding Fundamentals

1.

Given a collection of already tokenized texts, calculate the IDF (Inverse document frequency of each token)

 2.

Calculate the Jaccard similarity between two sets: the size of the intersection divided by the size of the union.

 3.

Check if a tree is a binary search tree