nemesis07
BAN USER
Questions (2)
Reputation 50
- 1of 1 vote
AnswersGiven a 2D (Rectangular) grid of points. You need to find the shortest path from a given source point to a destination point. You can only move up or right. Now among these points, there a few special points from which you can directly jump to the diagonally opposite point (Top-Right diagonal). You are granted a function which when invoked on the point returns 1 if it is a special point and 0 if it is not.
- nemesis07 in India| Report Duplicate | Flag | PURGE
Algorithm - 0of 0 votes
AnswersGiven a larger integer buffer/array (say size, x), now given a window size (say, n) and a number (say, k). Windows starts from the 1st element and keeps shifting right by one element. The objective is to find the minimum k numbers present in each window.
- nemesis07 in India| Report Duplicate | Flag | PURGE
Amazon Arrays
Page:
1
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.