En una entrevista para un puesto de desarrollador Java, prepárate para responder preguntas técnicas destinadas a evaluar tus conocimientos básicos de Java. El posible que también te formulen preguntas abiertas para evaluar tus habilidades de programación y de resolución de problemas. Prepárate para afrontar preguntas no técnicas centradas en tus habilidades de comunicación interpersonal, de organización del tiempo y de ética en el trabajo.
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.
C++ comprehension question
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.
How will you prevent unauthorized access to your website if someone tries to directly open the homepage following the login page via the url?
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.
Avreage level questions in aptiude and programing.
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.
Viewing 1841 - 1850 interview questions