assume you are writing number in ascending order to an array of constant size. once you reach the end of the array, you start writing from the beginning, thus writing over the oldest entries. write an algorithm for finding a specific number in this array.
Desarrollador Java Interview Questions
Desarrollador Java Interview Questions
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.
Preguntas de entrevista más frecuentes para desarrollador/a Java y cómo responderlas
Pregunta n.º 1: ¿Cuál es la diferencia entre HashTable y HashMap en Java?
Pregunta n.º 2: Escribe un programa para determinar si 243 es un número Armstrong.
Pregunta n.º 3: ¿Cómo lograrías elaborar código de calidad si tuvieras que simultanear varios proyectos Java?
710,038 desarrollador java interview questions shared by candidates
Determine whether the binary representation of a number if a palindrome or not, code it on a white board.
Describe a routine which returns the set of integers in {1..100} divisible without remainder by 3 but not by 9.
Write a program for odd input the pattern output will as below n=1 *-* n=3 ***** *** *---* *** *****
If a couple has two children, what is the probability that one is a girl and one is a boy?
1. sliding window algorithm 2. Why ZocDoc? Your interest match with the team and position. 3. System design question involving cache mechanism 4. triangle tree and some questions on threading mechanism
How many rotations does earth make on its axis while going around the sun for one year.
How many numbers between 1 and 1000 contain a 3?
Write a function that finds the median of a set of three numbers, also find the Big O. Can it be done with only 2 comparisons, or do you need 3?
Implement a function that takes the set-wise subtraction of two sorted sets of integers. ie A = {1, 2, 3}, B = {3, 4, 5} => A - B = {1, 2}. There can be duplicates, in which case all duplicates should be removed should there be an occurrence in B. IE: {1, 2, 3, 3, 3} - {2, 3} = {1}.
Viewing 121 - 130 interview questions