Given a directed graph with N nodes and Medges. 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.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Code in C programming only ( not C++ or Java or Python)
BeautifulPath
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 CMocka for writing test cases and GCC Compiler.
**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.
Function beauty has the following parameter(s):
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 lengthm
Y: list of length m
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) ie (aaca)
lonut.
Strictly Use the following Function :-
int beauty(int v, int e, String s, int[] x, int[] y)
Transcribed Image Text:Code in C programming only ( not C++ or Java or Python) BeautifulPath 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 CMocka for writing test cases and GCC Compiler. **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. Function beauty has the following parameter(s): 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 lengthm Y: list of length m 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) ie (aaca) lonut. Strictly Use the following Function :- int beauty(int v, int e, String s, int[] x, int[] y)
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Strongly connected components
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education