Re: [algogeeks] Source Bits
first of all congrats rajeev for the placements :) :) rajeev can u please tell us in more detaill about the technical anr hr around can u find any differenence on giving hr through skype can u list questions that were asked in techinacal and hr around. -- 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] Source Bits
first of all congrats rajeev for the placements :) :) rajeev can u please tell us in more detaill about the technical anr hr around can u find any differenence on giving hr through skype can u list questions that were asked in techinacal and hr around waiting for ur reply -- 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] Source Bits
first of all congrats rajeev for the placements :) :) rajeev can u please tell us in more detaill about the technical anr hr around can u find any differenence on giving hr through skype can u list questions that were asked in techinacal and hr around waiting for ur reply -- 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] Source Bits
first of all congrats rajeev for the placements :) :) rajeev can u please tell us in more detaill about the technical anr hr around can u find any differenence on giving hr through skype can u list questions that were asked in techinacal and hr around -- 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] Sourcebits [wrriten n interview round]
hi guys sourcebits is visiting our campus tomorrow can anybody please telll us what type of question wiill be there in wrriten and interview around it would be great help :) -- 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: informatica interview question
ravi can u please tell usa bout the written test what type of question asked etc? -- 'Life can be filled with disappointment but being happy is a choice' Manoj Bagari National Institute Technology Kernataka -- 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: informatica interview question
thanx a lot ravi for sharing the information :) :) 'Life can be filled with disappointment but being happy is a choice' Manoj Bagari National Institute Technology Kernataka -- 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 Ravi Maggon B.E. CSE, Final Year Thapar University www.algorithmguru.com *Failure is the opportunity to begin again more intelligently* -- 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. -- 'Life can be filled with disappointment but being happy is a choice' Manoj Bagari National Institute Technology Kernataka -- 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] National instruments
they visited our college few days ago . they asked ten conceptual questions on c , algorithim and aptitude covers [recursion,time complexity, finding the output etc] try to learn c,algo ,probablity . all the best. -- 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] IBM ONLINE TEST
Guys those who have given ibm online test plz share their experince! it would be great help! -- 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] Deloite
Hi guys those Who have taken the deloite test paper, pls share the type of questions asked in the test. -- 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] Deloite
thax ansul for helping! :) can u just describe more about the verbal section i mean the type n level of the questions asked , On Thu, Aug 25, 2011 at 12:42 PM, Anshul Khandelwal anshul.dans1...@gmail.com wrote: 30 ques. of simple aptitude. 10 question of verbal(including 5 ques. of a passage) sectional cut off is der. On Thu, Aug 25, 2011 at 12:37 PM, manoj manojbag...@gmail.com wrote: Hi guys those Who have taken the deloite test paper, pls share the type of questions asked in the test. -- 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. -- ANSHUL KHANDELWAL B.TECH. 4th yr. Computer Engineering Malaviya National Institute Of Technology, 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. -- 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] Deloite
k ..thanx piyush -- 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] probability ques
possible value for a can be 1,2,48,49,50 and all (50-100] no. so prob will be 55/100 On Tue, Aug 23, 2011 at 10:41 PM, priya ramesh love.for.programm...@gmail.com wrote: try substituting values for a. for a=1, 2 it's 50 for a=3, 4, 5, 6, 7... it's less than 50 when a approaches 48, 49... it's 50 the max value of a that satisfies the condition is 47. p= total numbers between 3 and 47 (inclusive of 3 and 47) / total numbers between 1 and 100 = 45/98 -- 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] probability ques
oh sorry i thought it was a+100/a50 because this same question asked by national instrument 2 day ago. in this case passibe cases wil be 44 [3-47} no so it'll be 44/100 -- 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: probability ques
sorry i thought it was a+ 100/a50 because same question was asked by national instrument 2 days ago in this case it'll be [3-47] 45 no so prob will be 45/100 On Aug 24, 8:21 am, Ankur Goel goel.anku...@gmail.com wrote: Dude how it can be 50 if u do 50 + 100/50 which is 52 50 On Wed, Aug 24, 2011 at 8:42 AM, Manoj Bagari manojbag...@gmail.com wrote: possible value for a can be 1,2,48,49,50 and all (50-100] no. so prob will be 55/100 On Tue, Aug 23, 2011 at 10:41 PM, priya ramesh love.for.programm...@gmail.com wrote: try substituting values for a. for a=1, 2 it's 50 for a=3, 4, 5, 6, 7... it's less than 50 when a approaches 48, 49... it's 50 the max value of a that satisfies the condition is 47. p= total numbers between 3 and 47 (inclusive of 3 and 47) / total numbers between 1 and 100 = 45/98 -- 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.- 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.
[algogeeks] Re: Amazon Written Tes Q1
Create BST of given list... 1. using extra space now you can create DLL and inorder traversal 2. Create sorted linked list from DLL, Great tree list recusion (cslibrary.stanford.edu/109/TreeListRecursion.pdf) On Jan 31, 12:11 am, bittu shashank7andr...@gmail.com wrote: can u provide solution..nlogn or n^2 ..write algo..or exact working code for this... 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.
[algogeeks] Re: partition array
if you don't distroy the oder in which elements are stored in array then this problem is just a cake walk. Requirement of question? On Jan 19, 11:49 am, Aditya adit.sh...@gmail.com wrote: this could be solved by using dynamic programing (knapsack problem) On 1/19/2011 12:30 AM, juver++ wrote: Did you mean absolute difference between two subsets is minimal? -- 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 Aditya -- 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] Recursive Function For insertion in BST
http://cslibrary.stanford.edu/110/
On Sat, Jan 15, 2011 at 6:36 PM, Logic King crazy.logic.k...@gmail.comwrote:
hello all,
i am a beginner to data structures.I have created a recursive function
for insertion of a node in BST,but the function is not working
properly.plz correct me,probably i am doing something wrong with
the pointers
help required :( .urgent !!
the function is here---
void insert(struct node *head,int info)
{
struct node *temp=malloc(sizeof(struct node));
temp-data=info;
temp-rchild=NULL;
temp-lchild=NULL;
if(head==NULL)
head=temp;
else if(infohead-data)
{
insert(head-rchild,info);
}
else if(infohead-data)
{
insert(head-lchild,info);
}
}
--
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.comalgogeeks%2bunsubscr...@googlegroups.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
--
Manoj Lalavat
--
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] No. of ways to Merge 2 arrays
one approch is very simple. 1. keep two index on arrays, lets say array1 and array2, which ever index has small element put this element to output array and move index of smaller element to next position. repeate above process untill one of the array index get exausted then append remaining array to output. corner cases when one array is 1,2,3,4 and other is 5,6,7,8,...in this case you just need to append them...take care of this... On Wed, Jan 12, 2011 at 2:53 PM, Arindam Chatterjee arindam.chatterje...@gmail.com wrote: Can anyone help: *In how many ways can 2 sorted arrays of combined size N be merged?* -- Thanks and regards, ARINDAM CHATTERJEE, Mtech Second Year, Department of Computer Science and Engineering, IIT Bombay, Powai, Mumbai-400076 Contacts : +919022313724 Living is about making tomorrow better than today !! -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- -- Manoj Lalavat -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] Amazon Analytical Puzzle
check this... Tournament Algorithm Another method is tournament algorithm. The idea is to conduct a knockout minimal round tournament to decide the ranks. It first organises the games (comparisons) between adjacent pairs and moves the winners to next round until championship (the first best) is decided. It also constructs the tournament tree along the way. Now the second best element must be among the direct losers to winner and these losers can be found out by walking in the binary tree in O(log *n*) time. It organises another tournament to decide the second best among these potential elements. The third best must be one among the losers of the second best in either of the two tournament trees. The approach continues until we find k elements. This algorithm takes O(n + k log *n*) complexity, which for any fixed *k* independent of *n* is O(*n*). On Wed, Jan 12, 2011 at 3:05 PM, bittu shashank7andr...@gmail.com wrote: if you had 5,623 participants in a tournament, how many games would need to be played to determine the winner Regards Shashank -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- -- Manoj Lalavat -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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: MICROSOFT IDC
try this...its will be less then O(n^2) 1. find the biggest and smallest element in smaller list 2. start traversing other list and compare every element with the biggest smallest element of first list if element of second list is grater then the biggest element of first list then then move to next position in second list || element of second list is smaller then the smallest element of first list then move to next position in second list else traverse first list and print if element of second list exist in first list, if(exist) print and break this loop only no sorting...and better performance On Jan 12, 2:27 pm, juver++ avpostni...@gmail.com wrote: May be combining merge sort and calculating final result is a possible solution. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] No. of ways to Merge 2 arrays
merging is merging...you can use different methods to do this... 1. I have told you... 2. build BST and print inorder 3. find biggest element, create hash of that size, init table element to zero (assume zero is not in input array) traverse each array and put that element into hash table finally print hashtable for non-zero elements. ..I hope you get some idea... On Wed, Jan 12, 2011 at 3:16 PM, Arindam Chatterjee arindam.chatterje...@gmail.com wrote: @Manoj: Thanks, but can u tell me the no. of ways in which merging can be done on 2 arrays. On Wed, Jan 12, 2011 at 3:06 PM, manoj lalavat manoj.lala...@gmail.comwrote: one approch is very simple. 1. keep two index on arrays, lets say array1 and array2, which ever index has small element put this element to output array and move index of smaller element to next position. repeate above process untill one of the array index get exausted then append remaining array to output. corner cases when one array is 1,2,3,4 and other is 5,6,7,8,...in this case you just need to append them...take care of this... On Wed, Jan 12, 2011 at 2:53 PM, Arindam Chatterjee arindam.chatterje...@gmail.com wrote: Can anyone help: *In how many ways can 2 sorted arrays of combined size N be merged?* -- Thanks and regards, ARINDAM CHATTERJEE, Mtech Second Year, Department of Computer Science and Engineering, IIT Bombay, Powai, Mumbai-400076 Contacts : +919022313724 Living is about making tomorrow better than today !! -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- -- Manoj Lalavat -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Thanks and regards, ARINDAM CHATTERJEE, Mtech Second Year, Department of Computer Science and Engineering, IIT Bombay, Powai, Mumbai-400076 Contacts : +919022313724 Living is about making tomorrow better than today !! -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- -- Manoj Lalavat -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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: No. of ways to Merge 2 arrays
what? On Wed, Jan 12, 2011 at 3:38 PM, juver++ avpostni...@gmail.com wrote: Explain problem using examples. When two merging are different? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- -- Manoj Lalavat -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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 IDC
worst case...but in avrg cases its better and dont use sorting... On Wed, Jan 12, 2011 at 3:41 PM, juver++ avpostni...@gmail.com wrote: it is better then pute brute force, but it is O(N^2) -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- -- Manoj Lalavat -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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: Amazon Analytical Puzzle
yes...but if you want to find second best and third best and so on...then you need to consider all loser to first winner and so onthink on this line.. On Wed, Jan 12, 2011 at 3:14 PM, bittu shashank7andr...@gmail.com wrote: @manoj..can u elaborate by making what exactly u mean...??? According to me if Tournament strategy is is used then i think its ok... After each round, you would have half the number that started the previous round; except if it were an odd number it would he half + 1. So 13 rounds. 2812 1 1406 2 703 3 352 4 176 5 88 6 44 7 22 8 11 9 6 10 3 11 2 12 1 13 Regrads Shashank Don't b Evil U Can Earn while U Learn -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- -- Manoj Lalavat -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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 IDC
hahahahgood...givesome thing better without sorting... On Wed, Jan 12, 2011 at 3:48 PM, juver++ avpostni...@gmail.com wrote: In average it is O(N^2) anyway but with a bit smaller constant. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- -- Manoj Lalavat -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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: MICROSOFT IDC
wake up ..L I think original question has asked about intersection (set intersection)...not the node intersection of two linked list. On Jan 12, 4:04 pm, juver++ avpostni...@gmail.com wrote: Justify your algo on examples. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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: MICROSOFT IDC
my understanding of question when I have given solution... list1 = 4--2--3--6 list2 = 5--7--2--3 output should be: 2,3 other understand of this question on which davin has given solution is.. two linked list froming Y and find intersecting node or find if they are intersecting or not. On Jan 12, 5:05 pm, Davin dkthar...@googlemail.com wrote: @manoj, Can you please explain question about your understanding? On Jan 12, 4:19 pm, manoj manoj.lala...@gmail.com wrote: wake up ..L I think original question has asked about intersection (set intersection)...not the node intersection of two linked list. On Jan 12, 4:04 pm, juver++ avpostni...@gmail.com wrote: Justify your algo on examples. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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: MICROSOFT IDC
coool hai... On Jan 12, 5:18 pm, sunny agrawal sunny816.i...@gmail.com wrote: @manoj we need to find a common node, not nodes in list having same values how a node can be pointing to 2 next values at the same time as in your case 3 is pointing to both null and 6, I think On Wed, Jan 12, 2011 at 5:44 PM, manoj manoj.lala...@gmail.com wrote: my understanding of question when I have given solution... list1 = 4--2--3--6 list2 = 5--7--2--3 output should be: 2,3 other understand of this question on which davin has given solution is.. two linked list froming Y and find intersecting node or find if they are intersecting or not. On Jan 12, 5:05 pm, Davin dkthar...@googlemail.com wrote: @manoj, Can you please explain question about your understanding? On Jan 12, 4:19 pm, manoj manoj.lala...@gmail.com wrote: wake up ..L I think original question has asked about intersection (set intersection)...not the node intersection of two linked list. On Jan 12, 4:04 pm, juver++ avpostni...@gmail.com wrote: Justify your algo on examples. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Sunny Aggrawal B-Tech IV year,CSI Indian Institute Of Technology,Roorkee -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] Interview Question
you can optimize BF newspaper first word you will search n then ne then new then news..and so onif at any point of time first word exist in dictionary then only see whether the word with the remaining characters exist in the dictionary or not. On Tue, Jan 11, 2011 at 5:57 PM, Vikas Singh vikas.sing...@gmail.comwrote: Given a dictionary find out if given word can be made by two words in dictionary. For eg. given newspaper you have to find if it can be made by two words. (news and paper in this case). I cant think of anything but brute force. Thanks, Vikas -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- -- Manoj Lalavat -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] Interview Question
how abt this.. Pass1 = look whether words like n,ne,new,news.exist or not...store information in some array like n is not found so is ne but new is found and news is found so array will be like 0,0,1,1. Pass2 = do d same from from the end... r,er,per,aper,paper 0,0,1,0,1 Pass3 on first array whenever you find 1see index [len(newspaper) - (index of one in first array)] in second array...if its one we have words n so on On Tue, Jan 11, 2011 at 6:58 PM, Vikas Singh vikas.sing...@gmail.comwrote: Wouldn't that be O(n2) . what if n, ne, new, news, newsp etc all are valid words ? Cant it be optimized? On Tue, Jan 11, 2011 at 6:27 PM, juver++ avpostni...@gmail.com wrote: Use trie (or similar DS). For each word, try to find second part of the target in a linear time O(length). -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@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 algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- -- Manoj Lalavat -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] Interview Question
words and...so on... on dictionaries lookup is O(1) now think abt complexity... pass1 for (1 to N) example here N=strlen(newspaper) other passes are also same... On Tue, Jan 11, 2011 at 8:07 PM, juver++ avpostni...@gmail.com wrote: What do you mean by N? If N - size of the dictionary. And L- maximum length of the words then above algo is O(N*L) -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- -- Manoj Lalavat -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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 interview question
it will give you an idea. http://en.wikipedia.org/wiki/Full_text_search On Fri, Dec 10, 2010 at 4:03 PM, ADITYA KUMAR aditya...@gmail.com wrote: @ankit u can'nt use TRIE becoz , input will be given in form of text so generating the TRIE will be much expensive than linear search On Fri, Dec 10, 2010 at 3:13 PM, GOBIND KUMAR gobind@gmail.comwrote: Help me in solving this problem... Define a data struct for the search engine which will represent whether given word is there in the document or not .It should be fast. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Regards Aditya Kumar B-tech 3rd year Computer Science Engg. MNNIT, Allahabad. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- -- Manoj Lalavat -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@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] cops n robber
I think if we talked about higher speed then there is no need of second cop Single cop is enough to catch the robber On Mon, Jul 5, 2010 at 10:01 AM, Jitendra Kushwaha jitendra.th...@gmail.com wrote: Offcourse it is possible if cops have higher speed. Incase if same speed : We can say when the when the thief is at one corner the cops will also be in some corner and since only two cops, and thief have three ways possible to move from one edge he can escape always. -- Regards Jitendra Kushwaha MNNIT, Allahabad -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@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 algoge...@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: impossible microsoft puzzle
If all the men gusses the same number then the solution could be wrong. for example the the value of N is 5 and numbers given are 1,2,1,1,1 and everybody guesses 4 then the solution is wrong. A different solution is like - All men will stand in a row and and everybody can think of his hat number as his position in row. In this way atleast one person will be there who is correct. Manoj Janoti On Mon, Jul 5, 2010 at 3:19 AM, Nikhil Jindal fundoon...@yahoo.co.inwrote: Hello All, Since duplicates are allowed, the fact that I can see the number on others hat is of no significance to me. My guess with this information is as good without it. Hence, I will consider the situation as: I am sitting alone in a dark room and I am given a hat with a number from 1 to N. I have to guess the number on my hat. I am in such a situation N times and I have to develop a strategy for guessing such that I am correct atleast once. Now if I guess a number x (1=x=N), my probability of correctness is 1/N i.e if I guess the same number N times, I will be correct once. Hence I guess the same number every time. For the given puzzle, all men guess the same number and at least one of them will be correct. :) Nikhil Jindal Department of Computer Engineering Delhi College of Engineering http://www.dce.edu, Delhi My Blog: http://fundoonick.blogspot.com My LinkedIn Profile: http://www.linkedin.com/in/nikhiljindal http://www.linkedin.com/in/nikhiljindal On Sun, Jul 4, 2010 at 11:05 PM, Dave dave_and_da...@juno.com wrote: But everyone guesses simultaneously. I take it to mean that no one knows anyone else's guess when making his own. Dave On Jul 4, 2:01 am, agnibha nath agni.fl...@gmail.com wrote: can it be like... one person sees any other person's number and guesses it first. then, everybody else guesses the same number. this way, atleast one guesses it right, since there is no boundation on the no. of wrong guesses. On Jul 3, 11:10 pm, jalaj jaiswal jalaj.jaiswa...@gmail.com wrote: N people team up and decide on a strategy for playing this game. Then they walk into a room. On entry to the room, each person is given a hat on which one of the first N natural numbers is written. There may be duplicate hat numbers. For example, for N=3, the 3 team members may get hats labeled 2, 1, 2. Each person can see the numbers written on the others' hats, but does not know the number written on his own hat. Every person then simultaneously guesses the number of his own hat. What strategy can the team follow to make sure that at least one person on the team guesses his hat number correctly? -- With Regards, Jalaj Jaiswal +919026283397 B.TECH IT IIIT ALLAHABAD- 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 algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. Please access the attached hyperlink for an important electronic communications disclaimer: http://dce.edu/web/Sections/Standalone/Email_Disclaimer.php -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com algogeeks%2bunsubscr...@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 algoge...@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:
On Tue, Jun 2, 2009 at 3:00 PM, Aminooo~ amin...@gmail.com wrote: *Dear Friends,* * * *A question for the genius, the one who solve the problem will write the name in the attached file.* *IF; 2+3=10* * 7+2=63* * 6+5=66* * 8+4=96* *THEN;* * 9+7=???* *The answer is the password to open the file attached* * * * * *Best Regards* *Aminooo.com* http://www.aminooo.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 -~--~~~~--~~--~--~--- successor.xlsx Description: application/vnd.openxmlformats-officedocument.spreadsheetml.sheet
[algogeeks] Re: Pyramid algorithm?
Just want to know what will be the structure if the number of stackable objects is 7 ~Janoti On Mon, Jan 19, 2009 at 11:17 AM, Darth Continent darthcontin...@gmail.comwrote: Hello, when I searched I found a couple of spam posts for pyramid scams, so I'm hoping someone may be able to help. Say you have a collection of stackable objects, like blocks or boxes. You need to stack them in a pyramid as tall as possible, so that no more than 1-2 of the objects is at the top level, and so that each layer is larger than the first, for example: O OO OOO Given the total number of stackable objects, what would be an effective looping algorithm to make this happen? Thanks in advance for any help. --~--~-~--~~~---~--~~ 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 -~--~~~~--~~--~--~---
