[algogeeks] coin problem
You are blindfolded and 20 coins are placed on the table in front of you. Out of them 10 coins have heads facing up and other tails. You are allowed to flip and move the coins. You should divide those coins into two sets such that one set contains 10 heads and other tails. You are allowed to only move or flip the coins -- 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/-/5On_Zr16xMIJ. 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: Directi Written Q 2012
wat abt 32 On Mon, Jul 30, 2012 at 4:02 PM, Lucifer sourabhd2...@gmail.com wrote: @ ruru I think we can do it in log(n).. I am not jolting down the code but giving out the idea that would lead to log(n) time.. If we write down all the nos. in the binary format one below the other.. we will observe the following pattern :- at bit index '1' the bit value toggles in group of '01' at bit index '2' the bit value toggles in group of '0011' ans so on.. Hence using basic divisibility property we can calculate the no. of one's at every it index 'i' where 'i' ranges from 1 to log(N).. On 30 July, 15:25, Zyro vivkum...@gmail.com wrote: int func(int start,int end) { int count=0; for(int i=start;i=end;i++) { int tmp=i; while(tmp!=0) { tmp=tmp(tmp-1); count++; } } return count; } Worst Case complexity : O((b-a)*32) Please let me know if there is another gud way to do it.. :) On Tuesday, 24 July 2012 15:09:42 UTC+5:30, ruru wrote: find no. of 1's in binary format of numbers from 1 to 100. like for 1 to 10 answer is 17 On Tuesday, 24 July 2012 15:09:42 UTC+5:30, ruru wrote: find no. of 1's in binary format of numbers from 1 to 100. like for 1 to 10 answer is 17 -- 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: Directi Written Q 2012
sory fr prev wrng cmnt On Mon, Jul 30, 2012 at 4:04 PM, SHOBHIT GUPTA shobhitgupta1...@gmail.comwrote: wat abt 32 On Mon, Jul 30, 2012 at 4:02 PM, Lucifer sourabhd2...@gmail.com wrote: @ ruru I think we can do it in log(n).. I am not jolting down the code but giving out the idea that would lead to log(n) time.. If we write down all the nos. in the binary format one below the other.. we will observe the following pattern :- at bit index '1' the bit value toggles in group of '01' at bit index '2' the bit value toggles in group of '0011' ans so on.. Hence using basic divisibility property we can calculate the no. of one's at every it index 'i' where 'i' ranges from 1 to log(N).. On 30 July, 15:25, Zyro vivkum...@gmail.com wrote: int func(int start,int end) { int count=0; for(int i=start;i=end;i++) { int tmp=i; while(tmp!=0) { tmp=tmp(tmp-1); count++; } } return count; } Worst Case complexity : O((b-a)*32) Please let me know if there is another gud way to do it.. :) On Tuesday, 24 July 2012 15:09:42 UTC+5:30, ruru wrote: find no. of 1's in binary format of numbers from 1 to 100. like for 1 to 10 answer is 17 On Tuesday, 24 July 2012 15:09:42 UTC+5:30, ruru wrote: find no. of 1's in binary format of numbers from 1 to 100. like for 1 to 10 answer is 17 -- 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] Binomial Coefficients
BigInteger Class in Java On 30 July 2012 21:14, Kishore kkishoreya...@gmail.com wrote: Python has no int limits On Mon, Jul 30, 2012 at 11:27 AM, shiva@Algo shiv.jays...@gmail.comwrote: Hey Guys, how to solve this problem where the input size is 500 digit Integer?? https://www.interviewstreet.com/challenges/dashboard/#problem/4fe19c4f35a0e -- 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. -- aviNash -- 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] Microsoft online questions
Analytical questions were from logical reasoning, syllogism, piechart, etc. Technical questions were like - they'll give a flow chart (eg:http://en.wikipedia.org/wiki/File:FlowchartExample.png) or C program and ask to trace the output. no data structures and all. On Sun, Jul 29, 2012 at 10:16 PM, Tanuj Makkar tanujmakkar.de...@gmail.com wrote: hi can u please elaborate on analytical questions.like if they were from logical reasoning,verbal(syllogism) and in technical...were questions based on output of c programs...or there were data structures nd other topics plz help...it will be a great help ... . Thanx On Sun, Jul 29, 2012 at 9:58 PM, Purani Sekar nagapur...@gmail.com wrote: Hi, They conducted 2 online rounds. First round was of 1 hour duration. It tests your speed and analytical skills. The mark split was as given below: 30 analytical questions - data interpretation type 20 technical questiions - flow chart and basic c Second round was online coding round. But compiler will not be provided. It will be like typing a code in notepad. On Sun, Jul 29, 2012 at 4:56 PM, Sanchit Mittal since1991sanc...@gmail.com wrote: Hi, Can anybody help by sharing MS online test pattern and questions ? I have heard they have also included aptitude questions this time, is that right? Thanks -- Sanchit Mittal Fourth Year Undergraduate Computer Engineering Delhi College of Engineering ph- +919582414494 -- 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] Binomial Coefficients
may be Lucas theorem will be helpful...google 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.
Re: [algogeeks] Binomial Coefficients
pankaj is correct ! my code has been accepted .. I used python . On Mon, Jul 30, 2012 at 2:02 PM, pankajsingh psingh...@gmail.com wrote: may be Lucas theorem will be helpful...google 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.
Re: [algogeeks] Re: Microsoft online questions : DLL to bst??
how would you do convert sorted doubly linked list to bst using same nodes as in DLL Best Regards Ashish Goel Think positive and find fuel in failure +919985813081 +919966006652 On Sun, Jul 29, 2012 at 10:30 PM, Purani Sekar nagapur...@gmail.com wrote: convert sorted doubly linked list to bst using same nodes as in DLL -- 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: coin problem
@Navin: Divide the coins into two groups of 10, and then flip all of the coins in one of the groups. Suppose group A has x heads and 10 - x tails. Then before you flip them, group B has 10 - x heads and x tails. After you flip them, group B has x heads and 10 - x tails. Dave On Tuesday, July 31, 2012 2:03:09 AM UTC-5, Navin Kumar wrote: You are blindfolded and 20 coins are placed on the table in front of you. Out of them 10 coins have heads facing up and other tails. You are allowed to flip and move the coins. You should divide those coins into two sets such that one set contains 10 heads and other tails. You are allowed to only move or flip the coins -- 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/-/5D_9gPnjvZ0J. 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] directi paper pattern
can anyone tell me the pattern (selection procedure )followed by directi this year -- 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/-/uaKshpROlGoJ. 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] directi paper pattern
On Tue, Jul 31, 2012 at 7:37 PM, deepikaanand swinyanand...@gmail.comwrote: can anyone tell me the pattern (selection procedure )followed by directi this year -- 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/-/uaKshpROlGoJ. 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. i have mailed u recently asked question by direct i in nit allahabad..make a view on 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.
Re: [algogeeks] directi paper pattern
please mail me as well.. really it woulb be of great help On Tue, Jul 31, 2012 at 9:42 PM, md shaukat ali ali.mdshau...@gmail.comwrote: On Tue, Jul 31, 2012 at 7:37 PM, deepikaanand swinyanand...@gmail.comwrote: can anyone tell me the pattern (selection procedure )followed by directi this year -- 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/-/uaKshpROlGoJ. 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. i have mailed u recently asked question by direct i in nit allahabad..make a view on 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. -- Akhilesh NSIT-COE -- 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] Microsoft online questions
Q1 ) rotate image by 90 degree Q2 ) sort a list with 0,1,2, values by pointer manipulation Q3) 2 values in bst swapped correct the bst On Tue, Jul 31, 2012 at 12:30 AM, Purani Sekar nagapur...@gmail.com wrote: Analytical questions were from logical reasoning, syllogism, piechart, etc. Technical questions were like - they'll give a flow chart (eg:http://en.wikipedia.org/wiki/File:FlowchartExample.png) or C program and ask to trace the output. no data structures and all. On Sun, Jul 29, 2012 at 10:16 PM, Tanuj Makkar tanujmakkar.de...@gmail.com wrote: hi can u please elaborate on analytical questions.like if they were from logical reasoning,verbal(syllogism) and in technical...were questions based on output of c programs...or there were data structures nd other topics plz help...it will be a great help ... . Thanx On Sun, Jul 29, 2012 at 9:58 PM, Purani Sekar nagapur...@gmail.com wrote: Hi, They conducted 2 online rounds. First round was of 1 hour duration. It tests your speed and analytical skills. The mark split was as given below: 30 analytical questions - data interpretation type 20 technical questiions - flow chart and basic c Second round was online coding round. But compiler will not be provided. It will be like typing a code in notepad. On Sun, Jul 29, 2012 at 4:56 PM, Sanchit Mittal since1991sanc...@gmail.com wrote: Hi, Can anybody help by sharing MS online test pattern and questions ? I have heard they have also included aptitude questions this time, is that right? Thanks -- Sanchit Mittal Fourth Year Undergraduate Computer Engineering Delhi College of Engineering ph- +919582414494 -- 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.
[algogeeks] Re: absolute minimum difference
@jatin: creating BST from *unsorted *array will take O(nlogn) timeso how it can be solved in O(n)?? -- 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/-/NEsBS0oK_DkJ. 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] coin problem
You just split the 20 coins into two groups such that each one contains 10 coins. Now you have to flip any one group of coins so that you will get same no. of heads and tails in each group. For example,consider the 1st group contains 7 heads and 3 tails so obviously the 2nd one contains 7 tails and 3 heads. if you flip the 2nd group coins means you will get 7 heads and 3 tails so each group contains same no. of heads and tails. -- 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 online questions : DLL to bst??
check on geeksforgeeks.org On Tue, Jul 31, 2012 at 3:09 PM, Ashish Goel ashg...@gmail.com wrote: how would you do convert sorted doubly linked list to bst using same nodes as in DLL Best Regards Ashish Goel Think positive and find fuel in failure +919985813081 +919966006652 On Sun, Jul 29, 2012 at 10:30 PM, Purani Sekar nagapur...@gmail.comwrote: convert sorted doubly linked list to bst using same nodes as in DLL -- 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] directi paper pattern
Please mail me too thaks in advance / On 31 July 2012 21:42, md shaukat ali ali.mdshau...@gmail.com wrote: On Tue, Jul 31, 2012 at 7:37 PM, deepikaanand swinyanand...@gmail.comwrote: can anyone tell me the pattern (selection procedure )followed by directi this year -- 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/-/uaKshpROlGoJ. 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. i have mailed u recently asked question by direct i in nit allahabad..make a view on 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. -- With Regard's Avinash -- 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] Sort 7 numbers of 4 digits each
Hi, We need to sort 7 numbers each of 4 digits. What is the number of comparisons in worst case . Options are as follows: 1) 40 2) 38 3) 47 4) 280 Please also explain why so? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: coin problem
@Dave can u please tell how your solution is going to divide it into two group of 10..one having 10 heads up and another 10 tails up... @Navin am i getting your question correctly..?? -- 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] directi paper pattern
these were written questions ? On Tue, Jul 31, 2012 at 9:42 PM, md shaukat ali ali.mdshau...@gmail.comwrote: On Tue, Jul 31, 2012 at 7:37 PM, deepikaanand swinyanand...@gmail.comwrote: can anyone tell me the pattern (selection procedure )followed by directi this year -- 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/-/uaKshpROlGoJ. 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. i have mailed u recently asked question by direct i in nit allahabad..make a view on 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. -- Akhilesh NSIT-COE -- 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 online questions : DLL to bst??
1. get the middle of the linked list and make it root 2. same for left half and right half recursivly a. get the middle of left half and make it left child. b. get middle of rite half and make it rite child. this is must b he logic for the qstn. :) Thank You, Ishan Sood. 9805660301 On Tue, Jul 31, 2012 at 3:09 PM, Ashish Goel ashg...@gmail.com wrote: how would you do convert sorted doubly linked list to bst using same nodes as in DLL Best Regards Ashish Goel Think positive and find fuel in failure +919985813081 +919966006652 On Sun, Jul 29, 2012 at 10:30 PM, Purani Sekar nagapur...@gmail.comwrote: convert sorted doubly linked list to bst using same nodes as in DLL -- 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] Microsoft online questions
Anyone with a logic/algo/code for the 3. convert sorted doubly linked list to bst using same nodes as in DLL. . Would it be recursive ? On Tue, Jul 31, 2012 at 12:30 AM, Purani Sekar nagapur...@gmail.com wrote: Analytical questions were from logical reasoning, syllogism, piechart, etc. Technical questions were like - they'll give a flow chart (eg:http://en.wikipedia.org/wiki/File:FlowchartExample.png) or C program and ask to trace the output. no data structures and all. On Sun, Jul 29, 2012 at 10:16 PM, Tanuj Makkar tanujmakkar.de...@gmail.com wrote: hi can u please elaborate on analytical questions.like if they were from logical reasoning,verbal(syllogism) and in technical...were questions based on output of c programs...or there were data structures nd other topics plz help...it will be a great help ... . Thanx On Sun, Jul 29, 2012 at 9:58 PM, Purani Sekar nagapur...@gmail.com wrote: Hi, They conducted 2 online rounds. First round was of 1 hour duration. It tests your speed and analytical skills. The mark split was as given below: 30 analytical questions - data interpretation type 20 technical questiions - flow chart and basic c Second round was online coding round. But compiler will not be provided. It will be like typing a code in notepad. On Sun, Jul 29, 2012 at 4:56 PM, Sanchit Mittal since1991sanc...@gmail.com wrote: Hi, Can anybody help by sharing MS online test pattern and questions ? I have heard they have also included aptitude questions this time, is that right? Thanks -- Sanchit Mittal Fourth Year Undergraduate Computer Engineering Delhi College of Engineering ph- +919582414494 -- 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. -- - - - - - - - - - - - - With Regards Daksh Talwar -- 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] directi paper pattern
Please forward the mail to me as well. Thanks -- Mudit Sadana Undergraduate Student,Computer Science NSIT, Delhi University,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.
Re: [algogeeks] directi paper pattern
Hey, can you please mail me too? -Thanks Nilanjan Basu On Tuesday, July 31, 2012 9:49:15 PM UTC+5:30, MUDIT wrote: Please forward the mail to me as well. Thanks -- Mudit Sadana Undergraduate Student,Computer Science NSIT, Delhi University,India -- 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/-/2YdFa0ZwOIsJ. 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] directi paper pattern
I need also... -- Sent from my Android phone with K-9 Mail. Please excuse my brevity. Akhilesh Vedhera akhileshn...@gmail.com wrote: please mail me as well.. really it woulb be of great help On Tue, Jul 31, 2012 at 9:42 PM, md shaukat ali ali.mdshau...@gmail.com wrote: On Tue, Jul 31, 2012 at 7:37 PM, deepikaanand swinyanand...@gmail.com wrote: can anyone tell me the pattern (selection procedure )followed by directi this year -- 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/-/uaKshpROlGoJ. 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. i have mailed u recently asked question by direct i in nit allahabad..make a view on 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. -- Akhilesh NSIT-COE -- 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] directi paper pattern
hey please mail me too...please give a pastebin link On 31 July 2012 21:51, neelpulse(Jadavpur University) neelpu...@gmail.comwrote: Hey, can you please mail me too? -Thanks Nilanjan Basu On Tuesday, July 31, 2012 9:49:15 PM UTC+5:30, MUDIT wrote: Please forward the mail to me as well. Thanks -- Mudit Sadana Undergraduate Student,Computer Science NSIT, Delhi University,India -- 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/-/2YdFa0ZwOIsJ. 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. -- With regard's Avinash -- 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] Microsoft online questions
@Daksh: total number of BST possible with n nodes will be : catalan number we can build balanced BST by each time selecting middle element as a root node and its left pointer will point to left linked list and right pointer will point to right linked list. Do it recursively for left list and right list. struct node *buildBST(struct node *list) { if(!list) return NULL; struct node *middle = getMiddle(list); middle-previous-next = NULL; middle-previous = buildBST(list); middle-next = buildBST(middle-next); return middle; } On Tue, Jul 31, 2012 at 8:35 PM, Daksh Talwar dakshtal...@gmail.com wrote: Anyone with a logic/algo/code for the 3. convert sorted doubly linked list to bst using same nodes as in DLL. . Would it be recursive ? On Tue, Jul 31, 2012 at 12:30 AM, Purani Sekar nagapur...@gmail.comwrote: Analytical questions were from logical reasoning, syllogism, piechart, etc. Technical questions were like - they'll give a flow chart (eg:http://en.wikipedia.org/wiki/File:FlowchartExample.png) or C program and ask to trace the output. no data structures and all. On Sun, Jul 29, 2012 at 10:16 PM, Tanuj Makkar tanujmakkar.de...@gmail.com wrote: hi can u please elaborate on analytical questions.like if they were from logical reasoning,verbal(syllogism) and in technical...were questions based on output of c programs...or there were data structures nd other topics plz help...it will be a great help ... . Thanx On Sun, Jul 29, 2012 at 9:58 PM, Purani Sekar nagapur...@gmail.com wrote: Hi, They conducted 2 online rounds. First round was of 1 hour duration. It tests your speed and analytical skills. The mark split was as given below: 30 analytical questions - data interpretation type 20 technical questiions - flow chart and basic c Second round was online coding round. But compiler will not be provided. It will be like typing a code in notepad. On Sun, Jul 29, 2012 at 4:56 PM, Sanchit Mittal since1991sanc...@gmail.com wrote: Hi, Can anybody help by sharing MS online test pattern and questions ? I have heard they have also included aptitude questions this time, is that right? Thanks -- Sanchit Mittal Fourth Year Undergraduate Computer Engineering Delhi College of Engineering ph- +919582414494 -- 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. -- - - - - - - - - - - - - With Regards Daksh Talwar -- 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] directi paper pattern
hey they repeat their paper alot,i.e they asked the same paper last year in our institute for the intern!! so best of luck On Tue, Jul 31, 2012 at 9:52 PM, Avinash Mishra mishra.avinas...@gmail.comwrote: hey please mail me too...please give a pastebin link On 31 July 2012 21:51, neelpulse(Jadavpur University) neelpu...@gmail.com wrote: Hey, can you please mail me too? -Thanks Nilanjan Basu On Tuesday, July 31, 2012 9:49:15 PM UTC+5:30, MUDIT wrote: Please forward the mail to me as well. Thanks -- Mudit Sadana Undergraduate Student,Computer Science NSIT, Delhi University,India -- 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/-/2YdFa0ZwOIsJ. 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. -- With regard's Avinash -- 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. -- With regards, Manish kumar untwal Indian Institute of Information Technology Allahabad (2009-2013 batch) -- 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] directi paper pattern
hey friends they repeat there paper a lot!! that is they asked the same question for the interns too last year. It was too difficult. On Tue, Jul 31, 2012 at 9:52 PM, Avinash Mishra mishra.avinas...@gmail.comwrote: hey please mail me too...please give a pastebin link On 31 July 2012 21:51, neelpulse(Jadavpur University) neelpu...@gmail.com wrote: Hey, can you please mail me too? -Thanks Nilanjan Basu On Tuesday, July 31, 2012 9:49:15 PM UTC+5:30, MUDIT wrote: Please forward the mail to me as well. Thanks -- Mudit Sadana Undergraduate Student,Computer Science NSIT, Delhi University,India -- 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/-/2YdFa0ZwOIsJ. 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. -- With regard's Avinash -- 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. -- With regards, Manish kumar untwal Indian Institute of Information Technology Allahabad (2009-2013 batch) -- 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: coin problem
@all: i have seen this question on careercup.com. I think question should be like this: Divide 20 coins in group of two such that both group must have equal number of heads and tails. solution given by dave sir solve this question. If this is not the case, i.e. if we will try to divide into two groups such that one group contain 10 heads and other group contains 10 tail ..i think it is not possible blindfolded. Because in that case we must have to identify (blindfolded) which coin is head and which is tail. On Tue, Jul 31, 2012 at 9:51 PM, Vipin Kumar vipink1ber...@gmail.comwrote: I think we are blindfolded.. how can we know afetr dividing 10 coins that 7 r heads.. or 'x' are heads and we need to flip it over.. ? On Tuesday, 31 July 2012 12:33:09 UTC+5:30, Navin Kumar wrote: You are blindfolded and 20 coins are placed on the table in front of you. Out of them 10 coins have heads facing up and other tails. You are allowed to flip and move the coins. You should divide those coins into two sets such that one set contains 10 heads and other tails. You are allowed to only move or flip the coins -- 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/-/bVriGdkAmMUJ. 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] Microsoft online questions
hey friends, just wanted to ask like what they ask in quants and DI On Tue, Jul 31, 2012 at 10:45 PM, Navin Kumar algorithm.i...@gmail.comwrote: @Daksh: total number of BST possible with n nodes will be : catalan number we can build balanced BST by each time selecting middle element as a root node and its left pointer will point to left linked list and right pointer will point to right linked list. Do it recursively for left list and right list. struct node *buildBST(struct node *list) { if(!list) return NULL; struct node *middle = getMiddle(list); middle-previous-next = NULL; middle-previous = buildBST(list); middle-next = buildBST(middle-next); return middle; } On Tue, Jul 31, 2012 at 8:35 PM, Daksh Talwar dakshtal...@gmail.comwrote: Anyone with a logic/algo/code for the 3. convert sorted doubly linked list to bst using same nodes as in DLL. . Would it be recursive ? On Tue, Jul 31, 2012 at 12:30 AM, Purani Sekar nagapur...@gmail.comwrote: Analytical questions were from logical reasoning, syllogism, piechart, etc. Technical questions were like - they'll give a flow chart (eg:http://en.wikipedia.org/wiki/File:FlowchartExample.png) or C program and ask to trace the output. no data structures and all. On Sun, Jul 29, 2012 at 10:16 PM, Tanuj Makkar tanujmakkar.de...@gmail.com wrote: hi can u please elaborate on analytical questions.like if they were from logical reasoning,verbal(syllogism) and in technical...were questions based on output of c programs...or there were data structures nd other topics plz help...it will be a great help ... . Thanx On Sun, Jul 29, 2012 at 9:58 PM, Purani Sekar nagapur...@gmail.com wrote: Hi, They conducted 2 online rounds. First round was of 1 hour duration. It tests your speed and analytical skills. The mark split was as given below: 30 analytical questions - data interpretation type 20 technical questiions - flow chart and basic c Second round was online coding round. But compiler will not be provided. It will be like typing a code in notepad. On Sun, Jul 29, 2012 at 4:56 PM, Sanchit Mittal since1991sanc...@gmail.com wrote: Hi, Can anybody help by sharing MS online test pattern and questions ? I have heard they have also included aptitude questions this time, is that right? Thanks -- Sanchit Mittal Fourth Year Undergraduate Computer Engineering Delhi College of Engineering ph- +919582414494 -- 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. -- - - - - - - - - - - - - With Regards Daksh Talwar -- 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. -- With regards, Manish kumar untwal Indian Institute of Information Technology Allahabad (2009-2013 batch) -- 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] directi paper pattern
Can you tell some of questions asked? **~Sathish Babu~** On Tue, Jul 31, 2012 at 10:53 PM, manish untwal manishuntw...@gmail.comwrote: hey they repeat their paper alot,i.e they asked the same paper last year in our institute for the intern!! so best of luck On Tue, Jul 31, 2012 at 9:52 PM, Avinash Mishra mishra.avinas...@gmail.com wrote: hey please mail me too...please give a pastebin link On 31 July 2012 21:51, neelpulse(Jadavpur University) neelpu...@gmail.com wrote: Hey, can you please mail me too? -Thanks Nilanjan Basu On Tuesday, July 31, 2012 9:49:15 PM UTC+5:30, MUDIT wrote: Please forward the mail to me as well. Thanks -- Mudit Sadana Undergraduate Student,Computer Science NSIT, Delhi University,India -- 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/-/2YdFa0ZwOIsJ. 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. -- With regard's Avinash -- 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. -- With regards, Manish kumar untwal Indian Institute of Information Technology Allahabad (2009-2013 batch) -- 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] directi paper pattern
@ md shaukat ali: Hi ! Directi is visting our campus in this week. Can u plz forward the paper that u mentioned to me. Thanx in advance. *Piyush Khandelwal** | Placement Coordinator**, Delhi Technological University ( Delhi College of Engineering )* Mobile: 91-8447229204 www.dce.edu Get a signature like this. http://r1.wisestamp.com/r/landing?promo=17dest=http%3A%2F%2Fwww.wisestamp.com%2Femail-install%3Futm_source%3Dextension%26utm_medium%3Demail%26utm_campaign%3Dpromo_17 CLICK HERE.http://r1.wisestamp.com/r/landing?promo=17dest=http%3A%2F%2Fwww.wisestamp.com%2Femail-install%3Futm_source%3Dextension%26utm_medium%3Demail%26utm_campaign%3Dpromo_17 On 31 July 2012 22:59, Sathish babu satbrucei...@gmail.com wrote: Can you tell some of questions asked? **~Sathish Babu~** On Tue, Jul 31, 2012 at 10:53 PM, manish untwal manishuntw...@gmail.comwrote: hey they repeat their paper alot,i.e they asked the same paper last year in our institute for the intern!! so best of luck On Tue, Jul 31, 2012 at 9:52 PM, Avinash Mishra mishra.avinas...@gmail.com wrote: hey please mail me too...please give a pastebin link On 31 July 2012 21:51, neelpulse(Jadavpur University) neelpu...@gmail.com wrote: Hey, can you please mail me too? -Thanks Nilanjan Basu On Tuesday, July 31, 2012 9:49:15 PM UTC+5:30, MUDIT wrote: Please forward the mail to me as well. Thanks -- Mudit Sadana Undergraduate Student,Computer Science NSIT, Delhi University,India -- 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/-/2YdFa0ZwOIsJ. 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. -- With regard's Avinash -- 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. -- With regards, Manish kumar untwal Indian Institute of Information Technology Allahabad (2009-2013 batch) -- 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. -- *Piyush Khandelwal*** Placement Coordinator ( Computer Science Engg.) Contact No: 91-8447229204 / 91-9808479765 -- 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] directi paper pattern
hi shaukat Ali ,it will be really kind if you can forward me that paper of directi my ID:amitsingh...@gmail.com On Tuesday, 31 July 2012 21:42:43 UTC+5:30, md shaukat ali wrote: On Tue, Jul 31, 2012 at 7:37 PM, deepikaanand swinyanand...@gmail.comwrote: can anyone tell me the pattern (selection procedure )followed by directi this year -- 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/-/uaKshpROlGoJ. 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. i have mailed u recently asked question by direct i in nit allahabad..make a view on it -- 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/-/e2nPukFWEpQJ. 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] Dominating Points
If we are given a number of points on the XY-plane, [(x0,y0),(x1,y1),(x2,y2),...]. A point (xi,yi) is dominant to another point (xj,yj) iff xixj and yiyj. Calculate all pairs of points such that one dominates the other. -- 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] Removing space inplace
Please have a look at this : http://www.careercup.com/question?id=14433699utm_source=feedburnerutm_medium=emailutm_campaign=Feed%3A+Careercup+%28CareerCup%29 What does inplace shifting imply here? Cant i keep 2 pointers and overwrite a non space character onto a space character and advance both pointers till one again hits a space character and other a non-space character? Does that violate the condition given in the question? -- 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.