Find the Prefix Common Array of Two Arrays | Leetcode 2657

[@sailendrachettri8521]

Thank you sir :)

[@techdose4u]

Most welcome!

[@vinayreddyBora]

thank you sir...

[@techdose4u]

welcome

[@nagendravinayravisetti-jc6yv]

Thanks

[@techdose4u]

welcome

[@devmahad]

thanks :)

[@techdose4u]

welcome back :)

[@LawZist]

What if we will use 2 sets for each array and for each element we will check the set of the other array while maintaining a counter?

[@techdose4u]

But why 2 sets ? Prefix means it should be present in both. So, if you check 1 its enough :)

[@RajSingh-r9r4l]

Where it is mentioned that each element can occur atmost one times?

[@techdose4u]

in the problem statement

[@yelugulavenkatanagaprathap-k5u]

Thanks Sir..How to decide like need to take UnOrdered set / Frequency while attempting this problem.?

[@techdose4u]

Set was good enough unless the size was 10^5 :)

[@Dineshkumar_dk]

time complexity of "in" operation in set also O(n) for worst case.

[@techdose4u]

log N for set N for unordered set

[@RajSingh-r9r4l]

​@@techdose4u I guess you said opposite

[@techdose4u]

Ordered set is “set” with logN all operations Unordered set has different implementation with O(N) complexity but Theta(1) avg time.

[@yelugulavenkatanagaprathap-k5u]

Hi Sir, This problem comes under Greedy approach ?

[@techdose4u]

Greedy because you can determine answer without trying all possibilities or looking at future items. So YES

[@wierdo9514]

I did hashing 🙂

[@techdose4u]

nice

[@thrillmantra]

can u pls explain zeros and ones dp problem pls

[@techdose4u]

From leetcode ?

[@mukulgupta7251]

First viewer

[@techdose4u]

nice :)

[@NikitaKanchan-q3l]

Hello sir, I have google phone screen kindly guide me what can i expect and focus

[@techdose4u]

You can ping us on whatsapp and ask the same question directly