i am working one below challenge
i was not clear on below description
Start with two arrays of strings, a and b, each in alphabetical order, possibly with duplicates. Return the count of the number of strings which appear in both arrays. The best "linear" solution makes a single pass over both arrays, taking advantage of the fact that they are in alphabetical order.
how to approach this challenge. use two for loops and loop both arrays to see equality of elements and return count? please advise