Why should we hire you?
Software Engineer At Interview Questions
665,112 software engineer at interview questions shared by candidates
You are given a dictionary, such as /usr/share/dict/words, containing a list of words, one per line. You are also given seven tiles. Each tile is either blank or contains a single lowercase letter (a-z). List all of the words from the dictionary that can be produced by using some or all of the seven tiles, in any order. A blank tile is a wildcard, and can be used in place of any letter. Try to use a minimal amount of memory. 1. Find all of the words that can be formed if you don't have to deal with blank tiles. (You may skip this step and go straight to step 2). 2. Find all of the words that can be formed, including those where blank tiles are used as wildcards. 3. Would you do things differently if you had to process several hundred tile sets with the same dictionary?
Given an array and a target value, return true if there is a pair of numbers in the array that sum to this target.
Determine the nth fibonacci number recursively.
Given and array. How do you find if there are such three numbers whose sum is Zero. What is the cost of this algorithm?
You are given an array of integers, a1, that have sequential integers 1 through n. ( { 1,2,3,4,5 } or { 1,2,3 } or any other array) You are also given an array of integers, a2, that also have numbers 1 through n, but are not in sequential order and are missing one of the numbers between 1 and n. Find the missing number in a2. Did you check for special cases? Can you do this in O(n) runtime?
You are given a number n, you have to find all prime numbers from 1 upto n and print them (or save them in an array). A varriation is (which changes the answer) is you are given two numbers m and n and you are to find all prime numbers between them.
Swap two variables without using a temp.
Which programming language you most familiar with?
Check if a String contains a number or not
Viewing 731 - 740 interview questions