Topic: hashing-problem / Level: intermediate

• 1151. Create a function to find the count of unique characters in a string using hashing.
• 1152. Write a program to check if a string can be transformed into another using hashing.
• 1153. Implement a function to find the maximum frequency of any element in a list using a hash map.
• 1154. Create a program to find the total number of characters in a string excluding spaces using hashing.
• 1155. Write a function to determine if two strings are anagrams using a hash table.
• 1156. Given a string, write a program to count the number of occurrences of a specific character using a hash map.
• 1157. Create a function that checks if a string contains balanced parentheses using hashing.
• 1158. Write a program to find the longest substring that contains the same character using hashing.
• 1159. Implement a function to count the total number of consonants in a string using a hash map.
• 1160. Create a program to check if a list of integers contains any duplicates using hashing.
• 1161. Write a function to find the first unique integer in an array using a hash map.
• 1162. Given a list of integers, write a program to find the count of negative numbers using a hash map.
• 1163. Implement a function to find the first character that appears three times in a string using a hash map.
• 1164. Create a program to find the longest substring that contains only digits using hashing.
• 1165. Write a function to check if two strings can be rearranged to form a palindrome using hashing.
• 1166. Given an array of integers, write a program to determine if it can be partitioned into two subsets with equal sums using hashing.
• 1167. Create a function to find the maximum product of three numbers in an array using hashing.
• 1168. Write a program to count the total number of uppercase letters in a string using hashing.
• 1169. Implement a function to find the longest substring that is a palindrome using hashing.
• 1170. Create a program to check if a string can be split into two palindromes using hashing.
• 1171. Write a function to find the number of unique words in a paragraph using hashing.
• 1172. Given a list of integers, write a program to find the maximum frequency of any digit in a number using hashing.
• 1173. Create a function that checks if a string contains all the letters of the alphabet using hashing.
• 1174. Write a program to find the first character that appears an odd number of times using hashing.
• 1175. Implement a function to count the occurrences of a specific word in a sentence using a hash map.
• 1176. Create a program to find the longest substring that contains exactly k distinct characters using hashing.
• 1177. Write a function to check if two strings can be made identical by swapping characters using hashing.
• 1178. Given an array, write a program to find the first unique element using hashing.
• 1179. Implement a function to find the longest palindromic substring in a given string using hashing.
• 1180. Create a program to count the frequency of letters in a string using a hash table.
• 1181. Write a function to find the maximum length of a substring that contains at most one repeating character using hashing.
• 1182. Create a function to determine if two arrays have any elements in common using hashing.
• 1183. Write a program to find the first character that appears twice in a string using a hash map.
• 1184. Given a string, write a function to check if it is a valid identifier using hashing.
• 1185. Implement a function to find the total number of vowels and consonants in a string using hashing.
• 1186. Create a program to find the longest sequence of unique numbers in an array using hashing.
• 1187. Write a function to count the total number of consonants in a string using a hash map.
• 1188. Given a string, write a program to check if it can be transformed into a valid number using hashing.
• 1189. Create a function to find the longest substring that is an anagram of another substring using hashing.
• 1190. Write a program to find the maximum frequency of any character in a string using a hash map.
• 1191. Implement a function to check if two strings can be formed from the same characters ignoring case using hashing.
• 1192. Create a program to find the total number of unique elements in a 2D array using hashing.
• 1193. Write a function to find the first character that occurs an even number of times in a string using hashing.
• 1194. Given two strings, write a program to find the longest common substring using a hash table.
• 1195. Implement a function to check if a string contains any digits using hashing.
• 1196. Create a program to find the maximum product of two distinct elements in an array using hashing.
• 1197. Write a function to find the total number of digits in a string using a hash map.
• 1198. Given an array, write a program to find the count of elements that are unique using hashing.
• 1199. Implement a function to check if two arrays have the same frequency of elements using hashing.
• 1200. Create a program to count the total number of characters in a string excluding spaces using hashing.

• More Levels

• Beginner
• Advanced