]+ );
for(int k = j ; k i; k++) **
Console.Write(numbers[k][i]+ );
for(int k = i ; k j; k–)
Console.Write(numbers[i][k]+ );
for(int k = i ; k j; k–)
Console.Write(numbers[k][j]+ );
}
}*
Regards,
Adi Srikanth.
Mob No 08886888066
Personal Pages: http://bit.ly/adisrikanth
On Sun, Apr 28, 2013 at 7
but he asked to optimize and i got stucked there.
Any otherway to accomplish same?
Regards,
Adi Srikanth.
Mob No 08886888066
Personal Pages: http://bit.ly/adisrikanth
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To unsubscribe from this group
as far as i understand, u may be looking for Executor class. check out for
Executor in JavaDocs
Regards,
Adi Srikanth.
Personal Pages: http://bit.ly/adisrikanth
On Thu, Oct 18, 2012 at 6:54 PM, Shruti Gupta fundooshr...@gmail.comwrote:
if u are extending Thread class, then u can simply make
if space complexity is not a constraint..u can use any kind of hashing and
its function.depends on the kind of data we store..if its numbers go for
square or simple linear function
Regards,
Adi Srikanth.
Mob No 9887233349
Personal Pages: adisrikanth.co.nr
On Fri, Sep 30, 2011 at 9:43
if its an array, you can get the size of an array from sizeof(array) divided
by size of element typethen we can perform binary search
Regards,
Adi Srikanth.
Personal Pages: adisrikanth.co.nr
On Fri, Sep 30, 2011 at 8:47 PM, Don dondod...@gmail.com wrote:
@Ashima: It is a hypothetical
in our college SAP had a online test, technical interview(some basic DSA
questions) and HR round(Important here..they will verify how much interested
you are...)
Regards,
Adi Srikanth.
Mob No 9887233349
Personal Pages: adisrikanth.co.nr
On Wed, Aug 31, 2011 at 12:31 PM, Nikhil Gupta
around 11.5 LPA gross
Regards,
Adi Srikanth.
Mob No 9887233349
Personal Pages: adisrikanth.co.nr
On Thu, Sep 22, 2011 at 11:55 AM, rahul sharma rahul23111...@gmail.comwrote:
wats eligibility n package?
On Thu, Sep 22, 2011 at 12:26 AM, sagar pareek sagarpar...@gmail.comwrote:
nit
there is something anamoly about this birthday probability caculation.
Search in google..you may find it.
Regards,
Adi Srikanth.
Mob No 9887233349
Personal Pages: adisrikanth.co.nr
On Wed, Aug 17, 2011 at 6:25 PM, Romil ... vamosro...@gmail.com wrote:
Take it as:
P(atleast 2) = 1-P(no 2
u can use count sort or bucket sort, hashing
Regards,
Adi Srikanth.
Mob No 9887233349
Personal Pages: adisrikanth.co.nr
On Mon, Aug 15, 2011 at 8:54 PM, sukran dhawan sukrandha...@gmail.comwrote:
use kadane 's algorithm
On Mon, Aug 15, 2011 at 8:46 PM, Bharat Kul Ratan bharat.kra
int main()
{
int x=0,t=0;
switch(x)
{
case 0: x++;
do {
case 1:t++;
case 2:t++;
case 3:t++;
x++;
} while(x2);
}
printf(%d\n,t);
return 0;
}
t will be wat???...3, 6 or 9
Regards,
Srikanth.
--
10 matches
Mail list logo
