Problem · Trie

Find Length of Longest Common Prefix

Learn this problem
EasyUber logoUberOA
See Uber hiring insights

Problem statement

Given two arrays of strictly integers, arr1 and arr2, find the length of the longest common prefix of any pair of numbers from the two arrays.

Function

findLengthOfLongestCommonPrefix(arr1: int[], arr2: int[]) → int

Examples

Example 1

arr1 = [123, 4, 5, 955]arr2 = [12345, 63, 95, 2]return = 3
n/a 🥲

Constraints

n/a 🥹

More Uber problems

drafts saved locally
public int findLengthOfLongestCommonPrefix(int[] arr1, int[] arr2) {
  // write your code here (pps:) you may want to refer to lc 3043)
}
arr1[123, 4, 5, 955]
arr2[12345, 63, 95, 2]
expected3
checking account