[algogeeks] Re: Openings in Snapdeal
Forgot to mention: Applications only from tier 1 colleges will be preferred. On Thu, Feb 19, 2015 at 11:17 AM, Romil Goyal vamosro...@gmail.com wrote: Hi everyone, Snapdeal is having a lot of open positions for developers both at senior and junior level. Send your resumes to me at vamosro...@gmail.com Java people are highly preferred but not mandatory. -- Romil -- Romil -- 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+unsubscr...@googlegroups.com.
[algogeeks] Openings in Snapdeal
Hi everyone, Snapdeal is having a lot of open positions for developers both at senior and junior level. Send your resumes to me at vamosro...@gmail.com Java people are highly preferred but not mandatory. -- Romil -- 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+unsubscr...@googlegroups.com.
Re: [algogeeks] Resources for understanding Dynamic programming
Hi, Rahul. Can you email me the complete book by kleinberg and tardos? On Thu, Nov 15, 2012 at 5:31 PM, Rahul Kumar Patle patlerahulku...@gmail.com wrote: On Thu, Nov 15, 2012 at 4:01 PM, Sarath csar...@gmail.com wrote: Are there any good resources to understand Dynamic programming and also looking for some good problem and step by step solution for better understanding. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/RtXi9Nlvqa0J. 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. -- Thanks and Regards: Rahul Kumar Patle M.Tech, School of Information Technology Indian Institute of Technology, Kharagpur-721302, Indiahttp://www.iitkgp.ac.in/ Mobile No: +91-8798049298, +91-9424738542 Alternate Email: rahulkumarpa...@hotmail.com [image: Linkedin]http://www.linkedin.com/profile/view?id=106245716trk=tab_pro [image: Twitter] https://twitter.com/rahulkumarpatle https://www.facebook.com/rkpatle -- -- Romil Software Engineer, Winshuttle Softwares India Pvt. Ltd. Chandigarh --
Re: [algogeeks] use of static
It should give an error in the line names[3] = names[4]
These are fixed address values..you cannot change them.
On Thu, Aug 30, 2012 at 12:44 PM, Puneet Gautam puneet.nsi...@gmail.comwrote:
#includeiostream.h
int main()
{static char names[5][20]={pascal,ada,cobol,fortran,perl};
int i;
char *t;
t=names[3];
names[3]=names[4];
names[4]=t;
for (i=0;i=4;i++)
coutnames[i]endl;
getchar();
return 0;
}
Whats the importance of static keyword here..?
--
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 this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Romil
Software Engineer,
Winshuttle Softwares India Pvt. Ltd.
Chandigarh
--
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 this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] SPOJ problem : CANDY III
Initialize sum as zero for all test cases ie inside 1st for loop.
On Jun 21, 2012 5:22 PM, Mayank Singh singh13490may...@gmail.com wrote:
here is my code :
#includestdio.h
#includestdlib.h
int main()
{
long long cand,sum;
int T,N,i,j,*temp;
scanf(%d,T);
temp= (int*)calloc(T, sizeof( int));
sum = 0;
for(i=0;iT;i++)
{
scanf(%d,N);
for(j=0;jN;j++)
{
scanf(%lld,cand);
sum = (sum+cand)%N;
}
if(sum == 0)
temp[i]=1;
else
temp[i]=0;
}
for(i=0;iT;i++)
{
if(temp[i]==1)
printf(YES\n);
else
printf(NO\n);
}
return 0;
}
it is giving WA in spoj. i am unable to find what is wrong with it..plz
help me.
--
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 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 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.
Re: [algogeeks] Re: Microsoft question
Can't we use k iterations of bubble sort ? On Jun 18, 2012 2:11 PM, Ramindar Singh ramin...@gmail.com wrote: We can use Median of medians http://en.wikipedia.org/wiki/Selection_algorithm#Linear_general_selection_algorithm_-_Median_of_Medians_algorithm On Sunday, 17 June 2012 08:13:18 UTC+5:30, Prem Nagarajan wrote: Give an array of unsorted elements, find the kth smallest element in the array. The expected time complexity is O(n) and no extra memory space should be used. Quickselect algorithm can be used to obtain the solution. Can anyone explain how quickselect works? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/4lQsacmUPYUJ. 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. -- 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 this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Please solve this code and explain what is happening..
#includestdio.hint fun(int(*)());
int main()
{
fun(main);
printf(Hi\n);
return 0;
}int fun(int (*p)())
{
printf(Hello );
return 0;}
--
Romil
--
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 this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Please solve this code and explain what is happening..
Thats exactly what I thought..but Turbo compiler tells something else..check it out please/ On Sun, Aug 21, 2011 at 12:36 PM, Abhishek mailatabhishekgu...@gmail.comwrote: here int fun(int(*)()); is a function which accepts a function in its argument which returns 'int' and accepts nothing. since it is doing nothing with argument, so there is as usual o/p. in short it is a concept of function pointers. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/WcDEshfy6MAJ. 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. -- Romil -- 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 this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Please solve this code and explain what is happening..
Problem solved..dont spend further time on it. On Sun, Aug 21, 2011 at 12:42 PM, JAIDEV YADAV jaid...@gmail.com wrote: plz stop using turbo compilers ... On Mon, Aug 22, 2011 at 1:11 AM, Romil ... vamosro...@gmail.comwrote: Thats exactly what I thought..but Turbo compiler tells something else..check it out please/ On Sun, Aug 21, 2011 at 12:36 PM, Abhishek mailatabhishekgu...@gmail.com wrote: here int fun(int(*)()); is a function which accepts a function in its argument which returns 'int' and accepts nothing. since it is doing nothing with argument, so there is as usual o/p. in short it is a concept of function pointers. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/WcDEshfy6MAJ. 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. -- Romil -- 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 this group at http://groups.google.com/group/algogeeks?hl=en. -- JaiDev Yadav (National Yoga Champion) Computer Engg. Dept. National Institute of Technology Kurukshetra,Haryana -- 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 this group at http://groups.google.com/group/algogeeks?hl=en. -- Romil -- 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 this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Please solve this code and explain what is happening..
Its okay abhishek..i got it working. thanks On Sun, Aug 21, 2011 at 12:48 PM, Abhishek mailatabhishekgu...@gmail.comwrote: what's wrong.. ? every thing is fine in Turbo C too.. it is just giving warning for not using the pointer p. plz be specific yours doubt is where.. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/RfelpqHwrOYJ. 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. -- Romil -- 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 this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Please explain its working..
#includestdio.h
int main()
{
char *str;
str = %s;
printf(str, K\n);
return 0;
}
--
Romil
--
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 this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Challenge
This question has more specification that the rows are sorted. It can be easily solved then. Otherwise its not solvable. On Sat, Aug 20, 2011 at 3:04 PM, shady sinv...@gmail.com wrote: i wonder how is it possible because reading input itself takes O(m*n) On Sat, Aug 20, 2011 at 2:59 PM, Sanjay Rajpal srn...@gmail.com wrote: Yes its O(m+n), but i dont know how :) Thats y i posted it here. Sanju :) On Sat, Aug 20, 2011 at 2:28 AM, Naman Mahor naman.ma...@gmail.comwrote: it is O(m+n). sure?? On Sat, Aug 20, 2011 at 2:52 PM, Sanjay Rajpal srn...@gmail.comwrote: We are given a 2-D array of 0s and 1s. We have to determine which row contains maximum no. of 1s in the array in O(m+n); where m - no. of rows and n - no. of columns. Sanju :) -- 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 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 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 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 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 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. -- Romil -- 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 this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: probability! tough one to crack!
The requirements will be satisfied if the centre of the coin is such that the coin just touches the square. This is possible only when the centre of coin is in a smaller square of 1 inch side. Hence the result. On Fri, Aug 19, 2011 at 10:41 PM, Sanjay Rajpal srn...@gmail.com wrote: @Dave : me too didnt get the meaning you want to convey, plz throw some light. Sanjay Kumar B.Tech Final Year Department of Computer Engineering National Institute of Technology Kurukshetra Kurukshetra - 136119 Haryana, India On Fri, Aug 19, 2011 at 10:09 AM, priya ramesh love.for.programm...@gmail.com wrote: @dave: You are great!! The ans is indeed 1/4. I dint understand this sentence... The area of the region within 1/2 inch of the boundary is 3 square inches. -- 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 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 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. -- Romil -- 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 this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] GS apti ques!
Answer should be 0.212. Tell me if I am correct. On Wed, Aug 17, 2011 at 4:30 PM, priya ramesh love.for.programm...@gmail.com wrote: A B and C have chance of failure of 20%, 30% and 40%. To activate the machine at least two should be active. What is the probability that machine will be active? -- 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 this group at http://groups.google.com/group/algogeeks?hl=en. -- Romil -- 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 this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] GS apti ques!
Kumar's approach would not do perhaps. I simply eliminated the undesired cases. Those include the one when none of them is active and when only one of them is active. @Kumar: You should have also added the term abc. On Wed, Aug 17, 2011 at 4:39 PM, priya ramesh love.for.programm...@gmail.com wrote: @romil: how did you solve this?? -- 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 this group at http://groups.google.com/group/algogeeks?hl=en. -- Romil -- 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 this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] GS apti ques!
@Priya: A mistake from my side. The answer should be 1-0.212 i.e. 0.788 Sorry for this mistake. @Kumar: Yours is wrong. Check it again. On Wed, Aug 17, 2011 at 4:42 PM, Romil ... vamosro...@gmail.com wrote: Kumar's approach would not do perhaps. I simply eliminated the undesired cases. Those include the one when none of them is active and when only one of them is active. @Kumar: You should have also added the term abc. On Wed, Aug 17, 2011 at 4:39 PM, priya ramesh love.for.programm...@gmail.com wrote: @romil: how did you solve this?? -- 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 this group at http://groups.google.com/group/algogeeks?hl=en. -- Romil -- Romil -- 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 this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] De shaw ques!
People this is not the way to approach this one. This question seems to be unfair. Take the number to be 1939 which also leaves 69 as the remainder when divided by 935 but when it is divided by 38, the remainder is only 1. There is definitely some mistake. Also there doesn't seem to be a mathematical way to solve this. On Wed, Aug 17, 2011 at 5:58 PM, priya ramesh love.for.programm...@gmail.com wrote: i solved it the same way you solved it. Took the same exmpl too :) -- 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 this group at http://groups.google.com/group/algogeeks?hl=en. -- Romil -- 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 this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: probability tough one!
Take it as: P(atleast 2) = 1-P(no 2 have same b'day) = 1- ((365C50)/50!) where C represents the combinations On Wed, Aug 17, 2011 at 6:14 PM, sukran dhawan sukrandha...@gmail.comwrote: can yo explain it pl? On Wed, Aug 17, 2011 at 6:11 PM, Aditya Jain aditya2...@gmail.com wrote: Is that exactly 2 or atleast 2? P(atleast 2)=1-P(no 2 people )=1-(364*363*362*.*317/365^49) On Aug 17, 5:24 pm, priya ramesh love.for.programm...@gmail.com wrote: nothing is specified. I guess it's 365 -- 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 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 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. -- Romil -- 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 this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Max possible numbers in incremental order
@Sanjay: In the longest common subsequence we have the continuous elements
but here he has placed no restriction on that..
On Wed, Aug 17, 2011 at 9:06 PM, Raghavan its...@gmail.com wrote:
@sanjay:
Thats cool
On Wed, Aug 17, 2011 at 9:02 PM, Sanjay Rajpal srn...@gmail.com wrote:
I think it is similar to longest increasing subsequence problem .
Try the following link :
http://en.wikipedia.org/wiki/Longest_increasing_subsequence
Sanjay Kumar
B.Tech Final Year
Department of Computer Engineering
National Institute of Technology Kurukshetra
Kurukshetra - 136119
Haryana, India
On Wed, Aug 17, 2011 at 8:26 AM, Raghavan its...@gmail.com wrote:
Given an unsorted array (A), find the max size of set in which the
numbers should be in the incremental order.
For example: A = [7,* 2, 3*, 1, *5, 8, 9*, 6]
The possible set with max numbers (in increment order) is {2, 3, 5, 8, 9}
and the result is: 5.
Note:
1. The final set can begin at any index.
2. It can skip any numbers which comes in between the array (here we
skipped {7, 1, 6}).
how to do this?
--
Thanks and Regards,
Raghavan KL
--
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 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 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.
--
Thanks and Regards,
Raghavan KL
--
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 this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Romil
--
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 this group at
http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] an amazing amazon question!
@Sagar: Could you please explain how you did it?? On Wed, Aug 17, 2011 at 10:35 PM, sagar pareek sagarpar...@gmail.comwrote: 16, 61, 106 average speed is 45 miles/hour On Wed, Aug 17, 2011 at 10:28 PM, priya ramesh love.for.programm...@gmail.com wrote: A car is traveling at a uniform speed.The driver sees a milestone showing a 2-digit number. After traveling for an hour the driver sees another milestone with the same digits in reverse order.After another hour the driver sees another milestone containing the same two digits. What is the average speed of the driver? -- 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 this group at http://groups.google.com/group/algogeeks?hl=en. -- **Regards SAGAR PAREEK COMPUTER SCIENCE AND ENGINEERING NIT ALLAHABAD -- 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 this group at http://groups.google.com/group/algogeeks?hl=en. -- Romil -- 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 this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: DE Shaw Q
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 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 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. -- Sunny Aggrawal B-Tech IV year,CSI Indian Institute Of Technology,Roorkee -- Sunny Aggrawal B-Tech IV year,CSI Indian Institute Of Technology,Roorkee -- 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 this group at http://groups.google.com/group/algogeeks?hl=en. -- Romil -- 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 this group at http://groups.google.com/group/algogeeks?hl=en.
