Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6964517
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 27, 20262026-05-27T15:56:05+00:00 2026-05-27T15:56:05+00:00

Given two strings, how can I do something if both strings have one word

  • 0

Given two strings, how can I do something if both strings have one word in common?

For example: "foo bar" and "foo line" both have the word "foo". The strings could be 3 words long or more, like "foo bar" and "blue foo line".

What I’ve tried so far:

var m = "foo bar";
var n = "foo line";
if(m.match(/n/g)){
  alert("match");
}
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-27T15:56:06+00:00Added an answer on May 27, 2026 at 3:56 pm

    http://jsbin.com/iwalam/3/edit

    better version :

    var m = "foo bar".split(' ');
    
    var n = "foo line".split(' ');
    var isOk=0;
    
        for (var i=0;i<m.length;i++)
        {
        for (var j=0;j<n.length;j++)
    
        {
          var reg = new RegExp("^"+m[i]+"$", "gi");
    
        if (n[j].match(reg) )
        {isOk=1;break;}
        }
        }
    
    if (isOk==1)
      alert("match");
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Given the following strings 7;#User One 7;#User Two;#9;#User Two 7;#User Two;#9;#User Two;#123;#User Three I
Given the following simple example: List<string> list = new List<string>() { One, Two, Three,
Given two colors and n steps, how can one calculate n colors including the
I have a list of strings similar to ['ONE', 'TWO', 'SEVEN', 'TWELVE', 'ONE', 'SEVEN']
given e.g: scala> def pipes(strings:String*) = strings.toList.mkString(|) which I can call normally: scala> pipes(foo,
Given two strings text1 and text2 : public SOMEUSABLERETURNTYPE Compare(string text1, string text2) {
Possible Duplicate: substring algorithm Given two strings, A and B, how to find the
Given two sets A and B, what is the common algorithm used to find
I have a static function in a class with two overloads. Both the overloads
I have a text file that contains date, and two time-strings separated by spaces

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.