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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 13, 20262026-06-13T14:12:23+00:00 2026-06-13T14:12:23+00:00

I have to find intersection elements of 3 integer arrays say a, b, c

  • 0

I have to find intersection elements of 3 integer arrays
say a, b, c with a condition; if any of the array is null ( [] ),
simply ignore the array and find intersection of the remaining arrays,
and if all three are null, then return [].
Thanks in advance.

ps:Ruby 1.9.3

  • 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-06-13T14:12:24+00:00Added an answer on June 13, 2026 at 2:12 pm

    One way to do it would be this:

    [ a, b, c ].tap{ |a| a.delete( [] ) }.reduce( :& ) || []
    

    Other options suggested in the discussion are:

    [ a, b, c ].reject( &:empty? ).reduce( :& ) || []
    

    and:

    [ a, b, c ].select( &:any? ).reduce( :& ) || []
    

    But in this last case, beware of non-empty arrays with explicit nil elements, such as [ nil ], cause they still fail #any? test.

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

Sidebar

Related Questions

I have an array of arrays, and I want to find the intersection of
You are given two sorted integer arrays, which have some common integers. Any common
i have to find out whether or not two collections have any intersection, the
I have been trying out to figure out a way to find intersection of
I have a variable number of ArrayList's that I need to find the intersection
I have a list of lists which I want to find the intersection for
i want to find the intersection of two lists in python. i have something
I have two cell arrays, X and Y. Each cell array is made up
I have four DIV elements on my page. Each has it's own array which
Possible Duplicate: Python: How to find list intersection? I have two lists of data

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.