Implement the div operator without using / or %
Software Interview Questions
550,609 software interview questions shared by candidates
Interweave a linked list. Do it in Linear time and constant space. Input: A->B->C->D->E Output: A->E->B->D->C
You're given an array of numbers, and you want to find 3 numbers that sum to 0 and output those 3 numbers. You can use each number multiple times. So if you're given the array [-1, 1, 2], you would output [-1, -1, 2] because -1 -1 +2=0
for encoding that {a,b,c,...,z}<->{1,2,3,...,26} if given a list of digit e.g. [1,2,3], this may represent {1,2,3}->{a,b,c} or {12,3}->{l,c} or {1,23}->{a,w}. so there are 3 possible interpretations for list [1,2,3] so, given a list of digit, calculate the number of possible interpretations for the list.
find 3 elements in an array that sum to 0.
Gegeven reeks van niet-negatieve hele getallen, terugkerend eerste unieke nummer in deze reeks (dat gebeurt slechts één keer). Voorbeeld: [1,1,2,3,56,4,7,4,3,2,56,1000] // Verwacht resultaat: 7
Call a function F in a loop. F returns a string of 140 chars. Write to the output 1 when F returns a string with the same letters (basically a permutation) of a string previously returned. (the question was not this well formed)
If you had to change permissions to read/write all recursively in the unix terminal, how would you do it?
Waar mogen we je 's nachts voor wakker maken?
Pancakes, size varies, and are put in a stack with random order. You have one operation called Flip(int[] pancakes, int k) to flip all pancakes from the top one to kth pancake, write a sort(int[] pancakes]) method
Viewing 531 - 540 interview questions