Find the second largest element in array in O(n) time and O(1) space?
Software Specialist Interview Questions
1,464 software specialist interview questions shared by candidates
Maximum of a subarray in a given array. (Kadane's Problem) time complexity - O(N) Space Complexity - O(1)
They asked question from Algorithms, like searching and sorting algorithms
Introduce yourself. Basic intro to yourself
Directly started with a DSA question Based on stack https://www.geeksforgeeks.org/remove-all-duplicate-adjacent-characters-from-a-string-using-stack/
I was asked to explain the working principles and real-life applications of various data structures such as stacks, queues, linked lists, trees, and graphs. Furthermore, the interviewer presented me with coding problems, and I had to walk through my thought process while arriving at the solutions. They were interested not only in the correct answers but also in understanding how I approached problem-solving.
Leetcode medium to hard categary question
to code smallest next palindrome and 3rd largest number
I interviewed for a Specialist Programmer position at Infosys. The interview was conducted virtually from the Infosys Rushikonda campus. There was one panel member. He introduced himself and then asked me to introduce myself. After that, he gave me a DSA problem on the "next permutation." I solved it partially, and then he asked me to reduce the time complexity of my code. Afterward, he asked about B+ tree indexing, multithreading, deadlock, and the Single Responsibility Principle. Lastly, he asked if I had any questions.
Exception handling, pillars of oops with concrete examples, avl trees, linked lists
Viewing 1391 - 1400 interview questions