Enhance key_eq documentation clarity and formatting

Updated formatting and clarified descriptions in the key_eq documentation for unordered_set.

Author: mamtawardhani

content/cpp/concepts/unordered-set/terms/key-eq/key-eq.md

@@ -25,13 +25,17 @@ The **`key_eq()`** method returns the equality comparison function object used b
 unordered_set_name.key_eq();
 ```
 
-**Return Value:**
+**Parameters:**
+
+This method takes no parameters.
+
+**Return value:**
 
 Returns a `key_equal` function object. By default, this is `std::equal_to<T>`, which compares keys using the `==` operator.
 
 ## Example
 
-The following example illustrates retrieving and using the equality comparison function from an unordered_set:
+The following example illustrates retrieving and using the equality comparison function from an `unordered_set`:
 
 ```cpp
 #include<iostream>
@@ -41,24 +45,28 @@ using namespace std;
 
 int main() {
   unordered_set<int> numbers = {1, 2, 3};
-    
+
   auto eq = numbers.key_eq();
-    
+
   cout << eq(2, 2) << "\n";
   cout << eq(2, 3) << "\n";
-    
+
   return 0;
 }
 ```
 
 The above program gives the following output:
 
-```
+```shell
 1
 0
 ```
 
-> **Note:** If two keys are considered equal by key_eq(), they must also produce the same hash value. Failing to maintain this consistency results in undefined behavior.
+> **Note:** If two keys are considered equal by `key_eq()`, they must also produce the same hash value. Failing to maintain this consistency results in undefined behavior.
+
+## Codebyte Example
+
+In this example, a custom case-insensitive equality function is used with `unordered_set`, and `key_eq()` retrieves that function to compare two strings while ensuring duplicate keys are not inserted:
 
 ```codebyte/cpp
 #include<iostream>
@@ -71,47 +79,40 @@ using namespace std;
 struct CaseInsensitiveHash {
   size_t operator()(const string& str) const {
   size_t hash = 0;
-    
+
   for(char ch : str) {
     hash = hash * 31 + tolower(ch);
   }
-    
+
   return hash;
   }
 };
 
 struct CaseInsensitiveEq {
   bool operator()(const string& a, const string& b) const {
-    if(a.size() != b.size()) 
+    if(a.size() != b.size())
       return false;
-        
+
     for(size_t i = 0; i < a.size(); i++) {
-      if(tolower(a[i]) != tolower(b[i])) 
+      if(tolower(a[i]) != tolower(b[i]))
         return false;
     }
-    
+
     return true;
   }
 };
 
 int main() {
   unordered_set<string, CaseInsensitiveHash, CaseInsensitiveEq> words;
-    
+
   words.insert("Codecademy");
   words.insert("codecademy"); // will be considered equal, and not inserted
-    
+
   auto eq = words.key_eq();
-    
+
   cout << eq("Codecademy", "codecademy") << "\n";
   cout << words.size() << "\n";
-    
+
   return 0;
 }
 ```
-
-The above program gives the following output
-
-```
-1
-1
-```