Dungeon Game
Algorithms: Searching, Sorting & Big-O
Implement algorithmic solution for **Dungeon Game** (Hard level).
Input parameters: `data`.
// EXAMPLES
Example 1:
Input:
Input: 2Output:
12Explanation: Result for example 1 of Dungeon Game.
Example 2:
Input:
Input: 5Output:
15Explanation: Result for example 2 of Dungeon Game.
// CONSTRAINTS
-10^9 <= n <= 10^9Time Complexity target: O(N) or O(N log N)Space Complexity target: O(1) or O(N)Evaluated against 600 test cases.
solution.py