No_hashing

1

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

  1. search
    2.insert
    3.delete
2

With what Collison resolution policy?

3

I didn’t get?

4

What strategy will you opt for resolving the collisions ?

5

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

6

Have you studied hashing ?

7

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
8

thinking that is this possible without hashing…

9

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

1 Like
10

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