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 604963
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 13, 20262026-05-13T17:05:41+00:00 2026-05-13T17:05:41+00:00

Given 2 int arrays e.g, foo and bar , what’s the most efficient way

  • 0

Given 2 int arrays e.g, foo and bar, what’s the most efficient way to check that the array bar contains at least one item that foo contains. should return true/false.

I’m suspecting nested foreach but just wondering if there’s a nicer way?

  • 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-13T17:05:42+00:00Added an answer on May 13, 2026 at 5:05 pm

    Using LINQ:

    array1.Intersect(array2).Any()
    

    Note: Using Any() assures that the intersection algorithm stops when the first equal object is found.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Given the following code: void foo( int* array ) { // ... } void
Given this piece of code: (void)someFunction(void) { int array[] = {1,2,3,4,5,6,7,8,9,10}; } Where are
Given the following class public class Foo { public int FooId { get; set;
Given a class like this: class Foo { public: Foo(int); Foo(const Foo&); Foo& operator=(int);
If I have a function void Foo(params int[] bar){} The following runs fine: int[]
Given the following: declare @a table ( pkid int, value int ) declare @b
Given an integer typedef: typedef unsigned int TYPE; or typedef unsigned long TYPE; I
Given a simple switch statement switch (int) { case 1 : { printf(1\n); break;
Given a table structure like this: CREATE TABLE `user` ( `id` int(10) unsigned NOT
Given the following class: class TestClass { public void SetValue(int value) { Value =

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.