Write a method that finds depth of a (non-balanced) binary tree.
Desarrollador Sr Java Interview Questions
714,024 desarrollador sr java interview questions shared by candidates
Given two linked lists, return the intersection of the two lists: i.e. return a list containing only the elements that occur in both of the input lists.
Write a function to return the longest common prefix between two strings.
Get the kth largest number from two sorted arrays
You are given a linked list with each node containing one extra pointer. Extra pointer points to any random node in the list.. Create a copy of this list..
Display all the numbers from 0 to 1000000. All the digits of a displayed number should be different.
Reverse words in string. Some questions about distributed system.
I can't go into details about the problems. But I wish I had studied my graph algorithms a little more closely. Make sure you know your big-O algorithm classifications. Almost every interviewer asked me something to do with that.
Write a code that returns the deepest node in a binary tree. If the tree is complete, having two same depth of node, return the rightmost node.
Given a 8x8 chessboard, write code to calculate the number of ways you can go from the the top left corner to the bottom right corner, given that you can go down, up, left, AND right.
Viewing 2251 - 2260 interview questions