Microsoft OA Widest Path Without Trees Solution

Microsoft Online Assessment 2021 Questions and Solution

Microsoft OA Widest Path Without Trees Solution There are N trees (numbered from 0 to N-1) in a forest. The K-th tree is located at coordinates (X[K], Y[K]). We want to build the widest possible vertical path, such that there is no tree on it. The path must be built somewhere between a leftmost and a rightmost tree, which means that the width … Read more