Engineer Ii Interview Questions

9,766 engineer ii interview questions shared by candidates

Craft Round - Design a backend application with all the parameters, APIs, test cases, optimized logic, DB connections, queries, caching, logging etc 1st Round - Questions on craft round , a small presentation on DB design, LLD. Code improvements, we should be very thorough of our choices of DB and every line of code. 2nd Round - Again changes in Craft demo only, Implementing the changes in API response, like custom api responses and then a question on Dynamic programming
avatar

Software Development Engineer (SDE) II

Interviewed at Intuit

4.2
Apr 28, 2024

Craft Round - Design a backend application with all the parameters, APIs, test cases, optimized logic, DB connections, queries, caching, logging etc 1st Round - Questions on craft round , a small presentation on DB design, LLD. Code improvements, we should be very thorough of our choices of DB and every line of code. 2nd Round - Again changes in Craft demo only, Implementing the changes in API response, like custom api responses and then a question on Dynamic programming

There are some villages near a city in India that have yet to be connected to the city via road. Some villages are connected to each other via road and some aren’t. A village is said to be connected to the city if one can travel from that village to the city via any road. The cost of making a road between a city and a village and that of between a village and another village is the same and equal to 1 unit. Find the minimum cost the government must bear in order to connect all the villages to the city. Input: N: number of villages. Matrix: M[N+1][N+1] where 0 to N-1 indexes represents a village and the Nth index represents a city. M[x][y] = M[y][x] = 1 if there is a road between x and y.
Oct 22, 2020

There are some villages near a city in India that have yet to be connected to the city via road. Some villages are connected to each other via road and some aren’t. A village is said to be connected to the city if one can travel from that village to the city via any road. The cost of making a road between a city and a village and that of between a village and another village is the same and equal to 1 unit. Find the minimum cost the government must bear in order to connect all the villages to the city. Input: N: number of villages. Matrix: M[N+1][N+1] where 0 to N-1 indexes represents a village and the Nth index represents a city. M[x][y] = M[y][x] = 1 if there is a road between x and y.

Viewing 9351 - 9360 interview questions

Glassdoor has 9,766 interview questions and reports from Engineer ii interviews. Prepare for your interview. Get hired. Love your job.