Skip to contentSkip to footer

Software Development Interview Questions

Salaries
Interviews

37,302 software development interview questions shared by candidates

They don't have any respect for you and value for your time, first of all the interviewee did not join on time - waited for him for 12 mins, then he started with basic java questions & programs, It was going well and all in mid he decided to leave saying i am done with it, Totally a waste of time.
avatar

Software Development Engineer In Test

Interviewed at Unifytech

3.9★
May 17, 2022

They don't have any respect for you and value for your time, first of all the interviewee did not join on time - waited for him for 12 mins, then he started with basic java questions & programs, It was going well and all in mid he decided to leave saying i am done with it, Totally a waste of time.

Find the Evil Monsters Problem Description Given an array A of N elements representing the monsters and an array B of Q elements representing the heroes. The i-th type of monster is represented by A[i][0], A[i][1] and A[i][2] which means a monster of the i-th type is present at each integer co-ordinate from A[i][0] to A[i][1] and having a strength of A[i][2]. The i-th type of her is represented by B[i][0] and B[i][1] which means a hero of strength B[i][1] will appear at the integer point B[i][0] after i seconds. When the i-th her appears it will destroy each and every monster present at B[1][0] and having a strength less than B[i][1]. For each i you have to determine the number of monsters left after the i-th hero has completed their task. Problem Constraints 1 <= N <= 105 1 <= Q <= 105 1 <= A[i][0] <= A[i][1] <= 105 1 <= B[i][0] <= 105 1 <= A[i][2] <= 105 1 <= B[i][1] <= 105 Input Format The first argument is an array A. The second argument is an array B. Output Format Return a list of integers
avatar

Software Development Engineer (SDE)

Interviewed at Trilogy Innovations

4.1★
May 18, 2023

Find the Evil Monsters Problem Description Given an array A of N elements representing the monsters and an array B of Q elements representing the heroes. The i-th type of monster is represented by A[i][0], A[i][1] and A[i][2] which means a monster of the i-th type is present at each integer co-ordinate from A[i][0] to A[i][1] and having a strength of A[i][2]. The i-th type of her is represented by B[i][0] and B[i][1] which means a hero of strength B[i][1] will appear at the integer point B[i][0] after i seconds. When the i-th her appears it will destroy each and every monster present at B[1][0] and having a strength less than B[i][1]. For each i you have to determine the number of monsters left after the i-th hero has completed their task. Problem Constraints 1 <= N <= 105 1 <= Q <= 105 1 <= A[i][0] <= A[i][1] <= 105 1 <= B[i][0] <= 105 1 <= A[i][2] <= 105 1 <= B[i][1] <= 105 Input Format The first argument is an array A. The second argument is an array B. Output Format Return a list of integers

Viewing 1101 - 1110 interview questions

Glassdoor has 37,302 interview questions and reports from Software development interviews. Prepare for your interview. Get hired. Love your job.