@anitha. :
JP Morgan din visit our campus. :P tat was Morgan Stanley :P :P
--
With Regards,
Balaji.S
--
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 f
Given a 3X3 matrix , with 1's 0's and -1's ( 1 is player one 0 is player two
-1 is none)
how ll you find who is the winner / draw in a tic tac toe game in the most
effiecient manner...
--
With Regards,
Balaji.S
--
You received this message because you are subscribed to the Google Groups
"
@kashyap : wow wat a solution.. great :D
--
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
algogeeks+unsubscr...@googlegroups.co
Question - you are given a1b3c7d8.. an array like this. This is a
compressed array. (Similar to
Run Length) You are supposed to expand the given input IN-PLACE. That is,
your array is large
enough to hold the output.
Example -
Input - a1b4 - Array Length - 5
Output - a
--
With Regards,
The following C program segfaults of IA-64, but works fine on IA-32.
* int main()
{
int* p;
p = (int*)malloc(sizeof(int));
*p = 10;
return 0;
}
*
Why does it happen so?
--
With Regards,
Balaji.S
--
You received this message because you are subscribed to the
wats the mistake..
--
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
algogeeks+unsubscr...@googlegroups.com.
For more options, visit
1. Convert a binary tree to binary search tree inplace..
2. Convert a DLL to a binary search tree that is balanced.
3. Implement a C++ garbage collector efficiently
--
With Regards,
Balaji.S
--
You received this message because you are subscribed to the Google Groups
"Algorithm
@pritpal : Refer ques 5 at
http://www.youthrocker.com/2011/06/interview-questions-amazon-placement.html
@shachindra : wats tat :-o
--
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.co
What is the wrong in this program
main()
{
char *p,*q;
p=(char *)malloc(25);
q=(char*) malloc(25);
strcpy(p,"INDIA" );
strcpy(q,"hyd");
strcat(p,q);
printf("%s",p);
}
--
With Regards,
Balaji.S
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" gr
LCS(string,reverse(string)) ?? but this is not O(n) ryt..
--
With Regards,
Balaji.S
--
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
main()
{ int i=5;
printf("%d",fun(fun(fun(fun( fun(i));
}
void fun (int i)
{
if(i%2)
return (i+(7*4)-(5/2)+(2*2));
else
return (i+(17/5)-(34/15)+(5/2));
}
--
With Regards,
Balaji.S
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" gr
no error ryt??
--
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
algogeeks+unsubscr...@googlegroups.com.
For more options, visit thi
@above : thanks got it :)
--
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
algogeeks+unsubscr...@googlegroups.com.
For more options
how s that output obtained??
--
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
algogeeks+unsubscr...@googlegroups.com.
For more opti
#include
int main()
{
int a=3, b = 5;
printf(&a["Ya!Hello! how is this? %s\n"], &b["junk/super"]);
printf(&a["WHAT%c%c%c %c%c %c !\n"], 1["this"],
2["beauty"],0["tool"],0["is"],3["sensitive"],4["CC"]);
return 0;
}
--
With Regards,
Balaji.S
--
You receive
why is it so..??
--
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
algogeeks+unsubscr...@googlegroups.com.
For more options, visit t
#include
int main()
{
float f=0.0f;
int i;
for(i=0;i<10;i++)
f = f + 0.1f;
if(f == 1.0f)
printf("f is 1.0 \n");
else
printf("f is NOT 1.0\n");
return 0;
}
--
You received this message because you
what if c=9.. 9%4=1 ryt?
--
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
algogeeks+unsubscr...@googlegroups.com.
For more options,
sqr(sqrt(c)) == c
what ll it return if c is 10...
--
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
algogeeks+unsubscr...@googlegro
Fermat's little theroem ???
--
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
algogeeks+unsubscr...@googlegroups.com.
For more optio
ya.. thanks :) it works. but.. we are initializing m to 0 in everycall ryt..
? then how does 1,2,3,is initialized??
--
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 unsubs
but
constructor is
A(int *m=0*)
{
a=m;
}
not
A*(int m*) {
a = m;
}
???
--
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 th
Answer pls.. ;-)
Class A
{
int a;
public:
A(int m = 0)
{
a = m;
}
int main()
{
int i = 0;
/*
Create the 32 Objects { nObjects[32] } of Class A
&&
Initialize the nObjects[i].a = i during the constructor call ( 0 <= i <= 31
)
*/
}
--
With Regards,
Balaji.S
--
You received this message bec
what is n in the while loop?
--
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
algogeeks+unsubscr...@googlegroups.com.
For more opt
@Dave: nice idea.. ll this give AC ?
--
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
algogeeks+unsubscr...@googlegroups.com.
For m
0, ther are no w's in all :P
--
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
algogeeks+unsubscr...@googlegroups.com.
For more opt
how will u find if the pattern - ww(reverse)s* is in a file in 0(n).
w-a string of any length-l
w(reverse)- reverse of w
s*- any string of any len
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks
@pankaj: nice answer...well done..;)
--
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
algogeeks+unsubscr...@googlegroups.com.
For m
how to solve it using DP??
--
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
algogeeks+unsubscr...@googlegroups.com.
For more option
can anyone help??
how to convert a string into a palindrome..with MINIMUM NUMBER OF
SUBSTITUTIONS ( operations..)
--
balaji ;-)
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroup
just output..unicode of infinity.. :)
--
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
algogeeks+unsubscr...@googlegroups.com.
For
a one line solution is needed...
--
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
algogeeks+unsubscr...@googlegroups.com.
For more
The solution is..
_AX = 10;
can anyone explain??
--
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
algogeeks+unsubscr...@googl
Insert only one line in the function change() so that the output of the
program is 10.
You are not allowed to use exit(). You are not allowed to edit the function
main() or to
pass the parameter to change()
void change()
{
// Code here
}
int main()
{
int i=5;
change();
printf(“%d” ,i);
return 0;
thanks..
--
balaji ;-)
--
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
algogeeks+unsubscr...@googlegroups.com.
For more opt
can anyone help..?
Suppose we have a string "RGBBGBGR". we have to eliminate the couple (two
same chars adjacent to each other) recursively.
For example
RGBBGBGR --> RGGBGR-->RBGR
--
balaji ;-)
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks"
can anyone tell how to evaluate max(a,b) using abs() function...??
--
balaji ;-)
--
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
well, i can understand how x gets 20...but how y becomes 1???
--
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
algogeeks+unsubscr..
@Shubam: i ll do the else part rather.. :) and nice reply..;-);p
--
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
algogeeks+unsubsc
i got AC... :) :) :)
--
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
algogeeks+unsubscr...@googlegroups.com.
For more options, vis
hi all,
can you all help to learn dp.. i hav done some basic dp in
spoj...
--
balaji ;-)
--
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 th
41 matches
Mail list logo
