[algogeeks] Re: Find all longest increasing subsequence of length k
OK then I guess this will do but not sure. 1. Traverse the list from 1st to n-k (if n is the length of the list). only those numbers to the left of this index n-k can be represented as the starting number in sequence. 2. Also mark the indices of increasing number. i.e., for the above list:- list=> 7,8,9,4,10,11 so till 3rd index we should traverse; for each number, 7 8,9,10,11 89,10,11 910,11 410,11 3. Now taking 3 numbers(k=3) at a time and leaving the rest.i.e., 7 8 9, 7 8 10, 7 8 11, 7 9 10, 7 9 11, 7 10 11 8 9 10, 8 9 11, 8 10 11, 9 10 11 4 10 11 On Feb 7, 4:26 pm, atul anand wrote: > @vetri : yes right , include your sequence to my output. > > > > > > > > On Tue, Feb 7, 2012 at 4:07 PM, vetri wrote: > > hi atul, > > will the output also have these sequence or only those you mentioned? > > + 7 8 11 > > + 7 8 10 > > + 7 9 11 > > + 8 9 11 > > + 4 10 11 > > can u explain the question more? > > > On Jan 30, 12:43 pm, Manni mbd wrote: > > > @Manee: can u explain a bit more !! still unclear > > > > On 1/30/12, Manee wrote: > > > > > store all the indices wherever the value decreases. all subsequences > > > > between 0, these indices and the end index n are increasing > > > > subsequences. > > > > > Check which of these are of length K. > > > > > On Jan 26, 11:17 pm, atul anand wrote: > > > >> Hi, > > > > >> suggest an algo which will find all longest increasing sub > > > >> sequence of length K. > > > > >> for eg:- > > > >> input : 7 8 9 4 10 11 > > > >> K=3 > > > > >> output : > > > >> 7 8 9 > > > >> 7 9 10 > > > >> 7 10 11 > > > >> 8 9 10 > > > >> 8 10 11 > > > > >> desired complexity : O(k*n*logn) > > > > > -- > > > > 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.
[algogeeks] Re: Find all longest increasing subsequence of length k
hi atul, will the output also have these sequence or only those you mentioned? + 7 8 11 + 7 8 10 + 7 9 11 + 8 9 11 + 4 10 11 can u explain the question more? On Jan 30, 12:43 pm, Manni mbd wrote: > @Manee: can u explain a bit more !! still unclear > > On 1/30/12, Manee wrote: > > > > > > > > > store all the indices wherever the value decreases. all subsequences > > between 0, these indices and the end index n are increasing > > subsequences. > > > Check which of these are of length K. > > > On Jan 26, 11:17 pm, atul anand wrote: > >> Hi, > > >> suggest an algo which will find all longest increasing sub > >> sequence of length K. > > >> for eg:- > >> input : 7 8 9 4 10 11 > >> K=3 > > >> output : > >> 7 8 9 > >> 7 9 10 > >> 7 10 11 > >> 8 9 10 > >> 8 10 11 > > >> desired complexity : O(k*n*logn) > > > -- > > 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 :)
@harshal: the link which u posted requires an invitation.. pls see to it On Mon, Aug 8, 2011 at 12:51 AM, KK wrote: > @Harshal: Thanx > > -- > 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.
[algogeeks] Re: Amazon Aptitude questions
it's working fine on both dev and ideone.com On Aug 5, 12:13 am, Ankur Khurana wrote: > dev cpp par chal jaenge , > ideone.com par try kar > cp=cpp nahi chalega . . > > On Fri, Aug 5, 2011 at 12:40 AM, Kamakshii Aggarwal > wrote: > > > > > > > > > > > i have a doubt regarding 3rd questions..acc to me both are valid...what is > > the correct answer? > > > On Fri, Aug 5, 2011 at 12:27 AM, newOne wrote: > > >> 2 issues: > >> 1. no error handling for malloc failure( can be ignored) > >> 2. no memset for p&q. > > >> strcat will not work properly: as by definition it will search for the > >> null char in first string, removes it then copies the second string > >> including the null char of second string. > > >> -- > >> 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. > > -- > 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.
[algogeeks] puzzle
given a 6x6 matrix with all the elements as either 1 or -1. find the number of ways the elements can b arranged such that 1.the product of all elements of all columns is 1 2.the product of all elements of all rows is 1 can u pls post the answer if u no... -- 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] merge 2 sorted list into 1
question:given 2 sorted list: a's size=n and b's size=2*n but has only
n elements.
merge them into 1 single list.
answer:
i came up with dis but am gettin index out of bound exception. can u
pls spot d mistake?
import java.util.*;
public class merge {
static int a[],b[],size;
public static void mergeArray(int a[],int b[],int M){
int N=2*M;
for(int j=0,k=M;j=M&&j>=N)break;
if(a[i]<=b[j]){
b[k]=a[i];
k++;
System.out.print(" "+a[i]);
if(ihttp://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Reverse the bits.
no..it will work just fine
On Sat, Jun 11, 2011 at 3:31 AM, Anika Jain wrote:
> @balaji: right , just one change required i think so coz in question they
> are asking for change of one more bit i.e. for j=2,k=5.. bits 2,3,4,5 are
> modified..ur code is doing i guess only 2,3,4.. i think just one change
> needed int t2=(1<<(k+1))-1;
>
> On Fri, Jun 10, 2011 at 10:22 PM, Vetri Balaji wrote:
>
>> int flip(int j,int k,int n)
>> {
>> int t1=(1<> int t2=(1<> t1=t2^t1;
>> return n^t1;
>> }
>> correct me if im wrong
>>
>>
>> On Fri, Jun 10, 2011 at 10:09 PM, Kunal Patil wrote:
>>
>>> How about this???
>>> *
>>> unsigned int flip_j_to_k_bits (unsigned int n,unsigned int j,unsigned int
>>> k)
>>> {
>>> unsigned int temp;
>>> int num_of_on_bits = k-j+1;
>>>
>>> temp = (1<>> temp <<= j;
>>>
>>> return (n^temp);
>>> }*
>>>
>>> I dont know whether shift operation is O(1) or not !
>>> But i think this is the best possible that can be done !!!
>>>
>>> On Fri, Jun 10, 2011 at 8:40 PM, dinesh bansal wrote:
>>>
>>>> How do you reverse the bits between j to k in a 32 bit integer.
>>>>
>>>> For e.g.:
>>>>
>>>> n = 11100011; j = 2 and k = 5
>>>> output: 1101 (bits from 2 to 5 are reversed.)
>>>>
>>>> n = 11010110; j = 1 and k = 5
>>>> output: 11101000
>>>>
>>>> O(1) method is preferred.
>>>> Thanks,
>>>> --
>>>> Dinesh Bansal
>>>> The Law of Win says, "Let's not do it your way or my way; let's do it
>>>> the best way."
>>>>
>>>> --
>>>> 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.
>
--
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] Reverse the bits.
int flip(int j,int k,int n)
{
int t1=(1< wrote:
> How about this???
> *
> unsigned int flip_j_to_k_bits (unsigned int n,unsigned int j,unsigned int
> k)
> {
> unsigned int temp;
> int num_of_on_bits = k-j+1;
>
> temp = (1< temp <<= j;
>
> return (n^temp);
> }*
>
> I dont know whether shift operation is O(1) or not !
> But i think this is the best possible that can be done !!!
>
> On Fri, Jun 10, 2011 at 8:40 PM, dinesh bansal wrote:
>
>> How do you reverse the bits between j to k in a 32 bit integer.
>>
>> For e.g.:
>>
>> n = 11100011; j = 2 and k = 5
>> output: 1101 (bits from 2 to 5 are reversed.)
>>
>> n = 11010110; j = 1 and k = 5
>> output: 11101000
>>
>> O(1) method is preferred.
>> Thanks,
>> --
>> Dinesh Bansal
>> The Law of Win says, "Let's not do it your way or my way; let's do it
>> the best way."
>>
>> --
>> 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.
Re: [algogeeks] Re: Million Numbers
@ankit: think u missed heapify.. time complexity is O(n logn) On Fri, Jun 10, 2011 at 12:55 PM, ankit sambyal wrote: > Lets say we have 9 numbers from 1 to 10 and one number is missing. We > hv a RAM which can accomodate only 3 nos. > 9,6,7,4,3,2,1,5,10 > So, we split the file into 3 smaller files each containing 3 nos. > File1: 9,6,7 > File2: 4,3,2 > File3: 1,5,10 > > Now take each file into memory one by one and min heapify > them and put them back in the memory. > File1: 6,9,7 > File2: 2,3,4 > File3: 1,5,10 > The 1st element in each file is min in each file. > > Now make a file temp containing the 1st element of each file and > remove the 1st element from the files 1,2 and 3.Min heapify each > file.. > Temp: 1,6,2 > File1: 7,9 > File2: 3,4 > File3: 5,10 > > Now remove 1 from file Temp and take element from File3 because 1 > belonged to File3 originally. Again min Heapify them. > Temp: 2,6,5 > File1: 7,9 > File2: 3,4 > File3: 10 > > Now remove 2 > Temp: 3,5,6 > File1: 7,9 > File2: 4 > File3: 10 > > Now remove 3 > Temp: 4,6,5 > File1: 7,9 > File2: > File3: 10 > > Now going on this way we will find that after we remove 7, we could > not find 8. So, 8 is the missing no. > > > Ankit Sambyal > BITS Pilani > > > > On Fri, Jun 10, 2011 at 12:11 AM, varun pahwa > wrote: > > can anyone explain "Since there > > are less than 2^32 numbers in the file there is bound to be one number > > in the array that is less than 2^16." in dumanshu's solution. > > > > On Fri, Jun 10, 2011 at 12:39 PM, varun pahwa > > wrote: > >> > >> @ankit :please explain by taking an example. > >> > >> On Fri, Jun 10, 2011 at 12:13 PM, Vetri Balaji > >> wrote: > >>> > >>> @ankit: pls explain the time complexity.. > >>> i dont think its O(log n) > >>> > >>> On Thu, Jun 9, 2011 at 11:57 PM, ankit sambyal > > >>> wrote: > >>>> > >>>> @Dumanshu: In each iteration, we r removing the smallest number. If > >>>> at any iteration we can't find the next smallest no., it means that > >>>> no. is missing. > >>>> > >>>> > >>>> > >>>> On Thu, Jun 9, 2011 at 10:54 AM, Dumanshu wrote: > >>>> > hey... we have 300 million (9- digit) numbers. So we have to print a > >>>> > number which isn't already there in the file. > >>>> > We are not given that number beforehand. You are saying to check "u > >>>> > are going to check whether a number N exist ". > >>>> > > >>>> > On Jun 9, 4:46 pm, radha krishnan > >>>> > wrote: > >>>> >> Ma approach is to xor the given number with all numbers in the file > >>>> >> !! > >>>> >> This takes O(n) > >>>> >> I think we cant achieve a complexity >>>> >> we have to scan the file at least once > >>>> >> > >>>> >> Or move to this problem > >>>> >> Instead of a file with numbers > >>>> >> you have a stream of numbers > >>>> >> > >>>> >> Create a Trie and insert every number from the stream by reversing > >>>> >> the > >>>> >> digits of the number > >>>> >> Now u have a Trie (left as 0 bit && right as 1 bit ) > >>>> >> > >>>> >> u are going to check whether a number N exist > >>>> >> reverse the bits of N > >>>> >> search for appropriate bit in the Trie > >>>> >> if all bit are matched then there is a number !! > >>>> >> else No > >>>> >> > >>>> >> But Space Complexity Of Trie is high we need (32 *(O(n)) assuming > >>>> >> each > >>>> >> integer is of 32 bits > >>>> >> > >>>> >> > >>>> >> > >>>> >> > >>>> >> > >>>> >> > >>>> >> > >>>> >> On Thu, Jun 9, 2011 at 4:54 PM, Dumanshu > wrote: > >>>> >> > Given a file containing roughly 300 million social security > >>>> >> > numbers(9- > >>>> >> > digit numbers) find a 9-digit number that isnt there in the file. > >>>> &
Re: [algogeeks] Re: Million Numbers
@ankit: pls explain the time complexity.. i dont think its O(log n) On Thu, Jun 9, 2011 at 11:57 PM, ankit sambyal wrote: > @Dumanshu: In each iteration, we r removing the smallest number. If > at any iteration we can't find the next smallest no., it means that > no. is missing. > > > > On Thu, Jun 9, 2011 at 10:54 AM, Dumanshu wrote: > > hey... we have 300 million (9- digit) numbers. So we have to print a > > number which isn't already there in the file. > > We are not given that number beforehand. You are saying to check "u > > are going to check whether a number N exist ". > > > > On Jun 9, 4:46 pm, radha krishnan > > wrote: > >> Ma approach is to xor the given number with all numbers in the file !! > >> This takes O(n) > >> I think we cant achieve a complexity >> we have to scan the file at least once > >> > >> Or move to this problem > >> Instead of a file with numbers > >> you have a stream of numbers > >> > >> Create a Trie and insert every number from the stream by reversing the > >> digits of the number > >> Now u have a Trie (left as 0 bit && right as 1 bit ) > >> > >> u are going to check whether a number N exist > >> reverse the bits of N > >> search for appropriate bit in the Trie > >> if all bit are matched then there is a number !! > >> else No > >> > >> But Space Complexity Of Trie is high we need (32 *(O(n)) assuming each > >> integer is of 32 bits > >> > >> > >> > >> > >> > >> > >> > >> On Thu, Jun 9, 2011 at 4:54 PM, Dumanshu wrote: > >> > Given a file containing roughly 300 million social security numbers(9- > >> > digit numbers) find a 9-digit number that isnt there in the file. You > >> > have unlimited drive space but only 2mb of RAM. > >> > >> > Solution is as follows: > >> > In the first step, we build an array of 2^16 integers that is > >> > initialized to 0 and for every number in the file we take its 16 most > >> > significant > >> > bit to index into this array and increment that number. Since there > >> > are less than 2^32 numbers in the file there is bound to be one number > >> > in the array that is less than 2^16 . This tells us that there is at > >> > least one number missing among the possible numbers with those upper > >> > bits. In the second pass, we can focus only on the numbers that match > >> > this criterion and use a bit-vector of size 2^16 to identify one of > >> > the missing numbers. > >> > >> > Someone plz explain this solution( may be using some small values > >> > numbers) or suggest another approach. > >> > >> > -- > >> > 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.
Re: [algogeeks] Re: Facebook Interview Question....Heavy Number
Hey , i m a new follower to this group.. i was actually looking for a nice group that would contain a nice challenge to sharpen the brain. and i finally ended with this group... i m happy to follo this group along with geeks like you. -- 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] If any one have algorithms for interviews by adnan aziz ebook... Please mail ...
is there any other books that can help in placements?? On Wed, Mar 23, 2011 at 9:25 AM, Gaurav Saxena wrote: > Thanks a lot. > > On Wed, Mar 23, 2011 at 8:41 AM, Vetri Balaji wrote: > >> thanks!! >> >> >> On Wed, Mar 23, 2011 at 8:25 AM, Anand wrote: >> >>> Thanks!! >>> >>> >>> On Tue, Mar 22, 2011 at 7:11 PM, D.N.Vishwakarma@IITR >> > wrote: >>> >>>> thanx... >>>> >>>> On 3/22/11, Himanshu Neema wrote: >>>> > -- Forwarded message -- >>>> > From: Himanshu Neema >>>> > Date: Tue, Mar 22, 2011 at 11:13 PM >>>> > Subject: Re: [algogeeks] If any one have algorithms for interviews by >>>> adnan >>>> > aziz ebook... Please mail ... >>>> > To: Abhishek Goswami >>>> > >>>> > >>>> > Its a 15.4MB pdf so would take time to download if you have slow >>>> internet >>>> > connection , otherwise i checked the link its working. >>>> > >>>> > But I have also uploaded it on Google docs as Abhishek suggested here >>>> : >>>> > >>>> > >>>> https://docs.google.com/viewer?a=v&pid=explorer&chrome=true&srcid=0B--bA2TobuKZNGU5Njk5OTctZWEyYi00NWMwLTk0OGItMzhkMTI1ZTk0Mjg2&hl=en&authkey=CL_1msUI >>>> > >>>> > >>>> > On Tue, Mar 22, 2011 at 11:01 PM, Abhishek Goswami >>>> > wrote: >>>> > >>>> >> can you upload this file into google docs or attach this file. i >>>> tried to >>>> >> download this file but did not get any success for >>>> >> open this file >>>> >> Thanks >>>> >> Abhishek >>>> >> >>>> >> On Tue, Mar 22, 2011 at 10:41 PM, Himanshu Neema < >>>> >> potential.himansh...@gmail.com> wrote: >>>> >> >>>> >>> Turns out that I cant send file larger than 4 MB , please download >>>> it >>>> >>> from >>>> >>> here , let me know if you're still unable to download: >>>> >>> >>>> >>> >>>> >>> >>>> http://dl.dropbox.com/u/2681370/Algorithms%2Bfor%2BInterviews%2B%28scan%2Bocr%29%20%281%29.pdf >>>> >>> >>>> >>> have fun ! >>>> >>> >>>> >>> >>>> >>> On Tue, Mar 22, 2011 at 10:21 PM, Himanshu Neema < >>>> >>> potential.himansh...@gmail.com> wrote: >>>> >>> >>>> >>>> Enjoy :) >>>> >>>> >>>> >>>> >>>> >>>> On Tue, Mar 22, 2011 at 10:09 PM, Saravanan T >>>> >>>> wrote: >>>> >>>> >>>> >>>>> ++ >>>> >>>>> >>>> >>>>> >>>> >>>>> On Tue, Mar 22, 2011 at 9:51 PM, Anurag atri >>>> >>>>> wrote: >>>> >>>>> >>>> >>>>>> and me too :) >>>> >>>>>> >>>> >>>>>> >>>> >>>>>> On Tue, Mar 22, 2011 at 9:28 PM, Nikhil Mishra >>>> >>>>>> wrote: >>>> >>>>>> >>>> >>>>>>> count me too >>>> >>>>>>> >>>> >>>>>>> >>>> >>>>>>> On Tue, Mar 22, 2011 at 11:16 AM, kunal srivastav < >>>> >>>>>>> kunal.shrivas...@gmail.com> wrote: >>>> >>>>>>> >>>> >>>>>>>> plz send it to me too >>>> >>>>>>>> >>>> >>>>>>>> On Tue, Mar 22, 2011 at 11:14 AM, D.N.Vishwakarma@IITR < >>>> >>>>>>>> deok...@gmail.com> wrote: >>>> >>>>>>>> >>>> >>>>>>>>> -- >>>> >>>>>>>>> >>>> >>>>>>>>> *With Regards >>>> >>>>>>>>> Deoki Nandan Vishwakarma >>>> >>>>>>>>> IITR MCA >>>> >>>>>>>>> Mathematics Department >>>> >>>>
Re: [algogeeks] If any one have algorithms for interviews by adnan aziz ebook... Please mail ...
thanks!! On Wed, Mar 23, 2011 at 8:25 AM, Anand wrote: > Thanks!! > > > On Tue, Mar 22, 2011 at 7:11 PM, D.N.Vishwakarma@IITR > wrote: > >> thanx... >> >> On 3/22/11, Himanshu Neema wrote: >> > -- Forwarded message -- >> > From: Himanshu Neema >> > Date: Tue, Mar 22, 2011 at 11:13 PM >> > Subject: Re: [algogeeks] If any one have algorithms for interviews by >> adnan >> > aziz ebook... Please mail ... >> > To: Abhishek Goswami >> > >> > >> > Its a 15.4MB pdf so would take time to download if you have slow >> internet >> > connection , otherwise i checked the link its working. >> > >> > But I have also uploaded it on Google docs as Abhishek suggested here : >> > >> > >> https://docs.google.com/viewer?a=v&pid=explorer&chrome=true&srcid=0B--bA2TobuKZNGU5Njk5OTctZWEyYi00NWMwLTk0OGItMzhkMTI1ZTk0Mjg2&hl=en&authkey=CL_1msUI >> > >> > >> > On Tue, Mar 22, 2011 at 11:01 PM, Abhishek Goswami >> > wrote: >> > >> >> can you upload this file into google docs or attach this file. i tried >> to >> >> download this file but did not get any success for >> >> open this file >> >> Thanks >> >> Abhishek >> >> >> >> On Tue, Mar 22, 2011 at 10:41 PM, Himanshu Neema < >> >> potential.himansh...@gmail.com> wrote: >> >> >> >>> Turns out that I cant send file larger than 4 MB , please download it >> >>> from >> >>> here , let me know if you're still unable to download: >> >>> >> >>> >> >>> >> http://dl.dropbox.com/u/2681370/Algorithms%2Bfor%2BInterviews%2B%28scan%2Bocr%29%20%281%29.pdf >> >>> >> >>> have fun ! >> >>> >> >>> >> >>> On Tue, Mar 22, 2011 at 10:21 PM, Himanshu Neema < >> >>> potential.himansh...@gmail.com> wrote: >> >>> >> Enjoy :) >> >> >> On Tue, Mar 22, 2011 at 10:09 PM, Saravanan T >> wrote: >> >> > ++ >> > >> > >> > On Tue, Mar 22, 2011 at 9:51 PM, Anurag atri >> > wrote: >> > >> >> and me too :) >> >> >> >> >> >> On Tue, Mar 22, 2011 at 9:28 PM, Nikhil Mishra >> >> wrote: >> >> >> >>> count me too >> >>> >> >>> >> >>> On Tue, Mar 22, 2011 at 11:16 AM, kunal srivastav < >> >>> kunal.shrivas...@gmail.com> wrote: >> >>> >> plz send it to me too >> >> On Tue, Mar 22, 2011 at 11:14 AM, D.N.Vishwakarma@IITR < >> deok...@gmail.com> wrote: >> >> > -- >> > >> > *With Regards >> > Deoki Nandan Vishwakarma >> > IITR MCA >> > Mathematics Department >> > * >> > >> > -- >> > 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. >> > >> > >> >> >> -- >> thezeitgeistmovement.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. >> >> >>> >> >>> -- >> >>> 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 >> >> Anurag Atri >> >> >> >> -- >> >> 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 be
