The implementation question: Find a max and min in an array simaltaneously. I used a 2n comparisons approach and a 1.5n on-average approach.
Desarrollador Java Senior Interview Questions
750,434 desarrollador java senior interview questions shared by candidates
Remove a node from a singly linkedlist without knowing the head node. All you have is the node itself.
Search a max value in an unsorted array. (Very abstract question) in better than O(n).
Given a set of strings, a number 'n', and a function that takes a string and gives back a score, find the n largest scored strings in the set.
Game of Life - write a function to calculate next state of the board based on current state
Given two lists A and B containing sorted non-unique integers, return the elements in A but not B and the elements in B but not A.
Find the longest subsequence of duplicate numbers in an array of sorted numbers.
How would you improve Uber?
What is the output? int n = 1; puts(((char*)&n)[0]==1?"Y":"N");
1) Given a string of parantheses, check if the string is valid. ex: [[]] is valid, ][][ is not valid. How would you solve if the parantheses could be of different types like {,[,(
Viewing 431 - 440 interview questions
See Interview Questions for Similar Jobs
Desarrollador Java J2eeDesarrollador Java J2ee SeniorDesarrollador De Software Java SeniorDesarrollador De Aplicaciones Java SeniorIngeniero De Software Desarrollador Java SeniorLíder Desarrollador JavaDesarrollador De Software Java J2ee SeniorDesarrollador JavaDesarrollador Java FlexDesarrollador De Software Java J2eeDesarrollador J2eeDesarrollador De Aplicaciones JavaDesarrollador Sr JavaDesarrollador Web Java SeniorDesarrollador De Java CoreDesarrollador De Software Java DesarrolladorDesarrollador De Software JavaDesarrollador De Aplicaciones Móviles Android