rrChar); } } // Return true if set size is 26 (total number of alphabets) return seen.size() == 26; } }; int main() { Solution sol; // Test cases cout << boolalpha << sol.checkIfPangram("TheQuickBrownFoxJumpsOverTheLazyDog") << endl; // Expected output: true cout << boolalpha << sol.checkIfPangram("This is not a pangram") << endl; // Expected output: false cout << boolalpha << sol.checkIfPangram("abcdef ghijkl mnopqr stuvwxyz") << endl; // Expected output: true cout << boolalpha << sol.checkIfPangram("") << endl; // Expected output: false cout << boolalpha << sol.checkIfPangram("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ") << endl; // Expected output: true return 0; } 3f:T510,using System; using System.Collections.Generic; class Solution { // Function to check if given sentence is pangram public bool checkIfPangram(string sentence) { // Create a set to store unique characters HashSet seen = new HashSet(); // Iterate over each character using a normal for loop for (int i = 0; i < sentence.Length; i++) { // Convert the current character to lowercase char currChar = char.ToLower(sentence[i]); if (char.IsLetter(currChar)) { // Add the character to the set seen.Add(currChar); } } // Return true if set size is 26 (total number of alphabets) return seen.Count == 26; } public static void Main(string[] args) { Solution sol = new Solution(); // Test cases Console.WriteLine(sol.checkIfPangram("TheQuickBrownFoxJumpsOverTheLazyDog")); // Expected output: True Console.WriteLine(sol.checkIfPangram("This is not a pangram")); // Expected output: False Console.WriteLine(sol.checkIfPangram("abcdef ghijkl mnopqr stuvwxyz")); // Expected output: True Console.WriteLine(sol.checkIfPangram("")); // Expected output: False Console.WriteLine(sol.checkIfPangram("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ")); // Expected