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,542 desarrollador java interview questions shared by candidates

However the interview was about Senior Java Position, I just asked a couple of questions about Java and nothing about Javascript. The interview questions were about: 1. Data structure and algorithms (30 minutes) 2. Operating Systems Concepts (System calls, concurrency, etc, Device Drivers.) 3. TCP/IP Layered protocol ( I was really really good at this when I was in college :) ) Till now about 1 hour or more passed from the 90 minutes interview... 4. Couple of questions about REST, Java Concurrency and Testing I could understand the emphasis on the OS, algorithms design and analysis is to be asked at Google & Amazon-like companies or to be asked to a fresh engineer he is just graduated from the university with a fresh knowledge. I am not denying their questions about OS, Data structure, and algorithms, but to make most on the interview for such topics and eventually got rejected because my knowledge in JavaScript is not enough is not honesty in reporting the Interview status. I answered the algorithms question and OS, TCP/IP from memory (which mostly wasn't that accurate as I left university more than 10 years back).
avatar

Senior Software Engineer

Interviewed at ING

4.3★
Jan 23, 2018

However the interview was about Senior Java Position, I just asked a couple of questions about Java and nothing about Javascript. The interview questions were about: 1. Data structure and algorithms (30 minutes) 2. Operating Systems Concepts (System calls, concurrency, etc, Device Drivers.) 3. TCP/IP Layered protocol ( I was really really good at this when I was in college :) ) Till now about 1 hour or more passed from the 90 minutes interview... 4. Couple of questions about REST, Java Concurrency and Testing I could understand the emphasis on the OS, algorithms design and analysis is to be asked at Google & Amazon-like companies or to be asked to a fresh engineer he is just graduated from the university with a fresh knowledge. I am not denying their questions about OS, Data structure, and algorithms, but to make most on the interview for such topics and eventually got rejected because my knowledge in JavaScript is not enough is not honesty in reporting the Interview status. I answered the algorithms question and OS, TCP/IP from memory (which mostly wasn't that accurate as I left university more than 10 years back).

Convert number above in hexadecimal 312312 Ex. 255 -> FF 254 -> 254 div 16 = 14, int(254/16) = 15. -> F, E Later I found the detailed Division-remainder in source base http://en.wikipedia.org/wiki/Hexadecimal#Division-remainder_in_source_base
avatar

Perl Developer

Interviewed at Booking.com

4.1★
Feb 6, 2015

Convert number above in hexadecimal 312312 Ex. 255 -> FF 254 -> 254 div 16 = 14, int(254/16) = 15. -> F, E Later I found the detailed Division-remainder in source base http://en.wikipedia.org/wiki/Hexadecimal#Division-remainder_in_source_base

Given an array of unique non-negative integers, {A1,…,An}, and a positive integer, X, write a function that finds all pairs of numbers in the array that sum to X”. You are given an integer array nums sorted in ascending order (with distinct values), and an integer target. Suppose that nums is rotated at some pivot unknown to you beforehand (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).” Take a singly-linked list, and reorder in such a way that the first element points to the last element, second element points to second-to-last element, and so on.
avatar

Software Engineer

Interviewed at Expedia Group

3.7★
Feb 1, 2021

Given an array of unique non-negative integers, {A1,…,An}, and a positive integer, X, write a function that finds all pairs of numbers in the array that sum to X”. You are given an integer array nums sorted in ascending order (with distinct values), and an integer target. Suppose that nums is rotated at some pivot unknown to you beforehand (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).” Take a singly-linked list, and reorder in such a way that the first element points to the last element, second element points to second-to-last element, and so on.

Given a database, where we know some portion of data (e.g. say 20%) is accessed more than the other portion of the database by the client. We have a frontend that client requests data from. Design a data structure that will increase the efficiency of access of objects. And we know that we can only hold on to n elements in memory.
avatar

Software Development Engineer

Interviewed at Microsoft

4★
Aug 2, 2014

Given a database, where we know some portion of data (e.g. say 20%) is accessed more than the other portion of the database by the client. We have a frontend that client requests data from. Design a data structure that will increase the efficiency of access of objects. And we know that we can only hold on to n elements in memory.

Merge 2 sorted arrays A and B Result should end up in B, which has available space for all items Utilize the space in B, not using temporary arrays Result in sorted array in B A { 2, 5, 8, 12, 15} B { 3, 5, 7, 9, , , , , , }
avatar

Software Development Engineer

Interviewed at Microsoft

4★
Dec 7, 2016

Merge 2 sorted arrays A and B Result should end up in B, which has available space for all items Utilize the space in B, not using temporary arrays Result in sorted array in B A { 2, 5, 8, 12, 15} B { 3, 5, 7, 9, , , , , , }

Viewing 2061 - 2070 interview questions

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