[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

data_structures/advanced_trie.py

@@ -368,13 +368,13 @@ def _pattern_search_helper(
     ) -> None:
         """
         Helper method for pattern search.
-        
+
         Args:
             node: Current trie node
             current_word: Current word being built
             pattern: Pattern to match
             words: List to collect matching words
-            
+
         Examples:
             >>> trie = Trie()
             >>> trie.insert("hello")
@@ -430,7 +430,7 @@ def get_all_words(self) -> list[str]:
     def clear(self) -> None:
         """
         Clear all words from the trie.
-        
+
         Examples:
             >>> trie = Trie()
             >>> trie.insert("hello")

data_structures/segment_tree.py

@@ -66,12 +66,12 @@ def __init__(
     def _build(self, node: int, start: int, end: int) -> None:
         """
         Build the segment tree recursively.
-        
+
         Args:
             node: Current node index
             start: Start of current segment
             end: End of current segment
-            
+
         Examples:
             >>> st = SegmentTree([1, 2, 3, 4, 5])
             >>> st._build(0, 0, 4)  # Builds the entire tree
@@ -247,12 +247,12 @@ def _build(self, node: int, start: int, end: int) -> None:
     def _push_lazy(self, node: int, start: int, end: int) -> None:
         """
         Push lazy updates to children.
-        
+
         Args:
             node: Current node index
             start: Start of current segment
             end: End of current segment
-            
+
         Examples:
             >>> lst = LazySegmentTree([1, 2, 3, 4, 5])
             >>> lst.lazy[0] = 2
@@ -279,7 +279,7 @@ def range_update(self, left: int, right: int, delta: int) -> None:
             left: Left boundary (0-indexed)
             right: Right boundary (0-indexed)
             delta: Value to add to the range
-            
+
         Examples:
             >>> lst = LazySegmentTree([1, 2, 3, 4, 5])
             >>> lst.range_update(1, 3, 2)
@@ -344,7 +344,7 @@ def query(self, left: int, right: int) -> int:
 
         Returns:
             Result of the operation over the range
-            
+
         Examples:
             >>> lst = LazySegmentTree([1, 2, 3, 4, 5])
             >>> lst.query(1, 3)
@@ -361,17 +361,17 @@ def query(self, left: int, right: int) -> int:
     def _query(self, node: int, start: int, end: int, left: int, right: int) -> int:
         """
         Internal query method.
-        
+
         Args:
             node: Current node index
             start: Start of current segment
             end: End of current segment
             left: Left boundary of query
             right: Right boundary of query
-            
+
         Returns:
             Result of the operation over the range
-            
+
         Examples:
             >>> lst = LazySegmentTree([1, 2, 3, 4, 5])
             >>> lst._query(0, 0, 4, 1, 3)