Alphagrep

Role: Not Specified

College: Not Specified

Interview Date: January 21, 2020

Interview Type: Not Specified

Result: Rejected

Difficulty: Not Specified

Rounds: 1 Online Test, 1 Codepair Round

Topics Asked: Graph Algorithms (DFS, Union-Find), Projects, Socket Programming, Buffer Management

Experience:

This candidate's experience with AlphaGrep Securities involved an online technical test and a codepair round, after which they were not shortlisted for further rounds.

Round 1: Online test - Technical (60 min, 2 questions) The test was conducted on HackerRank.

• Question 1: Given N palaces and M tunnels (Ai, Bi, Ri), determine if all N palaces can be connected by a set of tunnels for minimum total distance. The solution involved checking if all nodes are connected using DFS.
• Question 2: Given N palaces and M tunnels, determine if a sub-graph of size at least K exists where all nodes are connected, and print the size of the maximum such sub-graph (else 0). The candidate attempted DFS, but suggested Union-find algorithm as the probable solution.

Round 2: Codepair round (Telephone call) This round involved questions about the projects the candidate had worked on. A coding question was given to read data via sockets and manage writing data 50 bytes at a time, which involved buffer management.