An operation "swap" means removing an element from the array and appending it at the back of the same array. Find the minimum number of "swaps" needed to sort that array. Eg :- 3124 Output: 2 (3124->1243->1234) How to do it less than O(n^2) ?
Software Developer Engineer Interview Questions
466,919 software developer engineer interview questions shared by candidates
The second ninja (coding) test was about event processing system using pulling model, which literally no one in the industry is using.
To set 'N' bits in a number efficiently , N is a variable.
How many degrees are between the hour and minute hand on a clock at 9:45?
How do you test if water is toxic without tasting it
I received two questions. The first was print out all possible strings that a phone number can produce. For instance: 2 -> A,B,C and 3 -> D,E,F. So if the input is 23, then the output should be "AD, AE, AF, BD, etc.." The second question was if you had multiple points (x,y), find the n closest points to the origin (0,0).
Move all zeroes to end of array with minimum assignment operations
Given a string of digits, where every digit represents a letter (1->a, 2->b, 26->z). Find the number of words that we can generate from that string. For example: 123 -> abc, lc, aw. The answer: 3 456 -> def. The answer: 1
1. Given 1 billion numbers, find 100 largest numbers 2. Prefix notation +*123 = 5
How would you quickly find the kth smallest number in an unsorted array?
Viewing 1141 - 1150 interview questions