One independent survey showed that 70% on people asked like coffee. Another independent survey showed that 80% of people like tea. What is the upper and lower bound of peoples who likes both coffee and tea
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,019 desarrollador java interview questions shared by candidates
Given the daily values of a stock, find how you can lose the most with one buy-sell trading.
Quiz
Given an array of integers eg [1,2,-3,1] find whether there is a sub-sequence that sums to 0 and return it (eg 1,2,-3 or 2,-3,1) Checking every sub-sequence is O(n^2) which is too inefficient
Function to compute the number of ways to climb a flight of n steps. Taking 1, 2, or 3 steps at a time. Do it in Linear time and constant space. n = 3. 1 1 1 1 2 2 1 3 Ans = 4
Given an array, without using extra space, move all zeros to the end and no-zeros to the beginning. The function should return the number of non-zeros.
Why do you want to join Wipro ? and please don't give me crap answers !
Just data structure and algorithms questions
Given a sorted matrix where the number below and right of you will always be bigger, write an algorithm to find if a particular number exist in the matrix. What is the running time of your algorithm.
You are trying to rob houses on a street. Each house has some +ve amount of cash. Your goal is to rob houses such that you maximize the total robbed amount. The constraint is once you rob a house you cannot rob a house adjascent to that house.
Viewing 71 - 80 interview questions