Hi,
I am attending Google interview on Monday. Please help me with sample
questions.
Thanks Regards,
Rathish Kannan
--
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
With a directed graph G and we want to find the cycle cover(a set of
cycles s.t. every vertex is in exactly 1 cycle), can we do this in
poly-time? Can we break each node into entry/exit nodes and do
bipartite matching? Would this work?
Thanks,
L.H.
--
You received this message because you are
Given an array of integers A[N], find the maximum value of (j-k) such
that A[k] = A[j] jk.
I am looking for a solution with time complexity better than O(N^2).
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
hi all ,I am talking about the big-Oh notation ,
I had to prove that
[lg n] ^2 is better than the n .
how can I do that . I have tried to show that n is a big-oh of ([lg n]
^2) ,but
how can I do that ?
I hope proving (lg n)^b = o( n^a) , a,b0 o here denotes small-Oh,
should
hellow,
i am doing a program which deals with 128 bit numbers.i want to
store a 128 bit in a variable, as we know all the data types in c offer less
than 80 bits. now how do i create a 128 bit data type for my program.
--~--~-~--~~~---~--~~
You received
On 10/16/07, Muntasir Azam Khan [EMAIL PROTECTED] wrote:
h am terrible sorry dude. it is subsequence!!!
On Oct 13, 11:39 pm, kannan [EMAIL PROTECTED] wrote:
hellow!
here is the problem statement.
you have to find the subset having the maximum sum in the given array
of
Wow, thanks! :-). It's very re-assuring to know that I got it right.
Thanks for the information. My google searches had been very
inefficient (I mean, blob algorithms juast hadn't gotten very far),
and now they will be that much more targeted.
Today in a data structures class we went over blob recursion. What we
went over is actually described on this page (different school though):
http://www.bowdoin.edu/~ltoma/teaching/cs107/fall05/Labs/lab9.html
I understand how the recursion works, but I'm more interested in
determing the exact
