Re: [algogeeks] Cracking the IT interview: jump start your career with confidence
++me On Mon, Apr 25, 2011 at 3:01 PM, snehal jain learner@gmail.com wrote: ++me On Mon, Apr 25, 2011 at 1:14 PM, hary rathor harry.rat...@gmail.comwrote: ++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. -- 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.
Re: [algogeeks] Can anyone tell group name of good english vocabulary
barrons or kaplan...google it On Mon, Apr 25, 2011 at 12:41 PM, D.N.Vishwakarma@IITR deok...@gmail.comwrote: * * -- **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.
Re: [algogeeks] [brain teaser ] 6april
toughest puzzle ever :P On Wed, Apr 6, 2011 at 1:27 PM, Akash Agrawal akash.agrawa...@gmail.comwrote: throw opposite to gravity... Regards, Akash Agrawal http://tech-queries.blogspot.com/ On Wed, Apr 6, 2011 at 1:26 PM, balaji a peshwa.bal...@gmail.com wrote: when u throw it above u. On Wed, Apr 6, 2011 at 1:16 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote: * The Ball Puzzle *How can you throw a ball as hard as you can and have it come back to you, even if it doesn't bounce off anything? There is nothing attached to it, and no one else catches or throws it back to you. Update Your Answers at : Click Herehttp://dailybrainteaser.blogspot.com/2011/04/6april.html?lavesh=lavesh Solution: Will be updated after 1 day -- Never explain yourself. Your friends don’t need it and your enemies won’t believe 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, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- A.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 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. -- 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.
Re: [algogeeks] [brain teaser ] 31march
1 2 3 On Thu, Mar 31, 2011 at 2:21 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote: *Find Numbers Problem * * *Find three whole, positive numbers that have the same answer when multiplied together as when added together. Update Your Answers at : Click Herehttp://dailybrainteaser.blogspot.com/2011/03/31march.html?lavesh=lavesh Solution: Will be updated after 1 day -- Never explain yourself. Your friends don’t need it and your enemies won’t believe 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, 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.
Re: [algogeeks] [brain teaser ] 29march
differences = 1, 3, 9, 27 so nxt diff = 81 thus 122 On Thu, Mar 31, 2011 at 2:18 PM, Vandana Bachani vandana@gmail.comwrote: T(5) = 41 + 3^4 = 122. On Thu, Mar 31, 2011 at 2:16 PM, Vandana Bachani vandana@gmail.comwrote: T(n) = T(n-1) + 3^(n-1), T(0) = 1 On Thu, Mar 31, 2011 at 11:20 AM, rahul rahulr...@gmail.com wrote: 1+1+0, 2+2+1, 5+5+4, 14+14+13, 41+41+40 On Tue, Mar 29, 2011 at 1:05 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote: *Series Problem Solution* 1, 2, 5, 14, 41, x Whats x ?? Update Your Answers at : Click Herehttp://dailybrainteaser.blogspot.com/2011/03/29march.html?lavesh=lavesh Solution: Will be updated after 1 day -- Never explain yourself. Your friends don’t need it and your enemies won’t believe 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, 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. -- 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.
Re: [algogeeks] [brain teaser ] 30march
grandfather, father and son went for fishing... here we have two fathers and two sons On Wed, Mar 30, 2011 at 1:52 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote: *Fishing Problem * * *Two fathers and two sons went for fishing. Each of them caught a fish, and none of them caught the same fish. However, they caught a total of only three fish. How is this possible? Update Your Answers at : Click Herehttp://dailybrainteaser.blogspot.com/2011/03/30march.html?lavesh=lavesh Solution: Will be updated after 1 day -- Never explain yourself. Your friends don’t need it and your enemies won’t believe 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, 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.
Re: [algogeeks] Re: C o/p gud one try
refer let us c by YK fr these type of ques
On Tue, Mar 29, 2011 at 10:07 PM, ArPiT BhAtNaGaR
arpitbhatnagarm...@gmail.com wrote:
please do answer geeks me waiting
On Mon, Mar 28, 2011 at 11:14 PM, ArPiT BhAtNaGaR
arpitbhatnagarm...@gmail.com wrote:
#includestdio.h
main()
{
long x;
float t;
scanf(%f,t);
printf(%d\n,t);
x=90;
printf(%f\n,x);
{
x=1;
printf(%f\n,x);
{
x=30;
printf(%f\n,x);
}
printf(%f\n,x);
}
x==9;
printf(%f\n,x);
}
o/p on gcc compiler
20.3 (i/p given)
-1073741824
20.299988
20.299988
20.299988
20.299988
20.299988
plz explain the o/p
--
Arpit Bhatnagar
(MNIT JAIPUR)
--
Arpit Bhatnagar
(MNIT JAIPUR)
--
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.
Re: [algogeeks] Re: Median of Binary Tree
median is defined for a sorted list of numbers.. i cannot understand how you can traverse in O(n) in a normal binary tree. @raunak plz explain the solution On Mon, Mar 28, 2011 at 4:16 PM, bittu shashank7andr...@gmail.com wrote: @all try to understand the question as usual we have to do it in min. time space complexity ..in mean Time O(n) space o(1) At-most just tell em after doing in-order traversal where u will store the elements either in array or in set isn'tit it will take O(n) extra space why not looks fro O(1) SPACE..IF M NOT CORRECT otherwise problem just become finding median in array which O(1) ..correct me if m wrong @Anurag wher u will store inorder of tree Thanks Shashank -- 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.
Re: [algogeeks] Ties The Rope With Minimum Cost ..Interesting For Geeks
if you tie all of them and the cost is sum of invidual lengths then in the end the cost will be sum of all lengths irrespective of any order that we tie them in.. i think the ques would req you to say that the cost is the longer of the two..plz check On Mon, Mar 28, 2011 at 12:11 PM, bittu shashank7andr...@gmail.com wrote: you are given n ropes,maybe of different length. the cost of tying two ropes is the sum of their lengths.Find a way to tie these ropes together so that the cost is minimum. Thanks Shashank -- 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.
Re: [algogeeks] Re: Ties The Rope With Minimum Cost ..Interesting For Geeks
ok raunak i get what you are trying to say On Mon, Mar 28, 2011 at 11:03 PM, Dave dave_and_da...@juno.com wrote: @Raunak. Actually, I didn't add up the individual costs to give the total cost. It is 7 + 11 + 18 = 36. Dave On Mar 28, 12:00 pm, Raunak Agrawal raunak.ra...@gmail.com wrote: @Dave: Dude...u didn't count the cost for tying the two ropes i.e. (3 and 4) together with (5 and 6). On Mon, Mar 28, 2011 at 9:19 PM, Dave dave_and_da...@juno.com wrote: @Bittu. The ungreedy algorithm works. Repeatedly tie the two shortest ropes. E.g., suppose the ropes are 3, 4, 5, and 6 units long. Then tie 3 and 4, giving 7. Now 5 and 6 are the two shortest, so tie them, giving 11. Finally, 7 + 11 = 18. Dave On Mar 28, 1:41 am, bittu shashank7andr...@gmail.com wrote: you are given n ropes,maybe of different length. the cost of tying two ropes is the sum of their lengths.Find a way to tie these ropes together so that the cost is minimum. Thanks Shashank -- 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.- Hide quoted text - - Show quoted text - -- 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.
Re: [algogeeks] Re: Coding Round
Also please do provide some test cases to comprehend this problem better On Sun, Mar 27, 2011 at 10:34 PM, Raunak Agrawal raunak.ra...@gmail.comwrote: Hi Ankit, Please correct me if I am wrong: 1. There is no need of recursion and also I cant see any base conditionso this is basically a iterative problem. 2. Suppose the element is at last index of array...so the worst case order would be of O(n) 3. *|n-a[0]| size: I am not able to get the logic...I mean is there any relation between n and size?* On Sun, Mar 27, 2011 at 10:24 PM, ankit sambyal ankitsamb...@gmail.comwrote: For the following question : There is an array and the distance between any two consequent elements is one(+1 or -1) and given a number. You have to check whether the number is in array or not with minimum complexity. Assuming the array may not be sorted, the following algo can be used: Let a[] be the array of size size and n be the element to be searched. 1. If a[0]==n return yes else if( |n-a[0]| size) return no else call this function recursively with pointer to array pointing to the next element. Any problems with this solution, Plz let me know On Wed, Mar 23, 2011 at 9:07 PM, balaji a peshwa.bal...@gmail.comwrote: First I had a paper pen coding round. The questions were: 1) There are two sorted linked lists. Write a code to return the merged linked list which is also sorted. No additional nodes must be used. 2) Design a DS that would do Push(),Pop(), and GetMax() elements at complexity O(1) 3) Do a BFS in given binary tree do find whether the given element in the tree or not. I got shortlisted and I attended three interview rounds. Round 1: It was a kind of debugging round. The questions were: 1) Consider you are given a mobile alarm application how will u test it 2) Consider ur gmail chat box is not working for a particular person alone, wht will u do to find the problem 3) I was given a program (without the code - black box testing) and asked to write the test cases for it 4) A program was given and asked to debug - was simple only Round 2: It was an algorithm designing round. 1) Consider there is an array with duplicates and u r given two numbers as input and u have to return the minimum distance between the two in the array with minimum complexity. 2) For a normal Binary tree write the code for inorder traversal without recursion 3) Given an array and an number find all the pairs in the array that would add up to the given number. This also with minimum complexity. Round 3: It was also coding round 1) There is an array and the distance between any two consequent elements is one(+1 or -1) and given a number. You have to check whether the number is in array or not with minimum complexity. On Thu, Mar 24, 2011 at 12:11 AM, Akash Mukherjee akash...@gmail.comwrote: kul man...wud appreciate if u cud post your question On Wed, Mar 23, 2011 at 11:28 PM, balaji a peshwa.bal...@gmail.comwrote: hi i got till the third round of technical interview out of the four rounds and got eliminated in third round.anyways thnx for ur support dude :-) On Tue, Mar 22, 2011 at 12:51 PM, balaji a peshwa.bal...@gmail.comwrote: Thnx :-) I am from SSN College of Engineering,Chennai On Tue, Mar 22, 2011 at 12:28 PM, Akash Mukherjee akash...@gmail.com wrote: u r welcome :), nd all the best for ur test.btw, which clg?? On Tue, Mar 22, 2011 at 11:45 AM, guru peshwa.bal...@gmail.comwrote: Thank you very much for the info friendAnd sure will give u a treat :-) On Mar 22, 11:02 am, Akash Mukherjee akash...@gmail.com wrote: hey, dis is what i was told by a friend working @ amazon - Sometimes they do go to the level of the subject basics like OS or DS but you should be able to tackle these if you had studied well. No separate prep is needed. Few Favs DS Algos ( i should get treat for revealing this.;)... ) 1) All Trees (Binary for sure) 2) Graphs 3) Sorting Algos 4) Heaps Let us C ... though clichéd gives a good insight. If you can find time. can u tell a bit more about your profile?? fresher?? On Tue, Mar 22, 2011 at 11:20 AM, guru peshwa.bal...@gmail.com wrote: Hi geeks, tomorrow i am having Amazon.com's Coding round followed by Interview...pls suggest some tips to help me out... -- 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
Re: [algogeeks] Re: Coding Round
maintain a pointer to the max element so far in every element of the stack.. while push - if the new element is greater than the stack-top-max then add the new element at the top and hence make the max pointer of the new element point to itself, otherwise the new element is less than the max till yet and hence point the max part of the new element to the max part of the element at the top thus at each point the max pointer of the top most element points to the current max of the stack pop - usual, no need to do anything :) see if you are able to follow this logic. getmax() is O(1) because you just need to deference the max part of the top most element at any time On Sat, Mar 26, 2011 at 3:43 PM, balaji a peshwa.bal...@gmail.com wrote: yeah it wont remove the element...GetMax() only returns the maximum element added so far.. On Thu, Mar 24, 2011 at 9:42 AM, MK stardust...@gmail.com wrote: Actually, you probably mean that GetMax() does not remove it from the DS? Sorry for the hasty conclusion. On Thu, Mar 24, 2011 at 12:11 AM, MK stardust...@gmail.com wrote: 2) Design a DS that would do Push(),Pop(), and GetMax() elements at complexity O(1) Are you sure you remember this correctly? This would give you a way of sorting in O(1). Thanks.. On Thu, Mar 24, 2011 at 12:09 AM, balaji a peshwa.bal...@gmail.com wrote: The main thing they are testing is Problem Solving and the Algorithm Designing ability. Coding Ability is only next. If you have good knowledge in Data Structures and good Problem Solving skills with coding ability you can easily crack through the interview. This is what i infered from my experience. On Thu, Mar 24, 2011 at 12:33 AM, kunal srivastav kunal.shrivas...@gmail.com wrote: hi people, could someone tell me in detail what all things to prepare for amazon including the resources to consult for the same?? it would be really helpful On Thu, Mar 24, 2011 at 12:11 AM, Akash Mukherjee akash...@gmail.com wrote: kul man...wud appreciate if u cud post your question On Wed, Mar 23, 2011 at 11:28 PM, balaji a peshwa.bal...@gmail.com wrote: hi i got till the third round of technical interview out of the four rounds and got eliminated in third round.anyways thnx for ur support dude :-) On Tue, Mar 22, 2011 at 12:51 PM, balaji a peshwa.bal...@gmail.com wrote: Thnx :-) I am from SSN College of Engineering,Chennai l On Tue, Mar 22, 2011 at 12:28 PM, Akash Mukherjee akash...@gmail.com wrote: u r welcome :), nd all the best for ur test.btw, which clg?? On Tue, Mar 22, 2011 at 11:45 AM, guru peshwa.bal...@gmail.com wrote: Thank you very much for the info friendAnd sure will give u a treat :-) On Mar 22, 11:02 am, Akash Mukherjee akash...@gmail.com wrote: hey, dis is what i was told by a friend working @ amazon - Sometimes they do go to the level of the subject basics like OS or DS but you should be able to tackle these if you had studied well. No separate prep is needed. Few Favs DS Algos ( i should get treat for revealing this.;)... ) 1) All Trees (Binary for sure) 2) Graphs 3) Sorting Algos 4) Heaps Let us C ... though clichéd gives a good insight. If you can find time. can u tell a bit more about your profile?? fresher?? On Tue, Mar 22, 2011 at 11:20 AM, guru peshwa.bal...@gmail.com wrote: Hi geeks, tomorrow i am having Amazon.com's Coding round followed by Interview...pls suggest some tips to help me out... -- 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. -- A.Balaji -- A.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
Re: [algogeeks] Re: 23march
yes correct...2519 is the answer On Wed, Mar 23, 2011 at 7:08 PM, Dave dave_and_da...@juno.com wrote: It is LCM(2,3,4,5,6,7,8,9,10) - 1 = 2^3 * 3^2 * 5 * 7 - 1 = 2519. LCM = least common multiple. Dave On Mar 23, 2:41 am, Lavesh Rawat lavesh.ra...@gmail.com wrote: *A Remainder is chasing me Problem Solution* * *I just found a number with an interesting property: When I divide it by 2, the remainder is 1. When I divide it by 3, the remainder is 2. When I divide it by 4, the remainder is 3. When I divide it by 5, the remainder is 4. When I divide it by 6, the remainder is 5. When I divide it by 7, the remainder is 6. When I divide it by 8, the remainder is 7. When I divide it by 9, the remainder is 8. When I divide it by 10, the remainder is 9. It's not a small number, but it's not really big, either. When I looked for a smaller number with this property I couldn't find one. Can you find it? Update Your Answers at : Click Here http://dailybrainteaser.blogspot.com/2011/03/23march.html?lavesh=lavesh Solution: Will be updated after 1 day -- Never explain yourself. Your friends don’t need it and your enemies won’t believe 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, 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.
Re: [algogeeks] If any one have algorithms for interviews by adnan aziz ebook... Please mail ...
plz send it to me too On Tue, Mar 22, 2011 at 11:14 AM, D.N.Vishwakarma@IITR deok...@gmail.comwrote: -- *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.
Re: [algogeeks] Re: random number generator
call function and save each of the results in x and y(say)
if x = 0 and y = 1 ...prob = (.6)*(.4) return 0
if x = 1 and y = 0 ...prob = (.4)*(.6) return 1
otherwise, repeat..
hence this new function will return 0 and 1 with 50% prob.
On Tue, Mar 22, 2011 at 11:07 PM, Don dondod...@gmail.com wrote:
Which is why stating the requirements precisely is important.
If modeling a coin toss is the goal, this should work.
bool uniform()
{
static unsigned int x = 1234567;
x = 63663*(x65535)+(x16);
return ((x64)==0) ^ nonUniform();
}
On Mar 17, 3:29 pm, Dave dave_and_da...@juno.com wrote:
@Don: Clever and efficient code to meet the problem statement
precisely. It does give true on half of the calls, but it doesn't give
true with probability 50% on any given call, so we wouldn't want to
use it to model a fair coin.
Dave
On Mar 17, 1:03 pm, Don dondod...@gmail.com wrote:
bool uniform()
{
static bool state = true;
state = !state;
return state ^ nonuniform();
}
On Mar 17, 9:24 am, saurabh agrawal saurabh...@gmail.com wrote:
Given a function which returns true 60% time and false 40% time.
Using this function you have to write a function which returns true
50% of
the time.- Hide quoted text -
- Show quoted text -
--
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.
Re: [algogeeks] [brain teaser ] 21march
2 typists On Mon, Mar 21, 2011 at 2:22 PM, rohit agarwal agarwal.rohi...@gmail.comwrote: 2 minutes -- * Thanks and Regards* ┌─┐ │ Rohit Agarwal │ Undergraduate (Third Year) │ B.Tech (Information Technology) │ NIT Durgapur http://www.nitdgp.ac.in │ Blog: http://www.irelaxa.com/rohit └─┘ -- 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.
Re: [algogeeks] Re: Look and say sequence
no .. you see from l to r one 1, one 2 and two 1. now replace one and two with 1 and 2 respec. :) so its 111221 On Sun, Mar 20, 2011 at 1:36 AM, cegprakash cegprak...@gmail.com wrote: so the fifth number should be 1231 na?? one 2 and three 1's in 1211 y not? -- 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.
Re: [algogeeks] Re: Print Hello
n...c does not support classes
On Thu, Mar 17, 2011 at 6:10 PM, himanshu kansal
himanshukansal...@gmail.com wrote:
is this possible in c also
On Wed, Mar 16, 2011 at 11:57 PM, Manikanta manikantabab...@gmail.comwrote:
Thats right in C++. How about in C.
On Mar 16, 9:44 pm, kumar anurag anurag.it.jo...@gmail.com wrote:
@anurag good.
On Wed, Mar 16, 2011 at 9:28 PM, Anurag atri anu.anurag@gmail.com
wrote:
#includeiostream
using namespace std ;
class a
{
public :
a() { couthello;}
}a1;
int main()
{
}
On Wed, Mar 16, 2011 at 8:25 PM, himanshu kansal
himanshukansal...@gmail.com wrote:
How can u print hello in a c/c++ program without writing a single
word in main() function
--
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.
--
Kumar Anurag- Hide quoted text -
- Show quoted text -
--
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.
--
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.
