Skip to contentSkip to footer

Desarrollador Java Interview Questions

Salaries
Interviews

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

Question 1

Pregunta n.º 1: ¿Cuál es la diferencia entre HashTable y HashMap en Java?

How to answer
Respuesta recomendada: Los entrevistadores usarán preguntas técnicas para evaluar tu cualificación formal y tus conocimientos del lenguaje de programación Java. Aprovecha tu respuesta para exponer tus habilidades de comunicación. Aunque lleves años programando, quizás te convenga repasar tus nociones básicas de Java antes de la entrevista.
Question 2

Pregunta n.º 2: Escribe un programa para determinar si 243 es un número Armstrong.

How to answer
Respuesta recomendada: Usarán preguntas abiertas para poner a prueba tus habilidades de programación. Esta pregunta permite evaluar tu capacidad para resolver un problema utilizando un algoritmo de Java. Explica tu planteamiento mientras utilizas un editor de código o pizarra.
Question 3

Pregunta n.º 3: ¿Cómo lograrías elaborar código de calidad si tuvieras que simultanear varios proyectos Java?

How to answer
Respuesta recomendada: Los desarrolladores Java a menudo tienen que trabajar en varios proyectos a la vez. Las personas que realizan la entrevista utilizan preguntas como esta para poner a prueba tus habilidades organizativas y de gestión. Las empresas también intentan evaluar tu compromiso de calidad con tu trabajo. Si tienes experiencia como desarrollador, incluye ejemplos de tu experiencia profesional que demuestren tu capacidad para producir trabajo de calidad y para gestionar el tiempo de manera eficiente.

711,480 desarrollador java interview questions shared by candidates

Given a tree where every right node is a leaf, meaning that it can only extend on the left side, invert it such that the leftmost node is now the root, and all of the previous left nodes are now on the right side. The former right nodes will be on the left side.
avatar

Software Engineer

Interviewed at LinkedIn

3.8★
Oct 28, 2015

Given a tree where every right node is a leaf, meaning that it can only extend on the left side, invert it such that the leftmost node is now the root, and all of the previous left nodes are now on the right side. The former right nodes will be on the left side.

A couple tricky questions. One required writing a modified binary search, the other dealt with data structures and how to efficiently check if a given set of numbers contained two numbers summing to some other number x.
avatar

Software Engineer Intern

Interviewed at LinkedIn

3.8★
Feb 8, 2013

A couple tricky questions. One required writing a modified binary search, the other dealt with data structures and how to efficiently check if a given set of numbers contained two numbers summing to some other number x.

2. /** * A tournament tree is a binary tree * where the parent is the minimum of the two children. * Given a tournament tree find the second minimum value in the tree. * A node in the tree will always have 2 or 0 children. * Also all leaves will have distinct and unique values. * 2 * / \ * 2 3 * / \ | \ * 4 2 5 3 * * In this given tree the answer is 3. */ class Node { Integer value; Node left, right; Node(Integer value, Node left, Node right) { this.value = value; this.left = left; this.right = right; } } class Solution { /** * This should return the second minimum * int value in the given tournament tree */ public static Integer secondMin(Node root) { } }
avatar

Senior Software Engineer

Interviewed at LinkedIn

3.8★
Apr 5, 2017

2. /** * A tournament tree is a binary tree * where the parent is the minimum of the two children. * Given a tournament tree find the second minimum value in the tree. * A node in the tree will always have 2 or 0 children. * Also all leaves will have distinct and unique values. * 2 * / \ * 2 3 * / \ | \ * 4 2 5 3 * * In this given tree the answer is 3. */ class Node { Integer value; Node left, right; Node(Integer value, Node left, Node right) { this.value = value; this.left = left; this.right = right; } } class Solution { /** * This should return the second minimum * int value in the given tournament tree */ public static Integer secondMin(Node root) { } }

Write a program that takes an integer and prints out all ways to multiply smaller integers that equal the original number, without repeating sets of factors. In other words, if your output contains 4 * 3, you should not print out 3 * 4 again as that would be a repeating set. Note that this is not asking for prime factorization only. Also, you can assume that the input integers are reasonable in size; correctness is more important than efficiency. PrintFactors(12) 12 * 1 6 * 2 4 * 3 3 * 2 * 2
avatar

Software Engineer

Interviewed at LinkedIn

3.8★
Nov 25, 2014

Write a program that takes an integer and prints out all ways to multiply smaller integers that equal the original number, without repeating sets of factors. In other words, if your output contains 4 * 3, you should not print out 3 * 4 again as that would be a repeating set. Note that this is not asking for prime factorization only. Also, you can assume that the input integers are reasonable in size; correctness is more important than efficiency. PrintFactors(12) 12 * 1 6 * 2 4 * 3 3 * 2 * 2

Viewing 1631 - 1640 interview questions

Glassdoor has 711,480 interview questions and reports from Desarrollador java interviews. Prepare for your interview. Get hired. Love your job.