Skip to contentSkip to footer

Software Senior Interview Questions

Salaries
Interviews

99,670 software senior interview questions shared by candidates

1. experiences. 2. a graph related question as follows, later on I found out a tricky solution online. //problem: count islands in a graph // // A graph is a collection of nodes that are connected to each other with // edges. There are N nodes, numbered 1..N. and M edges. Each edge connects // two different node numbers. Here is an example graph with N= 8, M=6: // // 1---2---3 6 8 // | | | // 4---5 7 // // The goal is to count the number of islands in the graph. An island is a // graph of nodes that are connected only to themselves and not to any of the // other nodes in the graph. The above example has three islands. As a node // not connected to anything at all is regarded as it own island. // Implement the function IslandCount() below. The values N and M are passed // in, along with the array E which contains pairs of node numbers that are // connected by edges. The above example has E equal to // // E = { 1,2,2,3, 1,4, 2, 5, 4,5, 6, 7} // // IslandCount() should return the number of islands in the graph.
avatar

Senior Software Engineer

Interviewed at Nuro

4.2★
Jul 2, 2019

1. experiences. 2. a graph related question as follows, later on I found out a tricky solution online. //problem: count islands in a graph // // A graph is a collection of nodes that are connected to each other with // edges. There are N nodes, numbered 1..N. and M edges. Each edge connects // two different node numbers. Here is an example graph with N= 8, M=6: // // 1---2---3 6 8 // | | | // 4---5 7 // // The goal is to count the number of islands in the graph. An island is a // graph of nodes that are connected only to themselves and not to any of the // other nodes in the graph. The above example has three islands. As a node // not connected to anything at all is regarded as it own island. // Implement the function IslandCount() below. The values N and M are passed // in, along with the array E which contains pairs of node numbers that are // connected by edges. The above example has E equal to // // E = { 1,2,2,3, 1,4, 2, 5, 4,5, 6, 7} // // IslandCount() should return the number of islands in the graph.

Make a progress bar in vanilla JS with setInterval to kick it off. Then make 3 to kickoff at the same time. Then make them kick off at 3 different times (or end at different times). then use recursion to make them kick off one after the other sequentially.
avatar

Senior Front End Developer

Interviewed at Coursera

3.6★
Oct 10, 2021

Make a progress bar in vanilla JS with setInterval to kick it off. Then make 3 to kickoff at the same time. Then make them kick off at 3 different times (or end at different times). then use recursion to make them kick off one after the other sequentially.

Viewing 901 - 910 interview questions

Glassdoor has 99,670 interview questions and reports from Software senior interviews. Prepare for your interview. Get hired. Love your job.