Hi
My email id is : riteshsandily...@gmail.com
___
test mailing list -- test@lists.fedoraproject.org
To unsubscribe send an email to test-le...@lists.fedoraproject.org
Fedora Code of Conduct:
https://docs.fedoraproject.org/en-US/project/code-of-conduct/
it is better to use Binary Index Tree ( Fenwick Tree) with time complexity
O(log n) to update and O(n * log n) for finding max overlapping interval .
http://community.topcoder.com/tc?module=Staticd1=tutorialsd2=binaryIndexedTrees
this link can be useful for understanding how it will work.
@anurag : there is no need to SORT. as it will increase complexity O(n) to
O(n log n).
here is the correct code.. please look over it and notify me if i'm wrong .
T.C. = O( n )
// ex: 1 4 3 2 0 i'm explaining on behalf of it.
bool permute (int *arr , int N )
{
if ( N=1 ) return false;
try to solve it by recursion ..
http://www.leetcode.com/2011/09/regular-expression-matching.html
Regards,
Ritesh Kumar Mishra
Information Technology
Third Year Undergraduate
MNNIT Allahabad
On Sun, Dec 23, 2012 at 11:14 PM, Prem Krishna Chettri
hprem...@gmail.comwrote:
Well I can tell you
', but p+1 element can be '\0' , therefore leading to p+2 to be
undefined.
On Thu, Dec 27, 2012 at 6:23 AM, Ritesh Mishra rforr...@gmail.comwrote:
try to solve it by recursion ..
http://www.leetcode.com/2011/09/regular-expression-matching.html
Regards,
Ritesh Kumar Mishra
Information
