From 2208a21b3b3e70b23b19980e5e6a2aba3a476aa4 Mon Sep 17 00:00:00 2001 From: Harsh Date: Mon, 14 Oct 2024 20:28:37 +0530 Subject: [PATCH] Updated --- Trie/LongestCommonPrefix/LongestCommonPrefix.c | 2 +- Trie/LongestCommonPrefix/Readme.md | 1 - Trie/Maximum XOR/Program.c | 1 - Trie/Maximum XOR/Readme.md | 1 - 4 files changed, 1 insertion(+), 4 deletions(-) diff --git a/Trie/LongestCommonPrefix/LongestCommonPrefix.c b/Trie/LongestCommonPrefix/LongestCommonPrefix.c index 62ae4d51..3ba61096 100644 --- 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; -} +} \ No newline at end of file diff --git a/Trie/LongestCommonPrefix/Readme.md b/Trie/LongestCommonPrefix/Readme.md index 6c548006..4890b9a0 100644 --- 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 index fc3789b2..3538760e 100644 --- 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 index 4d46c1ac..b805370c 100644 --- 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. \ No newline at end of file