The programming test was quite difficult Math problem, it had to be solved precisely and every case must be handled carefully to ensure correct program outcome.
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,987 desarrollador java interview questions shared by candidates
Implemented the basic data structure. And followed up with several small questions.
Given a list of words, right a function to return a list of pairs of palindromes
Online median.
Consider a queue between the two processes indicated below. N is the capacity (maximum length) of the queue; e, f, and b are semaphores. "P" refers to the operation of acquiring (decrementing) a semaphore, and "V" refers to the operation of releasing (incrementing) a semaphore. init() { e = N; f = 0; b = 1; queue = EMPTY; } process1() { for(;;) { P(e); P(b); queue.enqueue(...); V(b); V(f); } } process2() { for(;;) { P(f); P(b); ... = queue.dequeue(); V(b); V(e); } } Which of the following statements is (are) true? (Zero or more may be correct.) a. The purpose of semaphore f is to ensure that dequeue is not executed on an empty queue. b. The purpose of semaphore e is to ensure that deadlock does not occur. c. The purpose of semaphore b is to provide mutual exclusion for queue operations. d. None of the above.
1. To add an HTTP request to the search engine, then log a result depending on the# of pages and requirements. 2. Use DP to implement a Knapsack-like problem. Restrictions on time complexity. 3. Implement a to-do list's delete method on website.
Given the pre-order and in-order traversing result of a binary tree, write a function to rebuild the tree.
Someone can go up on stairs from one or two steps, how many different there is to go up on a stairs with n steps.
Find all (english word) substrings of a given string. (every = every, ever, very)
Write a program to find (x^y) % z
Viewing 651 - 660 interview questions