Given a number n, find the largest number just smaller than n that can be formed using the same digits as n.
2841 Domande di colloqui condivise dai candidati | software developer engineering intern
Implement a power function to raise a double to an int power, including negative powers.
You are given an array with n positive integers where all values in the array are repeated except for one. Return the one that is not repeated.
Given a sorted array, write a program to decide if two elements sum up to a third.
There is an NxM grid containing a robot at (1, 1) and a destination at (N, M). Robot can move only up or right. Some locations can have obstacles. Find the number of unique paths from (1, 1) to (N, M). What is the time complexity of your algorithm?
25 racehorses, no stopwatch. 5 tracks. Figure out the top three fastest horses in the fewest number of races.
Write an algorithm to calculate the total number of paths possible from point (0, 0) to point (m, n) in an m by n grid. (You cannot retrace a line you already made when forming a path.)
Given an array of (unsorted) integers, arrange them such that a < b > c < d > e... etc.
how would you find the shortest path between two nodes in a social network?
Design a data structure that supports insert, delete min, delete max, get min, and get max, all in log(n) time.
Stai visualizzando 1 - 10 domande di colloquio