Dictionaries and Hashmaps Interview Questions | HackerRank

We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.

|

Prepare
Certify
Compete
Apply

Hiring developers?

Prepare
Interview Preparation Kit
Dictionaries and Hashmaps

Dictionaries and Hashmaps

Hash Tables: Ransom Note
EasyProblem Solving (Intermediate)Max Score: 25Success Rate: 86.76%

Given two sets of dictionaries, tell if one of them is a subset of the other.

Two Strings
EasyProblem Solving (Basic)Max Score: 25Success Rate: 90.65%

Sherlock and Anagrams
MediumProblem Solving (Intermediate)Max Score: 50Success Rate: 89.47%

Count Triplets
MediumProblem Solving (Intermediate)Max Score: 35Success Rate: 55.77%

Frequency Queries
MediumProblem Solving (Intermediate)Max Score: 40Success Rate: 65.68%

Status

Solved

Unsolved

Difficulty

Easy

Medium

Hard

Blog
Scoring
Environment
FAQ
About Us
Helpdesk
Careers
Terms Of Service
Privacy Policy

Cookie support is required to access HackerRank

Seems like cookies are disabled on this browser, please enable them to open this website