From 84b5fb111db6d3d5101dc07671b5d002c842f492 Mon Sep 17 00:00:00 2001 From: Gonzalo Diaz Date: Fri, 19 Jun 2026 17:53:27 -0400 Subject: [PATCH] [BUGFIX] Use "max()" instead of sorting to find this value. --- .../interview_preparation_kit/search/swap_nodes_algo.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/hackerrank/interview_preparation_kit/search/swap_nodes_algo.py b/src/hackerrank/interview_preparation_kit/search/swap_nodes_algo.py index 2813f922..e40c1d1e 100644 --- a/src/hackerrank/interview_preparation_kit/search/swap_nodes_algo.py +++ b/src/hackerrank/interview_preparation_kit/search/swap_nodes_algo.py @@ -79,7 +79,7 @@ def buildTree(indexes: List[List[int]]) -> Node: __INITIAL_LEVEL__, callbackCollectNodes) - last_level: int = sorted(node_collector)[-1] + last_level: int = max(node_collector) for i in range(0, min(len(indexes_copy), len(node_collector[last_level]))): current_node: Node = node_collector[last_level][i]