Re: [algogeeks] Imp->Amazon Question

2011-10-02 Thread SAMM
linked list + hash table. check for similar question poster on last friday ..

On 10/3/11, Ankur Garg  wrote:
> Can u provide a proper HashMap
>
> Not Implementation..A proper Idea wud do :)
>
> On Mon, Oct 3, 2011 at 1:03 AM, Preetam Purbia
> wrote:
>
>> you can implement using hashmap..
>>
>> On Mon, Oct 3, 2011 at 12:51 AM, Ankur Garg  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 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.
>>>
>>
>>
>>
>> --
>> 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 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.
>
>


-- 
Somnath Singh

-- 
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.



Re: [algogeeks] Imp->Amazon Question

2011-10-02 Thread Ankur Garg
Can u provide a proper HashMap

Not Implementation..A proper Idea wud do :)

On Mon, Oct 3, 2011 at 1:03 AM, Preetam Purbia wrote:

> you can implement using hashmap..
>
> On Mon, Oct 3, 2011 at 12:51 AM, Ankur Garg  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 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.
>>
>
>
>
> --
> 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 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.



Re: [algogeeks] Imp->Amazon Question

2011-10-02 Thread Preetam Purbia
you can implement using hashmap..

On Mon, Oct 3, 2011 at 12:51 AM, Ankur Garg  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 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.
>



-- 
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 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.



[algogeeks] Imp->Amazon Question

2011-10-02 Thread Ankur Garg
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 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.