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.
1. Finding first non repeated character in an array 2. Linux command to list files containing specific string 3. Mysql query related to Group by Second phone interview 1. create a doubly linked list out of that tree where each node represents sum of all nodes in the same vertical line. 2. Implement search for a sorted rotated array.
Why is multiple inheritances not supported in Java?
Can you work without salary
push pop without collection
in sql server written test based on tricky querries about 2 nd max salary of emp
C++ advanced topics, r-value reference, pimpl idiom, smart pointers, koenig lookup, bits of boost library, bits of STL datastructures, OS basics, some leetcode easy algorithm problem, 1 medium leetcode algorithm, 1 leetcode hard.
Given a series of strings, find the biggest common prefix.
Return the coins combination with the minimum number of coins.Time complexity O(MN), where M is the target value and N is the number of distinct coins. Space complexity O(M).
Given a set of numbers in an array which represent number of consecutive days of AirBnB reservation requested, as a host, pick the sequence which maximizes the number of days of occupancy, at the same time, leaving atleast 1 day gap in between bookings for cleaning. Problem reduces to finding max-sum of non-consecutive array elements. // [5, 1, 1, 5] => 10 The above array would represent an example booking period as follows - // Dec 1 - 5 // Dec 5 - 6 // Dec 6 - 7 // Dec 7 - 12 The answer would be to pick dec 1-5 (5 days) and then pick dec 7-12 for a total of 10 days of occupancy, at the same time, leaving atleast 1 day gap for cleaning between reservations. Similarly, // [3, 6, 4] => 7 // [4, 10, 3, 1, 5] => 15
You are given an array, and a number x. Determines whether or not there exist two elements in in the input array whose sum is exactly x, efficiently.
Viewing 1441 - 1450 interview questions