If I give you an array of integers, L, and another integer, s, can you write a program to find out whether there exists a *pair* of integers in L which sum up to s. What's the time complexity of this program? Can you find a faster version? Example: L = [8,4,7,1,4], s = 11. In this case, the program should return true since 7 + 4 = 11.
Tell me a little bit about yourself.
Round 1: 6 OA problems 40 minutes which had probability and linear algebra. Being familiar with matrix manipulation, Poisson PDF, recursion relations is more than enough. Round 2: 30 min CV review and motivation as to why QR rather than doing research in academia. Next 30 minutes: 4 probability/brain-teaser/linear algebra/market making. The probability/brainteaser problems are of style that are seen in dynamic programming i.e. recursive relation but no live coding was asked.
Martingales, probability, Linear Algebra.
(1st round HR) What do you know about our company?
Steps tetrahedron, expectations
What is the minimal natural number that ends with digit 4 such that moving its last digit to the first position (i.e. 1234 => 4123) increases it exactly fourfold? Answer:___
C questions (1h): mainly guess what will the ouput of some code C++ questions (1h): questions about the phylosophy of C++ Quant questions (2h If I remember well): typical but you have between 3-5 min for each problems ! You need to be well trained (like you just finish university)
Triangle ABC has sides of length 45, 60 and 75. A point X is placed randomly and uniformly inside the triangle. What is the expected value of the sum of perpendicular distance from point X to this triangle’s three sides
The expectation of rolling the dice and get 2 consecutive 6
Viewing 491 - 500 interview questions