Given an int array int list = {4,5,6,1,2,...} and an integer int target = 8 Write a function to return all the pairs (x, y) in the integer array that x + y = target (remove the duplicate one)
Software Developer Engineer Interview Questions
467,011 software developer engineer interview questions shared by candidates
Implement a class called AirMap that has two methods: 1. add_route(start, destination) - adds ONE WAY connecting flight from one airport to another 2. print_all_routes(start, destination) - prints all possible routes from start to destination Given the following routes, print all possible routes between the airport C and D: A -----> B B -----> A A -----> C C -----> A A -----> D D -----> A B -----> C C -----> B B -----> D D -----> B Expected Output: C,A,B,D C,A,D C,B,A,D C,B,D
What data structure would you use or design to implement a suggestion box for a user searching for someone in a telephone directory
given an array, all the elements in the array appear twince, only one element appears only once. Find that element. Eg, the array is 2 4 2 3 4 1 3 6 6, 1 should be the answer.
Implement a function in C that takes a string "Hey" and converts it to "[H][e][y]" with no return value
A robot can move only left and down in nXn matrix. Have to get to the bottom right corner of matrix. Write algorithm to find the maximum number paths it can take.
how different processes communicate with each other the advantages and disadvantages regarding multithreading vs multiprocessing given an input of integers that represent stock prices, how to get the best buying and selling price (notice you can only sell after you have bought the stock)
You're given a binary tree--not necessarily complete or proper--and you need to give each node a "friend" pointer that points to the node to its right in the tree. This node is on the same level but is not necessarily a sibling, which makes the problem a little tricky. The friend pointer of the node farthest to the right on each level should be null.
You have to measure exactly 4 liters of water, but you only have a 3-liter bottle and a 5-liter bottle. How do you do it?
Dynamic programming question. Given a list of non-overlapping (but intersecting) intervals {[0-2], [2-5], [6-10]} find the largest non-intersecting set with mamimum range. I.e in above | {[2-5], [6-10]} | > | {[0-2], [6-10]} |
Viewing 1651 - 1660 interview questions