Given an array A of n integers, in sorted order, and an integer x. design an O(n)-time complexity algorithm to determine whether there are 2 integers in A whose sum is exactly x.
Engineer Developer Interview Questions
467,034 engineer developer interview questions shared by candidates
How to reverse a space-delimited-string word by word
(over the phone) How to sort an array with millions of entry on a computer with low memory
WAP to find and print second largest digit in the given number? ( without using arrays, functions and using only one loop).
Write a program to print series. 6,15,35,77....
Given a number n, give me a function that returns the nth fibonacci number. Running time, space complexity, iterative vs. recursive.
Write C code that, given number n from the interval [0,32], produce integer number with n least-significant bit sets to 1, and other bits set to 0 (practically, write a decoder).
Short coding : 1. They gave an array A with N elements we need to find if addition of two elements in the array will be the element K Ex: I/P: a[5]={7,3,2,6,4,} K=10; Op:7+3=10 6+4=10 2. Two sorted array a[],b[] will be given we need to merge the array without temporary array. 3. An array arr[] with elements are given we need to sort the odd number in descending on left side and the even numbers in ascending on the right side of the array Ex: I/P: arr[5]={7,4,3,5,2} O/P:7 5 3 2 4
Why should we hire you?
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?
Viewing 621 - 630 interview questions