2421 Number of Good Paths - LeetCode Solution in Java | THE CODE WIZARD

Welcome to my channel.
In this video, I have solved the "Number of Good Paths" problem from LeetCode. This problem is tagged as a hard-level question on Leetcode. This problem has been asked on Daily LeetCoding Challenge on 15th January 2023 and I solved it using Java. This is the efficient solution to this "Number of Good Paths" problem in Java.

Problem: There is a tree (i.e. a connected, undirected graph with no cycles) consisting of n nodes numbered from 0 to n - 1 and exactly n - 1 edges.

You are given a 0-indexed integer array vals of length n where vals[i] denotes the value of the ith node. You are also given a 2D integer array of edges where edges[i] = [ai, bi] denotes that there exists an undirected edge connecting nodes ai and bi.

A good path is a simple path that satisfies the following conditions:
The starting node and the ending node have the same value.
All nodes between the starting node and the ending node have values less than or equal to the starting node (i.e. the starting node's value should be the maximum value along the path).
Return the number of distinct good paths.

Note that a path and its reverse are counted as the same path. For example, 0 - 1 is considered to be the same as 1 - 0. A single node is also considered as a valid path.

I have used the Disjoint Set data structure to solve this problem efficiently.


I hope you found this video helpful! If you have any questions or suggestions, please leave them in the comments below.
Thank you for watching!??

Problem Link: https://leetcode.com/problems/number-of-good-paths/

Keywords relevant to this problem:
Number of Good Paths
Number of Good Paths Disjoint Set Approach
Number of Good Path LeetCode Solution
Disjoint Set problem
Java Programming
Daily Leetcoding Solution

#disjointsets #leetcode #leetcodesolution #problemsolving #problemsolvingskills #set #dailyleetcoding #javaprogramming #leetcodejava #fastest #solution #coding #map #efficent #coding