how to implement the following in O(1) time with the knowledge of arrays and vector…?

  1. search

With what Collison resolution policy?

I didn’t get?

What strategy will you opt for resolving the collisions ?

I guess indexing using these data structure…isnt’t it?

Have you studied hashing ?

Don’t think he even has a question. I think he’s just trying to cover up this post : Ans on dp problem - #9 by corack
Since he got caught cheating.

1 Like

thinking that is this possible without hashing…

Ah… now this makes sense, someone’s got a panick attack

1 Like

It is possible by using vector with initial value 0 and put to 1 or 0 for these operations