Re: [algogeeks] Facebook Interview questions. -- Urgent
they will give a puzzle kind of problem .. and you will have to code to output the solution .. i think it was a 75 min coding round. On Thu, Sep 8, 2011 at 12:17 AM, Ishan Aggarwal ishan.aggarwal.1...@gmail.com wrote: Do anyone know what kind of questions facebook ask in their coding interview?? Wht should I prepare... -- 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. -- The more you sweat in the field, the less you bleed in war. Ankit Minglani NITK Surathkal -- 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] Any ideas on project on data mining ??
Any ideas on project on data mining ?? -- The more you sweat in the field, the less you bleed in war. Ankit Minglani NITK Surathkal -- 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] Algorithm to find two numbers in an array that sum up to a given number
one method can be :
Let T = the sum
for(i=0;in;i++)
{
temp=T- x[i];
// perform a binary search on array[ i+1. n-1] to find temp it if
does then just output.
}
On Wed, Aug 31, 2011 at 11:04 AM, bharatkumar bagana
bagana.bharatku...@gmail.com wrote:
Its brute force method.O(n^2) algo...
for(int i=0;in;i++)
for(int j=i+1;jn;j++)
{
if(x==A[i]+A[j])
{ print A[i],A[j]; break;}
}
On Wed, Aug 31, 2011 at 1:15 AM, Reynald reynaldsus...@gmail.com wrote:
For example, in array, say,
8, 9, 2, 4, 6, 2, 3
Input 5, output 2 and 3.
--
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.
--
**Please do not print this e-mail until urgent requirement. Go Green!!
Save Papers = Save Trees
*BharatKumar Bagana*
**http://www.google.com/profiles/bagana.bharatkumarhttp://www.google.com/profiles/bagana.bharatkumar
*
Mobile +91 8056127652*
bagana.bharatku...@gmail.com
--
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.
--
The more you sweat in the field, the less you bleed in war.
Ankit Minglani
NITK Surathkal
--
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] Re: My MORGAN STANLEY INTERVIEW Process
I just joined back .. On Aug 24, 8:59 am, shady sinv...@gmail.com wrote: lol, he is still part of the group On Wed, Aug 24, 2011 at 9:25 AM, saurabh singh saurab...@gmail.com wrote: Its not spamIts just that adfly is a bad shortening url.Wait for few seconds then skip the ad. @shadyU seriously need to cool down dude... On Tue, Aug 23, 2011 at 4:09 PM, shady sinv...@gmail.com wrote: very good ... spammer On Tue, Aug 23, 2011 at 3:31 PM, Ankit Minglani ankit.mingl...@gmail.com wrote: Link To my MORGAN STANLEY INTERVIEW PROCESS http://adf.ly/2Qewl -- The more you sweat in the field, the less you bleed in war. Ankit Minglani NITK Surathkal -- 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. -- Saurabh Singh B.Tech (Computer Science) MNNIT 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. -- 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: Find the non-duplicate element in sorted array in O(n) time
How about this :
We use a divide and conquer approach and since the array is sorted.
We find the middle element and check its value with its immediate left and
right element .. it must match with anyone of them ..
if it doesnt we have found such a element . and otherwise we divide the
array again ..
and then again find the middle element .. to check the same condition ..
This will take O(lg n ) time :)
On Wed, Aug 24, 2011 at 3:45 PM, Venkat venkataharishan...@gmail.comwrote:
we can solve this with the help of binary search.
we know N, which is odd(because of one pair missing)
We divide it array. Let consider your input { 1,1,2,2,2,2,3,3,4,5,5}
int find_culprit(int[] array, int start, int end)
{
if(end==start)
return -1;
int mid=((end-start) / 2) + start;
if array[mid] == array[mid-1]
return find_culprit(mid,end)
if(array[mid] == array [mid +1]
return find_culprit(start, mid);
else
return array[mid];
}
Run through:
Steps1: find_culprit(array,0,8)
mid=4
Step 2 : find_culprit(array,4,8))
mid=6
step 3 : find_culprit(array,6,8))
mid=7
return array[7]=4 (which dont have pair)
Run time O(log n+1) = O(log n)
Please ask if you ve any doubts.
Regards
Venkat.
On Aug 24, 2:49 pm, atul purohit gonewiththe...@gmail.com wrote:
Hi,
A* sorted *integer array contains elements in pairs. All the pairs are
complete except one element whose pair is missing. Find that element.
Ex. { 1,1,2,2,2,2,3,3,4,5,5}
result = 5
There is a standard solution which returns an XOR of all the elements.
But
this needs O(n) time complexity. The person who asked me this question
said
that this can be done in O(n). Maybe we can eliminate some elements.
Anyone knows how to do this?
Cheers,
Atul
--
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.
--
The more you sweat in the field, the less you bleed in war.
Ankit Minglani
NITK Surathkal
--
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] OUTPUT????
out put is :
10.375001
float value =10.4
integer value=1
1 1 1 10.37500
what us the problem ?
On Sat, Aug 6, 2011 at 2:19 AM, SHIVAM AGRAWAL shivi...@gmail.com wrote:
any1 plz tell me y output of float type of dis prgrm is zero?
#includestdio.h
#define INT 1
main()
{
struct a
{
int type;
};
struct c
{
int type;
int e;
};
struct b
{
int type;
float f;
};
union
{
struct a n;
struct b nf;
struct c ni;
}all;
all.ni.type=INT;
all.nf.f=10.43;
all.ni.e=1;
printf(%f\n,all.nf.f);
if(all.nf.type==INT)
printf(float value =%2.1f,all.nf.f);
if(all.ni.type==INT)
printf(\ninteger value=%d,all.ni.e);
printf(\n%d %d %d %f,all.ni.type,all.nf.type,all.ni.e,all.nf.f);
--
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.
--
The more you sweat in the field, the less you bleed in war.
Ankit Minglani
NITK Surathkal
--
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: Goldman sachs
heyy thanks alot to you people .. it was of so much help :) On Wed, Aug 3, 2011 at 2:49 AM, Kunal Patil kp101...@gmail.com wrote: I agree with Ved that Apti of GS is really really tough and technical is relatively easy..They ask CAT (Quant) like questions and you have to solve them in little time too...Also there will be sectional cut-off for this written test. So dont be afraid if you can solve only 10-15 questions from quantitative apti..Just make sure you attempt as much questions from both the sections as possible. Essay will also be there, subject of which will be provided in last 10 mins of your apti. In Interview, they ask C++ and DBMS questions mostly.. On Wed, Aug 3, 2011 at 2:39 PM, Ved vedgar...@gmail.com wrote: Questions were from C language lik Pointers and wat will b the output of the code , Errors etc. Clearing written test is not that tough u shud manage time and solve technical which will b 10 ques first den try aptitude .. All the Best On Aug 3, 12:10 am, arvind kumar arvindk...@gmail.com wrote: i mean..the technical written round. On Wed, Aug 3, 2011 at 12:37 AM, arvind kumar arvindk...@gmail.com wrote: Hi thanks a lot..can u pls temme wat wer the main areas(and questions if possible) covered in the technical round? Regards Arvind On Wed, Aug 3, 2011 at 12:35 AM, Ved Garbha vedgar...@gmail.com wrote: Goldman Sachs : The aptitude+technical together(written test ) will b of 45 min .. Apti will b tough but technical wil b C damn easy . followed by GD , and after dat two technical and HR round On Tue, Aug 2, 2011 at 9:54 PM, arvind kumar arvindk...@gmail.com wrote: Hi there Goldman sachs is comin to our campus!!anyone has any idea about their interviews(technical),etc..? -- 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. -- *Ved Garbha* -- 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. -- The more you sweat in the field, the less you bleed in war. Ankit Minglani NITK Surathkal -- 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: adobe written round que
yeah if it was a divisibility test then the question would have been too trivial .. the last digit after doing itoa will be the remainder . On Sat, Jul 30, 2011 at 11:52 AM, nivedita arora vivaciousnived...@gmail.com wrote: i think solution of ankit is right ! sorry even i forgot tht que ws not divisibility test ..but to get quotient :-| On Jul 30, 10:03 pm, Ankur Khurana ankur.kkhur...@gmail.com wrote: @roopam : i got the question all wrong. . . On Sat, Jul 30, 2011 at 10:01 PM, Roopam Poddar mailroo...@gmail.com wrote: The objective is to divide the number by 3 and not just check for it's divisibility. Adding the digits using itoa() and then repeated subtraction will check for it's divisibility by 3 and not give us the quotient. To get that you will have to carry out repeated subtraction on the number anyway. So whats the point? -- 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/-/BWTzYtcBhIgJ. 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. -- Ankur Khurana Computer Science Netaji Subhas Institute Of Technology Delhi. -- 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. -- The more you sweat in the field, the less you bleed in war. Ankit Minglani NITK Surathkal -- 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: Interview ques
+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. -- The more you sweat in the field, the less you bleed in war. Ankit Minglani NITK Surathkal -- 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: Interview ques
@aditi : in C++ you define a function virtual to let the derived class give
its own definition for the same. and in that case the functions are
overridden. unlike in JAVA where no virtual keyword is needed .. so if you
write the same code as above in java .. that may be referred to as Method
overriding .. but not in cpp.
On Sun, Jul 31, 2011 at 9:34 AM, aditi garg aditi.garg.6...@gmail.comwrote:
@ Ankit: Wat is overriding actually thn?
On Sun, Jul 31, 2011 at 9:58 PM, Anika Jain anika.jai...@gmail.comwrote:
ohkk.. m so sorry
On Sun, Jul 31, 2011 at 9:41 PM, Ankit Minglani ankit.mingl...@gmail.com
wrote:
@anika: This is not function overriding i think .. you cannot call the
f() function of the base class from the derived class object .. what you are
doing is creating a object of the derived class and calling the version of
f() that belong to derived class B .. ie is the same class object is calling
the same class function .
correct me if i m wrong .
On Sun, Jul 31, 2011 at 8:42 AM, Anika Jain anika.jai...@gmail.comwrote:
@ muthu : not declaring tht function as virtual wont save overriding
class A
{
int a;
public:
void f()
{}
int f2(){}
};
class B:public A
{
public:
void f()
{
coutabc\n;
}
};
int main()
{
B ob;
ob.f();
return 0;
}
in this output is abc..
so overriding occured
On Sun, Jul 31, 2011 at 8:41 PM, muthu raj muthura...@gmail.comwrote:
Using friend functions we can only invoke already defined private
functions. We cannot override or prevent overriding using friend
functions.
The problem here is how to prevent base class function from being
overridden
in derived class.
*Muthuraj R
IV th Year , ISE
PESIT , Bangalore*
On Sun, Jul 31, 2011 at 8:04 AM, Anika Jain anika.jai...@gmail.comwrote:
what if we write that function as private of base class.. and make a
function in derived class that is friend function of the base class do
that
it can call tht private function of base.??
On Sun, Jul 31, 2011 at 8:25 PM, muthu raj muthura...@gmail.comwrote:
Yeah but there is no equivalent of final keyword in c++.So to
prevent member function from overriding in derived class in c++ dont
declare
the member function as virtual. Then it cannot be overridden in derived
class. There is no other way of preventing a member function of base
class
from being overridden.
*Muthuraj R
IV th Year , ISE
PESIT , Bangalore*
On Sun, Jul 31, 2011 at 7:38 AM, himanshu kansal
himanshukansal...@gmail.com wrote:
i think there is no keyword known as final in c++.maybe u are
talking with respect to java
On Sun, Jul 31, 2011 at 8:03 PM, muthu raj muthura...@gmail.comwrote:
By declaring the function a static final f().
*Muthuraj R
IV th Year , ISE
PESIT , Bangalore*
On Sun, Jul 31, 2011 at 7:28 AM, himanshu kansal
himanshukansal...@gmail.com wrote:
sry i thinki misspelled d ques
d ques was
how will you protect a derived class to override base class's
member function in c++
say if there is a function f() in base class then derived should
not be able to
override f() to provide its own definition.
but The function must be accessible in derived class.
PS:dont try to make the function private in base class( it will be
become inaccessible in derived class).
On Sun, Jul 31, 2011 at 7:49 PM, himanshu kansal
himanshukansal...@gmail.com wrote:
how will you protect a base class to override its member function
in
derived class
say if there is a function f() in base class then derived cannot
override f() to provide its own definition.
The function must be accessible in derived class.
PS:dont try to make the function private in base class( it will
be
become inaccessible in derived class).
--
Regards
Himanshu Kansal
Msc Comp. sc.
(University of Delhi)
--
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.
--
Regards
Himanshu Kansal
Msc Comp. sc.
(University of Delhi)
--
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
Re: [algogeeks] Any help on bits?
@Kamakshi : any kind of operation can be used .. Exactly XORing the bits should do the trick .. and we can then count the number of 1s in the answer to know how many bits are different . This is like the Hamming distance used in Hamming code in Networks . On Sun, Jul 31, 2011 at 8:37 AM, Kamakshii Aggarwal kamakshi...@gmail.comwrote: @what kind of operations can be applied to 'A'? On Sun, Jul 31, 2011 at 6:54 PM, Amol Sharma amolsharm...@gmail.comwrote: yupxor would do the required task eaisly !! -- Amol Sharma Third Year Student Computer Science and Engineering MNNIT Allahabad On Sun, Jul 31, 2011 at 6:42 PM, Nikhil Gupta nikhilgupta2...@gmail.comwrote: @Surya, ^ operator mean XOR operation. On Sun, Jul 31, 2011 at 6:41 PM, Surya Prakash suryaprakash...@gmail.com wrote: we can just apply xor operation rightit's more easier!! -- 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. -- Nikhil Gupta Senior Co-ordinator, Publicity CSI, NSIT Students' Branch NSIT, New Delhi, India -- 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. -- Regards, Kamakshi kamakshi...@gmail.com -- 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. -- The more you sweat in the field, the less you bleed in war. Ankit Minglani NITK Surathkal -- 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: Direct - i ques
i think you can just enter elements in a sorted order ( ie applying insertion sort as the elements are added ) like we do in Bucket sort .. maintaining sorted buckets for a hash value .. and maintaining the min element at the head always we can do deletion of min and finding min in O(1) time because it is always the head. On Sun, Jul 31, 2011 at 10:21 AM, pandharinath gorde pandharinath.go...@gmail.com wrote: O(1) is possible in normal LL in below case: i.If u have head then insertion , deletion and accesss to first element at front . ii.if u have tail then insertion and access to element at last . if anything missing add anout normal LL On Sun, Jul 31, 2011 at 9:47 PM, siva viknesh sivavikne...@gmail.comwrote: I think the exact question resembles as what ravinder kumar saidAnd all these operations in O(1) time...ideas plz On Jul 31, 5:21 pm, Ravinder Kumar ravinde...@gmail.com wrote: Guys the real question is : Design a data structure which support following operation 1. insertion of an arbitrary element 2. removing the oldest element 3. Accessing min element -- *With Regards :* Ravinder Kumar B.Tech Final Year Computer Science and Engineering MNNIT 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. -- Pandharinath Gorde +91-9620557641 -- 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. -- The more you sweat in the field, the less you bleed in war. Ankit Minglani NITK Surathkal -- 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: adobe written round que
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. -- Aditi Garg Undergraduate Student Electronics Communication Divison NETAJI SUBHAS INSTITUTE OF TECHNOLOGY Sector 3, Dwarka New Delhi -- 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. -- The more you sweat in the field, the less you bleed in war. Ankit Minglani -- 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.
