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: PEARSON
Bartleby Related Questions Icon

Related questions

Question

Intro leve Python, please.

[画像:### Longest Common Suffix Problem In the program `problem6.py`, write a function named `longestCommonSuffix` to find the longest common suffix among numbers in a non-empty list of numbers, `nums`. If there is no common suffix, return "Not found". A suffix here means the part to the left from the end of the numbers. For example, 123 has 3 suffixes: 3, 23, and 123. Below is the code of the main function in `problem6.py`. Complete the program by writing the function `longestCommonSuffix`. Note that the value of `nums` is given in the main function which can be changed in the code. This program does not take any input. ```python if __name__ == '__main__': nums = [121, 43123, 523] print(longestCommonSuffix(nums)) ``` #### Example 1: **Input:** ```python nums = [123, 43123, 523] ``` **Output:** ``` 23 ``` #### Example 2: **Input:** ```python nums = [231, 43123, 523] ``` **Output:** ``` Not found ``` In the above examples: - **Example 1** shows that the longest common suffix for the numbers [123, 43123, 523] is 23. - **Example 2** demonstrates a case where there is no common suffix among the numbers [231, 43123, 523], thus the output is "Not found".]
expand button
Transcribed Image Text:### Longest Common Suffix Problem In the program `problem6.py`, write a function named `longestCommonSuffix` to find the longest common suffix among numbers in a non-empty list of numbers, `nums`. If there is no common suffix, return "Not found". A suffix here means the part to the left from the end of the numbers. For example, 123 has 3 suffixes: 3, 23, and 123. Below is the code of the main function in `problem6.py`. Complete the program by writing the function `longestCommonSuffix`. Note that the value of `nums` is given in the main function which can be changed in the code. This program does not take any input. ```python if __name__ == '__main__': nums = [121, 43123, 523] print(longestCommonSuffix(nums)) ``` #### Example 1: **Input:** ```python nums = [123, 43123, 523] ``` **Output:** ``` 23 ``` #### Example 2: **Input:** ```python nums = [231, 43123, 523] ``` **Output:** ``` Not found ``` In the above examples: - **Example 1** shows that the longest common suffix for the numbers [123, 43123, 523] is 23. - **Example 2** demonstrates a case where there is no common suffix among the numbers [231, 43123, 523], thus the output is "Not found".
Expert Solution
Check Mark
Knowledge Booster
Background pattern image
Recommended textbooks for you
Text book image
Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON
Text book image
Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science
Text book image
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning
Text book image
Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning
Text book image
Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education
Text book image
Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY