Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Telephone directory You have a list of names in the telephone directory. These names are stored in a string. Your task is to determine how many anagrams of the string are present in the telephone dictionary. Input format • The first line contains string S denoting the given string. • The second line contains the number N denoting the size of the telephone directory. • Next N lines contains N strings denoting different names in the telephone directory. Output format Print a single integer denoting the total number of anagrams of the given string present in the dictionary. Constraints 1 < DictionarySize < 105 1 < NameLength < 100

Telephone directory You have a list of names in the telephone directory. These names are stored in a string. Your task is to determine how many anagrams of the string are present in the telephone dictionary. Input format • The first line contains string S denoting the given string. • The second line contains the number N denoting the size of the telephone directory. • Next N lines contains N strings denoting different names in the telephone directory. Output format Print a single integer denoting the total number of anagrams of the given string present in the dictionary. Constraints 1 < DictionarySize < 105 1 < NameLength < 100

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

Need a program wrriten in Python 

Telephone directory You have a list of names in the telephone directory. These names are stored in a string. Your task is to determine how many anagrams of the string are present in the telephone dictionary. Input format • The first line contains string S denoting the given string. • The second line contains the number N denoting the size of the telephone directory. • Next N lines contains N strings denoting different names in the telephone directory. Output format Print a single integer denoting the total number of anagrams of the given string present in the dictionary. Constraints 1 < DictionarySize < 105 1 < NameLength < 100
Transcribed Image Text:Telephone directory You have a list of names in the telephone directory. These names are stored in a string. Your task is to determine how many anagrams of the string are present in the telephone dictionary. Input format • The first line contains string S denoting the given string. • The second line contains the number N denoting the size of the telephone directory. • Next N lines contains N strings denoting different names in the telephone directory. Output format Print a single integer denoting the total number of anagrams of the given string present in the dictionary. Constraints 1 < DictionarySize < 105 1 < NameLength < 100
Sample input E> Sample output ranjan aaranja rnjaan ranjan rnjaan akfekda Explanation For the given string ranjan , there are only 3 anagrams of the string present in the list which are rnjaan ranjan rnjaan Note: Your code must be able to print the sample output from the provided sample input. However, your code is run against multiple hidden test cases. Therefore, your code must pass these hidden test cases to solve the problem statement. Limits Time Limit: 1.0 sec(s) for each input file Memory Limit: 256 MB Source Limit: 1024 KB
Transcribed Image Text:Sample input E> Sample output ranjan aaranja rnjaan ranjan rnjaan akfekda Explanation For the given string ranjan , there are only 3 anagrams of the string present in the list which are rnjaan ranjan rnjaan Note: Your code must be able to print the sample output from the provided sample input. However, your code is run against multiple hidden test cases. Therefore, your code must pass these hidden test cases to solve the problem statement. Limits Time Limit: 1.0 sec(s) for each input file Memory Limit: 256 MB Source Limit: 1024 KB
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS