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.
Software Engineer C Interview Questions
665,113 software engineer c interview questions shared by candidates
How to reverse a space-delimited-string word by word
what if company in losses , dividend declaration
(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
question mostly about output prediction of java code
Viewing 721 - 730 interview questions