Re: [algogeeks] Re: Puzzle

. >> 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] apti

gle 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/grou

Re: [algogeeks] Re: GS on campus

you were not given any essay during the written round? and if you can get your friends to tell us what kind of puzzles were asked? just a bit of info on that. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email t

Re: [algogeeks] difference between the two

8 as int data is 8bytes. So, if p1 starts at 0, it should end at 16 > > not 12 so that p2 starts at 8's multiple. > > > > This is done by padding pointer by 4bytes in both I and II struct. > > declarations. > > > > > > Hope i made it clear...! > >

Re: [algogeeks] Re: Amazon Aptitude questions

e Of Technology >> Delhi. >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algogeeks@googlegroups.com. >> To unsubscribe from this group, send email t

Re: [algogeeks] Re: directi prepration

om. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Tushar Bindal Computer Engineering Delhi College of Engineering Mob: +919818442705 E-Mail : tushicom...@gmail.com Website: www.jugadengg.com -- You received this message because you are subs

Re: [algogeeks] pls help

subscr...@googlegroups.com. >> >> >> For more options, visit this group at >> >> >> http://groups.google.com/group/algogeeks?hl=en. >> >> >> >> >> > >> >> > >> >> > >> >> > -- >>

Re: [algogeeks] difference between the two

t; algogeeks+unsubscr...@googlegroups.com. >>> For more options, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >> >> >> >> -- >> Regards, >> Kamakshi >> kamakshi...@gmail.com >> >&g

Re: [algogeeks] MICRSOFT WRITEN TEST

this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Tushar Bindal Computer Engineering Delhi College of Engineering Mob: +919818442705 E-Mail : tushicom...@gmail.com Website:

Re: [algogeeks] Re: Puzzle

t; > >>> 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.

Re: [algogeeks] Call by reference

that is exactly what i thought thanks for the clarification -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@

Re: [algogeeks] Call by reference

; -- >> 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...@g

Re: [algogeeks] pointer size

eks" 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. > -- Tushar Bi

Re: [algogeeks] Call by reference

Shashank, In C++ we implement it thru reference variables in the function call we can say func(x); in the definition we have, func(int &a) whatever changes we make to a in func() are reflected back in x in the calling function In C, we can simulate i t through pointers call : func(&x); definiti

Re: [algogeeks] Re: Give an efficient search algo

ks@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: Re: Re: [algogeeks] Re: MS

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: Novell - Puzzle

Suppose that our rabbits never die and that the female always produces one new pair (one male, one female) *every month from the second month on * @Priyanka You have answer 288 I added 178 to it because I got the answer that 89 females would have given birth in the last month. Pls clarify. Are you

Re: [algogeeks] Re: Novell - Puzzle

visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > > > -- > Ashish kumar > ECE final yr > MNNIT allahabad > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" gr

Re: [algogeeks] Re: Novell - Puzzle

Gupta > wrote: > >> For rabbits, answer is 256. >> >> >> On Sat, Jul 30, 2011 at 8:33 PM, Tushar Bindal wrote: >> >>> for rabbits answer would be different from cows as they give birth to a >>> pair at a time, so at any time odd number of rabbit

Re: [algogeeks] Re: Novell - Puzzle

end email to >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > > > -- > Regards > Reynald Reni > Masters in Software Engineering > CIT - India > >

Re: [algogeeks] Re: binary search tree question!!!!

a > B.Tech (IT) > 7th Sem. > Indian Institute of Information Technology Allahabad. > Ph : 09793899112 > Official Email :: rit2008...@iiita.ac.in > Another Email :: varunpahwa.ii...@gmail.com > > People who fail to plan are those who plan to fail. > > -- > Y

Re: [algogeeks] Re: size of self referential structure

t;> 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 receive

Re: [algogeeks] Puzzle

we can just infer that at the point where the man met the driver, from that point, it takes 10 minutes to reach the office (assuming that car moves at same uniform speed all the time) -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to

Re: [algogeeks] Re: Contiguous subarray with sum zero

yup i got it now. nice code -- 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 optio

Re: [algogeeks]

; **Regards >> SAGAR PAREEK >> COMPUTER SCIENCE AND ENGINEERING >> NIT ALLAHABAD >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algogeek

Re: [algogeeks] Re: Contiguous subarray with sum zero

yeah i was just confirming that it is meant to be printed or is it considered reduntant as it wasn't mentioned in the question. thanks for this algo. -- 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] Re: Contiguous subarray with sum zero

can't we include -9 , 3 , 1, 5 , 0 as a possible sub array? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@

Re: [algogeeks] Re: Facebook Interview question at NIT Warangal

though the code given by siddharth seems to be a bit tough to understand due to one long statement, it gives a good idea to run the main loop fron 2^k -1 to (2^k - 1)*(2^(n-k)) since these rae the only numbers having k digits set -- You received this message because you are subscribed to the Goo

Re: [algogeeks] Re: rotate a matrix NVIDIA question

thanks amit for this code i tried this for the first time and am still not over finding out my mistakes (got another one while trying it out on an array) yours was an easy one :) -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to thi

Re: [algogeeks] Re: rotate a matrix NVIDIA question

i am sorry for givin such a naive solution and making so many mistakes. i still left a mistake in dir==4 * col=n-1-(col+1);* -- 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 u

Re: [algogeeks] Re: rotate a matrix NVIDIA question

There will be following changes to this while(noOfCellsVisitedhttp://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks] Re: rotate a matrix NVIDIA question

If this is the case, we can follow this method: take variables 1. dir = 1 2. st_col=0 3. end_col = n-1 4. st_row = 1 5. end_row = n-1 6. row = 0 7. col = n-1 8. noOfCellsVisited = 0 dir are as follows: 1 - left ro right 2 - top to bottom 3 - right to left 4 - bottom to top row will keep account

Re: [algogeeks] Re: rotate a matrix NVIDIA question

om 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

Re: [algogeeks] c++ output

@varun you are contradicting your own statement when inline replaces the code at place where it is called, then this code will work fine. and the other one w/o inline won't as explained by others also. there seems to be some confusion in your statement. -- Tushar Bindal Computer Engine

Re: [algogeeks] Re: Puzzle

thankyou :) -- 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 g

Re: [algogeeks] Re: Puzzle

thanks sagar for this wonderful shortcut but can you please explain it better. in what cases can we use this approach? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubs

Re: [algogeeks] puzzle-plz explain stepwise

yx - xy = x0y - yx => (10y + x) - (10x + y) = (100x + y) - (10y + x) 9y - 9x = 99x - 9y 18y = 108x y=6x Since, x comes in hundreds place, we know it can only be 1 as the difference between the 3 digit number and two digit number is difference of two 2 digit numbers only. thus, y=6*1 = 6 a explai

Re: [algogeeks] Re: Puzzle

Sory once again for that incomplete answer. The complete one is here. probability that i win standing at second position: 1/365 probability that i win standing at third position : 364/365*2/365 = 1/365)*(628/365) probability that i win standing at fourth position : 364/365*363/365*3/365 probability

Re: [algogeeks] puzzle

Sumit, the answer is 14 I think the example of 16 that they take on careerplus is probably confusing you. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from thi

Re: [algogeeks] Re: Puzzle

- n +1)*(n)} / {365*(n-1)} maximum probability is at nth position if at (n+1)th position, {(365 - n +1)*(n)} / {365*(n-1)} -- Tushar Bindal Computer Engineering Delhi College of Engineering Mob: +919818442705 E-Mail : tushicom...@gmail.com Website: www.jugadengg.com -- You received this

Re: [algogeeks] Re: Puzzle

Sorry for the previous post the last line was incorrect it should have been (n+1)th position I was just writing roughly and pressed send instead of save. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to al

Re: [algogeeks] Re: Puzzle

probability that i win standing at second position: 1/365 third position : 364/365*2/365 = 1/365)*(628/365) fourth position : 364/365*363/365*3/365 4th : 364/365*363/365*362/365*4/365 nth position: (365-1)*(365-2)*(365-3)*(365-4)*(365-5).*(365-(n-2))*(365-(n-1))*(n)*(1/365)^n -- You received

Re: [algogeeks] apti Q

the clock has become faster by 48 seconds in 10800 minutes i.e., 1 sec in 225 minutes from 8am on sunday we have to go 225*5*60 minutes behind to get time when clock showed the correct time. i.e., 67500 minutes or 44 days 1260 minutes 44 days 21 hours which means clock showed correct timing at 11a

Re: [algogeeks] Re: puzzle

the solution is given here but can anyone lease explain it better please give a original solution and stop making rude comments about answers posted genuinely. If you have an original solution, please post it. -- You received

Re: [algogeeks] puzzle

@Navneet Didn't get your point -- Tushar Bindal Computer Engineering Delhi College of Engineering Mob: +919818442705 E-Mail : tushicom...@gmail.com Website: www.jugadengg.com -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.

Re: [algogeeks] puzzle

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 gro

Re: [algogeeks] puzzle

> For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Tushar Bindal Computer Engineering Delhi College of Engineering Mob: +919818442705 E-Mail : tushicom...@gmail.com Website: www.jugadengg.com -- You received this message because you are

Re: [algogeeks] Reversing the order of words in String

to be done. > > On Wed, Jul 6, 2011 at 10:16 PM, saurabh singh > wrote: > > I have proposed my solution in one of the previous posts.Check the > solution > > there > > > > On Wed, Jul 6, 2011 at 10:10 PM, Tushar Bindal > > wrote: > >> > >>

Re: [algogeeks] Reversing the order of words in String

e Individual words in string >reverseWordsInString(str); >cout<cin.get(); >return 0; > } > > -- > Regards, > Navneet > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks&quo

Re: [algogeeks] Puzzle

- win-win situation For a change the easier method is faster as well -- Tushar Bindal Computer Engineering Delhi College of Engineering Mob: +919818442705 E-Mail : tushicom...@gmail.com Website: www.jugadengg.com -- You received this message because you are subscribed to the Google Groups

Re: [algogeeks] Re: Some adobe interview questions.

85 = 3 >> > 90 = 3 >> > 95 = 3 >> > 100 = 1 >> > 105 = 2 >> > 110 = 2 >> > 115 = 3 >> > 120 = 2 >> > >> > more information can be found athttp:// >> www.topcoder.com/tc?module=Static&d1=tutorials&d2=dy

Re: [algogeeks] Re: help to code

Evenly divisible simply means that a number should be completely divisible by the given numbers, i.e., it should give a whole number as an answer when divided by that particular number. Evenly divisible doesn't mean that quotient should be an even number. It just needs to be a whole number. Probabl

Re: [algogeeks] help to code

If my interpretation is right, following should be the code. int main() { int userInteger = 0; cout << "Enter A Number "<> userInteger; // Ask For a number from the user if (userInteger > 0) // Is the number valid? { int result = 0; int prime[5] = { 2, 3, 5, 7, 11 }; int a,b, count = 0; *for(a=1;

Re: [algogeeks] help to code

I think you are getting it wrong. Surender, your solution says that numbers divisible by all of the first 5 prime numbers will be taken into account whereas the question says that only the numbers *not* evenly divisible by *any* of the first 5 prime numbers are to be added. Shiv, you are making tw

Re: [algogeeks] Re: spoj--two squares problem

that theorem is for odd primes 9 is not an odd prime so we can;t apply this theorem -- 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

Re: [algogeeks] A SIMPLE C++ PROGRAM.

I am sorry for the previous post. The answer comes out to be 10. I was trying to evaluate values at each step using the code: *int y=(a=x++) + (b=++x) + (c=++x) + (d=x++)* Then y would have been 12. But with the given code, answer comes out to be 10 only. Why is this? -- Tushar Bindal

Re: [algogeeks] A SIMPLE C++ PROGRAM.

Manish is right. This would start from the left. In cout also processing starts from left. The processing is from right in the printf statement. -- Tushar Bindal Computer Engineering Delhi College of Engineering Mob: +919818442705 E-Mail : tusharbin...@jugadengg.com Website: www.jugadengg.com

Re: [algogeeks] Re: Stroustrup C++ BOOK

I have the book but I hope there are no issues with ths book being shared here. I don't have the link now. would it be fine if I share the book directly? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to alg

Re: [algogeeks] Re: Stroustrup C++ BOOK

Is this one fine? http://www.megaupload.com/?d=YSSE195C -- Tushar Bindal Computer Engineering Delhi College of Engineering Mob: +919818442705 E-Mail : tusharbin...@jugadengg.com Website: www.jugadengg.com -- You received this message because you are subscribed to the Google Groups "Algo

Re: [algogeeks] Re: Stroustrup C++ BOOK

searching in the group did not help please give the link to your previous post or better give the link once again -- Tushar Bindal Computer Engineering Delhi College of Engineering Mob: +919818442705 E-Mail : tusharbin...@jugadengg.com Website: www.jugadengg.com -- You received this message

Re: [algogeeks] Cracking the IT interview: jump start your career with confidence

is there anyone who has this book? -- Tushar Bindal Computer Engineering Delhi College of Engineering Mob: +919818442705 E-Mail : tusharbin...@jugadengg.com Website: www.jugadengg.com -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" grou

Re: [algogeeks] Re: If any one have algorithms for interviews by adnan aziz ebook... Please mail ...

Plz mail the book to me too -- Tushar Bindal Computer Engineering Delhi College of Engineering Mob: +919818442705 E-Mail : tusharbin...@jugadengg.com Website: www.jugadengg.com -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.

Re: [algogeeks] Re: Construct Binary Tree From Ancestor Matrix

a[i][j]=1 if 'i' is a parent to 'j' But in your matrix, a[1][2] = 1 a[1][3] = 1 a[2][3] = 1 a[4][2] = 1 a[4][3] = 1 You have taken 'j' to be a parent to 'i' -- Tushar Bindal Computer Engineering Delhi College of Engineering Mob: +919818442705 E-Ma

Re: [algogeeks] Re: Google puzzles

Arpit The formula that you have written is wrong. You would have approached it correctly but the formula written here is incorrect. m= n + (n**1/6* + (n-1)) + ((n**7/6* + (n-1))**1/6* + n-2) +.. If you add all the terms there should be 1/6 in these terms as the terms give the number of medals

Re: [algogeeks] Re: debugging contest

xxx, yyy are considered as cases? -- 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

Re: [algogeeks] Re: brain teaser

That is the point I wanted to make. they can hear what the previous person has said. you have repeated the answer given above. -- Tushar Bindal Computer Engineering Delhi College of Engineering Mob: +919818442705 E-Mail : tusharbin...@jugadengg.com -- You received this message because you are

Re: [algogeeks] Re: brain teaser

can't they hear what the previous person has just said? -- 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...@goog

Re: [algogeeks]

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. > -- Tushar Bindal Computer Engineering

Re: [algogeeks] Fwd: SANKALAN 2011:DUCSS Annual Technical Festival

promotional activity. We thot here ppl discuss on > technical topics so it wud b gr8 to enlighten ppl vd such fest whr ppl > compete n exchange knowledge. > > Sorry if we broke ne rule for the group. > > > On Fri, Feb 18, 2011 at 11:57 PM, Tushar Bindal wrote: > >> how can

Re: [algogeeks] Fwd: SANKALAN 2011:DUCSS Annual Technical Festival

t; > > > > > -- > 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...@

[algogeeks] DCE techfest

***DELHI TECHNOLOGICAL UNIVERSITY* *(Formerly DELHI COLLEGE OF ENGINEERING)** CSI-DTUPHOENIX'11 presents FIREWALL* *The Art Of Hacking * * * Do you swear by having the key to every single lock? Do you think you possess the innate talent of finding loopholes in anything and eve

Re: [algogeeks] interview quest..

gorithm 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

Re: [algogeeks] Special Binary Tree Again

I think the following algo should work: 1. Create a DLL of the inorder traversal of the tree 2. for each node, check whether P of that node points to the previous node in the DLL or not. 3. If not, assign it value NULL -- Tushar Bindal Computer Engineering Delhi College of Engineering Mob

Re: [algogeeks] Binary Tree Amazon

It would be *vertcal_sum(root->right,level+1); *in the last line -- Tushar Bindal Computer Engineering Delhi College of Engineering Mob: +919818442705 E-Mail : tusharbin...@jugadengg.com, tushicom...@gmail.com -- You received this message because you are subscribed to the Google Gro

Re: [algogeeks] no. of passwords

; 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. > -- Tushar Bindal Computer Engineer

Re: [algogeeks] Re: Meetings puzzle

eeks@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 ar

Re: [algogeeks] Re: Frequently one of the Top Question Asked in Amazon

bittu, you have written this code at end of main() *printGivenOrder(start); printList(rslt);* so the BT in spiral order should be printed twice But you are getting a extra 4 only in place of the whole tree because of these lines *temp=current; current=head; rslt=appnd(temp,current); * There

Re: [algogeeks] Re: Single linked list questions.

the > next. So, if they intersect they will definitely be merging. > > On Thu, Jan 6, 2011 at 11:01 PM, Tushar Bindal wrote: > >> Is it necessary that the two lists are merging at their ends?? >> Do we have to find whether they merge at the end into same lists or wheter &g

Re: [algogeeks] Re: Single linked list questions.

Is it necessary that the two lists are merging at their ends?? Do we have to find whether they merge at the end into same lists or wheter they are just intersecting?? On Thu, Jan 6, 2011 at 10:04 PM, Aditya wrote: > There are two aspects here for second question. > 1. to find if the common nod