thanx
--
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 gro
or it can be
2^3-2=6
3^3-3=24
4^3-4=60
5^3-5=120
6^3-6=210...
On Sun, Jul 10, 2011 at 9:35 AM, Abhishek Soni wrote:
> 6,24,60,120,210,336..
>
> Explaination:
> 0 + (6*1) = 6,
> 6 + (6*3) = 24,
> 24+ (6*6) = 60,
> 60+ (6*10) = 120,
> 120 + (6*15) = 210,
> 210 + (6*21) = 336,...
>
>
>
> On Sat,
6,24,60,120,210,336..
>
> (N^3 - N) where N=2,3,4
--
Regards
UDIT
DU- MCA
--
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
6,24,60,120,210,336..
Explaination:
0 + (6*1) = 6,
6 + (6*3) = 24,
24+ (6*6) = 60,
60+ (6*10) = 120,
120 + (6*15) = 210,
210 + (6*21) = 336,...
On Sat, Jul 9, 2011 at 8:43 PM, aayush jain wrote:
> plz give the logic of above series.
>
> --
> You received this message because you are subs
plz give the logic of above series.
--
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.
Fo
6,24,60,120,210,240..
On Sun, Jul 10, 2011 at 3:29 AM, Abhishek Soni wrote:
> is it
> 6,24,60,120,210,336,.. ?
>
>
> On Sat, Jul 9, 2011 at 4:03 AM, amit the cool wrote:
>
>> 6,24,60,120,_
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" g
is it
6,24,60,120,210,336,.. ?
On Sat, Jul 9, 2011 at 4:03 AM, amit the cool wrote:
> 6,24,60,120,_
>
> --
> 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 fro
Can someone please suggest some good links to get questions related to
number series ...
Regards and Thanks
Nikita Jain
On Sat, Jul 9, 2011 at 8:25 PM, vaibhav shukla wrote:
> 91,110,134,..163 ...
> 6,24,60,120..210
>
> On Sat, Jul 9, 2011 at 6:48 PM, Yogesh Yadav wrote:
>
>> 91,110,13416
91,110,134,..163 ...
6,24,60,120..210
On Sat, Jul 9, 2011 at 6:48 PM, Yogesh Yadav wrote:
> 91,110,134161 i guess
> 6,24,60,120210
>
>
>
> On Sat, Jul 9, 2011 at 5:46 PM, Aman Goyal wrote:
>
>> 210 for the last one you posted
>>
>>
>> On Sat, Jul 9, 2011 at 4:33 PM, amit the cool wrote:
91,110,134161 i guess
6,24,60,120210
On Sat, Jul 9, 2011 at 5:46 PM, Aman Goyal wrote:
> 210 for the last one you posted
>
>
> On Sat, Jul 9, 2011 at 4:33 PM, amit the cool wrote:
>
>> 6,24,60,120,_
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>>
210 for the last one you posted
On Sat, Jul 9, 2011 at 4:33 PM, amit the cool wrote:
> 6,24,60,120,_
>
> --
> 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 fr
6,24,60,120,_
--
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
find d next:
91,110,134,_
--
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
Now let x be the answer we want, the number of drops required.
So if the first egg breaks maximum we can have x-1 drops and so we must
always put the first egg from height x. So we have determined that for a
given x we must drop the first ball from x height. And now if the first drop
of the first
@sunny
dude i got so excited after finding this solution i did not bother to check
for 14
--
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 em
@Sumit
lets consider the case the Egg does not break even from 100th floor
in your case u will get to know the answer in 8th trial.after 91 trying
from 100
but worst case solution is 16 for your solution.
we can do better by starting at 14 as above explained
14,27,39,50,60,69,77,84,90,95,99,10
@ Tushar
the answer is 16 and i have proved it.
if it is 14 , then prove 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
algog
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
The answer is 14 .
On Thu, Jul 7, 2011 at 11:25 PM, Sumit chauhan wrote:
>
> The ans is 16 because :-
> if we drop from 16th floor and if egg1 breaks floor to be tested is b/w
> 1-16 . Then start from floor 1 with egg2 and floor from which it breaks
> first is obtained and will lie b/w 1-16. the
The ans is 16 because :-
if we drop from 16th floor and if egg1 breaks floor to be tested is b/w 1-16
. Then start from floor 1 with egg2 and floor from which it breaks first is
obtained and will lie b/w 1-16. the attempts are no more than 16.
however If egg1 doesn't break on 16 floor then try on (
At a movie theater, the manager announces that they will give a free ticket
to the first person in line whose birthday is the same as someone who has
already bought a ticket. You have the option of getting in line at any time.
Assuming that you don't know anyone else's birthday, that birthdays are
Suppose u start from x floor. Two cases arise...the egg breaks or it does
not.
If it doesthen u have to move linearly from first floor. till x-1
floor..Max attempts reqd. = x
If it does not break.take a jump of x-1 because ur number of attempts
has already increased by1. .
s(s+1)/2 must be close to 100.
The best possible number is 14.
try from 14th floor.
next from 14+13th floor.
next from 14+13+12th floor.
Worest case number of attempts = 14.
Best Regards,
T V Thirumala Reddy
Engineer, Qualcomm India Private Ltd.
1540C30, 15th Floor, Building #9, Mindspace, H
@tiru and @aseem: explanation pls...!
On Wed, Jul 6, 2011 at 11:11 PM, TIRU REDDY wrote:
> 14
>
> On 6 Jul 2011 22:35, "shiv narayan" wrote:
>
>
> * You are given 2 eggs.
> * You have access to a 100-storey building.
> * Eggs can be very hard or very fragile means it may break if dropped
> fro
14
On 6 Jul 2011 22:35, "shiv narayan" wrote:
* You are given 2 eggs.
* You have access to a 100-storey building.
* Eggs can be very hard or very fragile means it may break if dropped
from the first
floor or may not even break if dropped from 100 th floor.Both eggs are
identical.
* You need to
@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.
To post to this
Just to let you guys know it's a good legitimate problem with no trick
answer. People who don't know the solution should try.
On Wed, Jul 6, 2011 at 10:44 PM, Tushar Bindal wrote:
> Eggs can never break the building.
> So dropping the eggs won't break the building - whether you drop them from
> 1
14 attempts
Aseem
On Wed, Jul 6, 2011 at 10:44 PM, Tushar Bindal wrote:
> Eggs can never break the building.
> So dropping the eggs won't break the building - whether you drop them from
> 1st floor or 100th floor.
>
>
> On Wed, Jul 6, 2011 at 10:42 PM, Sriganesh Krishnan <2448...@gmail.com>wrot
Eggs can never break the building.
So dropping the eggs won't break the building - whether you drop them from
1st floor or 100th floor.
On Wed, Jul 6, 2011 at 10:42 PM, Sriganesh Krishnan <2448...@gmail.com>wrote:
> i think this puzzle follows arithmetic progression...i'm not sure
> though...does
100th floor is the answer
On Wed, Jul 6, 2011 at 10:35 PM, shiv narayan wrote:
>
> * You are given 2 eggs.
> * You have access to a 100-storey building.
> * Eggs can be very hard or very fragile means it may break if dropped
> from the first
> floor or may not even break if dropped from 100 th f
i think this puzzle follows arithmetic progression...i'm not sure
though...does anybody have a clean explanation for this?
On Wed, Jul 6, 2011 at 10:35 PM, shiv narayan wrote:
>
> * You are given 2 eggs.
> * You have access to a 100-storey building.
> * Eggs can be very hard or very fragile means
* You are given 2 eggs.
* You have access to a 100-storey building.
* Eggs can be very hard or very fragile means it may break if dropped
from the first
floor or may not even break if dropped from 100 th floor.Both eggs are
identical.
* You need to figure out the highest floor of a 100-storey bui
Let speed of boat be x miles/hr
Let speed of river be s miles/hr
First Method:
Hat comes down 1 mile in 10 minutes.
Hat comes with flow of river only. So its speed is equal to speed of river.
In 60 minutes, it will travel 6 miles.
thus, s = 6 miles/hr
Second Method:
Distance travelled upward by b
Hi,
A son and father goes for boating in river upstream . After
rowing for 1 mile son notices the hat of his fathe falling in the
river.After 5 min. he tells his father that his hat has fallen. So they turn
round and are able to pick the hat at the point from where they began
boating af
thanx guys
On Wed, Jul 6, 2011 at 2:40 PM, udit sharma wrote:
> (5*5)+(!5)/(5+5) and (((5+5)/5)^5)+5
>
> --
> Regards
> UDIT
> DU- MCA
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algog
(5*5)+(!5)/(5+5) and (((5+5)/5)^5)+5
--
Regards
UDIT
DU- MCA
--
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+uns
On Wed, Jul 6, 2011 at 1:23 PM, amit the cool wrote:
>Can you make a target number 37 by using five 5s? You can
> use any
> math operator as you want. There are at least two different ways.
> 5 5 5 5 5
>
> (((5+5)/5)^5)+5
((10/5)^5)+5
(2^5)+5
32+5=37
> --
> You received this
Can you make a target number 37 by using five 5s? You can use
any
math operator as you want. There are at least two different ways.
5 5 5 5 5
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send ema
All the nine digits are arranged here so as to form four square numbers:
9 81 324 576
How would you put them together so as to form single smallest possible
square number and a single largest possible square number..
139854276 and 923187456 are the answers given eve
3 mice .
On Sun, Jun 26, 2011 at 6:13 PM, ArPiT BhAtNaGaR <
arpitbhatnagarm...@gmail.com> wrote:
> 3
>
>
> On Mon, Jun 27, 2011 at 2:10 AM, amit the cool wrote:
>
>> There are 6 beer bottle nd one is poisoned. we have mice who will die
>> within 14 hrs after drinkin poisned beer. In 24 hrs we hav
3
On Mon, Jun 27, 2011 at 2:10 AM, amit the cool wrote:
> There are 6 beer bottle nd one is poisoned. we have mice who will die
> within 14 hrs after drinkin poisned beer. In 24 hrs we have to find
> poisoned beer bottle. How many no of mice we require to find out
> poisoned bottle.
>
> --
> You
There are 6 beer bottle nd one is poisoned. we have mice who will die
within 14 hrs after drinkin poisned beer. In 24 hrs we have to find
poisoned beer bottle. How many no of mice we require to find out
poisoned bottle.
--
You received this message because you are subscribed to the Google Groups
*Puzzle Digest Of The Week 6th-June to 10th June*
*
*
*
http://dailybrainteaser.blogspot.com/2011/06/find-next-number-in-series-10-june.html?lavesh=lavesh
*
*
*
*
http://dailybrainteaser.blogspot.com/2011/06/secret-code-puzzle-9-june.html?lavesh=lavesh
*
*
*
*
http://dailybrainteaser.blogspot.com/2
A helicopter drops two trains, each on a parachute, onto a straight
infinite railway line. There is an undefined distance between the two
trains. Each faces the same direction, and upon landing, the parachute
attached to each train falls to the ground next to the train and detaches.
Each train has
*Hi*
*
*
*Puzzle Digest Of The Week 23May - 27May*
*
http://dailybrainteaser.blogspot.com/2011/05/akbar-birbal-tale-27-may.html?lavesh=lavesh
*
*
*
*
http://dailybrainteaser.blogspot.com/2011/05/mystery-puzzle-sherlock-holmes-26-may.html
?**lavesh=lavesh*
*
*
*
http://dailybrainteaser.blogspot.com
Is it the minimum required matches to ensure for semifinals?
On Fri, May 27, 2011 at 6:06 AM, Rishabh Maurya wrote:
> suppose bottom 4 teams have won least matches and upper 4 teams have won
> equal number of matches ...
>
> 1 -> x
> 2 -> x
> 3 -> x
> 4 -> x
>
> 5 -> 6
> 6 -> 4
> 7 -> 2
> 8 ->
suppose bottom 4 teams have won least matches and upper 4 teams have won
equal number of matches ...
1 -> x
2 -> x
3 -> x
4 -> x
5 -> 6
6 -> 4
7 -> 2
8 -> 0
total matches are 56
and let upper four teams have won x matches each
so x = (56-(6+4+2+0))/4
x = 11
so in this way to ensure qualific
could you please explain how?
On Fri, May 27, 2011 at 3:45 AM, varun pahwa wrote:
> i think 11.
>
> On Fri, May 27, 2011 at 3:06 PM, Arpit Mittal wrote:
>
>> 8?
>>
>>
>> On Fri, May 27, 2011 at 2:26 AM, anil chopra
>> wrote:
>>
>>> 11
>>>
>>> On Fri, May 13, 2011 at 12:14 AM, amit wrote:
>>>
>>
i think 11.
On Fri, May 27, 2011 at 3:06 PM, Arpit Mittal wrote:
> 8?
>
>
> On Fri, May 27, 2011 at 2:26 AM, anil chopra wrote:
>
>> 11
>>
>> On Fri, May 13, 2011 at 12:14 AM, amit wrote:
>>
>>> Consider a series in which 8 teams are participating. each team plays
>>> twice with all other teams.
8?
On Fri, May 27, 2011 at 2:26 AM, anil chopra wrote:
> 11
>
> On Fri, May 13, 2011 at 12:14 AM, amit wrote:
>
>> Consider a series in which 8 teams are participating. each team plays
>> twice with all other teams. 4 of them will go to the semi final.How
>> many matches should a team win, so th
11
On Fri, May 13, 2011 at 12:14 AM, amit wrote:
> Consider a series in which 8 teams are participating. each team plays
> twice with all other teams. 4 of them will go to the semi final.How
> many matches should a team win, so that it will ensure that it will go
> to semi finals.?
>
> --
> You
*Hi*
*
*
*Puzzle Digest Of The Week 16May - 20May*
*
*
*
http://dailybrainteaser.blogspot.com/2011/05/logic-riddle-20-may.html?lavesh=lavesh
*
*
*
*
http://dailybrainteaser.blogspot.com/2011/05/is-this-maths-riddle-19-may.html
?**lavesh=lavesh*
*
*
*
http://dailybrainteaser.blogspot.com/2011/05/gr
everyone ,plz post some solution or explanation..
--
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...@googlegrou
534 is the correct answer
On Fri, May 20, 2011 at 8:47 AM, Bhavesh agrawal wrote:
>
>
> 1 elephant can take 1000 banana at a time and eat 1 banana after each 1km
> travel.
> total bananas are 3000 and distance have to travel from A to B is 1000km.
>
> So how many max bananas he can take from A to
@piyush: how???
On Sat, May 21, 2011 at 12:19 AM, Piyush Sinha wrote:
> 500
>
> On 5/20/11, Bhavesh agrawal wrote:
> > 1 elephant can take 1000 banana at a time and eat 1 banana after each 1km
> > travel.
> > total bananas are 3000 and distance have to travel from A to B is 1000km.
> >
> > So ho
500
On 5/20/11, Bhavesh agrawal wrote:
> 1 elephant can take 1000 banana at a time and eat 1 banana after each 1km
> travel.
> total bananas are 3000 and distance have to travel from A to B is 1000km.
>
> So how many max bananas he can take from A to B. (he'll eat in return
> travel too)
>
> -
1 elephant can take 1000 banana at a time and eat 1 banana after each 1km
travel.
total bananas are 3000 and distance have to travel from A to B is 1000km.
So how many max bananas he can take from A to B. (he'll eat in return
travel too)
--
You received this message because you are subscribed
Each team plays a total of 14 matches. Top 50% teams(4 out of 8) qualify for
the semis.
Thus, u must win more than 50% matches to be sure to get into semis. Thus, 8
is the answer.
On Fri, May 13, 2011 at 12:14 AM, amit wrote:
> Consider a series in which 8 teams are participating. each team play
*Hi*
*Puzzle Digest Of The Week 9May - 13May*
*
http://dailybrainteaser.ablogspot.com/2011/05/fun-math-puzzle-13-may.html?lavesh=lavesh
*
*
*
*http://dailybrainteaser.blogspot.com/2011/05/who-is-shortest-12-may.html?**
lavesh=lavesh*
*
*
*http://dailybrainteaser.blogspot.com/2011/05/fun-teaser-1
Consider a series in which 8 teams are participating. each team plays
twice with all other teams. 4 of them will go to the semi final.How
many matches should a team win, so that it will ensure that it will go
to semi finals.?
--
You received this message because you are subscribed to the Google G
If you had 5,623 participants in a tournament, how many games would
need to be played to determine the winner
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 numbe
Same prog for both the robots:
*Label1 : Go left*
* Skip next if oil in my path*
* Go to Label1*
*Label2 : Go left*
* Go left*
* Go to Label2*
Both robots go left with speed one move per 3 second.
After one of them finds an oil spot in its way
Two robots are placed at different points on a straight line of
infinite length. When they are first placed down, they each spray out
some oil to mark their starting points.
You must program each robot to ensure that the robots will eventually
crash into each other. A program can consist of the f
u can find more explanation here:
http://www.techinterview.org/post/526370758/100-doors-in-a-row
On Tue, Feb 8, 2011 at 12:52 PM, sunny agrawal wrote:
> finally all square number gates will be open
>
>
> On Wed, Feb 9, 2011 at 2:10 AM, bittu wrote:
>
>> There are N doors in a row numbered from 1
finally all square number gates will be open
On Wed, Feb 9, 2011 at 2:10 AM, bittu wrote:
> There are N doors in a row numbered from 1 to N. Initially all are
> closed.
> Then you make N passes by the N doors. In pass 1 you toggle the all
> the doors (1,2,3,4)starting from the first door. In
There are N doors in a row numbered from 1 to N. Initially all are
closed.
Then you make N passes by the N doors. In pass 1 you toggle the all
the doors (1,2,3,4)starting from the first door. In the second
pass you toggle every second door(2,4,6,8,...). In the third pass you
toggle all third do
This is an altogether different one in the same scenario. You have to
make 125 packets of sugar with first one weighing 1 kg, second 2 kg,
third 3 kg etc ...and 125th one weighing 125kg.You can only use one
pan of the common balance for measurement for weighing sugar, the
other pan had to be used f
he takes 10 card from the piles and reverse .
so there are two piles
1. 42
2.10
there are 10 cases possible
1. out of 10 cards in second pile all are down in it and all up card are in
other pile than you simply reverse the second pile.
2. out of 10 cards in second pile all are down except one
Hi Bhavesh,
Blind man has to create two piles of his own so he dont know which pile have
how much up face cards
Thanks & Regards,
Rajiv Podar
On Thu, Feb 3, 2011 at 10:42 AM, Bhavesh agrawal wrote:
> IS FACING UP CARDS ARE RANDOMLY DISTRIBUTED IN THE PILE
>
> On Thu, Feb 3, 2011 at 9:
IS FACING UP CARDS ARE RANDOMLY DISTRIBUTED IN THE PILE
On Thu, Feb 3, 2011 at 9:02 AM, Ricky wrote:
> Hi,
>
> I have come up with one interesting puzzle so I thought of discussing
> with you guys:
>
> "A blind man is given deck of 52 cards with 10 card facing up and rest
> are facing down.
These are quite old puzzles buddy. He take 10 cards from the pile and
reverse them. SOLVED
Thanks and regards,
Gajendra Dadheech
On Thu, Feb 3, 2011 at 9:02 AM, Ricky wrote:
> Hi,
>
> I have come up with one interesting puzzle so I thought of discussing
> with you guys:
>
> "A blind man is gi
Hi,
I have come up with one interesting puzzle so I thought of discussing
with you guys:
"A blind man is given deck of 52 cards with 10 card facing up and rest
are facing down. He need to create two piles not necessarily of same
height in order to have same number of up cards in both."
I would p
(9*9-1)/(9-1)
On Thu, Jan 27, 2011 at 4:55 PM, nishaanth wrote:
> (91-1)/9
>
>
> On Wed, Jan 26, 2011 at 11:07 PM, Apoorve Mohan wrote:
>
>> 9 + 1 - ( 1 / 9 )
>>
>>
>> On Wed, Jan 26, 2011 at 10:29 PM, satish wrote:
>>
>>> 19-(9/1).
>>>
>>> --
>>> You received this message because you are subs
(91-1)/9
On Wed, Jan 26, 2011 at 11:07 PM, Apoorve Mohan wrote:
> 9 + 1 - ( 1 / 9 )
>
>
> On Wed, Jan 26, 2011 at 10:29 PM, satish wrote:
>
>> 19-(9/1).
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, se
9 + 1 - ( 1 / 9 )
On Wed, Jan 26, 2011 at 10:29 PM, satish wrote:
> 19-(9/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 unsubscribe from this group, send e
19-(9/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 unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this gro
is it neccesary to use all four operators or we can use any combination??
i mean...can we use an operator twice??
On Wed, Jan 26, 2011 at 7:42 PM, may.I.answer wrote:
> You have four numbers 1 , 1 , 9 ,9 .
> Now using these four and operator + , - , * ,/ and parentheses(if
> required) your hav
11-(9/9)
On Wed, Jan 26, 2011 at 7:42 PM, may.I.answer wrote:
> You have four numbers 1 , 1 , 9 ,9 .
> Now using these four and operator + , - , * ,/ and parentheses(if
> required) your have to get 10.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorith
You have four numbers 1 , 1 , 9 ,9 .
Now using these four and operator + , - , * ,/ and parentheses(if
required) your have to get 10.
--
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
just try to make first row and first column zero with minimum no of moves.
after they have become zero , check in matrix for any remaining on state. it
there is on state , then it is impossible else , that you have done it.
On Tue, Jan 4, 2011 at 4:40 PM, Ankur Khurana wrote:
> it's exactly the
it's exactly the same question as Buttons on codechef. search this forum ,
it have been discussed before
On Tue, Jan 4, 2011 at 4:13 PM, bittu wrote:
> There is a lock which is an N by N grid of switches. Each switch can
> be in one of two states (on/off). The lock is unlocked if all the
> switc
There is a lock which is an N by N grid of switches. Each switch can
be in one of two states (on/off). The lock is unlocked if all the
switches are on. The lock is built in such a way that, if you toggle
some switch, all the switches in its row and its column toggle too
Give an algorithm which, gi
@swayambhoo:
ofcourse a cubical room must me symmetrical at allcorners, Hence, neway it
will reach in
min_dis=sqrt((4+3)^2+5^2)=8.6
--
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.co
See attached pdf for understanding the second part.
On Fri, Dec 31, 2010 at 10:24 AM, swayambhoo jain wrote:
> Sorry I was wrong on the second question :
> Correct answer is : depending on the corner in which the ant is answers can
> be :
>
> sqrt( (3+5)^2 + 4^2 ) or sqrt( (4+5)^2 + 3^2 )
>
>
>
Sorry I was wrong on the second question :
Correct answer is : depending on the corner in which the ant is answers can
be :
sqrt( (3+5)^2 + 4^2 ) or sqrt( (4+5)^2 + 3^2 )
On Fri, Dec 31, 2010 at 10:08 AM, swayambhoo jain wrote:
> 1) do two coin tosses :
>
> head , head --> 1st dessert
> head
1) do two coin tosses :
head , head --> 1st dessert
head , tail ---> 2nd dessert
tail , head ---> 3rd dessert
if coin is biased... you can do in three coin tosses :
tail , head , head --> 1st dessert
head, tail , head --> 2nd dessert
head, head , tail --> 3rd dessert
2) sqrt(9+16+25) = 5sqrt(2)
in case the coin is not biased, we can flip the coin twice and define the
rules as if {H,H} comes then ignore it i.e. dont take it as a flip and the 3
other events would be valid onces and could occur with equal probabilities.
In case of a biased coin please specify the probability of getting head
At a restaurant, how can Veronica choose one out of three desserts
with equal probability with the help of a coin? What if the coin is
biased and the bias is unknown?
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send
There are two robot standing on two ends of a line, somewhere on the line
there is a point and I need to make both robot reach that point. Same
program is running in both robots. Only instruction allowed is : Move Left,
Move Right, Am I on point. Tell how both the robots will meet.
--
You receive
You have a DNA string that you wish to analyze. Of particular interest
is which intervals of the string represent individual genes. You have
a number of "gene predictions", each of which assigns a score to an
interval within the DNA string, and you want to find the subset of
predictions such that t
This is classical problem of dynamic programming.
step-1: For each cell, calculate the possibility of knight (horse)
staying inside chess board after 1 step.
For example: corner cells will have possibility of 2/8.
Now, for each cell maintain valid steps (i.e. where all it can step..)
step-2: Now
On a empty chessboard, a horse starts from a point( say location x,y)
and it starts moving randomly, but once it moves out of board, it cant
come inside. So what is the total probability that it stays within the
board after N steps.
--
You received this message because you are subscribed to the G
yes even i dont think its possible as there is no n-1th state..ie there is
no state from whr u can come to 2 8 5..so plz check
On 7 June 2010 20:23, mohit ranjan wrote:
> is it possible ?
>
> if we say nth state is [2, 8, 5]
>
> I could not find possible (n-1)th state
>
>
> Mohit Ranjan
>
>
>
>
is it possible ?
if we say nth state is [2, 8, 5]
I could not find possible (n-1)th state
Mohit Ranjan
On Mon, Jun 7, 2010 at 2:02 PM, sharad wrote:
> : Three containers are of 15,10 and 6 ltrs capacity. Initially its in
> configuration (15,0,0). Make it to configuration (2,8,5)
>
> --
> Yo
: Three containers are of 15,10 and 6 ltrs capacity. Initially its in
configuration (15,0,0). Make it to configuration (2,8,5)
--
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
place the L block diagonally...
--Sundeep.
On Sun, Jun 6, 2010 at 7:29 PM, sharad wrote:
> A square Island surrounded by bigger square, and in between there is
> infinite depth water. The distance between them is L. The wooden
> blocks of L are given.
> The L length block can't be placed in be
There are N nuts and N bolts, all unique pairs od Nut and Bolt
You cant compare Nut with Nut.
You cant compare Bolt with Bolt
You CAN compare Nut with Bolt
Now how would you figure out matching pairs of nut and bolt from the
given N nut and Bolt.
The basic soln is O(N^2). Give O(NlogN soln)
--
Yo
A square Island surrounded by bigger square, and in between there is
infinite depth water. The distance between them is L. The wooden
blocks of L are given.
The L length block can't be placed in between to cross it, as it will
fall in water (just fitting).
How would you cross using these L length b
Three beauty pageant finalists-Cindy, Amy and Linda-The winner was
musician. The one who was not last or first was a math major. The one
who came in third had black hair. Linda had red hair. Amy had no
musical abilities. Who was first?
(A) Cindy (B) Amy (C) Linda (D) None of these
--~--~-~
Hi,
Can somebody help me with this puzzle? I tried to solve it but couldn't.
Puzzle 1
Weighing marbles
Given are 12 marbles. One of these marbles is slightly heavier or
lighter than the others. You have a two plate scale. You are allowed
to weigh three times.
Can you find the marble that differ
101 - 200 of 202 matches
Mail list logo
