आसान 0 हल किए गए 0% स्वीकृति

Cosine Similarity

Measure how similar two vectors are by the angle between them, as search engines do with embeddings.

आप क्या सीखेंगे

  • Measure similarity by angle
  • Compute dot products and vector norms
  • Understand how semantic search compares texts

समस्या

अनुवाद दिखाएँ

Cosine similarity compares the direction of two vectors and ignores their length. Semantic search uses it to find texts with similar embeddings:

cos(a, b) = (a · b) / (|a| × |b|), where |a| = √(a₁² + a₂² + … + aₙ²)

The result is 1 for the same direction, 0 for perpendicular vectors and -1 for opposite directions. If either vector is all zeros, return 0.

Implement cosine_similarity(a, b).

Input

a, b: Two lists of numbers with the same length.

Output

Return the cosine similarity as a decimal number.

सीमाएँ

1 ≤ length ≤ 1,000

-1,000 ≤ each value ≤ 1,000

उदाहरण

उदाहरण 1
इनपुट:
a = [1.0, 0.0]
b = [0.0, 1.0]

अपेक्षित आउटपुट:
expected = 0.0
इनपुट:
std::vector<double> a = {1.0, 0.0};
std::vector<double> b = {0.0, 1.0};

अपेक्षित आउटपुट:
double expected = 0.0;
इनपुट:
double[] a = new double[] {1.0, 0.0};
double[] b = new double[] {0.0, 1.0};

अपेक्षित आउटपुट:
double expected = 0.0;

व्याख्या

The dot product is 0, so the vectors are perpendicular and the similarity is 0.

उदाहरण 2
इनपुट:
a = [1.0, 2.0, 3.0]
b = [2.0, 4.0, 6.0]

अपेक्षित आउटपुट:
expected = 1.0
इनपुट:
std::vector<double> a = {1.0, 2.0, 3.0};
std::vector<double> b = {2.0, 4.0, 6.0};

अपेक्षित आउटपुट:
double expected = 1.0;
इनपुट:
double[] a = new double[] {1.0, 2.0, 3.0};
double[] b = new double[] {2.0, 4.0, 6.0};

अपेक्षित आउटपुट:
double expected = 1.0;

व्याख्या

b is a times 2: same direction, so the similarity is 1 even though the lengths differ.

संदर्भ

यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।

दूसरों से सीखें

समुदाय समाधान

अभी तक कोई प्रकाशित समाधान नहीं। पहला साझा करने के लिए इस चुनौती को हल करें।