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

  • Home
  • SEARCH
  • 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 7030581
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 28, 20262026-05-28T00:41:23+00:00 2026-05-28T00:41:23+00:00

Given an array such as [10,42,45,45,61,61,75,90,1240], how do I find what numbers X is

  • 0

Given an array such as [10,42,45,45,61,61,75,90,1240], how do I find what numbers X is in between? For example, if X = 59, the answers would be [45,45,61,61].

It seems like the select enumerator would be perfect for this, but I can’t figure out how to select all of the elements on either side.

  • 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-28T00:41:24+00:00Added an answer on May 28, 2026 at 12:41 am

    You seem to need the repeated values of the boundaries, don’t you? here is a functional approach just as an example. It’s O(n), so as pointed out by others you better use a O(log(n)) bisection algorithm if you have big input arrays (note: the value to check must be between xs.min and xs.max):

    xs = [10,42,45,45,61,61,75,90,1240]
    chk_pairs = xs.chunk { |x| x }.each_cons(2)
    boundaries = chk_pairs.detect { |_, (y, ys)| y > 59 }.flat_map { |x, xs| xs }
    #=> [45, 45, 61, 61]
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Given an array of N integer such that only one integer is repeated. Find
Given an array like {one two, three four five}, how'd you calculate the total
Given an array with n values, for example: $arr[] = 'ABCDEFABC'; $arr[] = 'ABCDEFDEF';
Given an array like this: Array => ( [0] => 1, [1] => 2,
Possible Duplicate: Interview Q: given an array of numbers, return array of products of
i have seen a few days ago such problem there is given two array
I am trying to create a script such that I am given an array
I'm trying to rotate an array such that given a number and an array,
Given an array of integers, how can you find two indices, i and j,
I am given an array of real numbers, A. It has n+1 elements. It

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.