solution/2000-2099/2065.Maximum Path Quality of a Graph/Solution.ts at main - sarvex/leetcode-q-sharp

main

leetcode-q-sharp

B

solution\2000-2099\2065.Maximum Path Quality of a Graph\Solution.ts

8 Complexity
2.67 Complexity / M
0 Duplication
1 Churn
42 Lines
37 Lines of Code
3 Methods
12.33 LOC / Method

{{getIssueFilterCount()}}

Autofix is being processed.

Found in

{{::issue.Locations[0].Path}}

Found in

{{::location.Path}}:{{::location.StartLine}}-{{::location.EndLine}} ,

{{::lineNumber}}

No issues found

“

Any fool can write code that a computer can understand. Good programmers write code that humans can understand.

– Martin Fowler