Ya your rite Anmol . 4th was wrong i guess.. incomplete question.
On Tuesday, 29 January 2013 12:58:07 UTC+5:30, Anmol Dhar wrote:
>
> Answer:
> 1)-> (4)
> 2)--> (2)
> 3)---> (a)
> 4)> doubt, for which team match fees you are asking?
> 5)> (b)
> Correct me if i'm wrong.
Thanks Varun :)
On Wednesday, 30 January 2013 11:21:35 UTC+5:30, varun pahwa wrote:
>
> Hi,
> Look at team Team7. F2,F9,F12,F14,F15.
> => F12 -> Chelsa.
> C -> 7,12
> L -> 2,9
> and 14,15 not from liverpool.
> Now, look at Team 6.
> So,
> C -> 7,12
> L -> 3,6,2,9
> U -> 15 , 1
Answer:
1)-> (4)
2)--> (2)
3)---> (a)
4)> doubt, for which team match fees you are asking?
5)> (b)
Correct me if i'm wrong..please don't reply with answers if i'm
incorrect... wanna give one more shot! ;)
--
You received this message because you are subscribed to
Hi,
Look at team Team7. F2,F9,F12,F14,F15.
=> F12 -> Chelsa.
C -> 7,12
L -> 2,9
and 14,15 not from liverpool.
Now, look at Team 6.
So,
C -> 7,12
L -> 3,6,2,9
U -> 15 , 1 (From Team 1)
Team 2 -> 11 & 13 not from liverpool.
Team 3 -> 11 & 5 not from liverpool
Team 5 => 11 from C
So,
C ->
@anuraggood logic dude..
On Fri, Mar 2, 2012 at 10:26 AM, Gaurav Popli wrote:
> great observation
> thanks!!
>
> On Wed, Feb 29, 2012 at 10:31 PM, Anurag atri
> wrote:
>> @shady:
>> Observation only ..
>>
>> On Wed, Feb 29, 2012 at 9:03 PM, shady wrote:
>>>
>>> anurag how did you
great observation
thanks!!
On Wed, Feb 29, 2012 at 10:31 PM, Anurag atri wrote:
> @shady:
> Observation only ..
>
> On Wed, Feb 29, 2012 at 9:03 PM, shady wrote:
>>
>> anurag how did you reach that solution ?
>> can you elaborate...
>>
>>
>> On Wed, Feb 29, 2012 at 8:11 PM, Anurag atri
>> w
@shady:
Observation only ..
On Wed, Feb 29, 2012 at 9:03 PM, shady wrote:
> anurag how did you reach that solution ?
> can you elaborate...
>
>
> On Wed, Feb 29, 2012 at 8:11 PM, Anurag atri wrote:
>
>> nth term : (n! + 2^n - n)
>>
>>
>> On Wed, Feb 29, 2012 at 11:05 AM, Vaibhav Mittal <
>> vaib
anurag how did you reach that solution ?
can you elaborate...
On Wed, Feb 29, 2012 at 8:11 PM, Anurag atri wrote:
> nth term : (n! + 2^n - n)
>
>
> On Wed, Feb 29, 2012 at 11:05 AM, Vaibhav Mittal <
> vaibhavmitta...@gmail.com> wrote:
>
>> Ntn else is provided..??
>> On Feb 28, 2012 12:51 PM, "Ga
nth term : (n! + 2^n - n)
On Wed, Feb 29, 2012 at 11:05 AM, Vaibhav Mittal
wrote:
> Ntn else is provided..??
> On Feb 28, 2012 12:51 PM, "Gaurav Popli" wrote:
>
>> Given a sequance of natural numbers.
>>
>> Find N'th term of this sequence.
>>
>> a1=2, a2=4, a3=11, a4=36, a5=147, a6=778 ... ... .
Ntn else is provided..??
On Feb 28, 2012 12:51 PM, "Gaurav Popli" wrote:
> Given a sequance of natural numbers.
>
> Find N'th term of this sequence.
>
> a1=2, a2=4, a3=11, a4=36, a5=147, a6=778 ... ... ... ... aN.
>
>
> this is a coding quesn and O(n) soln is also welcome...
>
> --
> You rece
{39,41,43,45}incremented by 2
{49,51,53,55}incremented by 2
{64,?,?,?}
first number in each set is considered as base number.
3 is for the number of numbers in each set other than base number.
so in final set base number is 64 and other 3 numbers are incremented by 2.
On Tue, Feb 28, 2012
one option cud be reverse the digits...i.e
(bt the first n d last do not satisfy d pattern howeva)
93 , 14,34,54,94,15,35,35,55
an increment is applied to the last 4th no each tme...
not very sure if its crckt...
Regards,
PAYAL GUPTA
On Tue, Feb 28, 2012 at 12:48 PM, Kartik Sachan wrote:
> I t
I think logic is the difference is
2 2 4 2 2 2 8 so next will be 2 2 2 2 2 16
so ans will be 66 68 70
but first number 3 making some problem
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@go
logic ?
On Tue, Feb 28, 2012 at 11:16 AM, srikanth reddy malipatel <
srikk...@gmail.com> wrote:
> 66,68,70
>
> On Mon, Feb 27, 2012 at 6:54 PM, karthikeya s
> wrote:
> > 3, 39, 41, 43, 45, 49, 51, 53, 55, 64, ?, ?, ...
> > (These are successive numbers sharing a common property. No math or
> > o
66,68,70
On Mon, Feb 27, 2012 at 6:54 PM, karthikeya s wrote:
> 3, 39, 41, 43, 45, 49, 51, 53, 55, 64, ?, ?, ...
> (These are successive numbers sharing a common property. No math or
> outside knowledge is needed.)
>
> --
> You received this message because you are subscribed to the Google Groups
and why is that related to algorithms anyway?
from [1]
"""
To further highlight the difference between a problem and an instance,
consider the following instance of the decision version of the
traveling salesman problem: Is there a route of length at most 2000
kilometres passing through all of Ge
+1 amit..
On Sun, Sep 4, 2011 at 4:15 AM, tarun kumar wrote:
> can we open the door twice(with the condition that once the door is opened
> switch can't be manipulated).? if not ,It is riddle rather an algorithmic
> question and the above written answer seems to be right.
>
> --
> You received
can we open the door twice(with the condition that once the door is opened
switch can't be manipulated).? if not ,It is riddle rather an algorithmic
question and the above written answer seems to be right.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Ge
1) on one switch for some time .
then , off that switch.
2) Now on a switch , and open the door.
the bulb which is on , that is for that switch .
earlier on switch will be for that bulb ,which is hot .
and the third switch will be for that bulb which coolest
On Sun, Sep 4, 2011 at 12:30 PM, 9i
Refer to the problem 3 of http://www.trytwi.com/twi4.html.
Sanju
:)
On Sat, Aug 20, 2011 at 7:07 AM, Naman Mahor wrote:
> 21
>
>
> On Sat, Aug 20, 2011 at 5:16 PM, Nikhil Gupta
> wrote:
>
>> Each side of a given polygon is parallel to either the X or the Y axis. A
>> corner of such a polygo
21
On Sat, Aug 20, 2011 at 5:16 PM, Nikhil Gupta wrote:
> Each side of a given polygon is parallel to either the X or the Y axis. A
> corner of such a polygon is said to be convex if the internal angle is 90o or
> concave if the internal angle is 270o. If the number of convex corners in
> such a
Note that in the answer above, the table given is of the form:
If condition is truethen what predicate is true
-----
M - married N - not married
N - married L - not married
L - not married M -
M - married N - not married
N - married L - not married
L - not married - M - married
When M is married and L and N are not married. This does not violate any
condition but you have only 1 of the 3 people married.
When N is married, by condition (2) L is not married which implies M is
married (
this qn is copy pastewd as it is...no further instructions etc provided
On Fri, Aug 19, 2011 at 6:06 PM, priya ramesh <
love.for.programm...@gmail.com> wrote:
> i think the question should be elaborated a li'l more. Plz give the
> sentences given in the puzzle. May be we cud solve then
>
> --
>
i think the question should be elaborated a li'l more. Plz give the
sentences given in the puzzle. May be we cud solve then
--
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 un
@prem... what if only M is married? if m is married, n is not married that
says L may or may not be married. If L is not married, that gives for M may
or may not be married.
For only N to be married, L is not married, that says M may or may not be
married.
& same does apply for L.
On Fri, Aug 19,
Only N is Married.. as if L is not married that n Must be married .. Again
for M to marry N must not Marry. but as N is Married.. so.. M cannot
marry...
On Fri, Aug 19, 2011 at 9:24 AM, Dheeraj Sharma wrote:
> M and N are married
>
>
> On Fri, Aug 19, 2011 at 5:19 AM, Abhishek Sharma
> wrote:
M and N are married
On Fri, Aug 19, 2011 at 5:19 AM, Abhishek Sharma wrote:
> M (hint: replace ü and û with their actual meaning.. u 'll understand)
>
>
> On Fri, Aug 19, 2011 at 4:10 AM, payal gupta wrote:
>
>> was there anything more specified
>> Regards,
>> PAYAL GUPTA
>>
>>
>> On Fri
M (hint: replace ü and û with their actual meaning.. u 'll understand)
On Fri, Aug 19, 2011 at 4:10 AM, payal gupta wrote:
> was there anything more specified
> Regards,
> PAYAL GUPTA
>
>
> On Fri, Aug 19, 2011 at 3:29 AM, Aditya Virmani
> wrote:
>
>> If ü - Married
>> û - Not Married a
was there anything more specified
Regards,
PAYAL GUPTA
On Fri, Aug 19, 2011 at 3:29 AM, Aditya Virmani wrote:
> If ü - Married
> û - Not Married and
> M-ü N-û
> N-ü L-û
> L-û M-ü
> Who is married?
>
> qn was put up in this way, asked in Deloitte 2004.
>
> --
> You received this message be
Put "0" in the first well and see the magic. :P
Aseem
On Sun, Aug 7, 2011 at 6:50 PM, mani sharma wrote:
> the word "half" was so confusing in the ques!! :(
>
>
> On 5 August 2011 00:24, Himanshu Srivastava wrote:
>
>> oh ok..thankshalf part which was kept inside the
>> well..
the word "half" was so confusing in the ques!! :(
On 5 August 2011 00:24, Himanshu Srivastava wrote:
> oh ok..thankshalf part which was kept inside the
> wellmeans well must be full..that is 100ok got it completely
> thank u:)
>
>
> On Fri, Aug 5, 2011 at 12:18 AM,
am i allowed to stand at the 100 m point?
--
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.
oh ok..thankshalf part which was kept inside the
wellmeans well must be full..that is 100ok got it completely
thank u:)
On Fri, Aug 5, 2011 at 12:18 AM, sagar pareek wrote:
> double 87.5 gives you 175
> 100 will be used by 1st well and 75 will be used by second
>
suppose u tie the rope at 200mt height and now climb down to 100m
heightthen u tie the rope at that point then how will you open the rope
at point above 200mt where u have tied it earlier
On Thu, Aug 4, 2011 at 11:15 PM, mohit verma wrote:
> can't we tie the rope where we are standing (at he
double 87.5 gives you 175
100 will be used by 1st well and 75 will be used by second
now second well will double the 75 and will give you 150
100 will be used by second and remainder 50 will forwarded to third
now third one use 50 and will double it to 100
no remainder left
i think its clear n
i mean @sagar:how did you get 87.5%??
On Fri, Aug 5, 2011 at 12:13 AM, Himanshu Srivastava <
himanshusri...@gmail.com> wrote:
> @nikhil:how did you get 87.5%??
>
> On Thu, Aug 4, 2011 at 11:59 PM, sagar pareek wrote:
>
>> 87.5 %
>>
>> On Thu, Aug 4, 2011 at 10:39 PM, Nikhil Gupta
>> wrote:
>>
>>
@nikhil:how did you get 87.5%??
On Thu, Aug 4, 2011 at 11:59 PM, sagar pareek wrote:
> 87.5 %
>
> On Thu, Aug 4, 2011 at 10:39 PM, Nikhil Gupta
> wrote:
>
>> There are 3 magical wells. Any input quantity of water we provide the 1st
>> well is returned double (of this double, half is kept inside
Explain please.
On Fri, Aug 5, 2011 at 12:01 AM, Kamakshii Aggarwal
wrote:
> @sagar:please explain..
>
>
> On Thu, Aug 4, 2011 at 11:59 PM, sagar pareek wrote:
>
>> 87.5 %
>>
>>
>> On Thu, Aug 4, 2011 at 10:39 PM, Nikhil Gupta
>> wrote:
>>
>>> There are 3 magical wells. Any input quantity of wat
@sagar:please explain..
On Thu, Aug 4, 2011 at 11:59 PM, sagar pareek wrote:
> 87.5 %
>
>
> On Thu, Aug 4, 2011 at 10:39 PM, Nikhil Gupta
> wrote:
>
>> There are 3 magical wells. Any input quantity of water we provide the 1st
>> well is returned double (of this double, half is kept inside the w
87.5 %
On Thu, Aug 4, 2011 at 10:39 PM, Nikhil Gupta wrote:
> There are 3 magical wells. Any input quantity of water we provide the 1st
> well is returned double (of this double, half is kept inside the well, and
> the other half is used as input to the 2nd well).
> The 2nd well also returns doub
can't we tie the rope where we are standing (at height of 200 meter)?
On Thu, Aug 4, 2011 at 10:26 PM, neeraja marathe <
neeraja.marath...@gmail.com> wrote:
> this was the puzzle asked to me in NVIDIA interview:
> you are standing on top of a tower of ht 200 mt. .At 100 mt. ht . from
> bottom of
Well acc to me the solution should be light the frst one on both ends(half
an hr)After rope one is completely burnt, fr the second one fold the rope in
the middle and then light it from both ends.it will take 15 minstotal 45
mins...please let me know if thr is any flaw in this
On Thu, Aug
@Nikhil : This question was asked to 2 people during Adobe interview on
Tuesdaythe above solutions are perfectly alright.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.google.com
Calibrate both the ropes and burn 1 rope from both ends. It will take half
an hour. Then note down the point where the rope fully burns out. Cut the
second rope at this point and fire both ends of any one of the pieces. This
will take 15 mins.
On Thu, Aug 4, 2011 at 4:54 PM, anubhav gupta wrote:
both ropes have to burn in one hour.. so if burn first rope at both ends it
wil definitely take 30 mins to burn completely no matter how non uniform
burning is.. when first rope burn out completly(after 30 mins) second rope
still have 30 mins left for complete burning so if it is burn at both ends
When the first rope is completely burnt after 30 minutes, the length of rope
2 remaining would be such that it would burn completely in the next 30
minutes, so if at this moment the rope 2 is lit at other end also, it will
burn completely in 15 min more, thereby giving a time of 45 min.
--
You
@priyanka, the ropes have a non uniform rate of burning. Means at some
duration they will be burning faster, and slower at some. So you cannot say
that first rope will take 30mins to burn completely, and by that time
second rope is half burnt.
>
>>
>> Nikhil Gupta
--
You received this message b
Lit the first rope on both the ends and simultaneously lit the second rope
on one end.
Now first rope will take 30mins to burn completely, and by that time second
rope is half burnt.
then lit the second end of 2nd rope which will burn for 15mins
so altogerther u can measure 45 mins
On Thu, Aug 4,
h nikhil how are you
On Thu, Aug 4, 2011 at 3:57 PM, Nikhil Gupta wrote:
> You have 2 identical ropes that burn in 1 hour (with non-uniform rate).
> How will you measure 45 minutes using them?
>
> --
> Nikhil Gupta
> Senior Co-ordinator, Publicity
> CSI, NSIT Students' Branch
> NSIT, New
On Sun, Jul 31, 2011 at 12:24 PM, prateek gupta wrote:
> Can anyone plz tell me
H = Head
T = Tail
> 1. how to get a fair result from a unfair coin?
since the probability of HT is the same as TH in two tosses, these two
events are equiprobable. If you get a HH or TT, repeat the experiment
until T
Thanks Pareek...
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/QW10bdF2oYMJ.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscri
check this out...
http://groups.google.com/group/algogeeks/browse_thread/thread/be213f8937b02858?hl=en#
On Thu, Jul 28, 2011 at 10:00 PM, shubham wrote:
> answer is:
>
> 1 hr 20 mins.
>
> But i don't know how to arrive at the solution.
>
> help anyone..
>
> --
> You received this message
@Aman : check this(same as ankit said) :
http://tech-queries.blogspot.com/2009/05/max-possible-sum-of-non-consecutive.html
On Fri, Jul 29, 2011 at 9:59 AM, ankit sambyal wrote:
> 1. Make an array S equal to the length of the given array where
> S[0] = a[0] and S[1] = max(a[0],a[1])
>
thanks ankit.
On Fri, Jul 29, 2011 at 9:59 AM, ankit sambyal wrote:
> 1. Make an array S equal to the length of the given array where
> S[0] = a[0] and S[1] = max(a[0],a[1])
>
> 2. for i:2 to n-1
>
> S[i] = max(S[i-2]+a[i], S[i-1])
>
> 3. return S[n-1]
>
> --
> You received
1. Make an array S equal to the length of the given array where
S[0] = a[0] and S[1] = max(a[0],a[1])
2. for i:2 to n-1
S[i] = max(S[i-2]+a[i], S[i-1])
3. return S[n-1]
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To
can you please send me the code snippet to get a better understanding.
On Fri, Jul 29, 2011 at 9:51 AM, ankit sambyal wrote:
> use the following recursive equation :
> S{i]=max(S[i-2]+a[i],S[i-1])
> S[0]=a[0]
> S[1]=max(a[0],a[1])
>
> S[size-1]is the required answer
>
> --
> You received this me
use the following recursive equation :
S{i]=max(S[i-2]+a[i],S[i-1])
S[0]=a[0]
S[1]=max(a[0],a[1])
S[size-1]is the required answer
--
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.co
answer is:
1 hr 20 mins.
But i don't know how to arrive at the solution.
help anyone..
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/-QFXfKOMKfIJ.
To p
That's what i was provided with in the interview. Somehow i know the answer,
but don't know how?
with the data provided above, you have to calculate the time it takes the
man to reach the office from his home on car.
--
You received this message because you are subscribed to the Google Groups
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
Insufficient data to calculate what you need to find out !!!
On Thu, Jul 28, 2011 at 9:39 PM, shubham wrote:
> A man leaves his office daily at 07:00 PM. His driver arrives with the car
> from home to his office at sharp 07:00 PM. So he doesn't need to wait for
> any transport medium as soon he
The problem is finding the subspaces that satisfy two conditions in the 6*6
total space?
2011/7/28 vetri
> given a 6x6 matrix with all the elements as either 1 or -1.
> find the number of ways the elements can b arranged such that
>
> 1.the product of all elements of all columns is 1
> 2.the pro
yes 2^((n-1)^2) is the answer :)
consider a row or column of size n, Number of ways it can we filled with 1's
and -1's(such that product is 1) is
sum of all nCi where i = 0,2,4. (i = no of -1s) and that will be 2^(n-1)
(same is the number when product is -1 )
so now let f(i,j) is the number of
@Hemlatha
this is one of the possible solution
the Question is to find Number of such solutions
On Thu, Jul 28, 2011 at 12:09 PM, Hemalatha <
hemalatha.amru...@googlemail.com> wrote:
> Give all the primary and secondary diagonal Elements a value -1 and the
> rest as 1s.
>
> -1 1 1 1 1 -1
> 1 -1
Give all the primary and secondary diagonal Elements a value -1 and the
rest as 1s.
-1 1 1 1 1 -1
1 -1 1 1 -1 1
1 1 -1 -1 1 1
1 1 -1 -1 1 1
1 -1 1 1 -1 1
-1 1 1 1 1 -1
Regards
Hemalatha
On Thu, Jul 28, 2011 at 11:29 AM, priyanka goel wrote:
> @ SkRiPt...
> can u pl explain ur ans?
>
> --
> Y
@ SkRiPt...
can u pl explain ur ans?
--
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 m
(nxn) => 2^((n-1)^2)
--
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, vi
x=15,y=16
x=15*2,y=16*2
x=15*n,y=16*n; (n=1,2,3,4,5,6,7,8..)
--
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
algogee
any value satisfying 16x=15y.
On Wed, Jul 20, 2011 at 12:14 AM, Saket Choudhary wrote:
> 16x=15y. Multiple solutions. Actually Infinite.
>
>
> On 19 July 2011 23:58, shiv narayan wrote:
>
>> There is a temple, whose premises have a garden and a pond. It has 4
>> idols, each of Ram, Shiv, Vishnu
16x=15y. Multiple solutions. Actually Infinite.
On 19 July 2011 23:58, shiv narayan wrote:
> There is a temple, whose premises have a garden and a pond. It has 4
> idols, each of Ram, Shiv, Vishnu and Durga. The priest plucks x
> flowers from the garden and places them in the pond. The number of
Can you please the explain the approach.. Would be very helpful... I dint
get it ...
On Tue, Jul 19, 2011 at 1:37 PM, archita monga wrote:
> yaa..
>
>
> On Tue, Jul 19, 2011 at 1:35 PM, alagammai narayanan <
> alagamma...@gmail.com> wrote:
>
>> Yep.. Its German.. Were you guys able to come up wit
yaa..
On Tue, Jul 19, 2011 at 1:35 PM, alagammai narayanan
wrote:
> Yep.. Its German.. Were you guys able to come up with the 5 * 5 matrix...
> As in who lives in which house?What does he drink,smoke etc..
>
>
> On Tue, Jul 19, 2011 at 1:31 PM, archita monga wrote:
>
>> German!
>>
>>
>> On Tue, J
Yep.. Its German.. Were you guys able to come up with the 5 * 5 matrix... As
in who lives in which house?What does he drink,smoke etc..
On Tue, Jul 19, 2011 at 1:31 PM, archita monga wrote:
> German!
>
>
> On Tue, Jul 19, 2011 at 1:22 PM, D!leep Gupta wrote:
>
>> Ans. *German*
>>
>> --
>> You rec
German!
On Tue, Jul 19, 2011 at 1:22 PM, D!leep Gupta wrote:
> Ans. *German*
>
> --
> 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 emai
Ans. *German*
--
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
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
Relation comes out as : y=6x
so x=1 ans y=6.
so 1st: "16" (say km)
2nd: "61"
3rd: "106"
av. speed=(106-16)/2=45 km/hr
On Thu, Jul 14, 2011 at 1:13 AM, Siddharth kumar <
siddhartha.baran...@gmail.com> wrote:
> 1st: "xy"
> 2nd: "yx"
> 3rd: "x0y"
>
> --
> You received this message because you are
1st: "xy"
2nd: "yx"
3rd: "x0y"
--
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 op
initially he saw say "xy" then he saw "yx" now what next does he
see...containing only x and y??
Please clarify your question..
On Thu, Jul 14, 2011 at 12:59 AM, udit sharma wrote:
>
> Ans should be 45km/hr. :)
>
> --
> Regards
> UDIT
> DU- MCA
>
> --
> You received this message because
Ans should be 45km/hr. :)
--
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+unsubscr...@go
http://www.geekinterview.com/question_details/56715
I think you missed zero :)
On Thu, Jul 14, 2011 at 12:20 AM, shiv narayan
wrote:
> A car is traveling at a uniform speed.The driver sees a milestone
> showing a 2-digit number. After traveling for an hour the driver sees
> another milestone wit
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
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 (
1 - 100 of 151 matches
Mail list logo