you can implement using hashmap.. On Mon, Oct 3, 2011 at 12:51 AM, Ankur Garg <[email protected]> wrote:
> Define a data structure , using extra memory/space , such that : > > > > Insert(int a) > > Delete(int a) > > isPresent(int a) > > get(int a) > > > > All above operations on the defined data structure take O(1) , i.e. > constant time. > > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Preetam Purbia http://twitter.com/preetam_purbia -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
