Software Engineer Interview Questions

Aziz V. - "ArrayList allows constant time access (O(1)) to elements using their index because it uses a dynamic array internally, whereas LinkedList requires traversal from the head node, resulting in linear time complexity (O(n))."See full answer

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

Relynn may silver B. - "import java.util.Arrays; import java.util.stream.Collectors; class Main { // Recursive function to print all combinations of numbers from \i\ to \n\ // having sum \n. The index\ denotes the next free slot in the output array \out\ public static void printCombinations(int i, int n, int[] out, int index) { // if the sum becomes n, print the combination if (n == 0) { System.out.println(Arrays.stream(out).limit(index) .boxed().collect(Collectors.toList())); } // start from the previous e"See full answer

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

Shar N. - "standard answer for this."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