no hashtable needed , a bitmap is sufficient
Best Regards
Ashish Goel
"Think positive and find fuel in failure"
+919985813081
+919966006652
On Fri, Jun 8, 2012 at 4:04 PM, saurabh singh <saurab...@gmail.com> wrote:
> The key doesn't lies in the way it will be solved.It is how efficiently
> you implement the hash table.do we really need an integer array ( 4*256
> bytes) just to record the first occurrence of a character?
> Saurabh Singh
> B.Tech (Computer Science)
> MNNIT
> blog:geekinessthecoolway.blogspot.com
>
>
>
> On Fri, Jun 8, 2012 at 2:36 PM, Nishant Pandey <
> nishant.bits.me...@gmail.com> wrote:
>
>> you may use look up table for each character like this :
>>
>> int table[255]={0};
>>
>> for(int i=0;str[i];i++)
>> {
>> if( table[str[i]] )
>> return true;
>> else
>> {
>> table[str[i]]=1;
>> }
>>
>> }
>> return false;
>>
>>
>> On Fri, Jun 8, 2012 at 2:26 PM, Anika Jain <anika.jai...@gmail.com>wrote:
>>
>>> you will have to note time for of occurence of a character for all chars
>>>
>>>
>>> On Fri, Jun 8, 2012 at 2:15 PM, himanshu kansal <
>>> himanshukansal...@gmail.com> wrote:
>>>
>>>> how can we find 1st repeating character in string???
>>>> e.g. if the string is "abba" it should return 'b' and not 'a'.....
>>>>
>>>> note: hashing will give the answer as 'a'....
>>>>
>>>> --
>>>> 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.
>>>>
>>>>
>>>
>>>
>>> --
>>> Regards
>>> Anika Jain
>>>
>>> --
>>> 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.
>>>
>>
>>
>>
>> --
>> Cheers,
>>
>> Nishant Pandey |Specialist Tools Development |
>> npan...@google.com<gvib...@google.com> |
>> +91-9911258345
>>
>>
>> --
>> 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.
>
--
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.
