Probability of a knight making a valid move on NxN matrix in m steps.
Developer Intern Interview Questions
716,975 developer intern interview questions shared by candidates
Find count of unique characters in a given string
Given a string of format '2+3*2-1', calculate and return the result. No parenthesis in the input, just integers and + - * / operators. Operator precedence has to be considered. Linear time complexity and minimal data structure use is preferred.
Given a triangle, determine if its a scalene, equilateral, isosceles or neither... required knowledge of triangle properties, I learnt these properties about two decades ago so ofcourse I was fuzzy on the details, completely unexpected
Save a tree to an array
Find the nth element in a linked list in constant time and space.
implement strtok
Imagine you have a string and you want to return False if there are repeat characters in this string, what are the fastest and most space efficient ways to do this. (I clarified and he only wanted to return False if there was a repeat letter or number)
//input: [1,2,[3,4,[5,6],7,[8,[9]]],10] //output: [1,2,3,4,5,6,7,8,9,10]
(this is a little easier to explain if it's drawn out, but I'll try my best to do it here) Given some integer N = 2^k which represents an NxN matrix, write a function that fills the matrix with 'L' shapes, such that the entire matrix is filled except for 1 empty space. For example, a 2x2 matrix would have 3 spaces filled with one of the corners empty. And a 4x4 matrix would have the entire outer row of spaces filled, with the center 4 filled the same way the 2x2 matrix is filled.
Viewing 1611 - 1620 interview questions