BrickRed Interview Questions, Process, and Tips

So we consider the 2nd statement first. We can form an equation out of it.
14x-6=13y+3=9z+3
Using this, we can understand that the multiple of 14 and the multiple of 13 and 9 must have a difference of 9. The easiest way to ensure that is multiplying it by 9
14*9=126
13*9=117
If the 5th farmer gives 3 apples to the 4th farmer, they would have 123 and 120 apples respectively. However, we also know that the 2nd farmer has 117 apples (13*9=117, and this is a multiple of 9) if the 5th farmer gives 3 apples too the 2nd farmer, the 3rd, 4th and 5th farmers would have 120 apples each.
Now that we got 120, we should check if the first part of the question makes sense along with it. The equation would be
7a+1=11b-1=120
We know that 11*11=121 and 7*17=119. When we add 1 to 119 and subtract 1 from 121, we get 120 for each. In this way, all the farmers have 120 apples each.
Therefore, the 3rd farmer had a yield of 11 per tree and the 4th farmer had a yield of 9 per tree.

2hrs

40
simple logic, Check Option Lets father present age = 40 so it full fill all condition like his son age become 10 and after five years it will become 15 and father age is 45 and it full fill second condition that fathers age is thrice as old as the son after 5 years

4/5

C.1175

Answer: 3121 gold coins
Let total no of coins be M
Let the disbursement D to each son:

D1 = 1 + (M – 1)/5 = (M + 4)/5
D2 = 1 + ( M – D1 -1)/5 = (D1) * 4/5
D3= (D2) * 4/5
D4= (D3) * 4/5
D5= (D4) * 4/5
Total disbursements to sons=
= ∑D= (M+4)*1/5[ 1+4/5+(4/5)(4/5)+ (4/5)(4/5)(4/5)+(4/5)(4/5)(4/5)(4/5) ]
= (2101/3125)*(M+4)
Thus balance left for daughters =M-{(2101/3125)*(M+4)}
=(1024M-8404)/3125
This balance should be a positive integer ( assuming M and all disbursements are full coins )
Thus 1024M-8404 should be a multiple of 3125….so….
1024M – 8404 = N*3125 where N is an integer
Using Python code:
n=int(input(“Enter num n: “))
X=int()
a=int()
a=0
X=’ ‘
for a in range(0,n+1):
a=a+1
X= (3125*a + 8404)/1024
if (3125*a + 8404)% 1024== 0:
print(X,a)
Enter num n: 10000
3121.0 1020
6246.0 2044
9371.0 3068
12496.0 4092
15621.0 5116
18746.0 6140
21871.0 7164
24996.0 8188
28121.0 9212
We get minimum value of N = 1021 and M = 3121 gold coins

The greatest number that will divide 187, 233 and 279 leaving the same remainder in each case.

To find : The number ?

Solution :

First we find the difference between these numbers.

The required numbers are

233-187=46

279-233=46

279-187=92

Now, We find the HCF of 46 and 92.

Therefore, The required largest number is 46.

B, 8mm x 5 mm = 40 mm^2
1000mm x 1000mm = 1,000,000mm^2
= 1,000,000 mm^2/40mm^2
= 25,000