Coding Challenge 1) Find the longest palindromic substring from the given string. No need of DP solution.
Engineer Software Interview Questions
419,183 engineer software interview questions shared by candidates
If you have a program that runs slow, how will you improve it to run faster?
Assume that you are given the head and tail pointers of a doubly linked list where each node can also have a single child pointer to another similar doubly linked list. There are no cycles in this structure outside of the traditional double links. Write a procedure in C++ that flattens this structure into a single list.
Sort a array, [W B W B B W W B ] === [W W W W B B B B ]
1. IsAnagram 2. Count unique substring of length k
Write a function that returns true when number of things (N) can be precisely divided into boxes of 6, 9 and 20 => N = 6x + 9y + 20z
There are n pots with different # gold coins in them. Two players play a game, where each player can select a pot at either ends. maximize the gold
You are given an array that represents bills in certain currency (For example 1, 2, 5, 10) and an amount, for example 17. You should output the number of possible combinations of bills that sum to the given amount. For example, {10, 5, 2} is valid combination, {10, 5, 1 ,1} also. I did not ask questions like does the order of bills matter, i.e. is {10, 5, 2} same as {2, 10, 5}.
what's wrong with the following code : <template type T > T accumulate ( vector<T> in) { T total = in[0]; for (int i =0; i < in.length() ; i++) { total = total + in[i]; } return T }
Given n numbers (P1,P2,P3,.....Pn). Divide them in m contiguous partitions such that the sum of the maximum is minimum. For e.g. (5,1,4,2,3) and m =2 then (5,1)(4,2,3)
Viewing 271 - 280 interview questions