LeetCode Question · Aug 2021 · San Francisco

Robinhood | OA | longestSubarrayCheck

1 upvote 2,268 views 6 replies

Question Details

You are given two integer arrays a, b and one array of distinct integers c. Your task is to check whether b is the longest contiguous subarray of a consisting...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Arrays