find 3 elements in an array that sum to 0.
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,923 desarrollador java interview questions shared by candidates
Call a function F in a loop. F returns a string of 140 chars. Write to the output 1 when F returns a string with the same letters (basically a permutation) of a string previously returned. (the question was not this well formed)
After Round 2 I Asked Interviewer How he would Solution for Above mentioned Q1 & Q2 questions of the Round 2 Technical Interview. Very Smartly Interviewer Did not take any effort to answer and also told me find it out by myself :)
Implement clearbit(int n, int p) function, p is the position of the bit to be cleared. Example : n is 13, p is 0. Binary representation of n : 1101. You need to clear the pth postion, means 0th position bit needs to be cleared.
Write a function to obtain a string with the binary representation of an integer
you have array with n elements. How would you do circular shift of k positions? Time and space complexity?
Write code to generate all possible case combinations of a given lower-cased string. (e.g. "0ab" -> ["0ab", "0aB", "0Ab", "0AB"])
salesforce exp
If you had to change permissions to read/write all recursively in the unix terminal, how would you do it?
Pancakes, size varies, and are put in a stack with random order. You have one operation called Flip(int[] pancakes, int k) to flip all pancakes from the top one to kth pancake, write a sort(int[] pancakes]) method
Viewing 571 - 580 interview questions