A 2d grid containing some obstacle and some gaurds each facing some direction and protecting entire row/column in front of them, Now a assassin is standing somewhere in the grid and want to reach end of the grid without being caught by gaurds and also he can not move on cell with obstacle or cells gaurded by gaurd or out of grid, We just need to return boolean value (0/1). He can only move in 4 adjacent cell in one move.
The interviewer wrote down a method and asked me what was wrong with the code. The method tested my knowledge of asynchronous processes and promises.
Given a sorted array, find two elements that sum up to a certain value in linear time.
Mathematical coding problem in any programming language
Given a full binary tree, iterate over it from the top to the bottom while for each level you change direction of iteration, for odd level go from left to right and for even go from right to left.
Q: Coding a Chess move
A question about string interpolation
Why Microsoft? Return the smallest integer in a circularly sorted array.
Develop a dictionary class from scratch.
Determine if two strings are anagrams of each other
Viewing 821 - 830 interview questions