Design data-structures, dynamic programming questions
Software Interview Questions
550,171 software interview questions shared by candidates
The accent of the interviewer was very hard to understand. Given an array with N - 2 elements (two missing) from 1 to N, find the two missing elements in linear time and constant memory usage.
Merge Linked list
Given an input vector X, first determine the sum of 2^(of each element), then give the shortest vector Y's length which elements' sum equals the input vector. Require some binary-related logic.
Write a function Brackets(int n) that prints all combinations of well-formed brackets. For Brackets(3) the output would be ((())) (()()) (())() ()(()) ()()()
Write a function to get maximum consecutive sum of integers from an array.
You are given an n by n array filled with '0's, and you have to set randomly X number of '1's in that array. Looping and generating x random number doesn't work as you might get the same random number (especially as X gets closer to n*n, collisions will become more likely in which case you'll loop for a very long time before filling all the '1's). All positions must have the same probability to get selected, and the array might be huge.
Given a list of n numbers. All numbers except one are unique. Find the number with duplicate entry.
If you can understand how the game performs, you will find answer very quickly.
List all anagrams in a file. Assumptions: case-insensitive, a-z characters only, one word per line. For example, if the file contains dog, cat, ddd, goo, act, god -- output dog, god, act, cat
Viewing 131 - 140 interview questions