Challenge - 5 Problems
Similarity Search Master
Get all challenges correct to earn this badge!
Test your skills under time pressure!
🧠 Conceptual
intermediate1:30remaining
What is the main purpose of similarity search in AI?
Imagine you have a large photo album and want to find pictures that look like a specific photo. What does similarity search do in this context?
Attempts:
2 left
💡 Hint
Think about how you find things that look alike, not exactly the same.
✗ Incorrect
Similarity search helps find items that share common features or patterns, not just exact copies.
❓ Predict Output
intermediate1:30remaining
Output of cosine similarity calculation
What is the output of this cosine similarity calculation between vectors A and B?
Prompt Engineering / GenAI
import numpy as np A = np.array([1, 2, 3]) B = np.array([4, 5, 6]) cos_sim = np.dot(A, B) / (np.linalg.norm(A) * np.linalg.norm(B)) print(round(cos_sim, 2))
Attempts:
2 left
💡 Hint
Recall cosine similarity formula and calculate dot product and norms carefully.
✗ Incorrect
Cosine similarity measures the angle between two vectors; here it is approximately 0.87.
❓ Model Choice
advanced2:00remaining
Best model type for similarity search on text data
You want to build a system that finds similar sentences in a large document collection. Which model type is best suited for this task?
Attempts:
2 left
💡 Hint
Think about models that create meaningful vector representations of sentences.
✗ Incorrect
Transformer models like BERT create embeddings that capture sentence meaning, ideal for similarity search.
❓ Metrics
advanced1:30remaining
Choosing the right metric for nearest neighbor search
Which distance metric is most appropriate for measuring similarity between high-dimensional dense vectors from a neural network embedding?
Attempts:
2 left
💡 Hint
Consider which metric focuses on the angle between vectors rather than magnitude.
✗ Incorrect
Cosine similarity measures the angle between vectors, which is effective for high-dimensional embeddings.
🔧 Debug
expert2:00remaining
Debugging a similarity search code snippet
What error does this code raise when trying to compute similarity between two lists of different lengths?
Prompt Engineering / GenAI
def jaccard_similarity(list1, list2): intersection = len(set(list1) & set(list2)) union = len(set(list1) | set(list2)) return intersection / union result = jaccard_similarity([1, 2, 3], [1, 2]) print(result)
Attempts:
2 left
💡 Hint
Check how sets handle different length lists and the division operation.
✗ Incorrect
The code correctly computes Jaccard similarity without error even if lists differ in length.