solution/0100-0199/0159.Longest Substring with At Most Two Distinct Characters/Solution.py at main - Yohann-study/leetcode

main

leetcode

A

solution\0100-0199\0159.Longest Substring with At Most Two Distinct Characters\Solution.py

4 Complexity
4 Complexity / M
0 Duplication
1 Churn
14 Lines
14 Lines of Code
1 Methods
14 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

“

All problems in computer science can be solved by another level of indirection, except for the problem of too many layers of indirection.

– David J. Wheeler