Capgemini Hash Table Questions

5 hash table problems asked at Capgemini interviews

Easy (3)Medium (2)

Questions

Title	Difficulty	Acceptance	Frequency
Two Sum	Easy	57.1%	100.0%
Count Elements With Maximum Frequency	Easy	79.8%	79.2%
Valid Anagram	Easy	67.8%	57.5%
Subarray Sum Equals K	Medium	46.8%	57.5%
Longest Substring Without Repeating Characters	Medium	38.5%	57.5%

Showing 5 questions