Home

Much in Common

Given two integer arrays a and b sorted in non-decreasing order (possibly with duplicates), return the count of the number of elements that appear in both arrays.

Hint: Take advantage of the fact that a and b are sorted!

muchInCommon([1, 2, 10], [2, 3, 4, 10]) → 2
muchInCommon([-5, 0, 0, 5], [0, 5]) → 2
muchInCommon([], [4, 8]) → 0

😳 TIME LEFT: 5.00 seconds 😳

function muchInCommon(a, b) {


// Your code here ⬇️



}

⏰ TOTAL TIME: 0.00 seconds ⏰