I developed a website/facebookapp. I would appreciate it if you could give
feedback about it.
http://apps.facebook.com/wouldloveto/
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
Hi guys,
I developed this website. Might be interesting for you!
http://www.thinktionary.net
Have fun!
Seckin John
--
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
Avik, yes the answer is obvious but your code doesn't find that.
that 2 pointer approach is the correct one.
On Tue, Aug 10, 2010 at 12:07 AM, Avik Mitra tutai...@gmail.com wrote:
@Sekin.
Sort the elements (increasing order). This has already been mentioned.
So, answer will be 1, 100.
--
as a hint, convert the BST to a sorted array and take two pointers one
pointing to the first number and the other pointing to the last. Then, move
pointers appropriately to find the two numbers summing up to k.
complexity: O(n)
2010/8/5 Seçkin Can Şahin seckincansa...@gmail.com
what about
Chonku, you can do that only when you have the links to parent nodes. I
couldn't come up with a way of doing what you said on a basic BST(nodes
having pointers only to their 2 children) that is why I suggested using an
array. It doesn't change the overall complexity but if you have an idea
about
Hey Anand,
Can you(or anyone who understood it) elaborate on that XOR logic idea of
yours?
Thanks,
Seckin
On Fri, Aug 6, 2010 at 7:14 AM, Manjunath Manohar
manjunath.n...@gmail.comwrote:
no the array is unsorted..
On Thu, Aug 5, 2010 at 9:29 PM, dinesh bansal bansal...@gmail.com wrote:
If
yeah it does not work. maybe it is only the implementation being wrong, I
want to hear the idea.
On Fri, Aug 6, 2010 at 2:55 PM, Manjunath Manohar
manjunath.n...@gmail.comwrote:
i kinda understood ...u are doing xor on the array twice..but it dint seem
to work for the array..{2,1,3,2}
please
either count it with a for loop or if you are using C, use
__builtin_popcount(int x)
or
x is given
int count = 0;
for(int i=0; i32;i++) count += (x (1i)) != 0;
On Tue, Aug 3, 2010 at 12:04 PM, amit amitjaspal...@gmail.com wrote:
(3*4096+15*256+3*16+3). How many 1's are there in the binary
those are the things that you can google for.
On Tue, Aug 3, 2010 at 10:22 AM, UMESH KUMAR kumar.umesh...@gmail.comwrote:
What is the Garbase value in C/C++
and what is the Null pointer ?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
write a recursive function getmin(node, value) that returns the least number
of flips necessary for the subtree rooted at node to give the result
value. recursive relations are easy to come up with, so I leave it as an
exercise :)
memorize the values calculated, so, never calculate a result more
10 matches
Mail list logo
