PROBLEMS|MOD 13|HARD

Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree

Algorithms: Searching, Sorting & Big-O

Implement algorithmic solution for **Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree** (Hard level). Input parameters: `data`.

// EXAMPLES

Example 1:
Input: Input: 2
Output: 4
Explanation: Result for example 1 of Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree.
Example 2:
Input: Input: 5
Output: 10
Explanation: Result for example 2 of Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree.

// CONSTRAINTS

  • -10^9 <= n <= 10^9
  • Time Complexity target: O(N) or O(N log N)
  • Space Complexity target: O(1) or O(N)
  • Evaluated against 600 test cases.
solution.py