Skip to content
Image
Programmingoneonone
Programmingoneonone

Learn everything about programming

  • Home
  • CS Subjects
    • Internet of Things (IoT)
    • Digital Communication
    • Human Values
    • Cybersecurity
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
  • HackerRank Solutions
    • HackerRank Algorithms Solutions
    • HackerRank C problems solutions
    • HackerRank C++ problems solutions
    • HackerRank Java problems solutions
    • HackerRank Python problems solutions
Programmingoneonone
Programmingoneonone

Learn everything about programming

HackerRank DefaultDict Tutorial solution in Python

Image YASH PAL, 31 July 202416 January 2026

In this HackerRank DefaultDict Tutorial in Python problem solution. The defaultdict tool is a container in the collections class of Python. It’s similar to the usual dictionary (dict) container, but the only difference is that a defaultdict will have a default value if that key has not been set yet. If you didn’t use a defaultdict, you’d have to check to see if that key exists, and if it doesn’t, set it to what you want.

In this challenge, you will be given 2 integers, n and m. There are n words, which might repeat, in word group A. There are m words belonging to word group B. For each m words, check whether the word has appeared in group A or not. Print the indices of each occurrence of m in group A. If it does not appear, print -1.

HackerRank DefaultDict Tutorial solution in Python

HackerRank DefaultDict problem solution in Python 2.

from collections import defaultdict
d = defaultdict(list)
n,m = map(int, raw_input().split())
for i in range(1,n+1):
    d[raw_input()].append(str(i))

for _ in range(m):
    w = raw_input()
    if w in d:
        print " ".join(d[w])
    else:
        print -1

DefaultDict Tutorial solution in Python 3.

# Enter your code here. Read input from STDIN. Print output to STDOUT
from collections import defaultdict
d = defaultdict(list)
list1=[]
n, m = map(int,input().split())
for i in range(1, n+1):
    d[input()].append(str(i))


for i in range(m):
    b = input()
    if b in d: print(' '.join(d[b]))
    else: print(-1)

Problem solution in pypy programming.

# Enter your code here. Read input from STDIN. Print output to STDOUT
from collections import defaultdict
d, n = defaultdict(list), list(map(int, raw_input().split()))

for i in xrange(n[0]):
    d[raw_input()].append(i + 1)

for i in xrange(n[1]):
    print ' '.join(map(str, d[raw_input()])) or -1

Problem solution in pypy3 programming.

from collections import defaultdict
d=defaultdict(list)
n,m=map(int,input().split())
x=[]
for i in range(1,n+m+1):
    c=input()
    if(i>n):
        if(d[c]==[]):
            d[c].append(-1)
            x.append(d[c])
        else:
            x.append(d[c])
    else:
        d[c].append(i)

for i in range(m):
    print(" ".join(list(map(str,(x[i])))))

coding problems solutions Hackerrank Problems Solutions Python Solutions HackerRankPython

Post navigation

Previous post
Next post
HackerRank Python Solutions
Say “Hello, World!” With Python solution
Python If-Else problem solution
Arithmetic Operators problem solution
Python Division problem solution
Loops problem solution
Write a function problem solution
Print Function problem solution
List Comprehensions problem solution
Find the Runner-Up Score! problem solution
Nested Lists problem solution
Finding the percentage problem solution
Lists problem solution
Tuples problem problem solution
sWAP case problem solution
String Split and Join problem solution
What’s Your Name? problem solution
Mutations problem solution
Find a string problem solution
String Validators problem solution
Text Alignment problem solution
Text Wrap problem solution
Designer Door Mat problem solution
String Formatting problem solution
Alphabet Rangoli problem solution
Capitalize! problem solution
The Minion Game problem solution
Merge the Tools! problem solution
itertools.product() problem solution
collections.Counter() problem solution
itertools.permutations() problem solution
collections.Counter() problem solution
itertools.permutations() problem solution
Polar Coordinates problem solution
Introduction to Sets problem solution
DefaultDict Tutorial problem solution
Calendar Module problem solution
Exceptions problem solution
Collections.namedtuple() problem solution
Time Delta problem solution
Find Angle MBC problem solution
No Idea! problem solution
Collections.OrderedDict() problem solution
Symmetric Difference problem solution
itertools.combinations() problem solution
Incorrect Regex problem solution
Set .add() problem solution
itertools.combinations_with_replacement() problem solution
Word Order problem solution
Set .discard(), .remove() & .pop() problem solution
Collections.deque() problem solution
Compress the String! problem solution
Company Logo problem solution
Set .union() Operation problem solution
Piling Up! problem solution
Triangle Quest 2 problem solution
Iterables and Iterators problem solution
Set .intersection() Operation problem solution in python
Mod Divmod problem solution
Power — Mod Power problem solution
Maximize It! problem solution
Set .difference() Operation problem solution
Integers Come In All Sizes problem solution
Set .symmetric_difference() Operation problem solution
Set Mutations problem solution
Triangle Quest problem solution
The Captain’s Room problem solution
Check Subset problem solution
Check Strict Superset problem solution
Classes: Dealing with Complex Numbers problem solution
Class 2 — Find the Torsional Angle problem solution
Zipped! problem solution
Input() problem solution
Python Evaluation problem solution
Athlete Sort problem solution
Any or All problem solution
ginortS problem solution
Detect Floating Point Number problem solution
Map and Lambda Function problem solution
Re.split() problem solution
Validating Email Addresses With a Filter problem solution
Group(), Groups() & Groupdict() problem solution
Reduce Function problem solution
Re.findall() & Re.finditer() problem solution
Re.star() & Re.end() problem solution
Regex Substitution problem solution
Validating Roman Numerals problem solution
Validating Phone Numbers problem solution
Validating and parsing Email Addresses problem solution
Hex Color Code problem solution
HTML Parser — Part 1 problem solution
HTML Parser — Part 2 problem solution
Detect HTML Tags, Attributes and Attributes Values problem solution
XML 1 — Find the Score problem solution
Validating UID problem solution
Validating Credit Card Numbers problem solution
XML2 — Find the Maximum Depth problem solution
Standardize Mobile Number using Decorators problem solution
Validating Postal Codes problem solution
Decorators 2 — Name Directory problem solution
Matrix Script problem solution
Words Score problem solution
Arrays problem solution
Shape and Reshape problem solution
default Arguments problem solution
Transpose and Flatten problem solution
Concatenate problem solution
Zeros and One’s problem solution
Eye and Identity problem solution
Array Mathematics problem solution
Floor, Ceil, and Rint problem solution
Sum and Prod problem solution
Min and Max problem solution
Mean, Var, and Std problem solution
Dot and cross problem solution
Inner and Outer problem solution
Polynomials problem solution
Linear Algebra problem solution

Pages

  • About US
  • Contact US
  • Privacy Policy

Follow US

  • YouTube
  • LinkedIn
  • Facebook
  • Pinterest
  • Instagram
©2026 Programmingoneonone | WordPress Theme by SuperbThemes
Advertisement