ards,
Dhruva Sagar.
Stephen
Leacock<http://www.brainyquote.com/quotes/authors/s/stephen_leacock.html>
- "I detest life-insurance agents: they always argue that I shall some
day
die, which is not so."
On Fri, Sep 11, 2009 at 7:30 AM, ganesa thandavam wrote:
>
> whence this que
Yea!
You could confirm from the excel sheet...This place is not for such jokes
Thanks & Regards,
Dhruva Sagar.
George Bernard
Shaw<http://www.brainyquote.com/quotes/authors/g/george_bernard_shaw.html>
- "A government that robs Peter to pay Paul can always depend on the
suppor
Oh come on!!!
This is really petty stuff.
Thanks & Regards,
Dhruva Sagar.
Mark Twain <http://www.brainyquote.com/quotes/authors/m/mark_twain.html> -
"There is no sadder sight than a young pessimist."
On Tue, Jun 2, 2009 at 4:09 PM, Vamsi Krishna wrote:
> On Tue,
This is so lame.
The answer is 144.
Thanks & Regards,
Dhruva Sagar.
George Bernard
Shaw<http://www.brainyquote.com/quotes/authors/g/george_bernard_shaw.html>
- "A government that robs Peter to pay Paul can always depend on the
support of Paul."
On Tue, Jun 2, 2009 at 3:00
StumbleVideo
See what's on your channel!
YouTube - Linux Beauty :
http://video.stumbleupon.com?s=tvsk74ruxn&i=s4vrwmpk253icb4tk6st
Check out this video. It's really cool!
-- dhruvasagar ([EMAIL PROTECTED])
Learn more about StumbleVideo or Try It Now at
http://video.stumbleupon.com !
*About St
StumbleVideo
See what's on your channel!
YouTube - Consumer capitalism :
http://video.stumbleupon.com?s=lqye04ja93&i=s4vrwmpk253icb4tk6st
Check out this video. It's really cool!
-- dhruvasagar ([EMAIL PROTECTED])
Learn more about StumbleVideo or Try It Now at
http://video.stumbleupon.com !
*A
StumbleUpon
Discover new web sites
Dhruva wants to Share Favorites with you
Likes
10 pages
Join StumbleUpon and discover your friends'
Favorites.
Suddenly the Web is fun again :)
-&Dhruva
& [EMAIL PROTECTED]
Discover my Favorites &
http://www.stumbleupon.com/redirect.php?t=j&u=4735572&d=h
this problem .They re sharing
> > their 60% adsense revenue with you.Just start sharing
> > videos,webpages,images and start making friends.Guaranteed you will be
> > making a lot of money from google using this website.
>
please elaborate
On 5/21/07, monu <[EMAIL PROTECTED]> wrote:
>
>
> Consider a rectangle of M * N .Inside that there are many small
> overlapping rectangles.Now i have remove overlapping suchthat the "
> % increase in size (M*N) -> 0 ".
>
>
&g
.
On 5/16/07, mirchi <[EMAIL PROTECTED]> wrote:
>
>
> u r rite..but now tht prblem is solved the problem i am facing to
> submit the code is that it does not print the code in lexicographical
> order...
>
> On May 16, 1:56 pm, "Dhruva Sagar" <[EMAIL PROTECTED]
(r-1))
> >{
> > for(j=k;j > {
> > str[j]='1';
> > if(j!=k)
> > str[j-1]='0';
> >
the level of programming
> contests ??
>
--
Thanks & Regards,
Dhruva Sagar.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@google
derstand how perimeter defenses work, and then you
> > will move on to scanning and attacking your own networks. You will
> > also learn about escalated privileges, intrusion detection, DDOS
> > attacks, buffer overflows, and virus creation.
> >
> > For more information, you ca
:-S
On 4/4/07, Dhruva Sagar <[EMAIL PROTECTED]> wrote:
>
> This is the right one, with the correction. temp1 -> temp.
> By the way aakash, that point was a good one.
>
> On 4/4/07, Dhruva Sagar < [EMAIL PROTECTED]> wrote:
> >
> > Based on aakash's ex
This is the right one, with the correction. temp1 -> temp.
By the way aakash, that point was a good one.
On 4/4/07, Dhruva Sagar <[EMAIL PROTECTED]> wrote:
>
> Based on aakash's explanation there is another solution (similar to point
> no 2.)
>
> Traverse the l
re move the first node by one and keep moving
> the other node in multiples of two. During the movement compare if the two
> nodes meet. If not advance the first node to the second node and start
> moving again.
>
> Regards,
> Aakash
>
> On 4/4/07, Dhruva Sagar <[EMAIL PROTE
>B->*C*--->D-->E--F-
> | |
> ----- - -|
> >
>
--
Thanks & Regards,
Dhruva Sagar.
--~--~-~--~~~---~--~~
You received this message because you are subscribe
again.
On 4/4/07, Pradeep Juneja <[EMAIL PROTECTED]> wrote:
>
> It will consume lot of memory (varying on the length of link list).
>
> On 4/4/07, Dhruva Sagar <[EMAIL PROTECTED] > wrote:
> >
> > I guess you can keep an array of node pointers where you coul
fier?
>
> We are not allowed to modify the struct node of linked list
>
> On 4/4/07, Dhruva Sagar <[EMAIL PROTECTED]> wrote:
> >
> > It would be easy to do in case there is a unique identifier for each
> > node.
> > Simply traverse through the link list and
at what node, list has the loop ?
> i.e
> A>B->*C*--->D-->E--F-
> | |
> ----- - -|
nd remove them one by one and check the remaining if it's a
palendrom? That sounds like a pretty complex task...
and what about i>2..i>3...what would you say the complexity of the solution
be?
On 3/30/07, Dhruva Sagar <[EMAIL PROTECTED]> wrote:
>
> Yes, i read the probl
get a wrong answer. Your understanding of the word
> 'substring' is correct,
> but the question asks that we check all subsequences.
>
> Muntasir
>
>
> >
>
--
Thanks & Regards,
Dhruva Sagar.
--~--~-~--~~~---~--~~
You received this messa
lem...
On 3/30/07, Dhruva Sagar <[EMAIL PROTECTED]> wrote:
>
> No there's no assumptions...
> How can it be sub string?
> Say a set S = {1,4,12,62,11,3}
>
> we are given an algo say SUM(S,k) which returns TRUE or FALSE if the set S
> has a subset, sum of whose e
have specified the problem
> incorrectly. Is "subset" the right word? Do you mean "substring"
>
--
Thanks & Regards,
Dhruva Sagar.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Al
Are you really sure that your assumption is correct?
I am not sure about the fact that you can take sub strings from the word by
removing characters from between them...
AAM is certainly not valid sub string for this case as far as my
understanding of the problem stands.
On 3/30/07, Muntasir Azam
ensure that it's
sorted. That way the complexity will be lesser.
On 3/29/07, Arun <[EMAIL PROTECTED]> wrote:
>
> i believe the sorted order needed is interms of how close they are and not
> alphabetical? moreover the words neednot necc be in dictionary(like nouns)
>
>
The dictionary will already be sorted, hence the output of a linear search
will already be sorted!
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeek
The problem is not clear. Do you mean any one element from row and column?
Can you please give some example to clearify it pls...
On 3/28/07, vinay
<[EMAIL PROTECTED]>
> wrote:
> >
> >
> > Hai all,
> > Given a N X N Matrix( with +ve integers), How to find the elements,
> > such that only one eleme
But it is used in books about automata...I am not agreeing to it being a
valid assumption anyways.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeek
RR*=R* is an assumption that is often made for conveniences in some books.
I don't quite beleive it to be correct either.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group,
I am eager to know this as well.
--~--~-~--~~~---~--~~
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 [
shing and using Hash Keys, Universal Hashing in C++
> plesae guide me about this.
>
> Thanks in Advance
> Vijay bhaskar R
>
>
>
> >
>
--
If you reached till here,
you must have read my mail, hope you liked it.
Thanks & Regards,
Dhruva Sagar.
Application Programmer
32 matches
Mail list logo
