Find the maximum difference in an unsorted array with the index of max greater than min. array cant be sorted
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,420 desarrollador java interview questions shared by candidates
Given an array like [-1, 2, 3, 5, 4, 6] and it should print the 3 that is order of the array is equal to array element
Given a function for a fair coin, write a function for a biased coin that returns heads 1/n times (n is a param).
The first one is, given a tree, each node contains a digit. Calculate the sum of all numbers formed by paths from root to leaf. The second one is given a string, remove all 'b's and duplicate all 'a's.
How do you remove duplicates from an array of integers?
My 30 min coding question was related to tree where all nodes were managers each node has a value which was the number of months they worked.We have to find the maximum tenure which is I remember can be calculated using the average of its child nodes.
code a function that takes 2 parameters and an algorithm, print out all the numbers between the 2 parameters that completes the algorithm
In your opinion, what is our company's single most important metric?
(following the previous one) You got only TWO baby bottle sample. You would like to know the max height you can drop it without breaking the bottle. Let set the unit as 1 foot. And the highest height you can reach is at N feet. So how would you find the (max) safe height? (This is the one I think is kind of brain-teaser one.)
Write an algorithm to see if a tree is a BST.
Viewing 401 - 410 interview questions