On Mon, Aug 8, 2011 at 1:07 AM, Yasir Imteyaz <[email protected]> wrote:
> @Shuaib, > You are right, this approach will work! :) > But for each element 'e' > instead of checking whether *|K-e| *exists, *you should check for either > (e+K) or (e-K).* > You are right. Mistake. ;) > > But here the question is, will the hash map really give o(1) access for > such a large record? > ..and is it a good practice to create such large map while solving these > kinda problem? > This is something to ponder over. > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/bHxWTp3DLQgJ. > > 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. > -- Shuaib http://www.bytehood.com http://twitter.com/ShuaibKhan -- 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.
