Implement clearbit(int n, int p) function, p is the position of the bit to be cleared. Example : n is 13, p is 0. Binary representation of n : 1101. You need to clear the pth postion, means 0th position bit needs to be cleared.
Programmer Developer Interview Questions
747,737 programmer developer interview questions shared by candidates
you have array with n elements. How would you do circular shift of k positions? Time and space complexity?
Write a function to obtain a string with the binary representation of an integer
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
What is a stack?
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
Given an array of length N containing numbers bounded between 1 and N with exactly one duplicate, determine what the duplicate number is in O(n) time without using more than constant memory (no making new arrays of N length).
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)
Implementing a dictionary of quick searching words
given two linked lists with a digit in each node, add the two linked lists together. the result must be a linked list with one digit in each node. use only one iteration of the two input lists.
Viewing 611 - 620 interview questions