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 (From Team 1)
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..please
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 - 7,12,11,10
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 the
Dream teams are formed by television viewers by selecting five players from
the sixteen players namely
F1,F2,F3,F4,F5,F6,F7,F8,F9,F10,F11,F12,F13,F14,F15 and F16.The players
belong to exactly one of the three teams namely Chelsea,Liverpool and
United.Every Dream Team must have two players each
great observation
thanks!!
On Wed, Feb 29, 2012 at 10:31 PM, Anurag atri anu.anurag@gmail.com wrote:
@shady:
Observation only ..
On Wed, Feb 29, 2012 at 9:03 PM, shady sinv...@gmail.com wrote:
anurag how did you reach that solution ?
can you elaborate...
On Wed, Feb 29, 2012 at
nth term : (n! + 2^n - n)
On Wed, Feb 29, 2012 at 11:05 AM, Vaibhav Mittal
vaibhavmitta...@gmail.comwrote:
Ntn else is provided..??
On Feb 28, 2012 12:51 PM, Gaurav Popli abeygau...@gmail.com wrote:
Given a sequance of natural numbers.
Find N'th term of this sequence.
a1=2, a2=4, a3=11,
anurag how did you reach that solution ?
can you elaborate...
On Wed, Feb 29, 2012 at 8:11 PM, Anurag atri anu.anurag@gmail.comwrote:
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
@shady:
Observation only ..
On Wed, Feb 29, 2012 at 9:03 PM, shady sinv...@gmail.com wrote:
anurag how did you reach that solution ?
can you elaborate...
On Wed, Feb 29, 2012 at 8:11 PM, Anurag atri anu.anurag@gmail.comwrote:
nth term : (n! + 2^n - n)
On Wed, Feb 29, 2012 at 11:05
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
{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,
Ntn else is provided..??
On Feb 28, 2012 12:51 PM, Gaurav Popli abeygau...@gmail.com 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...
--
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
Algorithm Geeks group.
To post to this group, send email to
66,68,70
On Mon, Feb 27, 2012 at 6:54 PM, karthikeya s karthikeya.a...@gmail.com 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
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 karthikeya.a...@gmail.com
wrote:
3, 39, 41, 43, 45, 49, 51, 53, 55, 64, ?, ?, ...
(These are successive numbers sharing a common property.
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
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 received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
A family has several children. every boy has as many brothers as
sisters. Every gal has twice as many brothers as sisters. How many
childrens are there in family?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
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
Assume that you have just heard of a scandal and you are the first one
to know. You pass it on to four person in a matter of 30 minutes. Each
of these four in turn passes it to four other persons in the next 30
minutes and so on.
How long it will take for everybody in the World to get to know the
There is a room with a door (closed) and three light bulbs. Outside
the room there
are three switches, connected to the bulbs. You may manipulate the
switches as
you wish, but once you open the door you can't change them. Identify
each switch
with its bulb.
--
You received this message because
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,
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
+1 amit..
On Sun, Sep 4, 2011 at 4:15 AM, tarun kumar taruniit1...@gmail.com 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.
21
On Sat, Aug 20, 2011 at 5:16 PM, Nikhil Gupta nikhilgupta2...@gmail.comwrote:
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
Refer to the problem 3 of http://www.trytwi.com/twi4.html.
Sanju
:)
On Sat, Aug 20, 2011 at 7:07 AM, Naman Mahor naman.ma...@gmail.com wrote:
21
On Sat, Aug 20, 2011 at 5:16 PM, Nikhil Gupta
nikhilgupta2...@gmail.comwrote:
Each side of a given polygon is parallel to either the X or
@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,
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
--
You
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
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 because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To
was there anything more specified
Regards,
PAYAL GUPTA
On Fri, Aug 19, 2011 at 3:29 AM, Aditya Virmani virmanisadi...@gmail.comwrote:
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
M (hint: replace ü and û with their actual meaning.. u 'll understand)
On Fri, Aug 19, 2011 at 4:10 AM, payal gupta gpt.pa...@gmail.com wrote:
was there anything more specified
Regards,
PAYAL GUPTA
On Fri, Aug 19, 2011 at 3:29 AM, Aditya Virmani
virmanisadi...@gmail.comwrote:
the word half was so confusing in the ques!! :(
On 5 August 2011 00:24, Himanshu Srivastava himanshusri...@gmail.comwrote:
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,
Put 0 in the first well and see the magic. :P
Aseem
On Sun, Aug 7, 2011 at 6:50 PM, mani sharma monadh...@nsitonline.in wrote:
the word half was so confusing in the ques!! :(
On 5 August 2011 00:24, Himanshu Srivastava himanshusri...@gmail.comwrote:
oh ok..thankshalf
h nikhil how are you
On Thu, Aug 4, 2011 at 3:57 PM, Nikhil Gupta nikhilgupta2...@gmail.comwrote:
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'
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,
@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
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.
--
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
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
@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
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
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 tower there is a peg where u can tie a rope. You have a rope
of length 150 mt. with you and using this rope you have to get down
the tower. you can not jump or
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 double the quantity of its input (of which half is
kept inside the well,
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
87.5 %
On Thu, Aug 4, 2011 at 10:39 PM, Nikhil Gupta nikhilgupta2...@gmail.comwrote:
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
@sagar:please explain..
On Thu, Aug 4, 2011 at 11:59 PM, sagar pareek sagarpar...@gmail.com wrote:
87.5 %
On Thu, Aug 4, 2011 at 10:39 PM, Nikhil Gupta
nikhilgupta2...@gmail.comwrote:
There are 3 magical wells. Any input quantity of water we provide the 1st
well is returned double (of
Explain please.
On Fri, Aug 5, 2011 at 12:01 AM, Kamakshii Aggarwal
kamakshi...@gmail.comwrote:
@sagar:please explain..
On Thu, Aug 4, 2011 at 11:59 PM, sagar pareek sagarpar...@gmail.comwrote:
87.5 %
On Thu, Aug 4, 2011 at 10:39 PM, Nikhil Gupta
nikhilgupta2...@gmail.comwrote:
@nikhil:how did you get 87.5%??
On Thu, Aug 4, 2011 at 11:59 PM, sagar pareek sagarpar...@gmail.com wrote:
87.5 %
On Thu, Aug 4, 2011 at 10:39 PM, Nikhil Gupta
nikhilgupta2...@gmail.comwrote:
There are 3 magical wells. Any input quantity of water we provide the 1st
well is returned
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 sagarpar...@gmail.comwrote:
87.5 %
On Thu, Aug 4, 2011 at 10:39 PM, Nikhil Gupta
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
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 mohit89m...@gmail.com wrote:
can't we tie the rope where
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 sagarpar...@gmail.com wrote:
double 87.5 gives you 175
100 will be used by 1st well and 75 will
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.
Can anyone plz tell me
1. how to get a fair result from a unfair coin?
2. How to use a fair coin to get unfair result?
--
Prateek Gupta
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
On Sun, Jul 31, 2011 at 12:24 PM, prateek gupta prateek00...@gmail.com 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
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 shubh2...@gmail.com wrote:
answer is:
1 hr 20 mins.
But i don't know how to arrive at the solution.
help anyone..
--
You received
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 priya888g...@gmail.comwrote:
@ SkRiPt...
can u pl
@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 1 1
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
The problem is finding the subspaces that satisfy two conditions in the 6*6
total space?
2011/7/28 vetri natarajananitha...@gmail.com
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
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 is free from his work. But today he finished
his work early and left the office at 05:30 PM. As his driver was not
Insufficient data to calculate what you need to find out !!!
On Thu, Jul 28, 2011 at 9:39 PM, shubham shubh2...@gmail.com 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
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
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
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
Can some tell me the solution of this question??
5. Given an array all of whose elements are positive numbers, find the
maximum sum of a subsequence with the constraint that no 2 numbers in the
sequence should be adjacent in the array.
Eg.
i) 3 2 7 10 should return 13 (sum of 3 and 10)
ii) 3 2
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
can you please send me the code snippet to get a better understanding.
On Fri, Jul 29, 2011 at 9:51 AM, ankit sambyal ankitsamb...@gmail.comwrote:
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
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
thanks ankit.
On Fri, Jul 29, 2011 at 9:59 AM, ankit sambyal ankitsamb...@gmail.comwrote:
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]
--
@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 ankitsamb...@gmail.comwrote:
1. Make an array S equal to the length of the given array where
S[0] = a[0] and
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 product of all elements of all rows is 1
can u pls post the answer if u no...
--
You received this message because
(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,
@ 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
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
yaa..
On Tue, Jul 19, 2011 at 1:35 PM, alagammai narayanan
alagamma...@gmail.comwrote:
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
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 kool.arc...@gmail.comwrote:
yaa..
On Tue, Jul 19, 2011 at 1:35 PM, alagammai narayanan
alagamma...@gmail.com wrote:
Yep.. Its German.. Were you guys able to
Question :-
Once upon a time in ancient times there was a king who was very fond of
wines. He had a huge cellar, which had 1000 different varieties of wine all
in different caskets (1000 caskets in all). In the adjoining kingdom there
was a queen who was envious of the king’s huge wine
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
flowers
doubles up, and he picks y flowers out of them and goes to offer it to
Lord Ram. By the
16x=15y. Multiple solutions. Actually Infinite.
On 19 July 2011 23:58, shiv narayan narayan.shiv...@gmail.com 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
any value satisfying 16x=15y.
On Wed, Jul 20, 2011 at 12:14 AM, Saket Choudhary sake...@gmail.com wrote:
16x=15y. Multiple solutions. Actually Infinite.
On 19 July 2011 23:58, shiv narayan narayan.shiv...@gmail.com wrote:
There is a temple, whose premises have a garden and a pond. It has 4
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
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 with the same digits in reverse order.After another
hour the driver sees another milestone containing the same two digits.
What is the average
http://www.geekinterview.com/question_details/56715
I think you missed zero :)
On Thu, Jul 14, 2011 at 12:20 AM, shiv narayan
narayan.shiv...@gmail.com 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
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
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 sharmaudit...@gmail.comwrote:
Ans should be 45km/hr. :)
--
Regards
UDIT
DU- MCA
--
You received this
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 options,
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 subscribed to the
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 to
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 ab.abhish...@gmail.comwrote:
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,...
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
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,
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
210 for the last one you posted
On Sat, Jul 9, 2011 at 4:33 PM, amit the cool amitthecoo...@gmail.comwrote:
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
91,110,134161 i guess
6,24,60,120210
On Sat, Jul 9, 2011 at 5:46 PM, Aman Goyal aman.goya...@gmail.com wrote:
210 for the last one you posted
On Sat, Jul 9, 2011 at 4:33 PM, amit the cool amitthecoo...@gmail.comwrote:
6,24,60,120,_
--
You received this message because you are
91,110,134,..163 ...
6,24,60,120..210
On Sat, Jul 9, 2011 at 6:48 PM, Yogesh Yadav medu...@gmail.com wrote:
91,110,134161 i guess
6,24,60,120210
On Sat, Jul 9, 2011 at 5:46 PM, Aman Goyal aman.goya...@gmail.com wrote:
210 for the last one you posted
On Sat, Jul 9, 2011 at 4:33
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 vaibhav200...@gmail.comwrote:
91,110,134,..163 ...
6,24,60,120..210
On Sat, Jul 9, 2011 at 6:48 PM, Yogesh Yadav
is it
6,24,60,120,210,336,.. ?
On Sat, Jul 9, 2011 at 4:03 AM, amit the cool amitthecoo...@gmail.comwrote:
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
6,24,60,120,210,240..
On Sun, Jul 10, 2011 at 3:29 AM, Abhishek Soni ab.abhish...@gmail.comwrote:
is it
6,24,60,120,210,336,.. ?
On Sat, Jul 9, 2011 at 4:03 AM, amit the cool amitthecoo...@gmail.comwrote:
6,24,60,120,_
--
You received this message because you are subscribed to the
1 - 100 of 180 matches
Mail list logo
