For a given binary tree, assign the sibling pointer of each node. A sibling is always the node to its immediate right on the same level of the tree.
Developer Advisor Interview Questions
710,959 developer advisor interview questions shared by candidates
Smallest missing natural number in a linked list in linear time without a hash table.
Write a function that calculates the root of a given number.
The first Jedi question was this: given an unsorted array of numbers, like [1, 3, 5, 4, 2], write a function that takes an integer and returns true if there's any pair of numbers in that array that can be summed up to the input integer.
Implement a method to determine whether a string is a palindrome.
Find Kth minimum node in a binary tree and suggest a complexity
Given an array of integers, find the sub array with the largest sum. (must be done in linear time)
Given two events, each with a start and end time, implement a boolean check to see if they overlap.
Optimize the algorithm suggested above
In an array you have all the numbers from 1 through n (not in order) with one number missing. Find that number. Now, you have two numbers missing. Find both the numbers. Notes: O(n) time solution, O(1) extra space. n may be very large, so beware of overflows!
Viewing 1231 - 1240 interview questions
See Interview Questions for Similar Jobs
Solutions DeveloperDatabase DeveloperDatabase DesignerTechnology AnalystPhp DeveloperSystems AnalystWeb ProgrammerMysql Database AdministratorNet DeveloperApplications DeveloperExtjs DeveloperUi DeveloperAngularjs DeveloperApplications Developer AssociateConsultant DeveloperApplication Development AnalystSenior Database AdministratorProgrammer Analyst