1. In an array provide pairs of numbers that add to a particular value 2. In fibonacci series provide sum of all even numbers
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
Find the 20 longest strings in a text file.
Given a integer , return corresponding ASCII char representation without using language building in feature. ex. input interger 1234, return "1234" in string or characters
1. Given a 3 array like below NSArray *a = [1,3,4,5]; NSArray *b = [-1,3,0,9]; NSArray *c = [0,31,32,22,6]; Find the elements from the three array which existing in atleast 2 arrays. Eg: [3, 0] Because 3 is presented in array a, b and 0 is presented in array b, c respectively. -(NSArray)find2ElementsAtleastPresentIn2Arrays:(NSArray*)aList b::(NSArray*)bList c::(NSArray*)cList{ // -- your code here. }
Easy quant and java questions
implement a O(1) min function for Stack
How would you implement a stack with the additional operation of getMin?
Given a stream of integers of unknown (possibly large) length, how would you pick one at random? Now prove its random.
Giving a windows size K and an array of size N, find the minimum of each window as it slides through the array.
* You have a data structure of integers, which can be negative, zero, or positive, and you need to support an API with two public methods, insert(int) and getmedian(). Describe a data structure you would use to support this API and describe the running time of the two methods. * Imagine you're writing a function that takes an array of integers and an integer and it needs to return true if any pair in the array sum to the 2nd argument. The array can have negative numbers, zero, or positive numbers. Describe how you would design this function and what its running time would be. I ran through the trivial n^2 solution, then modified it to an nlogn and finally to a linear solution.
Viewing 391 - 400 interview questions