if A! + B! + C! = ABC and A, B, C are single digit numbers, find A, B, and C.
Desenvolvedor Interview Questions
102,633 desenvolvedor interview questions shared by candidates
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"] ]
Implement a function nondecreasing_subsequences() that, given a sequence of numbers such as: [ 3,6,61,6,7,9,1,7,7,2,7,7,2,388,3,72,7 ] ... will identify and return each contiguous sub-sequence of non-decreasing numbers. E.g. this example input should return this array-of-arrays (e.g. or list-of-lists) [ [3,6,61],[6,7,9],[1,7,7],[2,7,7],[2,388],[3,72],[7] ] (Each array includes a sequence of numbers that do not get smaller. The original order is unchanged.) For a visual example of a non-decreasing, see: http://en.wikipedia.org/wiki/File:Monotonicity_example1.png
/* You have rating (0-10) of the hotels per user in this format: scores = [ {'hotel_id': 1001, 'user_id': 501, 'score': 7}, {'hotel_id': 1001, 'user_id': 502, 'score': 7}, {'hotel_id': 1001, 'user_id': 503, 'score': 7}, {'hotel_id': 2001, 'user_id': 504, 'score': 10}, {'hotel_id': 3001, 'user_id': 505, 'score': 5}, {'hotel_id': 2001, 'user_id': 506, 'score': 5} ] Any given hotel might have more than one score. Implement a function, get_hotels(scores, min_avg_score) that returns a list of hotel ids that have average score equal to or higher than min_avg_score. get_hotels(scores, 5) -> [1001, 2001, 3001] get_hotels(scores, 7) -> [1001, 2001] */
Viewing 371 - 380 interview questions
See Interview Questions for Similar Jobs
Estágio De Desenvolvedor De SoftwareDesenvolvedor De AplicativosDesenvolvedor De Aplicativos 3Desenvolvedor Asp.netDesenvolvedor .netAnalista/desenvolvedorDesenvolvedor De AplicaçõesDesenvolvedor De SoftwareDesenvolvedor SêniorDesenvolvedor De Software 2Desenvolvedor De ApiDesenvolvedor De SistemasDesenvolvedor De Software AssociadoDesenvolvedor SwiftDesenvolvedor De Engenheiro De Software AssociadoEngenheiro De Software, Desenvolvedor De SoftwareDesenvolvedor NetEngenheiro Desenvolvedor