Company: DocuSign_6april
Difficulty: medium
Minimum Vulnerability of Non-Adjacent Servers Problem Description Hackerrank developers want to deploy an application on a set of exactly k servers with different vulnerabilities. They have an option to choose the k servers from a sequence of n servers where vulnerability[i] represents the vulnerability of the i th server. The vulnerability of the chosen k servers is defined as the maximum vulnerability amongst any of the chosen servers. To avoid congestion, they would like to choose a subsequence of k servers such that no two adjacent servers are chosen as part of the k servers. Given an array vulnerability and an integer k , find the minimum possible vulnerability of the chosen servers such that the above condition is respected. Function Description Complete the function getMinVulnerability in the editor below. getMinVulnerability has the following parameters: int vulnerability[] : An array of integers representing the vulnerability of each server. int k : The length of the subsequen