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.
Software Interview Questions
748,248 software interview questions shared by candidates
Two texts are considered to "match" if they have a common substring of at least length n. Describe an algorithm to determine if two strings are matches.
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.
K nearest points to the origin on a 2D plane; one-pass reverse linked list with constant space.
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.
Given a list of numbers, find the consecutive sequence of numbers whose sums equal to a target number.
Find Kth minimum node in a binary tree and suggest a complexity
Not relevant (see my comment) even if you answered correctly.
Viewing 1301 - 1310 interview questions
See Interview Questions for Similar Jobs
Qa ManagerSenior SalesAccount Executive Mid MarketTechnical Support AssociateMajor Account ExecutiveChannel Sales ManagerManual TesterConfiguration ManagerProgrammer AnalystTest AnalystErp Implementation ConsultantJava DeveloperIt HeadEngineer DeveloperIos DeveloperFull Stack EngineerEntry Level Digital Signal Processing EngineerEntry EngineerEntry Developer