HI, thanks for letting me know ...
*Shashi Kant *
*"Think positive and find fuel in failure"*
*Senior Member technical Staff*
*Oracle India Pvt Ltd*
http://thinkndoawesome.blogspot.com/
On Mon, Nov 16, 2015 at 4:31 AM, Shachindra A C
wrote:
> You're not supposed to post
hi,
*Note:* if an inappropriate mail ..please do ignore
Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr ..mail your
resume to me
Regards,
*Shashi Kant *
*"Think positive and find fuel in failure"*
*Senior Member technical Staff*
*Oracle India Pvt
contact me. *
Regards,
*Shashi Kant *
*"Think positive and find fuel in failure"*
*Senior Member technical Staff*
*Oracle India Pvt Ltd*
http://thinkndoawesome.blogspot.com/
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
T_SET
remove this vertex from graph and repeat
step1->step2
}
}
Not an efficient way but i did solved it this way . ...
what i'm looking for is a better way .
*Shashi Kant *
*"Think positive and find fuel
http://www.geeksforgeeks.org/minimum-cut-in-a-directed-graph/ is suitable
here.
*Thanks & Regards,*
*Shashi Kant *
*"Think positive and find fuel in failure"*
http://thinkndoawesome.blogspot.com/
*Senior Software Engineer*
*Samsung Research India Bangalore .*
--
You received this m
@don thanks for the link
*Shashi Kant *
***"Think positive and find fuel in failure"*
http://thinkndoawesome.blogspot.com/
On Tue, Nov 20, 2012 at 10:18 PM, Don wrote:
> This might be helpful too:
> http://www.mathopenref.com/coordpolygonarea2.html
>
>
> On Nov
checkout these links
http://people.csail.mit.edu/bdean/6.046/dp/ =>#7
https://www.youtube.com/watch?feature=player_embedded&v=GdnpQY2j064
*Shashi Kant *
***"Think positive and find fuel in failure"*
http://thinkndoawesome.blogspot.com/
*System/Software Engineer*
*Hewl
@RushirajPatel if you happen to have looked at the page ..3rd solution is
the XOR one which is may be a solution for 2 missing numbers
but the trick can well be used here..
have a close look there
--
check this linkit has many different solutions to this problem
http://www.geeksforgeeks.org/archives/7953
*Shashi Kant *
***"Think positive and find fuel in failure"*
*+917259733668
*
http://thinkndoawesome.blogspot.com/
*System/Software Engineer*
*Hewlett-Packard India Software
thanks @dave
*Shashi Kant *
***"Think positive and find fuel in failure"*
*System/Software Engineer*
*Hewlett-Packard India Software Operations.
*
On Mon, Oct 1, 2012 at 10:42 PM, Dave wrote:
> @Shashi: It has been discussed before, and an O(n^2 log n) solution is
> out
Given a two dimensional graph with points on it, find a line which passes
the most number of points.
Can somebody suggest possible ways to do it.
*(or point me to the post if this problem is already discussed)*
*Thanks & Regards,*
*Shashi Kant *
***"Think positive and find fuel i
tChars(s1).compareTo(sortChars(s2));
}
}
*Shashi Kant *
***"Think positive and find fuel in failure"*
http://thinkndoawesome.blogspot.com/
*System/Software Engineer*
*Hewlett-Packard India Software Operations.
*
On Sun, May 27, 2012 at 2:56 AM, Navin Gupta wrote:
> @jalaj :- we will
that what i mentioned finding original BST or a correcting the BST property
...
my method will only maintains the BST property...
--
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.
well in that case there can be simpler ways to do it
do an inorder traversal while checking prevhttp://thinkndoawesome.blogspot.com/
*System/Software Engineer*
*Hewlett-Packard India Software Operations.
*
On Wed, Sep 5, 2012 at 12:43 PM, atul anand wrote:
> @Shashi : i dont see any differenc
Is it required only to retain the BST property ?? or to retain the
original BST (tree)
*Shashi Kant *
***"Think positive and find fuel in failure"*
http://thinkndoawesome.blogspot.com/
*System/Software Engineer*
*Hewlett-Packard India Software Operations.
*
On Tue, Sep 4, 2012
.
Get all those elements defeated by the least element ... that number should
be of order O(n)
get the second least element out of it in O(n) time.
*Shashi Kant *
*"Think positive and find fuel in failure"*
http://thinkndoawesome.blogspot.com/
*System/Software Engineer*
*Hewlett-Packard
>> > 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 received this message
int main(){
printf("%t",&main);
//sleep(1000);
return 0;
}
this works for you
On Thu, Aug 25, 2011 at 12:12 PM, shashi kant wrote:
> @ankur it's showing lvalue error.u should check it in some compiler
> first
>
>
>
> On Thu, Aug 25, 2011
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.
>>
>
> --
> You received thi
ail to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
*Shashi Kant *
***"Think positive and find fuel in failure"*
*+919002943948
*
*R&D engineer ,
Tejas Networks Ltd Banglore.
*
--
You recei
ks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
*Shashi Kant *
***"Think positive and find fuel in failure"*
*+919002943948
*
*R&D engineer ,
Tejas Networks Ltd Banglore.
*
--
You received this me
t; 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
> "Algorithm Geeks" group.
> To pos
more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
*Shashi Kant *
***"Think positive and find fuel in failure"*
*+919002943948
*
*R&D engineer ,
Tejas Networks Ltd Banglore.
*
--
You received this message because you are subscribed to
email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
*Shashi Kant *
***"Think positive and find fuel in failure"*
*+919002943948*
Final Yr. Cse ,Undergraduate Student,
*National Institute Of
http://forums.mysql.com/read.php?11,278745,278745
this works for me will work for you too
<http://forums.mysql.com/read.php?11,278745,278745>
On Fri, Apr 29, 2011 at 8:34 AM, shashi kant wrote:
> try this http://www.fixya.com/support/t840251-mysql_error_messeage
>
>
>
> On
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
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group a
to other people as well .
http://avishkar.mnnit.ac.in/iopc/iopc.php
Do Join us.
--
Shashi Kant Sharma
Final Yr CSE
NIT, Allahabad
--
Shashi Kant Sharma
Final Yr CSE
NIT, Allahabad
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the
s 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 can visit our website at :
&g
which book ??
On 3/27/07, Dhruva Sagar <[EMAIL PROTECTED]> wrote:
>
> 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
Yes, RR* = R+ is fine.
On 3/27/07, Karthik Singaram L <[EMAIL PROTECTED]> wrote:
>
>
> sorry
> RR* = R+ is the valid assumption
>
> >
>
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post
Don't think such an assumption can be used.
Its not possible for RR* == R*.
On 3/27/07, Dhruva Sagar <[EMAIL PROTECTED]> wrote:
>
> RR*=R* is an assumption that is often made for conveniences in some books.
> I don't quite beleive it to be correct either.
>
> >
>
--~--~-~--~~
31 matches
Mail list logo
