1.1 Input text is an unsorted list of strings. Each string contains only lowercase a-z characters. text can contain duplicates. queries is a list of strings consisting only of lowercase a-z characters. Each string in queries is a prefix of some string in text (note that a string is a prefix of itself). 1.2 Output lex_pos outputs a list of numbers. The ith number in this list is the number of words in text which are lexicographically greater than the ith element of queries 1.3 Example text = ["aaa", "bab","aba","baa", "baa","aab","bab"] queries = ["", "a", "b", "aab"] lex_pos (text, queries) >>> [7, 7, 4, 5] 1.4 Complexity Remember that string comparison is not considered O(1) in this unit. lex_pos should run in O(T + Q) time, where • T is the sum of the number of characters in all strings in text • Q is the total number of characters in queries
1.1 Input text is an unsorted list of strings. Each string contains only lowercase a-z characters. text can contain duplicates. queries is a list of strings consisting only of lowercase a-z characters. Each string in queries is a prefix of some string in text (note that a string is a prefix of itself). 1.2 Output lex_pos outputs a list of numbers. The ith number in this list is the number of words in text which are lexicographically greater than the ith element of queries 1.3 Example text = ["aaa", "bab","aba","baa", "baa","aab","bab"] queries = ["", "a", "b", "aab"] lex_pos (text, queries) >>> [7, 7, 4, 5] 1.4 Complexity Remember that string comparison is not considered O(1) in this unit. lex_pos should run in O(T + Q) time, where • T is the sum of the number of characters in all strings in text • Q is the total number of characters in queries
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...
Related questions
Question
Pyton code please
![Cnan a 81
10 SUIVE CHIS proDiem, you wilh
WITCE a
-Pos
1.1 Input
text is an unsorted list of strings. Each string contains only lowercase a-z characters. text
can contain duplicates.
queries is a list of strings consisting only of lowercase a-z characters. Each string in queries
is a prefix of some string in text (note that a string is a prefix of itself).
1.2 Output
lex_pos outputs a list of numbers. The ith number in this list is the number of words in text
which are lexicographically greater than the ith element of queries
1.3 Example
text = ["aaa","bab","aba" ,"baa","baa","aab","bab"]
queries
lex_pos (text, queries)
>>> [7, 7, 4, 5]
["", "a", "b", "aab"]
=
1.4 Complexity
Remember that string comparison is not considered O(1) in this unit.
lex_pos should run in O(T + Q) time, where
• T is the sum of the number of characters in all strings in text
• Q is the total number of characters in queries](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F42cade82-02de-4ace-9957-aef794461689%2F2526d6a2-e83d-4f1b-b57e-8aa8ad702c2c%2Fsi1kqob_processed.png&w=3840&q=75)
Transcribed Image Text:Cnan a 81
10 SUIVE CHIS proDiem, you wilh
WITCE a
-Pos
1.1 Input
text is an unsorted list of strings. Each string contains only lowercase a-z characters. text
can contain duplicates.
queries is a list of strings consisting only of lowercase a-z characters. Each string in queries
is a prefix of some string in text (note that a string is a prefix of itself).
1.2 Output
lex_pos outputs a list of numbers. The ith number in this list is the number of words in text
which are lexicographically greater than the ith element of queries
1.3 Example
text = ["aaa","bab","aba" ,"baa","baa","aab","bab"]
queries
lex_pos (text, queries)
>>> [7, 7, 4, 5]
["", "a", "b", "aab"]
=
1.4 Complexity
Remember that string comparison is not considered O(1) in this unit.
lex_pos should run in O(T + Q) time, where
• T is the sum of the number of characters in all strings in text
• Q is the total number of characters in queries
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 2 images
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY