geeks+unsubscr...@googlegroups.com.
>>
>>
>>
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to algogeeks+un
d bar
> i has height H[i], 0<=i plane is at zero. Water is held in the "pockets" between bars. Then
> the "pocket" between H[i] and H[i+1] holds min(H[i],H[i+1]). To get
> the total, just sum these for 0 <= i < N-1 .
>
> On May 17, 1:57 am, Nikhil A
"Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=
t;>> >>>>>>>
>>> >>>>>>
>>> >>>>>>
>>> >>>>>>
>>> >>>>>> --
>>> >>>>>> Regards
>>> >>>>>> Anurag Atri
&g
this group, send email to
>>> algogeeks+unsubscr...@googlegroups.com.
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>
>>
>>
>> --
>> Regards
>> Anurag Atri
>>
>>
e
> > >> Groups
> > >> > > "Algorithm Geeks" group.
> > >> > > To post to this group, send email to algogeeks@googlegroups.com.
> > >> > > To unsubscribe from this group, send email to
> > >> > > algogeeks
groups.google.com/group/algogeeks?hl=en.- Hide quoted text -
> >
> > - Show quoted text -
>
> --
> 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
PUT
>
> Case #1: 1
> Case #2: 4
>
> --
> 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
> algoge
s" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Th
oglegroups.com.
>>> To unsubscribe from this group, send email to
>>> algogeeks+unsubscr...@googlegroups.com
>>> .
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>
>>
>>
>
ps
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks
https://groups.google.com/group/algogeeks/browse_thread/thread/b20cd8160a8e8f92?hl=en
On Fri, Dec 31, 2010 at 10:18 PM, Anand wrote:
> @Nikhil,
>
> I searched through the group for the answer but didn't find one so I stated
> again.
>
>
> On Fri, Dec 31, 2010 at 1:39 A
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 group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more option
. so that is what i was saying. can you specify where i was not
> > clear ?
> >
> > On Thu, Dec 23, 2010 at 9:22 PM, Nikhil Agarwal
> > wrote:
> >> @ankur can you hint your nlogn solution?
> >>
> >> On Thu, Dec 23, 2010 at 9:08 PM, Ankur Khuran
nd email to algoge...@googlegroups.com.
> > To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> > For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
> >
> >
>
> --
> You recei
ooglegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Thanks & Regards
Nikhil Agarwal
Senior Undergraduate
Computer Science & Engineering,
National Institute Of Technology, Durgapur,India
http://tech-nikk.blo
ks" group.
> To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Thanks
..@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Thanks & Regards
Nikhil Agarwal
Senior Undergraduate
Computer
, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Thanks & Regards
Nikhil Agarwal
Senior Undergraduate
Computer Science & Engineering,
National Institute Of Tech
o unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Thanks & Regards
Nikhil Agarwal
Senior Undergraduate
Computer Science & Engineer
ooglegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Thanks & Regards
Nikhil Agarwal
Senior Undergraduate
Computer Science & Engineering,
National Institute Of Technology, Durgapur,India
http://tech-nikk.blogspot
; >
>
> --
> 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 group, send email to
> algogeeks+unsubscr...@googlegroup
nsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Thanks & Regards
Nikhil Agarwal
Senior Undergraduate
Computer Science & Engineering,
National Institute Of Technology, Durgapur,India
http://tech
his group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Thanks & Regards
Nikhil Aga
scribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algoge...@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com
>> .
>> For more options, visi
On Mon, Dec 20, 2010 at 11:18 AM, Nikhil Agarwal
wrote:
> I have a solution.I cant prove the correctness but by intuition I can
> conclude.This is O(1) solution.
>
> As we have 3 sorted arrays A,B,C.So only first and last element of these 3
> lists will be contributing for min
hl=en.
>>
>>
> --
> 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 group, send email to
> algogeeks+unsubscr..
> > elements where A[i]=i in O(2 log n) = O(log n) time. Of course if the
> > searches fail, you have no elements at all where A[i]=i.
> >
> > On Dec 5, 9:46 am, Nikhil Agarwal wrote:
> >
> >
> >
> > > @Divesh I have updated my algo and Array
e 5...
> correct me if i am wrong... and u have assumed all are positive, hence
> base index should be 1
>
>
> On Sun, Dec 5, 2010 at 4:41 PM, Nikhil Agarwal
> wrote:
>
>> If All the elements are unique and sorted in ascending order then we can
>> design an algorit
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 group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, vi
Algorithm Geeks" group.
> To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
I know it's odd to discuss assignments here but I am in a problem.The
problem is on socket programming.
Please check Link-> http://www.scribd.com/doc/37550963/Assignment-3
If anybody has already solved this problem or can do it please reply in this
thread.
--
Thanks & Regards
Ni
> printf("\n");
> output(i);
> printf("\n");
> }
>getch();
>return 0;
> }
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send ema
-String
*
--
Thanks & Regards
Nikhil Agarwal
Senior Undergraduate
Computer Science & Engineering,
National Institute Of Technology, Durgapur,India
http://tech-nikk.blogspot.com
http://beta.freshersworld.com/communities/nitd
--
You received this message because you are subscribed to the Googl
> "Algorithm Geeks" group.
> To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks
>
> On Tue, Oct 12, 2010 at 6:18 PM, Nikhil Agarwal > wrote:
>
>> @Asquare : Please check the following example:
>>
>> Given: an array of numbers ranging from 1-n
>> A[]= 3,3,5,2,1,2
>>
>> As we encounter a number make the index of tha
; algogeeks+unsubscr...@googlegroups.com
>
> > > .
> > > For more options, visit this group at
> > >http://groups.google.com/group/algogeeks?hl=en.- Hide quoted text -
> >
> > - Show quoted text -
>
> --
> You received this message because you are subscr
@ankur Please give me a proper link.I mean with hash after 4shared.com
On Wed, Sep 22, 2010 at 11:26 AM, ankur aggarwal
wrote:
> http://www.4shared.com/
> check it..
>
> On Wed, Sep 22, 2010 at 12:00 AM, Nikhil Agarwal <
> nikhil.bhoja...@gmail.com> wrote:
>
>> Ca
Can anybody share his/her E-copy of An Introduction to algorithm by Udi
manber.It's a great resource.If anybody has please share his E-copy.Thanks
in advance.
--
Thanks & Regards
Nikhil Agarwal
Senior Undergraduate
Computer Science & Engineering,
National Institute Of Technology, D
gt; http://groups.google.com/group/algogeeks?hl=en.
>
--
Thanks & Regards
Nikhil Agarwal
Senior Undergraduate
Computer Science & Engineering,
National Institute Of Technology, Durgapur,India
http://tech-nikk.blogspot.com
http://beta.freshersworld.com/communities/nitd
--
You received
oogle.com/group/algogeeks?hl=en.
>
>
--
Thanks & Regards
Nikhil Agarwal
Senior Undergraduate
Computer Science & Engineering,
National Institute Of Technology, Durgapur,India
http://tech-nikk.blogspot.com
http://beta.freshersworld.com/communities/nitd
--
You received this message be
garwal <
ashish.cooldude...@gmail.com> wrote:
> can you give link for this
>
>
> On Sat, Sep 11, 2010 at 6:10 AM, Nikhil Agarwal > wrote:
>
>> This has been discussed already.Please refer that post I have provided the
>> actual code .
>>
>> On Sat, Sep 11
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Thanks & Regards
Nikhil Agarwal
Senior Undergraduate
Computer Science & Engineering,
National Institute Of Technology, Durgapur,India
http://tech-nikk.blogspot.com
http://beta.freshersworld.
In this case, the print would go as follows.
>
> 313123355
>
> On Sat, Aug 21, 2010 at 12:53 PM, Nikhil Agarwal <
> nikhil.bhoja...@gmail.com> wrote:
>
>> Suppose the test is like:
>>
>> 21 71 217
>> after sorting and msb appending we get: 217 712
gt; - Show quoted text -
>
> --
> 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 group, send email to
> algogeeks+unsu
subscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Thanks & Regards
Nikhil Agarwal
Senior Undergraduate
Computer Science & Engineering,
National
I have corrected my msb algo please have a look.
On Fri, Aug 20, 2010 at 10:59 PM, Nikhil Agarwal
wrote:
>
>
> On Fri, Aug 20, 2010 at 10:06 PM, Nikhil Agarwal <
> nikhil.bhoja...@gmail.com> wrote:
>
>> The solution for the above problem will be,
>>
>> 1.
* y = M
> > > > and x' + y' = S', x' * y' = M'
> >
> > > > If: S' = S and M' = M, then x = x' and y = y'
> > > > i.e for given sum and product, the elements are unique.
> >
> >
On Fri, Aug 20, 2010 at 10:06 PM, Nikhil Agarwal
wrote:
> The solution for the above problem will be,
>
> 1.First convert all the smaller nos of by concatenating 9 at the end
> suppose 23,333 -> (239,333) to the size of the maximum digit.
> 2.Sort the numbers;
> 3.remove the
mail to
>>> algogeeks+unsubscr...@googlegroups.com
>>> .
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>
>> --
>> You received this message because you are subscribed to the Google Groups
&
t;
> >
> > > Nikhil's algo is correct if the following is always true:
> >
> > > Given: x + y = S, x * y = M
> > > and x' + y' = S', x' * y' = M'
> >
> > > If: S' = S and M' = M, then x = x' and y = y&
ikhil i.e;count the
> number
> > > of elements in array 1 and number of elements in array2 if these two
> values
> > > are equal then after follow the algo proposed by nikhil agarwal..
> >
> > > On Wed, Aug 18, 2010 at 8:50 PM, Rais Khan
> wrote:
> >
wrote:
>
>> @Nikhil: Your algo seems to fail with following input. What do you say?
>> Arr1[]= {1,2,3}
>> Arr2[]={6}
>>
>>
>>
>>
>> On Wed, Aug 18, 2010 at 7:17 AM, Nikhil Agarwal <
>> nikhil.bhoja...@gmail.com> wrote:
>>
>>
On Wed, Aug 18, 2010 at 8:42 PM, Rais Khan wrote:
> @Nikhil: Your algo seems to fail with following input. What do you say?
> Arr1[]= {1,2,3}
> Arr2[]={6}
>
There is an obvious check. N1==N2 at the beginning.
>
>
>
> On Wed, Aug 18, 2010 at 7:17 AM, Nikhil Agarwal &
To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Thanks & Regards
Nikhil Agarwal
Senior Undergraduate
Computer Science & En
from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Thanks & Regards
Nikhil Agarwal
Senior Undergraduate
Computer Science & Engineering,
National In
@maxim . my algo is for array of equal sizes.Sorry I didn't notice the
unequal thing.
On Tue, Aug 17, 2010 at 10:09 AM, Maxim Mercury wrote:
> above algo isnt handling unequal length arrays,
>
> On Aug 13, 10:06 pm, Nikhil Agarwal wrote:
> > Check this code
> >
> &g
o this group, send email to algoge...@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com
>> .
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>>
> --
> Yo
;> Thanks & Regards,
>> Priyanka Chatterjee
>> Final Year Undergraduate Student,
>> Computer Science & Engineering,
>> National Institute Of Technology,Durgapur
>> India
>> http://priyanka-nit.blogspot.com/
>>
>
>
>
> --
> Thanks &
ups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Thanks & Regards
Nikhil Agarwal
Senior Undergraduate
Computer Science & Enginee
is 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 group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, vi
his group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Thanks & Regards
Nikhil Agarwal
Senior Undergraduate
Computer Science & Engineering,
National Institute Of Technology, Durgapur,India
http://tech-nikk.blogspot.com
http://beta.freshersworld.com/communities/nitd
ge 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 group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
&g
; group.
> To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Th
gt;>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this
p.
> To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Thanks & Reg
ribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Thanks & Regards
Nikhil Agarwal
Senior Undergraduate
Computer Science & Engineering,
National Insti
groups.com.
>>>>>>>> To unsubscribe from this group, send email to
>>>>>>>> algogeeks+unsubscr...@googlegroups.com
>>>>>>>> .
>>>>>>>> For more options, visit this group at
>>>>>>>&g
.com/group/algogeeks?hl=en.
>
--
Thanks & Regards
Nikhil Agarwal
Junior Undergraduate
Computer Science & Engineering,
National Institute Of Technology, Durgapur,India
http://tech-nikk.blogspot.com
--
You received this message because you are subscribed to the Google Groups
"A
>>> Rohit Saraf
>>> Second Year Undergraduate,
>>> Dept. of Computer Science and Engineering
>>> IIT Bombay
>>> http://www.cse.iitb.ac.in/~rohitfeb14<http://www.cse.iitb.ac.in/%7Erohitfeb14>
>>>
>>>
>>> On
-
> Rohit Saraf
> Second Year Undergraduate,
> Dept. of Computer Science and Engineering
> IIT Bombay
> http://www.cse.iitb.ac.in/~rohitfeb14
>
>
> On Mon, Apr 12, 2010 at 12:38 PM, Nikhil Agarwal <
> nikhil.bhoja...@gmail.com> wrote:
&
tb.ac.in/~rohitfeb14
>
>
> On Mon, Apr 12, 2010 at 8:18 AM, Rohit Saraf
> wrote:
>
>> but still the binary tree solution is of more practical use.i will explain
>> the solution once i reach my comp
>>
>>
>> On 4/11/10, Nikhil Agarwal wrote:
&
t; For more options, visit this group at
>>>>>> http://groups.google.com/group/algogeeks?hl=en.
>>>>>>
>>>>>
>>>>> --
>>>>> You received this message because you are subscribed to the Google
>>>>> Groups "
up.
> To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Thanks & Regards
up at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
> --
> 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
rithm Geeks" group.
> To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=
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 group, send email to
>> algogeeks+unsubscr...@googlegroups.com
>> .
>>
o this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Thanks & Regards
Nikhil Agarwal
78 matches
Mail list logo
