Software Engineer 1 Interview Questions

3,915 software engineer 1 interview questions shared by candidates

Assume there exists an employee table. An employee reports to a manager. Given such a table, how will store the data in table such that, i can get hierarchy of an employee till CEO in a single query. For example if an employee is a software engineer. Assume his hierarchy would be upto CEO can be manager -> VP -> CEO. Tell an efficient way to store the above data, so that hierarchy can be retrieved in a single step.
avatar

Software Development Engineer-1

Interviewed at Freshworks

3.4
Mar 24, 2018

Assume there exists an employee table. An employee reports to a manager. Given such a table, how will store the data in table such that, i can get hierarchy of an employee till CEO in a single query. For example if an employee is a software engineer. Assume his hierarchy would be upto CEO can be manager -> VP -> CEO. Tell an efficient way to store the above data, so that hierarchy can be retrieved in a single step.

There is a network consisting of ‘n’ nodes. These ‘n’ nodes are connected using ‘n-1’ number of cables, to keep the entire network connected. N = 6 Edges = [{2,3},{3,4},{4,5},{5,6},{1,5}] Unfortunately, one of these nodes is infected by a malicious virus, which modifies the contents stored in a particular node, and to all nodes separated upto a distance ‘d’ from the corrupted source-node. D = 3 You know information about some of the nodes which are corrupted. This is an array of size M. M = 2. Affected Nodes = [1,2] There is exactly one node where the virus infestation would have taken place. Find all the possible nodes on which the virus infestation might have taken place. Assume input is such that the answer is always present.
avatar

SDE 1

Interviewed at Confluent

3.6
Sep 26, 2025

There is a network consisting of ‘n’ nodes. These ‘n’ nodes are connected using ‘n-1’ number of cables, to keep the entire network connected. N = 6 Edges = [{2,3},{3,4},{4,5},{5,6},{1,5}] Unfortunately, one of these nodes is infected by a malicious virus, which modifies the contents stored in a particular node, and to all nodes separated upto a distance ‘d’ from the corrupted source-node. D = 3 You know information about some of the nodes which are corrupted. This is an array of size M. M = 2. Affected Nodes = [1,2] There is exactly one node where the virus infestation would have taken place. Find all the possible nodes on which the virus infestation might have taken place. Assume input is such that the answer is always present.

Viewing 3611 - 3620 interview questions

Glassdoor has 3,915 interview questions and reports from Software engineer 1 interviews. Prepare for your interview. Get hired. Love your job.