Alphagrep

Alphagrep Hiring Process

Pay and Duration

Pay: 4.50L/month

Duration: 8-10 weeks

OA

Q1

Given a tree, with each node possessing a value, find the subset of nodes with maximum sum such that no node is an ancestor of another in the subset.

Q2

Similar to this

Q3

Q4

Given a tree of n nodes with each node having a value between 1 and n inclusive. Each node has a unique value. The values of the nodes are displaced such that no node possesses it's original value. Find the maximum and minimum sum of displacements of all the nodes. Displacement of a node is defined as the distance between the node which now possesses the original value of the node.