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?
17.689 Domande di colloqui condivise dai candidati | software developer intern
non disclosure agreement
What was one of your best achievements on a project in the past?
DS, Algorithms.
Given a number n, find the largest number just smaller than n that can be formed using the same digits as n.
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.
To find and return the common node of two linked lists merged into a 'Y' shape.
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.
Implement a power function to raise a double to an int power, including negative powers.
Stai visualizzando 1 - 10 domande di colloquio