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.
Programmer Developer Interview Questions
748,807 programmer developer 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.
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.
Given an array of integers, find the sub array with the largest sum. (must be done in linear time)
Viewing 1301 - 1310 interview questions
See Interview Questions for Similar Jobs
C DeveloperC++ DeveloperSenior System Software EngineerCompiler EngineerSoftware Engineer DeveloperSystem Software EngineerC Software DeveloperSoftware Engineer, Software DeveloperSoftware Developer CSenior C Wpf DeveloperPython DeveloperC Software EngineerC++ Software EngineerDeveloperRuby On Rails EngineerDeveloper CC++ Software DeveloperSenior Python Developer