Software engineers write programs to design and develop computer software. Interviews are highly technical, so come ready to work through coding problems and math brainteasers. The specific questions you are asked will depend on what type of programming position you are looking for. Try researching a specific software discipline such as web development, application development, or system development.
1) Problem-solving which includes pattern matching. 2) Greedy algorithm two dimensions array question of hard level which was impossible to complete in 75 mins 3) Finding complexity ( Multiple choose question ) 4) HashMap easy ( Multiple choose question ) I all most did all the question and I got rejected. I don't know on what criteria they rejected me.
Two parachutist are dropped in a dense forest. A railroad is in the middle of the forest. What instructions would you give to the parachutists so that they may meet each other?
Basically questions asked are on the coding round what you have done in 2nd round.
Analzying the following code and answer the complexity of this algorithm public String getString() String s= ""; for(int i =0 ; i < LARGE_NUMBER ; i++) { s += "a"; } return s; }
Write a function that implements division without dividing or multiplying.
Calculate the angle between a minute and hour hands in a clock.
You are in charge of a classroom which has n seats in a single row, numbered 0 through n-1. During the day students enter and leave the classroom for the exam. In order to minimize the cheating, your task is to efficiently seat all incoming students. You're given 2 types of queries: add_student(student_id) -> seat index, and remove_student(student_id) -> void. The rules for seating the student is the following: 1) The seat must be unoccupied 2) The closest student must be as far away as possible 3) Ties can be resolved by choosing the lowest-numbered seat.
Write codes for the Nth Fibonacci number.
From an arbitrary list of integers, find all pairs that equal zero.
Given a nested list of integers, return the sum of all integers in the list weighted by their depth For example, given the list {{1,1},2,{1,1}} the function should return 10 (four 1's at depth 2, one 2 at depth 1)
Viewing 1361 - 1370 interview questions