Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Please code the following in Java 8 ( images) & for your reference: Function beauty has the following parameters : n = integer, number of nodes m = integer, number of directed edges S : string of length n where ith alphabet denotes the alphabets associated with ith node X : list of length m Y : list of length m

Please code the following in Java 8 ( images) & for your reference: Function beauty has the following parameters : n = integer, number of nodes m = integer, number of directed edges S : string of length n where ith alphabet denotes the alphabets associated with ith node X : list of length m Y : list of length m

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
Please code the following in Java 8 ( images) & for your reference: Function beauty has the following parameters : n = integer, number of nodes m = integer, number of directed edges S : string of length n where ith alphabet denotes the alphabets associated with ith node X : list of length m Y : list of length m
You are supposed to write production ready code with Proper Unit Test Cases, Modularizaton etc. You need to write your test cases under user package in test folder. One sample test is created under same package for reference. Your code will be evaluated on the basis of code coverage, Code Quality, Best Practices and Bugs. NOTE: Here, we use JAVA 8 and GRADLE VERSION 4+. *PROBLEM: ** Given a directed graph with N nodes and M edges. Each node is associated with lowercase english alphabet. Beauty of a path is defined as the number of most frequently occurring alphabet. Find the most beautiful path and return the maximum beauty value it has. **CONSTRAINTS:** 1 < N,M< 300000 **FUNCTION DESCRIPTION: ** Complete the function beauty in code. Function must Return an integer, the beauty of most beautiful path. If the value is very large return -1.
Transcribed Image Text:You are supposed to write production ready code with Proper Unit Test Cases, Modularizaton etc. You need to write your test cases under user package in test folder. One sample test is created under same package for reference. Your code will be evaluated on the basis of code coverage, Code Quality, Best Practices and Bugs. NOTE: Here, we use JAVA 8 and GRADLE VERSION 4+. *PROBLEM: ** Given a directed graph with N nodes and M edges. Each node is associated with lowercase english alphabet. Beauty of a path is defined as the number of most frequently occurring alphabet. Find the most beautiful path and return the maximum beauty value it has. **CONSTRAINTS:** 1 < N,M< 300000 **FUNCTION DESCRIPTION: ** Complete the function beauty in code. Function must Return an integer, the beauty of most beautiful path. If the value is very large return -1.
X, Y: two integers arrays of length M, pair Xi Yi denotes there is an edge from node Xi to Yi. Output Return an integer, the beauty of most beautiful path. If the value is very large return -1. **EXAMPLE:** Input: - n: 5 M: 4 s: abaca x: [1, 1, 3, 4 ] y: [ 2, 3, 4, 5] Output: 3 Explanation- Path with maximum beauty is (1->3- >4->5) de (aaca) Input:- si xeyabe x: 1, 3, 2, 5, 4, 61 y: (2, 1, 3, 4, 3, 4 1 Output:- -1 Explanation- We have path with infinite beauty Le 1-2-3-1 (xzyx...)
Transcribed Image Text:X, Y: two integers arrays of length M, pair Xi Yi denotes there is an edge from node Xi to Yi. Output Return an integer, the beauty of most beautiful path. If the value is very large return -1. **EXAMPLE:** Input: - n: 5 M: 4 s: abaca x: [1, 1, 3, 4 ] y: [ 2, 3, 4, 5] Output: 3 Explanation- Path with maximum beauty is (1->3- >4->5) de (aaca) Input:- si xeyabe x: 1, 3, 2, 5, 4, 61 y: (2, 1, 3, 4, 3, 4 1 Output:- -1 Explanation- We have path with infinite beauty Le 1-2-3-1 (xzyx...)
Expert 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