We can use hash to do all the operations in O(1) time. Thanks & Regards, Anantha Krishnan
On Thu, Aug 18, 2011 at 5:30 PM, Ankur Garg <ankurga...@gmail.com> 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. > > > Any suggestions /solutions for this problem > > > Regards > > Ankur > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
