Given a graph, cost of traveling in a path is the max edge weight that appeared in that path. Find the min cost taken to reach from 1 to n. You can only include k edges in the path. Please let me know if you find the same question anywhere, It's the question from UIPath's Online assessment test.

Hi, I'm not able to see any of the testcases in the questions available in edu section. Is there any option to view the testcases?

Given an array you can decrease m non zero elements by 1 in one operation find max no of possible operations. Binary Search Question, but I'm not able to check is it possible to apply k number of operations when I'm applying binary search. Help !!!