Dynamic Programming problems in python. Find minimum number of groups of items in an array given certain specific constraints. String manipulation. All worded like real problems.
Quantitative Research Intern Interview Questions
3,500 quantitative research intern interview questions shared by candidates
Coin tossing that required a mathematical proof of the sequence of probabilities it generates.
Indep normal, conditional density on summation.
3 Questions. Programming, Math, Trading.
Output all permutations of size n.
Probability quizzes about dice throws
Problem Analysis: A k-star consists of a center node and up to k arms (edges to other nodes) We need to find the k-star with maximum sum of all its nodes For each potential center, we choose the best neighbors (up to k) to maximize sum Algorithm: Build an adjacency list from the edges For each node as a potential center: Get all its neighbors Sort neighbors by their values (descending) Select up to k best neighbors Calculate sum: center + selected neighbors Return the maximum sum found
flip a coin the expected number to get two H
Coding: Matrix spinning problem(90, 180, 270 degrees)
Algorithm to count the strongly connected components in a graph
Viewing 3301 - 3310 interview questions