two arrays, one shorter (with all separate items) and one longer (with no unique elements). Find the shortest subarray in the larger array that contains all of the shorter array's items. The things can be shown in any order. EXAMPLE

Programming Logic & Design Comprehensive
9th Edition
ISBN:9781337669405
Author:FARRELL
Publisher:FARRELL
Chapter6: Arrays
Section: Chapter Questions
Problem 17RQ
icon
Related questions
Question

You are given two arrays, one shorter (with all separate items) and one longer (with no unique elements). Find the shortest subarray in the larger array that contains all of the shorter array's items. The things can be shown in any order.
EXAMPLE
Input: {1, 5, 9}
{7, 5, 9, 0, 2, 1, 3, 5. 7, 9. 1, 1, 5, 8, 8, 9, 7}
Results: [7, 10] (the underlined portion above)

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Arrays
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Programming Logic & Design Comprehensive
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage