Interviewer ask me to solve some permutation related problems. 1) Algorithm to get Index of a permutation when all permutations arranged in lexicographical order and its complexity
Software Developer In Test Interview Questions
710,305 software developer in test interview questions shared by candidates
integer partiontioing given N (a integer) how many ways you can write as N summation of other numbers 5 = 1+ 2 +2 = 2+ 2 + 1 = 1 + 3 +1 = 1 + 4 etc.. write C code to print every combination
Given an array, print the largest subarray that has elements in an increasing order
Implement the "see and tell" algorithm with a given seed number x and a number of iterations y. Output the result on iteration y
print out all prime numbers in a given string. abc2134kd31 -> 2, 13, 3, 3
Given a string, remove all the duplicate characters (not necessarily consecutive)
Given a page size and a number, align the number with the nearest page. (Note: This was a phone interview question. The interviewer and I used an online document to share ideas about this problem.
An optimal algorithm to check whether a hand of cards was a full house (in Poker) or not.
Just one question: shift an array to the right by n positions such that the right most indexes are become the first ones and the first ones move ahead. like: 1 2 3 4 5 --> shift by 2 --> 4 5 1 2 3
Only they need money no interview questions
Viewing 221 - 230 interview questions