Topic: hashing-problem / Level: intermediate

• 1101. Implement a function to find the total number of vowels and consonants in a string using hashing.
• 1102. Create a program to check if two strings can be made identical by rearranging characters using hashing.
• 1103. Write a function to count the number of unique elements in a 2D array using a hash set.
• 1104. Given a string, write a program to find all substrings that are palindromes using hashing.
• 1105. Create a function that checks if a string contains balanced brackets using a hash map.
• 1106. Write a program to determine if two strings are anagrams using a sorted hash map.
• 1107. Implement a function to find the maximum length of a prefix substring that occurs more than once using hashing.
• 1108. Create a program to find the first character that appears an odd number of times using a hash map.
• 1109. Write a function to count the total number of different characters in two strings combined using hashing.
• 1110. Given an array of integers, write a program to check if it contains duplicate elements using a hash set.
• 1111. Implement a function to find the total number of unique digits in a string using hashing.
• 1112. Create a program to count the frequency of each word in a book using a hash table.
• 1113. Write a function to find the first occurrence of a substring in a string using a hash map.
• 1114. Given a list of words, write a program to find the longest word using a hash map.
• 1115. Create a function that checks if two strings are isomorphic using a hash map.
• 1116. Write a program to find the first non-repeating character in a string using a hash table.
• 1117. Implement a function to count the number of substrings that are palindromes using a hash map.
• 1118. Create a program to find the total number of characters that are uppercase in a string using hashing.
• 1119. Write a function to check if a string can be transformed into another string using a hash map.
• 1120. Given an array, write a program to find the total number of distinct elements using a hash set.
• 1121. Implement a function to find the count of elements that are unique in an array using hashing.
• 1122. Create a program to check if a string can be formed from the characters of another string using hashing.
• 1123. Write a function to find the longest substring with at least one repeating character using hashing.
• 1124. Given a string, write a program to find all unique characters using a hash set.
• 1125. Create a function that checks if a string can be rearranged to form a valid word using hashing.
• 1126. Write a program to determine if a list contains any pairs of integers that are equal using a hash set.
• 1127. Implement a function to find the longest palindrome substring in a given string using hashing.
• 1128. Create a program to count the total number of distinct elements in a 2D array using hashing.
• 1129. Write a function to find the first character that occurs more than twice in a string using a hash map.
• 1130. Given two strings, write a program to find the longest common substring using a hash table.
• 1131. Implement a function to check if a string contains a specific sequence of characters using hashing.
• 1132. Create a program to find the frequency of elements in a list using a hash map.
• 1133. Write a function to find the longest substring with at most k distinct characters using hashing.
• 1134. Given a string, write a program to count the number of unique letters using hashing.
• 1135. Create a function that checks if a list of integers contains any duplicates using a hash set.
• 1136. Write a program to find the maximum length of a substring that contains only lowercase letters using hashing.
• 1137. Implement a function to check if a string can be rearranged into a palindrome using hashing.
• 1138. Create a program to count the total number of digits in a string using a hash map.
• 1139. Write a function to find the number of unique triplets in an array that sum to zero using hashing.
• 1140. Given a string, write a program to determine the frequency of each letter using hashing.
• 1141. Create a function that checks if two strings can be formed from the same characters using hashing.
• 1142. Write a program to find the first character that occurs an even number of times in a string using hashing.
• 1143. Implement a function to count the total number of vowels in a string using a hash table.
• 1144. Create a program to find the longest substring with exactly one distinct character using hashing.
• 1145. Write a function to check if a string contains any digits using hashing.
• 1146. Given a list of words, write a program to count the frequency of each word using a hash map.
• 1147. Implement a function to find the total number of unique characters in two strings combined using hashing.
• 1148. Create a program to check if a string contains only digits using a hash set.
• 1149. Write a function to find the longest substring with exactly two distinct characters using hashing.
• 1150. Given an array of integers, write a program to determine the total number of even numbers using hashing.

• More Levels

• Beginner
• Advanced