Software development is an in-demand career path, and it's also a job that can provide opportunities for high earnings and professional fulfillment. When interviewing for software developer positions, you'll likely face questions about your hard and soft skills and how you manage projects efficiently.
There are one hundred closed lockers in a hallway. A man begins by opening all one hundred lockers. Next, he closes every second locker. Then he goes to every third locker and closes it if it is open or opens it if it is closed (e.g., he toggles every third locker). After his one hundredth pass in the hallway, in which he toggles only locker number one hundred, how many lockers are open?
Given a list of strings, determine if there are any anagrams. What is the running time of your algorithm?
how will you find a circular link list which has a loop in it.
Classic one from them: You have an array and you want to find the first non-repeating element.
If you have all the companies that are traded, and live inputs are coming of which company is being traded and what is the volume, how do you maintain the data, so that you can carry out operation of giving the top 10 most traded companies by volume of shares most efficiently.
unsorted integer array size n. unmodifiable list of "less than" / "greater than" operators. place elements from int array in between each "<" and ">" operator so that every comparison holds true. e.g. 6, 2, 8, 1, 3, 9, 4, 0, 5, 7 <, >, <, <, <, >, <, >, > answer: 0 < 9 > 1 < 2 < 3 < 8 > 4 < 7 > 6 > 5
Implement a function to raise a number to an exponent using your language of choice.
Write a program that given a 2D integer matrix (default value: 0) and a coordinate in the matrix, it sets all of the elements diagonal to the coordinate to a value of 1 (so that if you wrote it on a piece of paper there's an X with the coordinate at the center).
There are 20 floors in a building. I step into the elevator with 5 other people. What is the probability that I do not have to press my button? (ie someone else chooses the same floor as me)
#1: We have a linked list, but it is special in that it can have pointers down, as well as next. Any node can have an arbitrary number of links down as well as across. Write a function that will "flatten" this linked list so that it does not have any down pointers, but all elements remain in order.
Viewing 851 - 860 interview questions