Question: 7. Describe an algorithm that takes two strings, A and B, and returns the number of occurrences of every character in A that appears in

 7. Describe an algorithm that takes two strings, A and B,

7. Describe an algorithm that takes two strings, A and B, and returns the number of occurrences of every character in A that appears in B. Let n = Lena + LenB. The runtime of your algorithm must be O(n). You may treat strings as arrays of characters. That is, you can iterate over a string, and access the character at a given index

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!