Suppose you had eight identical balls. One of them is slightly heavier and you are given a balance scale . What's the fewest number of times you have to use the scale to find the heavier ball?
Perguntas de entrevista de Intern Software Engineer
9.334 Perguntas de entrevista compartilhadas pelos candidatos | intern software engineer
non disclosure agreement
What was one of your best achievements on a project in the past?
DS, Algorithms.
To find and return the common node of two linked lists merged into a 'Y' shape.
Suppose we can translate numbers into characters: 1->a, 2->b, ...26->z given an integer, for example, 11223, output every translation of the number.
Given two strings representing integer numbers ("123" , "30") return a string representing the sum of the two numbers ("153")
Determine if an array from 1..n has a duplicate in constant time and space.
An optimal algorithm to check whether a hand of cards was a full house (in Poker) or not.
Write a function in language of your choice that takes in two strings, and returns true if they match. Constraints are as follows: String 1, the text to match to, will be alphabets and digits. String 2, the pattern, will be alphabets, digits, '.' and '*'. '.' means either alphabet or digit will be considered as a "match". "*" means the previous character is repeat 0 or more # of times. For example: Text: Facebook Pattern: F.cebo*k returns true
Exibindo 1 a 10 perguntas de entrevista