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, experience,,, actually normal interview questions
Coding questions in python language
dynamic programming for online test
Online Assessment with algorithm/coding problems.
Coin tossing that required a mathematical proof of the sequence of probabilities it generates.
Algorithm to count the strongly connected components in a graph
Imagine you needed to write some code to perform this function. Write that function.
Previous and recent projects / researches
Viewing 3311 - 3320 interview questions