Generate the first n prime numbers and time complexity.
Software Developer Interview Questions
96,343 software developer interview questions shared by candidates
Implement a function that counts the duplicates in an unordered array
if A! + B! + C! = ABC and A, B, C are single digit numbers, find A, B, and C.
Now if you have a sorted array, how will you search for an element?
6 face dice. He rolls 1 to win, and me 6. He rolls first, what's the probability that he eventually win.
2 pieces of string of different length and non-uniform width, each take one hour to burn. the remaining length of a burning string doesn't tell you how much longer it burns for. with a lighter measure 45 mins.
Write a program to reverse each word in a string and remove spaces say "i am good" to "imadoog".
A and B are 32 bit numbers with first 16 bits valid in A and next 16 bits valid in B. (The non-valid bits aren't necessarily 0). WAP that adds A and B without using arithmetic operator.
you have a list of people, and a function that return true/false if one person knows the second person. write a function that finds a VIP, which everybody knows and he doesn't know anybody else.
Implement a function all_anagram_groups() that, given many input strings, will identify and group words that are anagrams of each other. An anagram is word that is just a re-arrangement of the characters of another word, like "reap" and "pear" and "a per" (whitespace is ignored). But "pear" and "rep" are not, since "rep" does not have an "a". Also, "the" and "thee" are not anagrams, because "the" only has one "e". Given this example input: [ "pear","dirty room","amleth","reap","tinsel","hamlet","dormitory","listen","silent" ] The output should be an array-of-arrays (or list-of-lists) [ ["pear","reap"], ["dirty room","dormitory"], ["amleth","hamlet"], ["tinsel","listen","silent"] ]
Viewing 371 - 380 interview questions