add all the elements in a trie tree and then search all the elements for
their best matching complement
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this
Given a list of numbers , How to find the max(x[i] XOR x[j]) in the
list.
Any solution less than O(n^2)?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this