Software Engineer Interview Questions

Mourya C. - "I try to solve this initially using quick select where will take a pivot element and position the remaining elements and check if the current index is answer or not and continue the same but it requires o(n*n), but interviewee is expecting the best from me, so at the end i tried solving using heaps where will check the difference between k and n-k to use min or max heap after that we will heap the array, and will keep popping the element k-1 and return the peek one which leads to answer."See full answer

Jazeel A. - "public int CountNumberOfSpace(string s){ int n = s.Length; for(int i=0;i<n;i++){ if(s[i]==' ')count++; } return count; }"See full answer

P D. - "Steps in booking (eg. movie ticket booking) User logs in User enters details User selects seats User adds meal options User enters payment method User completes payment Scenarios Which can happen agents corner the tickets and then sell them at premium Multiple users booking at the same time and get an error message at the end Money gets stuck and will be refunded later Load at the server and server crashes Multiple users get t"See full answer

Komal K. - "My experience with JavaScript is extensive and grounded in a deep understanding of both the language itself and the ecosystems built around it. I can work with modern JavaScript (ES6 and beyond), including concepts like arrow functions, destructuring, modules, promises, and async/await. I’m well-versed in core language features such as closures, the event loop, hoisting, scope, and prototype inheritance. Additionally, I can assist with both front-end and back-end development using popular framew"See full answer

Susmita S. - "Function that transforms each elements in a collection and returns new collection with transformed elements"See full answer

Aniket G. - "public class BoggleBoard { public static List findWords(char board, Set dictionary) { int rows = board.length; int cols = board[0].length; boolean visited = new booleanrows; int directions = {{1,0}, {-1,0}, {0,1}, {0,-1}}; List result = new ArrayList(); for(int i=0; i<rows; i++) { for(int j=0; j<cols; j++) { dfs(board, visited, i, j, dictionary, "", result, dire"See full answer

Shar N. - "standard answer for this."See full answer

Mohith J. - "Recursion: 0 if NULL, else 1+max(height(left), height(right))"See full answer

Anthony O. - "What excites me at work is being able to work on new and challenging projects where I have to be allowed to be creative and work with little supervision. I'm demotivated by that constant supervision and breathing down on one's neck every minute of the day."See full answer