Updated

AlgoGenesis · Oct 14, 2024 · 2208a21 · 2208a21
1 parent da7b9e2
commit 2208a21
Show file tree

Hide file tree

Showing 4 changed files with 1 addition and 4 deletions.
diff --git a/Trie/LongestCommonPrefix/LongestCommonPrefix.c b/Trie/LongestCommonPrefix/LongestCommonPrefix.c
@@ -115,4 +115,4 @@ int main()
     printf("Longest Common Prefix: %s\n", prefix);
 
     return 0;
-}
+}
diff --git a/Trie/LongestCommonPrefix/Readme.md b/Trie/LongestCommonPrefix/Readme.md
@@ -68,7 +68,6 @@ The longest common prefix we found is `"fl"`.
 ```
 Longest Common Prefix: fl
 ```
-
 ### Key Points:
 
 - The Trie helps build a common prefix by inserting each word one character at a time and following the path that is shared by all words.

diff --git a/Trie/Maximum XOR/Program.c b/Trie/Maximum XOR/Program.c
@@ -60,7 +60,6 @@ int findMaximumXOR(int *nums, int n) {
 
     return maxResult; // Return the maximum XOR found
 }
-
 int main() {
     int nums[] = {3, 10, 5, 25, 2, 8};
     int n = sizeof(nums) / sizeof(nums[0]);

diff --git a/Trie/Maximum XOR/Readme.md b/Trie/Maximum XOR/Readme.md
@@ -31,7 +31,6 @@ int nums[] = {3, 10, 5, 25, 2, 8};
 ```
 Maximum XOR: 28
 ```
-
 ### Key Points:
 - The Binary Trie allows efficient lookup and insertion of binary representations of numbers.
 - The XOR is maximized by selecting the opposite bit at each level, ensuring we get the maximum possible value.