Skip to contentSkip to footer

Software Developers Interview Questions

Salaries
Interviews

96,395 software developers interview questions shared by candidates

The questions were given a time frame of 1 hour in total and were as follows: (30 marks)User inputs N trucks and M coins in the first line. Then the user input price and ID of trucks separated by space in next N lines. Display the ID of the max trucks the user can buy using his coins. If 2 trucks have same price, the user will buy the one with bigger ID. Sample input: 4 5 5 3 4 2 3 4 2 5 The user has inputted that there are 4 trucks to buy from and he has 5 coins. Then the truck with ID 3 has price 5, truck with ID 2 has price 4, truck with ID 4 has price 3, truck with ID 5 has price 2. Expected output: 4 5 Explanation: The truck with ID 4 has price 3 coins and truck with ID 5 has 2 coins, every other bus combination gets him lesser trucks so he can buy a max of 2 trucks of ID 4, 5 totalling 5 coins.
avatar

Software Developer

Interviewed at BlackBuck

3.4★
Dec 16, 2017

The questions were given a time frame of 1 hour in total and were as follows: (30 marks)User inputs N trucks and M coins in the first line. Then the user input price and ID of trucks separated by space in next N lines. Display the ID of the max trucks the user can buy using his coins. If 2 trucks have same price, the user will buy the one with bigger ID. Sample input: 4 5 5 3 4 2 3 4 2 5 The user has inputted that there are 4 trucks to buy from and he has 5 coins. Then the truck with ID 3 has price 5, truck with ID 2 has price 4, truck with ID 4 has price 3, truck with ID 5 has price 2. Expected output: 4 5 Explanation: The truck with ID 4 has price 3 coins and truck with ID 5 has 2 coins, every other bus combination gets him lesser trucks so he can buy a max of 2 trucks of ID 4, 5 totalling 5 coins.

You are given a maze with N cells. Each cell may have multiple entry points but not more than one exit (ie. entry/exit points are unidirectional doors like valves). The cells are named with an integer value from 0 to N-1. You need to find the the length of the largest cycle in the maze. Return -1 if there are no cycles. INPUT FORMAT First line has the number of cells N Second line has list of N values of the edge[] array. edge[i] contains the cell number that can be reached from of cell ‘i’ in one step. edge[i] is -1 if the ‘i’th cell doesn’t have an exit. OUTPUT FORMAT largest sum among all cycles Sample input: 23 4 4 1 4 13 8 8 8 0 8 14 9 15 11 -1 10 15 22 22 22 22 22 21 Sample output 6 I have already tried to do this with DFS to find all possible cycles and print the largest cycle size. Please let me know if there is any better solution for the same.
avatar

Software Developer

Interviewed at JUSPAY

4★
Oct 18, 2019

You are given a maze with N cells. Each cell may have multiple entry points but not more than one exit (ie. entry/exit points are unidirectional doors like valves). The cells are named with an integer value from 0 to N-1. You need to find the the length of the largest cycle in the maze. Return -1 if there are no cycles. INPUT FORMAT First line has the number of cells N Second line has list of N values of the edge[] array. edge[i] contains the cell number that can be reached from of cell ‘i’ in one step. edge[i] is -1 if the ‘i’th cell doesn’t have an exit. OUTPUT FORMAT largest sum among all cycles Sample input: 23 4 4 1 4 13 8 8 8 0 8 14 9 15 11 -1 10 15 22 22 22 22 22 21 Sample output 6 I have already tried to do this with DFS to find all possible cycles and print the largest cycle size. Please let me know if there is any better solution for the same.

Viewing 901 - 910 interview questions

Glassdoor has 96,395 interview questions and reports from Software developers interviews. Prepare for your interview. Get hired. Love your job.