DEV Community is a community of 901,019 amazing developers

We're a place where coders share, stay up-to-date and grow their careers.

Miss Pooja Anilkumar Patel

Posted on

1857. Leetcode Solution in Cpp

``````class Solution {
public:
int largestPathValue(string colors, vector<vector<int>>& edges) {
const int n = colors.length();
int ans = 0;
int processed = 0;
vector<vector<int>> graph(n);
vector<int> inDegree(n);
queue<int> q;
vector<vector<int>> count(n, vector<int>(26));

// build graph
for (const auto& e : edges) {
const int u = e[0];
const int v = e[1];
graph[u].push_back(v);
++inDegree[v];
}

// topology
for (int i = 0; i < n; ++i)
if (inDegree[i] == 0)
q.push(i);

while (!q.empty()) {
const int out = q.front();
q.pop();
++processed;
ans = max(ans, ++count[out][colors[out] - 'a']);
for (const int in : graph[out]) {
for (int i = 0; i < 26; ++i)
count[in][i] = max(count[in][i], count[out][i]);
if (--inDegree[in] == 0)
q.push(in);
}
}

return processed == n ? ans : -1;
}
};

``````