Re: [algogeeks] Source Bits

2011-09-25 Thread Manoj Bagari
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

Re: [algogeeks] Source Bits

2011-09-25 Thread Manoj Bagari
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

Re: [algogeeks] Source Bits

2011-09-25 Thread Manoj Bagari
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

Re: [algogeeks] Source Bits

2011-09-25 Thread Manoj Bagari
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

[algogeeks] Sourcebits [wrriten n interview round]

2011-09-25 Thread manoj
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

Re: [algogeeks] Re: informatica interview question

2011-09-13 Thread Manoj Bagari
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

Re: [algogeeks] Re: informatica interview question

2011-09-13 Thread Manoj Bagari
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

Re: [algogeeks] National instruments

2011-08-30 Thread Manoj Bagari
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

[algogeeks] IBM ONLINE TEST

2011-08-28 Thread manoj
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

[algogeeks] Deloite

2011-08-25 Thread manoj
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

Re: [algogeeks] Deloite

2011-08-25 Thread Manoj Bagari
. 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

Re: [algogeeks] Deloite

2011-08-25 Thread Manoj Bagari
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

Re: [algogeeks] probability ques

2011-08-23 Thread Manoj Bagari
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...

Re: [algogeeks] probability ques

2011-08-23 Thread Manoj Bagari
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,

[algogeeks] Re: probability ques

2011-08-23 Thread manoj
, 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

[algogeeks] Re: Amazon Written Tes Q1

2011-01-31 Thread manoj
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

[algogeeks] Re: partition array

2011-01-19 Thread manoj
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:

Re: [algogeeks] Recursive Function For insertion in BST

2011-01-15 Thread manoj lalavat
, 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

Re: [algogeeks] No. of ways to Merge 2 arrays

2011-01-12 Thread manoj lalavat
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

Re: [algogeeks] Amazon Analytical Puzzle

2011-01-12 Thread manoj lalavat
, 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

[algogeeks] Re: MICROSOFT IDC

2011-01-12 Thread manoj
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

Re: [algogeeks] No. of ways to Merge 2 arrays

2011-01-12 Thread manoj lalavat
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

Re: [algogeeks] Re: No. of ways to Merge 2 arrays

2011-01-12 Thread manoj lalavat
...@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

Re: [algogeeks] Re: MICROSOFT IDC

2011-01-12 Thread manoj lalavat
. 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

Re: [algogeeks] Re: Amazon Analytical Puzzle

2011-01-12 Thread manoj lalavat
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

Re: [algogeeks] Re: MICROSOFT IDC

2011-01-12 Thread manoj lalavat
. -- -- 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

[algogeeks] Re: MICROSOFT IDC

2011-01-12 Thread manoj
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

[algogeeks] Re: MICROSOFT IDC

2011-01-12 Thread manoj
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

[algogeeks] Re: MICROSOFT IDC

2011-01-12 Thread manoj
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

Re: [algogeeks] Interview Question

2011-01-11 Thread manoj lalavat
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

Re: [algogeeks] Interview Question

2011-01-11 Thread manoj lalavat
...@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

Re: [algogeeks] Interview Question

2011-01-11 Thread manoj lalavat
...@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

Re: [algogeeks] Microsoft interview question

2010-12-10 Thread manoj lalavat
. 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

Re: [algogeeks] cops n robber

2010-07-05 Thread manoj janoti
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

Re: [algogeeks] Re: impossible microsoft puzzle

2010-07-04 Thread manoj janoti
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

[algogeeks] Re:

2009-06-02 Thread manoj lalavat
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

[algogeeks] Re: Pyramid algorithm?

2009-01-19 Thread manoj janoti
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.