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 Interview Questions
550,593 software interview questions shared by candidates
given non-zero number array A, create array B where B[i] = product of all elements in A except A[i].
First explain what a tree, then binary tree, then a binary search tree is. Now implement a function that verifies whether a binary tree is a valid binary search tree.
Write a code for determining the given integer is palindrome in binaries.
I got questions like "Given a dictionary of words, how do you calculate the anagrams for a new word".
Find the longest subarray which consists of numbers that can be arranged in a continuous sequence. For ex- {4,5,1,5,7,6,8,4,1} output-{5,7,6,8,4}.Find the longest.
How would you code up a custom rectangle detector?
Given two numbers n and m, divide n by m without using the division operator. Return both the integer answer as well as the remainder.
how would you design how a cellphone implements its contact list when you press a certain letter. For example, If you press M it will tell you all the names starting with M. then if you press MI it will tell you all names starting from MI and so forth....
Given an ArrayList of Nodes, with each Node having an ID and a parent ID, determine whether the List is given in preorder.
Viewing 801 - 810 interview questions
See Interview Questions for Similar Jobs
Erp Implementation ConsultantConfiguration ManagerQa ManagerAccount Executive Mid MarketTechnical Support AssociateMajor Account ExecutiveManual TesterChannel Sales ManagerProgrammer AnalystTest AnalystSenior SalesEntry DeveloperIt HeadFull Stack EngineerEngineer DeveloperIos DeveloperEntry Level Digital Signal Processing EngineerEntry EngineerJava Developer