Topic: hashing-problem / Level: beginner

• 901. Create a function that returns the first character that does not appear in another string using hashing.
• 902. Given a list of words, write a program to find all anagrams of a given word using hashing.
• 903. Write a function to find the total number of digits in a string using hashing.
• 904. Create a program that checks if a string can be formed from the characters of another string using hashing.
• 905. Implement a function to count the frequency of each digit in a number using hashing.
• 906. Write a program to find the maximum length of a substring that contains only unique characters using hashing.
• 907. Create a function that checks if a string is a valid identifier using hashing.
• 908. Given a string, write a function to find the longest substring that is an anagram of another substring using hashing.
• 909. Write a program to find the total number of characters in a string excluding digits using a hash set.
• 910. Create a function that returns the unique elements in an array using hashing.
• 911. Implement a function to count the number of trailing zeros in a factorial of a number using hashing.
• 912. Write a program to find the first character that appears three times in a string using hashing.
• 913. Create a function that checks if a string can be converted into a palindrome by removing at most one character using hashing.
• 914. Given a string, write a function to find the longest substring of numbers using hashing.
• 915. Write a program to count the number of unique characters in a string using a hash set.
• 916. Create a function that checks if a string contains all uppercase letters using hashing.
• 917. Implement a function to find the minimum character swaps required to make two strings equal using hashing.
• 918. Write a program to find the maximum frequency of any digit in a number using a hash map.
• 919. Create a function that checks if an array contains any even number using hashing.
• 920. Given a string, write a function to count the total number of punctuation marks using hashing.
• 921. Write a program to find the length of the longest substring that contains exactly two different characters using hashing.
• 922. Create a function that checks if two strings can be formed from the same characters ignoring case using hashing.
• 923. Implement a function to count the number of valid brackets in a string using a hash map.
• 924. Write a program to find the frequency of each word in a sentence ignoring case using hashing.
• 925. Create a function that checks if a string contains a specific character using hashing.
• 926. Given a list of integers, write a program to find the count of pairs with a specific difference using hashing.
• 927. Write a function to find the total number of unique words in a given text using hashing.
• 928. Create a program that checks if two strings can be made identical by swapping characters using hashing.
• 929. Implement a function to count the number of palindromic substrings in a given string using hashing.
• 930. Write a program to find the first character that appears twice in a string using a hash map.
• 931. Create a function that checks if two strings are made up of the same characters using hashing.
• 932. Given a string, write a function to find the longest substring that is a palindrome using hashing.
• 933. Write a program to count the total number of uppercase letters in a string using hashing.
• 934. Create a function that checks if a string contains balanced parentheses using hashing.
• 935. Implement a function to find the maximum frequency of any character in a string using a hash map.
• 936. Write a program to find the total number of consonants in a string using hashing.
• 937. Create a function that returns the first character that does not appear in another string using hashing.
• 938. Given a list of words, write a program to find all anagrams of a given word using hashing.
• 939. Write a function to find the total number of digits in a string using hashing.
• 940. Create a program that checks if a string can be formed from the characters of another string using hashing.
• 941. Implement a function to count the frequency of each digit in a number using hashing.
• 942. Write a program to find the maximum length of a substring that contains only unique characters using hashing.
• 943. Create a function that checks if a string is a valid identifier using hashing.
• 944. Given a string, write a function to find the longest substring that is an anagram of another substring using hashing.
• 945. Write a program to find the total number of characters in a string excluding digits using a hash set.
• 946. Create a function that returns the unique elements in an array using hashing.
• 947. Implement a function to count the number of trailing zeros in a factorial of a number using hashing.
• 948. Write a program to find the first character that appears three times in a string using hashing.
• 949. Create a function that checks if a string can be converted into a palindrome by removing at most one character using hashing.
• 950. Given a string, write a function to find the longest substring of numbers using hashing.

• More Levels

• Intermediate
• Advanced