Quick Overview

Find the maximum L1 distance between equal-length nonempty contiguous subarrays chosen from two integer arrays. Handle different start positions, any valid common length, large values, 64-bit results, optional witness indices, and the required time and space analysis.

Maximum L1 Distance Between Equal-Length Subarrays

Company: Deshaw

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Overview: Find the maximum L1 distance between equal-length nonempty contiguous subarrays chosen from two integer arrays. Handle different start positions, any valid common length, large values, 64-bit results, optional witness indices, and the required time and space analysis.

Loading…