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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 24, 20262026-05-24T19:22:02+00:00 2026-05-24T19:22:02+00:00

Here is one to get your brain going! I’ve not had any luck with

  • 0

Here is one to get your brain going! I’ve not had any luck with it.

[1,2,1,1,2,1,1,1,2,2]

[1,2,1,1,2,1]

I would like to use the second array to find the values in the first, but they must be in the same order.

Once for I would like it to return the next key up from the last key in the second array.

So in this example it would use the first six digits in the first array and then return 6 as the key after the final one in the second array.

  • 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-24T19:22:03+00:00Added an answer on May 24, 2026 at 7:22 pm
      var a2 =  [1,2,1,1,2,1,1,1,2,2]
    var a1 = [1,2,1,1,0,1]
    function find(arr1, arr2) {
        var len = 1
        var result = 0;
        var s2 = arr2.toString();
        for (len=1;len <= a1.length; len++)
        {
            var aa1 = arr1.slice(0, len)
            var s1 = aa1.toString();
            if(s2.indexOf(s1)>=0){
                result = aa1.length; 
            }
            else {
                break;
            }
        }
        return result;
    }
    alert(find(a1, a2));
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Similar to the one here on StackOverFlow, I would be needing to implement a
Strange one here, hoping to get some feedback to point me in the right
I was going to ask a question here about whether or not my design
Here one more basic question asked in MS interview recently class A { public
Here's one from the No question's too dumb department: Well, as the subject says:
Here is one of my header file which consists of a union template with
Here's one I have always wondered about... Please excuse my naivety, but - How
Here is one more newbie question: require 'tasks/rails' I saw this line in Rakefile
Here is one method that monkey patched the Dir[] method from autotest class Dir
Here is one I am working on: var fStep = from insp in sq.Inspections

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.