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
4 programming problems using Java or Python
Questions about probability, statistical model, algorithm on white board
Coding qs were based on : Matching parentheses, Prime factorization, fair dice expected value when rolled n times.
Not applicable to this circumstance.
1. Threads and processes 2. Algorithm complexity 3. The output of a particular module 4. Coding: check whether a sting containing (),[],{} are balanced or not 5. Coding: The expected payoff of a dice game 6. Coding: cannot remember.
Some arithmetic questions in the math test
The factor of 3 and 5
Calculate the sum of all even numbers from 0 to 100.
Viewing 9491 - 9500 interview questions