{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"ICanGuessTheDataStructure.main (cyclomatic 18): ICanGuessTheDataStructure.main has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/ICanGuessTheDataStructure.java"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28932eb124dda25a0a476c6e187132700eff4d2607991a48b917113300ef0fd"}},{"ruleId":"D1","level":"warning","message":{"text":"ShortestDistanceFromAllBuildings.shortestDistance (cyclomatic 16): ShortestDistanceFromAllBuildings.shortestDistance has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/ShortestDistanceFromAllBuildings.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c6c91abc14d4d39e90cc2fbf2b3650244e904712ab01ff1c6aec44ecda3aa8"}},{"ruleId":"D1","level":"warning","message":{"text":"Shortest.shortestDistance (cyclomatic 16): Shortest.shortestDistance has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/breadth-first-search/ShortestDistanceFromAllBuildings.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f25bfe37a328c0c4c2a0b01afd3717fe6f27848afda15d4737adedc07ed82fd"}},{"ruleId":"D2","level":"warning","message":{"text":"ShortestDistanceFromAllBuildings.shortestDistance (cognitive 39): ShortestDistanceFromAllBuildings.shortestDistance has cognitive complexity 39 (threshold 15). Drivers by points: loops 7 (21 pts), if/else 4 (14 pts), boolean chains 3, ternaries 1 (nesting depth added 24). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/ShortestDistanceFromAllBuildings.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2590bc574700e818477397a5bf0f7ee8480ffc84b510b5710bc9995abcca4f7d"}},{"ruleId":"D2","level":"warning","message":{"text":"Shortest.shortestDistance (cognitive 39): Shortest.shortestDistance has cognitive complexity 39 (threshold 15). Drivers by points: loops 7 (21 pts), if/else 4 (14 pts), boolean chains 3, ternaries 1 (nesting depth added 24). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/breadth-first-search/ShortestDistanceFromAllBuildings.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2577dd251e46d9b3fa43f3dc181d09cc774670da4beddc6d409aad78f3631554"}},{"ruleId":"D2","level":"warning","message":{"text":"ICanGuessTheDataStructure.main (cognitive 32): ICanGuessTheDataStructure.main has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/ICanGuessTheDataStructure.java"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23c9742634c395f855055e424b3db2ae1250803d47a701a9dd665698cc8546f"}},{"ruleId":"D2","level":"warning","message":{"text":"SolveEquation.main (cognitive 27): SolveEquation.main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/SolveEquation.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2cece7d4988a69a27f576b568aba8ccd20119225350992d568bd80c44b9e39"}},{"ruleId":"D2","level":"warning","message":{"text":"RegularExpressionMatching.isMatch (cognitive 25): RegularExpressionMatching.isMatch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/airbnb/RegularExpressionMatching.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"37744f16a1d3d6f8da9bf47fac89a8bf3cef6d0330107b0e8829c996fea98618"}},{"ruleId":"D2","level":"warning","message":{"text":"RegularExpressionMatching.isMatch (cognitive 25): RegularExpressionMatching.isMatch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/RegularExpressionMatching.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5add6525df475ac085751604fc0972804fe0f26e466d44d60ffc4dfa729edbb3"}},{"ruleId":"D2","level":"warning","message":{"text":"RegularExpressionMatching.isMatch (cognitive 25): RegularExpressionMatching.isMatch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/twitter/RegularExpressionMatching.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d492a5a783c60f243f93cbf07c4ebf27cec89dd5cbd5d3ac060ffe0d74b61a07"}},{"ruleId":"D2","level":"warning","message":{"text":"RegularExpressionMatching.isMatch (cognitive 25): RegularExpressionMatching.isMatch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/uber/RegularExpressionMatching.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1dbf4cde7375e9e553ad351e6e9c6de130236e281429e8812767bd9337cb8b"}},{"ruleId":"D2","level":"warning","message":{"text":"RegularExpressionMatching.isMatch (cognitive 25): RegularExpressionMatching.isMatch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/dynamic-programming/RegularExpressionMatching.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dbacadff3591409f339da994d447bbbd4192451e34085b8ba139b44facb355"}},{"ruleId":"D2","level":"warning","message":{"text":"PaintHouseII.minCostII (cognitive 23): PaintHouseII.minCostII has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (8 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/PaintHouseII.java"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c188b498a8313525710f77b0a7550333106ecab74ff2563c2a1a9baaec38a68"}},{"ruleId":"D2","level":"warning","message":{"text":"BombEnemy.maxKilledEnemies (cognitive 23): BombEnemy.maxKilledEnemies has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), ternaries 1 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/BombEnemy.java"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba74bb0ba93fb2524ebd32ccbd08eee4e6441b8132a1c65ed71093da6c7831cb"}},{"ruleId":"D2","level":"warning","message":{"text":"BombEnemy.maxKilledEnemies (cognitive 23): BombEnemy.maxKilledEnemies has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), ternaries 1 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/dynamic-programming/BombEnemy.java"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"620958f1d11b5db07dbe3d2a93dbdf7c2c30d47bccf4835b30c842f4b03044f9"}},{"ruleId":"D2","level":"warning","message":{"text":"PaintHouseII.minCostII (cognitive 23): PaintHouseII.minCostII has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (8 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/dynamic-programming/PaintHouseII.java"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebf835a5d88d5c54d24552969ee8b8d75d52b1c6cb90530bd66d4d761e44975"}},{"ruleId":"D2","level":"warning","message":{"text":"WhatBaseIsThis.main (cognitive 20): WhatBaseIsThis.main has cognitive complexity 20 (threshold 15). Drivers by points: error handling 2 (7 pts), if/else 2 (6 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/WhatBaseIsThis.java"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"154d2e1a421c006c5863cfd6fadc55d3eb1a9230a8d85a4a0db601e24fdebfd4"}},{"ruleId":"D2","level":"warning","message":{"text":"SpiralMatrix.spiralOrder (cognitive 18): SpiralMatrix.spiralOrder has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/SpiralMatrix.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbc4aa18b7ad334cf309cdf9c9118fb5c86ef05b4ccebcad4bcf9b1c02b303f"}},{"ruleId":"D2","level":"warning","message":{"text":"FindPath.search (cognitive 18): FindPath.search has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cracking-the-coding-interview/chapter-four-trees-and-graphs/FindPath.java"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecc209bc777ab86c2971f7a0577acb5a03327a334760aba83b60864bc7ccd63"}},{"ruleId":"D2","level":"warning","message":{"text":"SpiralMatrix.spiralOrder (cognitive 18): SpiralMatrix.spiralOrder has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/microsoft/SpiralMatrix.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"74290cd01cb45521d4edc859d5a5f20dba56cd769ff8b1116dbfab8ca214ecc8"}},{"ruleId":"D2","level":"warning","message":{"text":"SpiralMatrix.spiralOrder (cognitive 18): SpiralMatrix.spiralOrder has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/uber/SpiralMatrix.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce52b7926ab74f19815f7cfee4ea8a2abcaa1e65834b21632595a80c16c216c"}},{"ruleId":"D2","level":"warning","message":{"text":"SpiralMatrix.spiralOrder (cognitive 18): SpiralMatrix.spiralOrder has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/array/SpiralMatrix.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b956affc8e524739a20b38f0c75bc0f77f9059373e69ba6d192ef21d0198a4f"}},{"ruleId":"D2","level":"warning","message":{"text":"MinimumWindowSubstring.minWindow (cognitive 17): MinimumWindowSubstring.minWindow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (5 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/MinimumWindowSubstring.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7466972c3d20b8867528648a94c4cd368f6a067976860ba540c2e12b0342d8"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchInRotatedSortedArray.search (cognitive 17): SearchInRotatedSortedArray.search has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/SearchInRotatedSortedArray.java"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c92d7cd606aca4c7853189aec59786bcbb0e92d08776200183e7ef4775cc61"}},{"ruleId":"D2","level":"warning","message":{"text":"MischievousChildren.main (cognitive 17): MischievousChildren.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/MischievousChildren.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef25b9c6685b3043216557255b369a1d03b603783ceea4a31a3551cb9b3df90"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenSource.main (cognitive 17): OpenSource.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/OpenSource.java"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e10c09fb1e5b4371af66b9ff0ccb9a5b0f02d6a36ff98836451253f79bb683"}},{"ruleId":"D2","level":"warning","message":{"text":"MinimumWindowSubstring.minWindow (cognitive 17): MinimumWindowSubstring.minWindow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (5 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/linkedin/MinimumWindowSubstring.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afb77ab486790c82f429d4936244791d849b217c7d93a5c2d09a8869cc43331"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchInRotatedSortedArray.search (cognitive 17): SearchInRotatedSortedArray.search has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/linkedin/SearchInRotatedSortedArray.java"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12ec81663a36b4323b1d72f04a6b9bf370e029b1ea8509b7bc2f916ccdde8bb"}},{"ruleId":"D2","level":"warning","message":{"text":"MinimumWindowSubstring.minWindow (cognitive 17): MinimumWindowSubstring.minWindow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (5 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/uber/MinimumWindowSubstring.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f487efa5440a56a5d307fb0f65680f5f2bc2a8c3fb5c6e3f007d632fe9c1bb2"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchInRotatedSortedArray.search (cognitive 17): SearchInRotatedSortedArray.search has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/uber/SearchInRotatedSortedArray.java"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3f9a7569b19b78be195cbcc4d7692ea70398577f98ae1210e805d3e389589b"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchInRotatedSortedArray.search (cognitive 17): SearchInRotatedSortedArray.search has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/array/SearchInRotatedSortedArray.java"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db211e986e465e59f74f8d03453137f57aaadf88dc0168e375b04feedd065b9"}},{"ruleId":"D2","level":"warning","message":{"text":"SpiralMatrix.generateMatrix (cognitive 17): SpiralMatrix.generateMatrix has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 3 (7 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/array/SpiralMatrixII.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"846fef9a6d9b6d2d83b33ca25549fff6128e2468775b6ebe7299cbc86a4997cc"}},{"ruleId":"D2","level":"warning","message":{"text":"MinimumWindowSubstring.minWindow (cognitive 17): MinimumWindowSubstring.minWindow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (5 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/hash-table/MinimumWindowSubstring.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce8d0a0ec55787434f397a4318359787a198b04bcb98f5d1a5c1977b18ab961"}},{"ruleId":"D2","level":"warning","message":{"text":"MinimumWindowSubstring.minWindow (cognitive 17): MinimumWindowSubstring.minWindow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (5 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/string/MinimumWindowSubstring.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02102681501d3345a42a25a26c6c280b8df5fc52fc47fa38c04c4fec4d13317"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoveInvalidParentheses.remove (cognitive 16): RemoveInvalidParentheses.remove has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/RemoveInvalidParentheses.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88ce87c3745f4fda626fb586895b9ab6eca2b29718c0a337068caa6296c5c72"}},{"ruleId":"D2","level":"warning","message":{"text":"GameOfLife.gameOfLife (cognitive 16): GameOfLife.gameOfLife has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/GameOfLife.java"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6506e0ca89a679a909e8c144971d415e787a48a3ed087f11a65fcfc9b63666e4"}},{"ruleId":"D2","level":"warning","message":{"text":"CoconutsRevisited.main (cognitive 16): CoconutsRevisited.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/CoconutsRevisited.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a515f77fd79d336a4af77f56b36a2b9efbdb5db10930fedce7f5331ab04760"}},{"ruleId":"D2","level":"warning","message":{"text":"GameOfLife.gameOfLife (cognitive 16): GameOfLife.gameOfLife has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/array/GameOfLife.java"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a9827e22bd08e84e211e8a3f9470eed16f56131294c8fd0ad3b45a5b6d868b"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoveInvalidParentheses.remove (cognitive 16): RemoveInvalidParentheses.remove has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/breadth-first-search/RemoveInvalidParentheses.java"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"da73b55134fce2b37c81a43fc1b360d282e672718b8e99a44e662e9b08b73540"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 32 shared lines): company/airbnb/RegularExpressionMatching.java:21-56 | company/facebook/RegularExpressionMatching.java:21-56 | company/twitter/RegularExpressionMatching.java:21-56 | company/uber/RegularExpressionMatching.java:21-56 | leetcode/dynamic-programming/RegularExpressionMatching.java:21-56 \u2014 These 5 members are variants of one another: a block of 32 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/airbnb/RegularExpressionMatching.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e24bad1ee7d65172c00156267bbf4dd14f83f275357be04dd2dd0dafc9cd594"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 13 shared lines): company/facebook/OneEditDistance.java:4-24 | company/twitter/OneEditDistance.java:4-24 | company/uber/OneEditDistance.java:4-24 | leetcode/string/OneEditDistance.java:4-25 \u2014 These 4 members are variants of one another: a block of 13 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/OneEditDistance.java"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de4d6ae9d0d8819f562537d8c37c53ecbc1246ce9323678568ac4a50af1109e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): company/linkedin/PaintHouse.java:13-25 | leetcode/dynamic-programming/PaintHouse.java:13-25 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/linkedin/PaintHouse.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cbb52b19f44fe443242d8fdf80c1602f15b7fe90745a811361c2e069dbd0f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): company/airbnb/MergeKSortedLists.java:12-50 | company/amazon/MergeKSortedLists.java:12-49 | company/facebook/MergeKSortedLists.java:12-49 | company/linkedin/MergeKSortedLists.java:12-49 | company/twitter/MergeKSortedLists.java:12-49 | company/uber/MergeKSortedLists.java:12-49 | leetcode/linked-list/MergeKSortedLists.java:12-49 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/airbnb/MergeKSortedLists.java"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2560acb89c6a7ca303edf61d719ef72d14f70f950866418d7deacfea57073833"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): company/airbnb/TwoSum.java:12-29 | company/amazon/TwoSum.java:12-29 | company/facebook/TwoSum.java:12-29 | company/linkedin/TwoSum.java:12-29 | company/uber/TwoSum.java:12-28 | leetcode/hash-table/TwoSum.java:12-29 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/airbnb/TwoSum.java"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"280860f20cf911cb87beaee1f76709cca8414ead2e9705cf0e9a7ceb7817c3ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): company/airbnb/ValidParentheses.java:6-28 | company/amazon/ValidParentheses.java:6-28 | company/facebook/ValidParentheses.java:6-28 | company/google/ValidParentheses.java:6-28 | company/twitter/ValidParentheses.java:6-28 | leetcode/string/ValidParentheses.java:6-28 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/airbnb/ValidParentheses.java"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c1be901b69ebbd2596a57be2c208462fdf51471dbacb9ceceba850417b28fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): company/amazon/FirstUniqueCharacterInAString.java:13-33 | company/bloomberg/FirstUniqueCharacterInAString.java:13-33 | company/google/FirstUniqueCharacterInAString.java:13-33 | company/microsoft/FirstUniqueCharacterInAString.java:13-33 | leetcode/hash-table/FirstUniqueCharacterInAString.java:13-33 | leetcode/string/FirstUniqueCharacterInAString.java:13-33 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/FirstUniqueCharacterInAString.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ebd1836eacce1620908de19cb96832bccb622b59d7ec868880dd3e03c7b614"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): company/amazon/LinkedListCycle.java:16-29 | company/bloomberg/LinkedListCycle.java:16-29 | company/microsoft/LinkedListCycle.java:16-29 | company/yahoo/LinkedListCycle.java:16-29 | leetcode/linked-list/LinkedListCycle.java:16-29 | leetcode/two-pointers/LinkedListCycle.java:16-29 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/LinkedListCycle.java"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfddd8526d8ae9b4cb5516479b189b97f64e2f921a69987d8cab025b11f3bd08"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): company/apple/ReverseWordsInAString.java:7-15 | company/bloomberg/ReverseWordsInAString.java:7-15 | company/microsoft/ReverseWordsInAString.java:7-15 | company/snapchat/ReverseWordsInAString.java:7-15 | company/yelp/ReverseWordsInAString.java:7-15 | leetcode/string/ReverseWordsInAString.java:7-15 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/apple/ReverseWordsInAString.java"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5e0a37f4ad8b32b5cee0a7262fa64cd944974553d448d62bb6229b74cb28e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): company/amazon/LetterCombinationsOfAPhoneNumber.java:18-41 | company/facebook/LetterCombinationsOfAPhoneNumber.java:18-41 | company/google/LetterCombinationsOfAPhoneNumber.java:18-41 | company/uber/LetterCombinationsOfAPhoneNumber.java:18-41 | leetcode/backtracking/LetterCombinationsOfAPhoneNumber.java:18-41 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/LetterCombinationsOfAPhoneNumber.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98af320d7a4ce9c61d20ca9d1f107141164066329b88dfb1ef0ba0311aec4c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): company/amazon/LetterCombinationsOfAPhoneNumber.java:43-53 | company/facebook/LetterCombinationsOfAPhoneNumber.java:43-53 | company/google/LetterCombinationsOfAPhoneNumber.java:43-53 | company/uber/LetterCombinationsOfAPhoneNumber.java:43-53 | leetcode/backtracking/LetterCombinationsOfAPhoneNumber.java:43-53 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/LetterCombinationsOfAPhoneNumber.java"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefdeb68a858904d9d7f5499fcdf0f980b0d45c7e325fa6429e94a9b6fed9d3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): company/amazon/LowestCommonAncestorOfABinaryTree.java:24-37 | company/facebook/LowestCommonAncestorOfABinaryTree.java:24-37 | company/linkedin/LowestCommonAncestorOfABinaryTree.java:24-37 | company/twitter/LowestCommonAncestorOfABinaryTree.java:24-37 | leetcode/tree/LowestCommonAncestorOfABinaryTree.java:24-37 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/LowestCommonAncestorOfABinaryTree.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e134b0e45b2fc751cbf723278783836457468ba03b84e8ce18904fdd3356efa"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): company/amazon/WordBreak.java:10-25 | company/facebook/WordBreak.java:10-25 | company/google/WordBreak.java:10-24 | company/uber/WordBreak.java:10-24 | leetcode/dynamic-programming/WordBreak.java:10-25 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/WordBreak.java"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"108e110aabd68b831a95bf0cc7a17c9879221f3166b2f61e7b0c982672f9d6c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): company/facebook/ImplementTrie.java:32-44 | company/google/ImplementTrie.java:32-44 | company/twitter/ImplementTrie.java:32-45 | company/uber/ImplementTrie.java:32-44 | leetcode/trie/ImplementTrie.java:36-48 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/ImplementTrie.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbf455611b468ae70d30c105e919fa99516729ef7c555afe90fd8126a29ee8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): company/facebook/ImplementTrie.java:47-63 | company/google/ImplementTrie.java:47-63 | company/twitter/ImplementTrie.java:48-64 | company/uber/ImplementTrie.java:47-63 | leetcode/trie/ImplementTrie.java:51-67 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/ImplementTrie.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeee72f6ce3ff64cbd5aa21562b298b41e9a26eb609964393326a59552cda6de"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): company/facebook/MergeIntervals.java:17-42 | company/google/MergeIntervals.java:17-42 | company/linkedin/MergeIntervals.java:17-42 | company/twitter/MergeIntervals.java:17-42 | leetcode/array/MergeIntervals.java:17-42 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/MergeIntervals.java"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3614887df930084bcd67138c77f54ee731e1c9b3a1efe0ba0cc986c8d1ca9dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): company/facebook/MinimumWindowSubstring.java:14-63 | company/linkedin/MinimumWindowSubstring.java:14-63 | company/uber/MinimumWindowSubstring.java:14-63 | leetcode/hash-table/MinimumWindowSubstring.java:14-63 | leetcode/string/MinimumWindowSubstring.java:13-62 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/MinimumWindowSubstring.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aaec24e7e81405df99a241d927007c04e4a40da99db7a6c9e24b337f9d446df"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): company/airbnb/ContainsDuplicatesII.java:5-17 | company/palantir/ContainsDuplicatesII.java:5-17 | leetcode/array/ContainsDuplicatesII.java:5-17 | leetcode/hash-table/ContainsDuplicatesII.java:5-17 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/airbnb/ContainsDuplicatesII.java"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce7e4176c74b53abce2e86c0124f0d1719f867a0c8a1427059f507249a6a882"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): company/amazon/BestTimeToBuyAndSellStock.java:17-35 | company/facebook/BestTimeToBuyAndSellStock.java:17-35 | company/uber/BestTimeToBuyOrSellStock.java:17-35 | leetcode/array/BestTimeToBuyAndSellStock.java:17-35 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/BestTimeToBuyAndSellStock.java"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fab06e6dc1892377bd003c02faee11e7d7b88a17bc4c0d42c6f4f1c6bffe23"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): company/amazon/BinaryTreeLevelOrderTraversal.java:27-69 | company/facebook/BinaryTreeLevelOrderTraversal.java:27-69 | company/linkedin/BinaryTreeLevelOrderTraversal.java:27-69 | leetcode/breadth-first-search/BinaryTreeLevelOrderTraversal.java:27-69 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/BinaryTreeLevelOrderTraversal.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3bfe8b272d4c54a0fa0f2d13de2a0e35c6e9f2dc4b08ae143f6c77aca47172"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): company/amazon/GroupAnagrams.java:14-38 | company/facebook/GroupAnagrams.java:14-38 | company/uber/GroupAnagrams.java:14-38 | leetcode/hash-table/GroupAnagrams.java:14-38 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/GroupAnagrams.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8dc3281794c90fd9c84332c2bc9b96937929a8765ad49c186368635d6a20f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): company/amazon/LongestPalindromicSubstring.java:14-29 | company/bloomberg/LongestPalindromicSubstring.java:14-29 | company/microsoft/LongestPalindromicSubstring.java:14-29 | leetcode/string/LongestPalindromicSubstring.java:14-29 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/LongestPalindromicSubstring.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b5c94a7d6f235f3ab7e640e49bca75002abc0198ca3866e883ded73d6fed90"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): company/amazon/NumberOfIslands.java:22-40 | company/facebook/NumberOfIslands.java:22-39 | company/google/NumberOfIslands.java:22-39 | leetcode/depth-first-search/NumberOfIslands.java:22-39 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/NumberOfIslands.java"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4655e570ac2efcd3cbc91fcfbefbae3955b157671f146c67b2318c692af05d89"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): company/amazon/NumberOfIslands.java:42-59 | company/facebook/NumberOfIslands.java:41-58 | company/google/NumberOfIslands.java:41-58 | leetcode/depth-first-search/NumberOfIslands.java:41-58 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/NumberOfIslands.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e6fed99dceea8523c03cb42fc321c63eca389b9d682f8eb48000b80603f023"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): company/amazon/ProductOfArrayExceptSelf.java:11-35 | company/facebook/ProductOfArrayExceptSelf.java:11-35 | company/linkedin/ProductOfArrayExceptSelf.java:11-35 | leetcode/array/ProductofArrayExceptSelf.java:11-35 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/ProductOfArrayExceptSelf.java"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c549df4954b949f6a828c3881461ed647dbcc0085a742f7127f1c0f63a87be"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): company/amazon/Subsets.java:29-43 | company/facebook/Subsets.java:29-43 | company/uber/Subsets.java:29-42 | leetcode/array/Subsets.java:28-41 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/Subsets.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b0606a72bdc73c4a98f44b853788ec30de2d9409f5d1d3c19e8065273e0567"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): company/amazon/TrappingRainWater.java:7-30 | company/google/TrappingRainWater.java:7-30 | company/twitter/TrappingRainWater.java:7-30 | leetcode/stack/TrappingRainWater.java:7-30 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/TrappingRainWater.java"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"81df761d04878334b004869dbfc61668303db39425dc4950d598e89b9792c3aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): company/apple/ValidSudoku.java:9-29 | company/snapchat/ValidSudoku.java:9-29 | company/uber/ValidSudoku.java:9-29 | leetcode/hash-table/ValidSudoku.java:9-29 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/apple/ValidSudoku.java"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b683ee14b117a2fdcdb4f6ebcb36372743e1d8616206f77d4b20b9e150521e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): company/facebook/CloneGraph.java:34-51 | company/google/CloneGraph.java:34-51 | company/uber/CloneGraph.java:34-51 | leetcode/breadth-first-search/CloneGraph.java:34-51 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/CloneGraph.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7989957bb495b73030c2aa6aaa7d4ed54733f62648f0c8a3d414850ce00e7d62"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): company/facebook/FlattenNestedListIterator.java:47-63 | company/google/FlattenNestedListIterator.java:47-63 | company/twitter/FlattenNestedListIterator.java:47-63 | leetcode/stack/FlattenNestedListIterator.java:47-63 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/FlattenNestedListIterator.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"234e682f93023fdfa9999620b03a55a8a5df2111200f877519014a700d07305f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): company/facebook/InsertInterval.java:23-38 | company/google/InsertInterval.java:23-38 | company/linkedin/InsertInterval.java:23-38 | leetcode/array/InsertInterval.java:23-38 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/InsertInterval.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e147a28db11e544ebea968be14e924a470f3ea08e5f7b2653be8c311393ff56"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): company/facebook/PalindromicSubstrings.java:18-29 | company/linkedin/PalindromicSubstrings.java:18-29 | leetcode/dynamic-programming/PalindromicSubstrings.java:18-29 | leetcode/string/PalindromicSubstrings.java:18-29 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/PalindromicSubstrings.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c381423e9f1e56529aad3135a3f80b7665dafee66303de096bce387994d9ec2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): company/facebook/PowerOfXToTheN.java:4-19 | company/google/PowerOfXToTheN.java:4-19 | company/linkedin/PowerOfXToTheN.java:4-19 | leetcode/binary-search/PowerOfXToTheN.java:4-19 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/PowerOfXToTheN.java"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"18651064baadab8dc33aa5a54edec4ae94646c5ca3a9c66a4c90254ccb0bfff6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): company/facebook/SearchInRotatedSortedArray.java:10-39 | company/linkedin/SearchInRotatedSortedArray.java:10-39 | company/uber/SearchInRotatedSortedArray.java:10-39 | leetcode/array/SearchInRotatedSortedArray.java:10-39 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/SearchInRotatedSortedArray.java"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb3b80edc02dd168bf6cb6c89c1bf667d9981d72413014e5f4764c8331c61e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): company/google/GenerateParentheses.java:21-34 | company/uber/GenerateParentheses.java:9-22 | leetcode/backtracking/GenerateParentheses.java:21-34 | leetcode/string/GenerateParentheses.java:21-34 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/GenerateParentheses.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e35d6dae1dc30597ff193191aee8e5868809f4c173eed7814c8829d09015bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): company/google/SpiralMatrix.java:23-60 | company/microsoft/SpiralMatrix.java:23-60 | company/uber/SpiralMatrix.java:23-60 | leetcode/array/SpiralMatrix.java:23-60 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/SpiralMatrix.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a76ee49a3b9c5d7a4a53a783b550b209e75f7993a52fa0dec42c0817addef6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): company/facebook/MultiplyStrings.java:11-37 | company/twitter/MultiplyStrings.java:11-38 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/MultiplyStrings.java"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4392804a764dcb6eebc7114da5c77771b23e2a76fa2c313f0e810921e24092f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): company/facebook/CountAndSay.java:27-52 | leetcode/string/CountAndSay.java:22-42 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/CountAndSay.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c7576733ce8b373df84be0bb2aa92ef6993574dbc70220d7019baff01b9e21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): company/google/GameOfLife.java:45-57 | leetcode/array/GameOfLife.java:45-57 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/GameOfLife.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d5801b1c748541e4082c5a1259018882cb6c3c82040da4608b9cffe9c2bfb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): uva/GoldbachConjecture.java:66-80 | uva/PrimeFactors.java:120-134 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/GoldbachConjecture.java"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d567ec3bf4ac41212414e822b541483e092c67b865ba4338f95fa79615b4aaa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): company/linkedin/MaximumSubarray.java:7-20 | leetcode/array/MaximumSubarray.java:8-26 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/linkedin/MaximumSubarray.java"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0a0e8dcbb6e471c0c2bab69d4b34047c1fc268dc4635c14e0beb21bb0038f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): company/google/MissingRanges.java:6-17 | leetcode/array/MissingRanges.java:6-15 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/MissingRanges.java"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5838f2b629484433febed1b1e34790ba0045ad0e7a794e38b19eebcbd29306"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): uva/HashmatWarriors.java:29-39 | uva/HighSchoolPhysics.java:24-34 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/HashmatWarriors.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd76723cfa49df12d4ab5ce5311a5f6743c2338b326270855f66a6e9501d8e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): company/facebook/WallsAndGates.java:31-46 | company/google/WallsAndGates.java:31-46 | leetcode/breadth-first-search/WallsAndGates.java:31-46 | leetcode/depth-first-search/BattleshipsInABoard.java:38-46 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/WallsAndGates.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"236989ba5b67a5b5c7b4476fab7248a93618b8b4a7319a19efff2a1fc729f9bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): leetcode/dynamic-programming/ClimbingStairs.java:8-19 | leetcode/dynamic-programming/UniqueBinarySearchTrees.java:13-26 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/dynamic-programming/ClimbingStairs.java"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4630e6a6e76fd6db95900b1ec27f4d1bcaadc11bd03fbb80ae0a3cebff3d9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): company/amazon/ValidateBinarySearchTree.java:37-45 | company/facebook/ValidateBinarySearchTree.java:37-45 | leetcode/tree/ValidateBinarySearchTree.java:37-45 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/ValidateBinarySearchTree.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a269d65150aa17bae259f59b55881d085187b949fd240d3eca2cd69873c772"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): company/facebook/WallsAndGates.java:20-29 | company/google/WallsAndGates.java:20-29 | leetcode/breadth-first-search/WallsAndGates.java:20-29 | leetcode/depth-first-search/BattleshipsInABoard.java:23-36 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/WallsAndGates.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd36419113c12c98d1edbd2d151e0e12d55b2542cc0bc913ad7077e2a2466278"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): company/google/StrobogrammaticNumber.java:8-16 | leetcode/hash-table/StrobogrammaticNumber.java:8-16 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/StrobogrammaticNumber.java"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"01edd263241bf3b9b4a6d4b4f9e83259524fcff03e5118fab94c38c90b59ac18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): uva/Modex.java:36-47 | uva/WhoSaidCrisis.java:36-45 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/Modex.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"72016a3ea0aa1db1f6dcc7c0ad4f74ccf8f294aff1effe73790851308444a70f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): company/google/UniqueWordAbbreviation.java:53-55 | leetcode/hash-table/UniqueWordAbbreviation.java:53-55 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/UniqueWordAbbreviation.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"59883033e9b9f9f9e8c303cc44d60021d27c6d3eddba7676131d07f84414be01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51\u201352 lines \u00D7 2): company/google/DecodeString.java:12-63 | leetcode/stack/DecodeString.java:12-62 \u2014 before extracting anything, compare \u0060company/google/DecodeString.java\u0060 and \u0060leetcode/stack/DecodeString.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/DecodeString.java"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"880d18c9d72d3d3bd325a6abfbaeef112383b6bac1a46a67b7a7e4b28462ddfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 5): company/facebook/MinimumWindowSubstring.java:15-63 | company/linkedin/MinimumWindowSubstring.java:15-63 | company/uber/MinimumWindowSubstring.java:15-63 | leetcode/hash-table/MinimumWindowSubstring.java:15-63 | leetcode/string/MinimumWindowSubstring.java:14-62 \u2014 \u0060company/facebook/MinimumWindowSubstring.java\u0060 and \u0060company/linkedin/MinimumWindowSubstring.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 49 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/MinimumWindowSubstring.java"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e5a91c6a1b89ee176d0957ee8db34f0186daa4fa2867ab9ab9b565a9f7a5da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 3): company/amazon/3Sum.java:13-58 | company/facebook/3Sum.java:13-58 | leetcode/two-pointers/3Sum.java:13-58 \u2014 \u0060company/amazon/3Sum.java\u0060 and \u0060company/facebook/3Sum.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 46 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/3Sum.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"698aa08b5b9ef5bab0b65d56cc30493b847bb4e1cc9fc0102cde7d5c0cb35769"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 3): company/facebook/BinaryTreeVerticalOrderTraversal.java:69-113 | company/google/BinaryTreeVerticalOrderTraversal.java:69-113 | leetcode/hash-table/BinaryTreeVerticalOrderTraversal.java:69-113 \u2014 \u0060company/facebook/BinaryTreeVerticalOrderTraversal.java\u0060 and \u0060company/google/BinaryTreeVerticalOrderTraversal.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 45 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/BinaryTreeVerticalOrderTraversal.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3015787f077b11a702ed3c224ca19e7cfbd589ff904d20d7530ca31dc7bed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 4): company/amazon/BinaryTreeLevelOrderTraversal.java:28-69 | company/facebook/BinaryTreeLevelOrderTraversal.java:28-69 | company/linkedin/BinaryTreeLevelOrderTraversal.java:28-69 | leetcode/breadth-first-search/BinaryTreeLevelOrderTraversal.java:28-69 \u2014 \u0060company/amazon/BinaryTreeLevelOrderTraversal.java\u0060 and \u0060company/facebook/BinaryTreeLevelOrderTraversal.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 42 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/BinaryTreeLevelOrderTraversal.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fe3ec3070a9ec3939c16efeae4e71020b66a0fd5efd4e35c5c87512cd654b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201341 lines \u00D7 3): company/airbnb/AddTwoNumbers.java:18-58 | company/amazon/AddTwoNumbers.java:18-48 | leetcode/linked-list/AddTwoNumbers.java:18-49 \u2014 \u0060company/airbnb/AddTwoNumbers.java\u0060 and \u0060company/amazon/AddTwoNumbers.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 41 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/airbnb/AddTwoNumbers.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b55ce41294b03036d8d69bac7dc867dca9c48be03265cc385ad41213ad13cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201338 lines \u00D7 7): company/airbnb/MergeKSortedLists.java:13-50 | company/amazon/MergeKSortedLists.java:13-49 | company/facebook/MergeKSortedLists.java:13-49 | company/linkedin/MergeKSortedLists.java:13-49 | company/twitter/MergeKSortedLists.java:13-49 | company/uber/MergeKSortedLists.java:13-49 | leetcode/linked-list/MergeKSortedLists.java:13-49 \u2014 \u0060company/airbnb/MergeKSortedLists.java\u0060 and \u0060company/amazon/MergeKSortedLists.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 38 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/airbnb/MergeKSortedLists.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c610f2a597e4815083aca7b0681e2d9c9e65c7b058919afa5a52cd10b6b33747"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 4): company/google/SpiralMatrix.java:24-60 | company/microsoft/SpiralMatrix.java:24-60 | company/uber/SpiralMatrix.java:24-60 | leetcode/array/SpiralMatrix.java:24-60 \u2014 \u0060company/google/SpiralMatrix.java\u0060 and \u0060company/microsoft/SpiralMatrix.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 37 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/SpiralMatrix.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"675f9b66bccd98dce5667671fc9df6bb4e24d937503a3f4643a6bb6bcff5d056"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 3): company/google/GroupShiftedStrings.java:18-53 | company/uber/GroupShiftedStrings.java:18-53 | leetcode/hash-table/GroupShiftedStrings.java:18-53 \u2014 \u0060company/google/GroupShiftedStrings.java\u0060 and \u0060company/uber/GroupShiftedStrings.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 36 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/GroupShiftedStrings.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"900821c9db8ef96bcfa862808c0df2e242c0b7c6d76a401a40386d53e343b97c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201336 lines \u00D7 2): company/google/3SumSmaller.java:13-47 | leetcode/two-pointers/3SumSmaller.java:13-48 \u2014 before extracting anything, compare \u0060company/google/3SumSmaller.java\u0060 and \u0060leetcode/two-pointers/3SumSmaller.java\u0060 as WHOLE FILES: 87% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/3SumSmaller.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dee0232e0c19bbd08b71ce1f18272142f5a362347b7496e9824483191e3244"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): company/facebook/PaintHouseII.java:13-47 | leetcode/dynamic-programming/PaintHouseII.java:13-47 \u2014 before extracting anything, compare \u0060company/facebook/PaintHouseII.java\u0060 and \u0060leetcode/dynamic-programming/PaintHouseII.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/PaintHouseII.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c3b7cf65a5616c4bf8b8740351abc7f44ccddcb6cf7515517a6775e22c6591"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (63\u201364 lines \u00D7 2): company/google/ShortestDistanceFromAllBuildings.java:20-83 | leetcode/breadth-first-search/ShortestDistanceFromAllBuildings.java:20-82 \u2014 before extracting anything, compare \u0060company/google/ShortestDistanceFromAllBuildings.java\u0060 and \u0060leetcode/breadth-first-search/ShortestDistanceFromAllBuildings.java\u0060 as WHOLE FILES: 98% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/ShortestDistanceFromAllBuildings.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"352217abd067fbb0bf4b0225e9ecb965862bb4145e2de78b47be3438f2e6b918"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): company/google/BombEnemy.java:16-45 | leetcode/dynamic-programming/BombEnemy.java:16-45 \u2014 before extracting anything, compare \u0060company/google/BombEnemy.java\u0060 and \u0060leetcode/dynamic-programming/BombEnemy.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/BombEnemy.java"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1e5d756f4ee08813f1d347d67e8d4a6e1854c38cf83802b5029b06b26e2f93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): company/google/ReverseVowelsOfAString.java:14-43 | leetcode/string/ReverseVowelsOfAString.java:14-43 \u2014 before extracting anything, compare \u0060company/google/ReverseVowelsOfAString.java\u0060 and \u0060leetcode/string/ReverseVowelsOfAString.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/ReverseVowelsOfAString.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc93f33b8b5881037f822779153069fc972e77b6bbac478ea9221d339d86c879"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 4): company/facebook/SearchInRotatedSortedArray.java:11-39 | company/linkedin/SearchInRotatedSortedArray.java:11-39 | company/uber/SearchInRotatedSortedArray.java:11-39 | leetcode/array/SearchInRotatedSortedArray.java:11-39 \u2014 \u0060company/facebook/SearchInRotatedSortedArray.java\u0060 and \u0060company/linkedin/SearchInRotatedSortedArray.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 29 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/SearchInRotatedSortedArray.java"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"48195a06e34090afbe76627b21cdb0256783244ac033a037a1d04d724a5a7b3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 3): company/amazon/PalindromeLinkedList.java:11-39 | company/facebook/PalindromeLinkedList.java:11-39 | leetcode/linked-list/PalindromeLinkedList.java:11-39 \u2014 \u0060company/amazon/PalindromeLinkedList.java\u0060 and \u0060company/facebook/PalindromeLinkedList.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 29 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/PalindromeLinkedList.java"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a08b65db5a128d0ee9bf0b0e5acc089c28b632f3b7f5446fe09518a9999827"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): company/facebook/AddBinary.java:10-37 | leetcode/string/AddBinary.java:10-36 \u2014 before extracting anything, compare \u0060company/facebook/AddBinary.java\u0060 and \u0060leetcode/string/AddBinary.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/AddBinary.java"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc23222190b7a83c23a03cf8a6e9e9c9585c5717a5c350eb3a1579c57f8cc4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): company/google/LongestSubstringWithAtMostKDistinctCharacters.java:9-36 | leetcode/string/LongestSubstringWithAtMostKDistinctCharacters.java:10-37 \u2014 before extracting anything, compare \u0060company/google/LongestSubstringWithAtMostKDistinctCharacters.java\u0060 and \u0060leetcode/string/LongestSubstringWithAtMostKDistinctCharacters.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/LongestSubstringWithAtMostKDistinctCharacters.java"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d23519e1f5bb74b1d1e4004c34cf8ff24cd30727615f1817d9ee6e647857c6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): company/google/AndroidUnlockPatterns.java:58-84 | leetcode/backtracking/AndroidUnlockPatterns.java:58-84 \u2014 before extracting anything, compare \u0060company/google/AndroidUnlockPatterns.java\u0060 and \u0060leetcode/backtracking/AndroidUnlockPatterns.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/AndroidUnlockPatterns.java"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"0439f0a05988902bcb41debf221be83fad70a8ff8382301723115cfd9d398a6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): company/google/GameOfLife.java:17-43 | leetcode/array/GameOfLife.java:17-43 \u2014 before extracting anything, compare \u0060company/google/GameOfLife.java\u0060 and \u0060leetcode/array/GameOfLife.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/GameOfLife.java"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06229733706b684f9aae942f753f3bfa54d5e3b558645f99cb3c688af812fe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 3): company/facebook/LongestConsecutiveSequence.java:11-36 | company/google/LongestConsecutiveSequence.java:11-36 | leetcode/array/LongestConsecutiveSequence.java:11-36 \u2014 \u0060company/facebook/LongestConsecutiveSequence.java\u0060 and \u0060company/google/LongestConsecutiveSequence.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 26 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/LongestConsecutiveSequence.java"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6cb8ddaa7459b92921733f32adf834d654767fd9cb8580d7e15ce40b6925c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): company/facebook/MaximumSizeSubarraySumEqualsK.java:19-44 | leetcode/hash-table/MaximumSizeSubarraySumEqualsK.java:19-43 \u2014 before extracting anything, compare \u0060company/facebook/MaximumSizeSubarraySumEqualsK.java\u0060 and \u0060leetcode/hash-table/MaximumSizeSubarraySumEqualsK.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/MaximumSizeSubarraySumEqualsK.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0921433d96f50e257646ecb7de76e715a0c6d59e880a92bba948f422289a411"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 5): company/facebook/MergeIntervals.java:18-42 | company/google/MergeIntervals.java:18-42 | company/linkedin/MergeIntervals.java:18-42 | company/twitter/MergeIntervals.java:18-42 | leetcode/array/MergeIntervals.java:18-42 \u2014 \u0060company/facebook/MergeIntervals.java\u0060 and \u0060company/google/MergeIntervals.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 25 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/MergeIntervals.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d6162a0151536ce21c1e6864ed5d4970e99ffa33711649cdaa6cdf369b7036"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): company/google/WordSquares.java:47-71 | leetcode/trie/WordSquares.java:47-71 \u2014 before extracting anything, compare \u0060company/google/WordSquares.java\u0060 and \u0060leetcode/trie/WordSquares.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/WordSquares.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c432370850fb49d8a2dd87a27b9b9ee52fa51b8838260c036fbd0715416dc63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 4): company/amazon/GroupAnagrams.java:15-38 | company/facebook/GroupAnagrams.java:15-38 | company/uber/GroupAnagrams.java:15-38 | leetcode/hash-table/GroupAnagrams.java:15-38 \u2014 \u0060company/amazon/GroupAnagrams.java\u0060 and \u0060company/facebook/GroupAnagrams.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 24 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/GroupAnagrams.java"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a070d2a62dc2d805f9ed2690756a53df0b16bdb580fadada74bc7bb47c1076aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 4): company/amazon/ProductOfArrayExceptSelf.java:12-35 | company/facebook/ProductOfArrayExceptSelf.java:12-35 | company/linkedin/ProductOfArrayExceptSelf.java:12-35 | leetcode/array/ProductofArrayExceptSelf.java:12-35 \u2014 \u0060company/amazon/ProductOfArrayExceptSelf.java\u0060 and \u0060company/facebook/ProductOfArrayExceptSelf.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 24 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/ProductOfArrayExceptSelf.java"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65da9378e7f9de59a9d88b10704802f1cc9603ccae4471fa37583ef9ca73bd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): company/google/SummaryRanges.java:7-30 | leetcode/array/SummaryRanges.java:7-29 \u2014 before extracting anything, compare \u0060company/google/SummaryRanges.java\u0060 and \u0060leetcode/array/SummaryRanges.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/SummaryRanges.java"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe04f65c2a2529450f7d60d756b588b3fb6cd00633ccd6cb59ab382a0d53f8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): company/google/Utf8Validation.java:36-59 | leetcode/bit-manipulation/Utf8Validation.java:36-59 \u2014 before extracting anything, compare \u0060company/google/Utf8Validation.java\u0060 and \u0060leetcode/bit-manipulation/Utf8Validation.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/Utf8Validation.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d10411a84d77f7c706bc0caecf0365292da2a5a11b4e75c516161288abcb4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 5): company/amazon/LetterCombinationsOfAPhoneNumber.java:19-41 | company/facebook/LetterCombinationsOfAPhoneNumber.java:19-41 | company/google/LetterCombinationsOfAPhoneNumber.java:19-41 | company/uber/LetterCombinationsOfAPhoneNumber.java:19-41 | leetcode/backtracking/LetterCombinationsOfAPhoneNumber.java:19-41 \u2014 \u0060company/amazon/LetterCombinationsOfAPhoneNumber.java\u0060 and \u0060company/facebook/LetterCombinationsOfAPhoneNumber.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 33 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/LetterCombinationsOfAPhoneNumber.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2fb52da896baa621fd3c67dbfbf3972057599938398ef09cf21126d30d8721"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 4): company/amazon/TrappingRainWater.java:8-30 | company/google/TrappingRainWater.java:8-30 | company/twitter/TrappingRainWater.java:8-30 | leetcode/stack/TrappingRainWater.java:8-30 \u2014 \u0060company/amazon/TrappingRainWater.java\u0060 and \u0060company/google/TrappingRainWater.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 23 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/TrappingRainWater.java"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69f0f721ece63cbddd0576a7ffe6c1878271ea9243c5e0de8b3c2af2fa624d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): company/bloomberg/UniquePaths.java:9-31 | leetcode/array/UniquePaths.java:9-31 | leetcode/dynamic-programming/UniquePaths.java:9-31 \u2014 before extracting anything, compare \u0060company/bloomberg/UniquePaths.java\u0060 and \u0060leetcode/array/UniquePaths.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/bloomberg/UniquePaths.java"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"581ec88616bac0ce82a3cec1b202c3d86d8e1ac943a580627d7280e3a9be75d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): company/facebook/ValidPalindrome.java:3-24 | company/uber/ValidPalindrome.java:3-24 | leetcode/string/ValidPalindrome.java:3-24 \u2014 \u0060company/facebook/ValidPalindrome.java\u0060 and \u0060company/uber/ValidPalindrome.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 22 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/ValidPalindrome.java"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc94cc85c33a72120bd18aed268c9f6aced19e253e65e8498c9db470f537e48a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 3): company/facebook/FindTheCelebrity.java:15-35 | company/linkedin/FindTheCelebrity.java:15-34 | leetcode/array/FindTheCelebrity.java:15-34 \u2014 \u0060company/facebook/FindTheCelebrity.java\u0060 and \u0060company/linkedin/FindTheCelebrity.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 21 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/FindTheCelebrity.java"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7bd86eb1aa4fa7373b56909f481e7027d0ca07ce1a7918e73883bc368e4a20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): company/facebook/SquareRootX.java:7-27 | leetcode/binary-search/SquareRootX.java:7-27 \u2014 before extracting anything, compare \u0060company/facebook/SquareRootX.java\u0060 and \u0060leetcode/binary-search/SquareRootX.java\u0060 as WHOLE FILES: 82% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/SquareRootX.java"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e938aefde83a38b654f771d0d0ec34a83dd977e9d70a6f43c2e045f4fbe6bb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201329 lines \u00D7 2): company/google/MaximumProductOfWordLengths.java:20-46 | leetcode/bit-manipulation/MaximumProductOfWordLengths.java:20-48 \u2014 before extracting anything, compare \u0060company/google/MaximumProductOfWordLengths.java\u0060 and \u0060leetcode/bit-manipulation/MaximumProductOfWordLengths.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/MaximumProductOfWordLengths.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7c633817cdb5282812056927af8670b465a3b9c5a6eda36ffc3383b4672569"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): company/microsoft/LongestIncreasingSubsequence.java:13-33 | leetcode/dynamic-programming/LongestIncreasingSubsequence.java:13-33 \u2014 before extracting anything, compare \u0060company/microsoft/LongestIncreasingSubsequence.java\u0060 and \u0060leetcode/dynamic-programming/LongestIncreasingSubsequence.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/microsoft/LongestIncreasingSubsequence.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"586bfc3c8befdf67b870e51c8f8df4a3e1588aaa5e614dd11f8e80fde4560e25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): company/facebook/DecodeWays.java:17-36 | company/uber/DecodeWays.java:17-36 | leetcode/string/DecodeWays.java:17-36 \u2014 \u0060company/facebook/DecodeWays.java\u0060 and \u0060company/uber/DecodeWays.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 20 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/DecodeWays.java"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2172771f5aa9af6e92b3b1c5efc5cce745b147cff4ff955962a49f8908557a62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): company/facebook/ExclusiveTimeOfFunctions.java:32-54 | company/uber/ExclusiveTimeOfFunctions.java:32-54 | leetcode/stack/ExclusiveTimeOfFunctions.java:32-54 \u2014 \u0060company/facebook/ExclusiveTimeOfFunctions.java\u0060 and \u0060company/uber/ExclusiveTimeOfFunctions.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 23 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/ExclusiveTimeOfFunctions.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fef5ea889e9e2297a70bd1a3c4194c7337df8e7516d59cf90c5ada88a5489a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): company/facebook/MinimumSizeSubarraySum.java:8-27 | leetcode/two-pointers/MinimumSizeSubarraySum.java:8-27 \u2014 before extracting anything, compare \u0060company/facebook/MinimumSizeSubarraySum.java\u0060 and \u0060leetcode/two-pointers/MinimumSizeSubarraySum.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/MinimumSizeSubarraySum.java"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf47a43bbefb72e27e81f9adb9b91bf444cb5d6fc91278b0c1f923df4af4152e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): company/facebook/SortColors.java:10-29 | leetcode/two-pointers/SortColors.java:10-29 \u2014 before extracting anything, compare \u0060company/facebook/SortColors.java\u0060 and \u0060leetcode/two-pointers/SortColors.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/SortColors.java"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b357bcbf8194c7bd53807e2f9c0b1c4b5471c384007abc9088ba9d92afeeae56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): company/uber/PalindromePermutation.java:3-21 | leetcode/string/PalindromePermutation.java:3-22 \u2014 before extracting anything, compare \u0060company/uber/PalindromePermutation.java\u0060 and \u0060leetcode/string/PalindromePermutation.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/uber/PalindromePermutation.java"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"197fd072d62bdf46e19f78f4a9af6c4e8e9fb0e52d04beb11a66a6382964c339"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 6): company/amazon/FirstUniqueCharacterInAString.java:14-33 | company/bloomberg/FirstUniqueCharacterInAString.java:14-33 | company/google/FirstUniqueCharacterInAString.java:14-33 | company/microsoft/FirstUniqueCharacterInAString.java:14-33 | leetcode/hash-table/FirstUniqueCharacterInAString.java:14-33 | leetcode/string/FirstUniqueCharacterInAString.java:14-33 \u2014 \u0060company/amazon/FirstUniqueCharacterInAString.java\u0060 and \u0060company/bloomberg/FirstUniqueCharacterInAString.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 20 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/FirstUniqueCharacterInAString.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc15538a340f5446ae823c78823ca11ffd771c7bf4c962ec0cac35e39a6db15c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201319 lines \u00D7 3): company/facebook/CombinationSumIV.java:30-48 | company/google/CombinationSumIV.java:28-40 | leetcode/dynamic-programming/CombinationSumIV.java:28-40 \u2014 \u0060company/facebook/CombinationSumIV.java\u0060 and \u0060company/google/CombinationSumIV.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 19 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/CombinationSumIV.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e903142e65ae15e11c26ecae0fb263c3fb871168b029bddfb748c4752ac3fcb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): company/facebook/MultiplyStrings.java:20-37 | company/twitter/MultiplyStrings.java:20-38 \u2014 \u0060company/facebook/MultiplyStrings.java\u0060 and \u0060company/twitter/MultiplyStrings.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 37 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060company/facebook/MultiplyStrings.java:20\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/MultiplyStrings.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8962a5ea03ecbf143041a7a46744e84bf806e12aff2f2f49c26953d6972ceb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): company/google/PacificAtlanticWaterFlow.java:29-61 | leetcode/breadth-first-search/PacificAtlanticWaterFlow.java:29-61 \u2014 before extracting anything, compare \u0060company/google/PacificAtlanticWaterFlow.java\u0060 and \u0060leetcode/breadth-first-search/PacificAtlanticWaterFlow.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/PacificAtlanticWaterFlow.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9650d0b98bb755f213a1fa7c805a45e80aa0930a6bf0bab22decf8e25769deb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): company/google/SentenceScreenFitting.java:56-74 | leetcode/dynamic-programming/SentenceScreenFitting.java:56-73 \u2014 before extracting anything, compare \u0060company/google/SentenceScreenFitting.java\u0060 and \u0060leetcode/dynamic-programming/SentenceScreenFitting.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/SentenceScreenFitting.java"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"112d880b588c71a9e70f219fba0896f03d09c3abef89deab575c3fe9bef4d41a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): company/facebook/ExpressionAddOperators.java:24-47 | company/google/ExpressionAddOperators.java:24-47 | leetcode/divide-and-conquer/ExpressionAddOperators.java:23-46 \u2014 \u0060company/facebook/ExpressionAddOperators.java\u0060 and \u0060company/google/ExpressionAddOperators.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 35 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/ExpressionAddOperators.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ef7a074f373ad40ca724a0e883d5f3115b34fbca5ce7981520ee5fa55a9c81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): company/adobe/MajorityElement.java:6-23 | leetcode/array/MajorityElement.java:6-23 \u2014 before extracting anything, compare \u0060company/adobe/MajorityElement.java\u0060 and \u0060leetcode/array/MajorityElement.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/adobe/MajorityElement.java"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"393ab90037450bcdbf95f55d0f0aa06c576fd252412d8c4bf58a09d16c9556f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): company/facebook/IntegerToEnglishWords.java:15-32 | leetcode/string/IntegerToEnglishWords.java:15-32 \u2014 before extracting anything, compare \u0060company/facebook/IntegerToEnglishWords.java\u0060 and \u0060leetcode/string/IntegerToEnglishWords.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/IntegerToEnglishWords.java"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a461585055d16bb86523150913cd37807447b905c8978fa6ea29dbbd68695230"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): company/facebook/RemoveDuplicatesFromSortedArray.java:12-29 | leetcode/two-pointers/RemoveDuplicatesFromSortedArray.java:12-29 \u2014 before extracting anything, compare \u0060company/facebook/RemoveDuplicatesFromSortedArray.java\u0060 and \u0060leetcode/two-pointers/RemoveDuplicatesFromSortedArray.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/RemoveDuplicatesFromSortedArray.java"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"147d43d8d5055852830d82cf2d18900c2e87c31610e57ebe4327604b99320b04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): company/facebook/SumOfLeftLeaves.java:24-41 | leetcode/tree/SumOfLeftLeaves.java:24-41 \u2014 before extracting anything, compare \u0060company/facebook/SumOfLeftLeaves.java\u0060 and \u0060leetcode/tree/SumOfLeftLeaves.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/SumOfLeftLeaves.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f18b8cb93c0a87b50c6e05eaa3f1b2608931f3e0b3aca4b673f9e7d4c9097a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): company/google/BullsAndCows.java:25-42 | leetcode/hash-table/BullsAndCows.java:25-42 \u2014 before extracting anything, compare \u0060company/google/BullsAndCows.java\u0060 and \u0060leetcode/hash-table/BullsAndCows.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/BullsAndCows.java"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e52d51cd790ffd247af08cdeec413f3962d6a6b219f61228b024e07d2a2d659"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): company/google/FindAllNumbersDisappearedInAnArray.java:17-36 | leetcode/array/FindAllNumbersDisappearedInAnArray.java:17-36 \u2014 before extracting anything, compare \u0060company/google/FindAllNumbersDisappearedInAnArray.java\u0060 and \u0060leetcode/array/FindAllNumbersDisappearedInAnArray.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/FindAllNumbersDisappearedInAnArray.java"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"728e0291fe0c72fa8de76b7654ff7ab59d0d8a35bf252f7e1599e20109799a84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 6): company/airbnb/TwoSum.java:13-29 | company/amazon/TwoSum.java:13-29 | company/facebook/TwoSum.java:13-29 | company/linkedin/TwoSum.java:13-29 | company/uber/TwoSum.java:13-28 | leetcode/hash-table/TwoSum.java:13-29 \u2014 \u0060company/airbnb/TwoSum.java\u0060 and \u0060company/amazon/TwoSum.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 17 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/airbnb/TwoSum.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e284189cc7700b230a04b9ac442e533a430cb0de6719028eca5c1ec899707c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 4): company/amazon/NumberOfIslands.java:24-40 | company/facebook/NumberOfIslands.java:24-39 | company/google/NumberOfIslands.java:24-39 | leetcode/depth-first-search/NumberOfIslands.java:24-39 \u2014 \u0060company/amazon/NumberOfIslands.java\u0060 and \u0060company/facebook/NumberOfIslands.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 33 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/NumberOfIslands.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5a8349e64fac52396db1ca8c4549c78117d5c77e813b9a3d338361cd7b90d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): company/facebook/CloneGraph.java:35-51 | company/google/CloneGraph.java:35-51 | company/uber/CloneGraph.java:35-51 | leetcode/breadth-first-search/CloneGraph.java:35-51 \u2014 \u0060company/facebook/CloneGraph.java\u0060 and \u0060company/google/CloneGraph.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 17 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/CloneGraph.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c923494a29d52596b321afb17e79265430e1a31cad3384957a8e8fa340aa0291"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): company/linkedin/Permutations.java:16-32 | company/microsoft/Permutations.java:16-32 | leetcode/backtracking/Permutations.java:16-32 \u2014 \u0060company/linkedin/Permutations.java\u0060 and \u0060company/microsoft/Permutations.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 17 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/linkedin/Permutations.java"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f45ed94db86d97f8161af85286cb77d48a9eca2894f1a4aa63499b592ad7376"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): company/facebook/MeetingRooms.java:18-34 | leetcode/sort/MeetingRooms.java:18-34 \u2014 before extracting anything, compare \u0060company/facebook/MeetingRooms.java\u0060 and \u0060leetcode/sort/MeetingRooms.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/MeetingRooms.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c87ec03608df36e69b6ef681b16acf18ec026a0f55130f349eaa69f4c033d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): company/facebook/MoveZeros.java:11-27 | leetcode/two-pointers/MoveZeros.java:11-27 \u2014 before extracting anything, compare \u0060company/facebook/MoveZeros.java\u0060 and \u0060leetcode/two-pointers/MoveZeros.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/MoveZeros.java"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"519d5827f0d09d24dbff82fe8d61505d4a58727a1f073913a6f166b5c960f931"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): company/facebook/RemoveInvalidParentheses.java:21-51 | leetcode/breadth-first-search/RemoveInvalidParentheses.java:19-49 \u2014 before extracting anything, compare \u0060company/facebook/RemoveInvalidParentheses.java\u0060 and \u0060leetcode/breadth-first-search/RemoveInvalidParentheses.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060company/facebook/RemoveInvalidParentheses.java:21\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/RemoveInvalidParentheses.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c4ca3427dee8c82e5b74c08ca53ed446902a91677cb5fff8b2bea15f22ccaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): company/google/PaintFence.java:12-28 | leetcode/dynamic-programming/PaintFence.java:12-26 \u2014 before extracting anything, compare \u0060company/google/PaintFence.java\u0060 and \u0060leetcode/dynamic-programming/PaintFence.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/PaintFence.java"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65245fdeafee892426fcc25d91a61e96f5c7c007bbc88104ab0a683398be306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 5): company/facebook/ImplementTrie.java:48-63 | company/google/ImplementTrie.java:48-63 | company/twitter/ImplementTrie.java:49-64 | company/uber/ImplementTrie.java:48-63 | leetcode/trie/ImplementTrie.java:52-67 \u2014 \u0060company/facebook/ImplementTrie.java\u0060 and \u0060company/google/ImplementTrie.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 41 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/ImplementTrie.java"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"274744a6cf66c58b8ba085c6c10f56a7d460070dfba3894d7d1ba83b020bea96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): company/amazon/NumberOfIslands.java:44-59 | company/facebook/NumberOfIslands.java:43-58 | company/google/NumberOfIslands.java:43-58 | leetcode/depth-first-search/NumberOfIslands.java:43-58 \u2014 \u0060company/amazon/NumberOfIslands.java\u0060 and \u0060company/facebook/NumberOfIslands.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 33 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/NumberOfIslands.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4673aa8835a6c13453c67edd2af4aa84d50d168e08a83ea07334236745958d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): company/facebook/FlattenNestedListIterator.java:48-63 | company/google/FlattenNestedListIterator.java:48-63 | company/twitter/FlattenNestedListIterator.java:48-63 | leetcode/stack/FlattenNestedListIterator.java:48-63 \u2014 \u0060company/facebook/FlattenNestedListIterator.java\u0060 and \u0060company/google/FlattenNestedListIterator.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 21 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/FlattenNestedListIterator.java"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a90bf01579302bd90f02b0217bfdc353d9706ca370b7f76e5742a3e0bca98d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): company/facebook/WordSearch.java:34-55 | leetcode/array/WordSearch.java:33-54 \u2014 before extracting anything, compare \u0060company/facebook/WordSearch.java\u0060 and \u0060leetcode/array/WordSearch.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/WordSearch.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"089191b71b36efa8b60ea0eaf6ac2d09fb17c291af923fe4ed7098e0bddb7e93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): company/google/IslandPerimeter.java:14-29 | leetcode/hash-table/IslandPerimeter.java:14-29 \u2014 before extracting anything, compare \u0060company/google/IslandPerimeter.java\u0060 and \u0060leetcode/hash-table/IslandPerimeter.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/IslandPerimeter.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2c7346ba4ee6e8aa901baaf1c3be9979b6b4ac4cb2afcefe3eb835ccb2aab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): company/google/JudgeRouteCircle.java:14-29 | leetcode/string/JudgeRouteCircle.java:14-29 \u2014 before extracting anything, compare \u0060company/google/JudgeRouteCircle.java\u0060 and \u0060leetcode/string/JudgeRouteCircle.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/JudgeRouteCircle.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3212612fc5cc3177f19e155934c7a1e3da86f4ab92ae06e8890cb7ba5bad833c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): company/microsoft/HouseRobberII.java:11-32 | leetcode/dynamic-programming/HouseRobberII.java:11-32 \u2014 before extracting anything, compare \u0060company/microsoft/HouseRobberII.java\u0060 and \u0060leetcode/dynamic-programming/HouseRobberII.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/microsoft/HouseRobberII.java"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc945400a13ca9a0c9bcc5bf6cc1bfdf89a9b13ec5c2ffc91f52f96d12996b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): company/facebook/PowerOfXToTheN.java:5-19 | company/google/PowerOfXToTheN.java:5-19 | company/linkedin/PowerOfXToTheN.java:5-19 | leetcode/binary-search/PowerOfXToTheN.java:5-19 \u2014 \u0060company/facebook/PowerOfXToTheN.java\u0060 and \u0060company/google/PowerOfXToTheN.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 15 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/PowerOfXToTheN.java"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"19269646dc34f8e0aa5468c67e7fa145bc7740b13185112b0f2189ac46380df6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): company/google/BinaryWatch.java:20-34 | leetcode/bit-manipulation/BinaryWatch.java:20-34 \u2014 before extracting anything, compare \u0060company/google/BinaryWatch.java\u0060 and \u0060leetcode/bit-manipulation/BinaryWatch.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/BinaryWatch.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"641debb9a5fc1dde25df3b0dbc9783071b602d24858554cbbc11cbf084b46b49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): company/google/GuessNumberHigherOrLower.java:24-38 | leetcode/binary-search/GuessNumberHigherOrLower.java:19-33 \u2014 before extracting anything, compare \u0060company/google/GuessNumberHigherOrLower.java\u0060 and \u0060leetcode/binary-search/GuessNumberHigherOrLower.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/GuessNumberHigherOrLower.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be90a9109385e49dd3d1be3cb551eb4492893d12e03cb2abd7d9c964467a5fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): leetcode/dynamic-programming/EditDistance.java:11-40 | leetcode/string/EditDistance.java:11-40 \u2014 \u0060leetcode/dynamic-programming/EditDistance.java\u0060 and \u0060leetcode/string/EditDistance.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 30 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/dynamic-programming/EditDistance.java"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3c791ba21c8860e2ca8958d55bb5758d29b79d1d3e479347b098beeeaf7bd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 4): company/amazon/Subsets.java:30-43 | company/facebook/Subsets.java:30-43 | company/uber/Subsets.java:30-42 | leetcode/array/Subsets.java:29-41 \u2014 \u0060company/amazon/Subsets.java\u0060 and \u0060company/facebook/Subsets.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 21 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/Subsets.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc47ec7539f429895512d25c95530939aac146be12d0f51f142eb9af2731ebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 4): company/facebook/OneEditDistance.java:12-24 | company/twitter/OneEditDistance.java:12-24 | company/uber/OneEditDistance.java:12-24 | leetcode/string/OneEditDistance.java:12-25 \u2014 \u0060company/facebook/OneEditDistance.java\u0060 and \u0060company/twitter/OneEditDistance.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 14 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060company/facebook/OneEditDistance.java:12\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/OneEditDistance.java"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63ba88430f1ac571ee5699a748b4ceb640a23a55accf084589d0c29ce972996"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): company/amazon/BestTimeToBuyAndSellStock.java:19-32 | company/facebook/BestTimeToBuyAndSellStock.java:19-32 | company/uber/BestTimeToBuyOrSellStock.java:19-32 \u2014 \u0060company/amazon/BestTimeToBuyAndSellStock.java\u0060 and \u0060company/facebook/BestTimeToBuyAndSellStock.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 24 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/BestTimeToBuyAndSellStock.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7c0b22a32ed0de85dd536a4b903a6ecc9fc638394641bc618d4069b7a23d82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): company/google/PlusOne.java:20-33 | leetcode/array/PlusOne.java:20-33 | leetcode/math/PlusOne.java:20-33 \u2014 before extracting anything, compare \u0060company/google/PlusOne.java\u0060 and \u0060leetcode/array/PlusOne.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/PlusOne.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"33316a8f09a4014a23a3216d54ff25852650b354cc503980e6c0dd8191373344"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): company/facebook/SubsetsII.java:34-47 | leetcode/array/SubsetsII.java:34-45 \u2014 before extracting anything, compare \u0060company/facebook/SubsetsII.java\u0060 and \u0060leetcode/array/SubsetsII.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/SubsetsII.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dadb99d14a0ad965723a10b1cf7115d286aac66748d227532756d23bab3ee57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): company/google/AndroidUnlockPatterns.java:31-54 | leetcode/backtracking/AndroidUnlockPatterns.java:31-54 \u2014 before extracting anything, compare \u0060company/google/AndroidUnlockPatterns.java\u0060 and \u0060leetcode/backtracking/AndroidUnlockPatterns.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/AndroidUnlockPatterns.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7df43db0430b345871bcb3808647d464b74b0d9dbd7548e4007df04c7a753b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): company/google/LoggerRateLimiter.java:41-54 | leetcode/hash-table/LoggerRateLimiter.java:41-52 \u2014 before extracting anything, compare \u0060company/google/LoggerRateLimiter.java\u0060 and \u0060leetcode/hash-table/LoggerRateLimiter.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/LoggerRateLimiter.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a656934430a8b6490b542fac1a8dd2196633906bf55072419ccea1b6a1a8cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): company/google/UniqueWordAbbreviation.java:38-51 | leetcode/hash-table/UniqueWordAbbreviation.java:38-51 \u2014 before extracting anything, compare \u0060company/google/UniqueWordAbbreviation.java\u0060 and \u0060leetcode/hash-table/UniqueWordAbbreviation.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/UniqueWordAbbreviation.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"99702457464abb95b3ff6dd49ee1ef44a65fbf9a208b256fc78490fed4a2d80e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 6): company/amazon/LinkedListCycle.java:17-29 | company/bloomberg/LinkedListCycle.java:17-29 | company/microsoft/LinkedListCycle.java:17-29 | company/yahoo/LinkedListCycle.java:17-29 | leetcode/linked-list/LinkedListCycle.java:17-29 | leetcode/two-pointers/LinkedListCycle.java:17-29 \u2014 \u0060company/amazon/LinkedListCycle.java\u0060 and \u0060company/bloomberg/LinkedListCycle.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 13 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/LinkedListCycle.java"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71975f7de485c2096f00da4d4e63ad928847a0d5e8dfb2f1087b844c4a24f62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): company/amazon/LowestCommonAncestorOfABinaryTree.java:25-37 | company/facebook/LowestCommonAncestorOfABinaryTree.java:25-37 | company/linkedin/LowestCommonAncestorOfABinaryTree.java:25-37 | company/twitter/LowestCommonAncestorOfABinaryTree.java:25-37 | leetcode/tree/LowestCommonAncestorOfABinaryTree.java:25-37 \u2014 \u0060company/amazon/LowestCommonAncestorOfABinaryTree.java\u0060 and \u0060company/facebook/LowestCommonAncestorOfABinaryTree.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 13 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/LowestCommonAncestorOfABinaryTree.java"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d938d5f051fb9de8a645dd1a8784b3bece3bc00b84c8ab3875f9c58aa62f3bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): company/google/GenerateParentheses.java:22-34 | company/uber/GenerateParentheses.java:10-22 | leetcode/backtracking/GenerateParentheses.java:22-34 | leetcode/string/GenerateParentheses.java:22-34 \u2014 \u0060company/google/GenerateParentheses.java\u0060 and \u0060company/uber/GenerateParentheses.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 19 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/GenerateParentheses.java"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"466aa1e91d937275e0868a4e270af35b21fc2107e4fbcc0f2e66bb909579476d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): company/amazon/MinCostClimbingStairs.java:19-37 | leetcode/array/MinCostClimbingStairs.java:19-37 | leetcode/dynamic-programming/MinCostClimbingStairs.java:19-37 \u2014 before extracting anything, compare \u0060company/amazon/MinCostClimbingStairs.java\u0060 and \u0060leetcode/array/MinCostClimbingStairs.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/MinCostClimbingStairs.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fa75212061a876281618e696f68e20032dd9d024056747619a922924fefeda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): company/facebook/RomanToInteger.java:7-30 | company/uber/RomanToInteger.java:7-30 | leetcode/string/RomanToInteger.java:7-30 \u2014 \u0060company/facebook/RomanToInteger.java\u0060 and \u0060company/uber/RomanToInteger.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 24 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/RomanToInteger.java"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52000ad111dd45d650ea9e1d767b6df0a538714a945f4c379684f6b8cbc78bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): company/airbnb/ConvertSortedArrayToBinarySearchTree.java:24-36 | leetcode/depth-first-search/ConvertSortedArrayToBinarySearchTree.java:24-36 \u2014 before extracting anything, compare \u0060company/airbnb/ConvertSortedArrayToBinarySearchTree.java\u0060 and \u0060leetcode/depth-first-search/ConvertSortedArrayToBinarySearchTree.java\u0060 as WHOLE FILES: 95% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/airbnb/ConvertSortedArrayToBinarySearchTree.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b548406dfd0d739ed42983236adf75bfbde7366652d72b0f2fd9c20003cea1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): company/google/FindTheDifference.java:21-33 | leetcode/hash-table/FindTheDifference.java:21-33 \u2014 before extracting anything, compare \u0060company/google/FindTheDifference.java\u0060 and \u0060leetcode/hash-table/FindTheDifference.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/FindTheDifference.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"74454ce591d92898925746ff29ea3031a5e283c7c58e750759fd12ea09a1b4d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): company/google/IslandPerimeter.java:32-45 | leetcode/hash-table/IslandPerimeter.java:32-45 \u2014 before extracting anything, compare \u0060company/google/IslandPerimeter.java\u0060 and \u0060leetcode/hash-table/IslandPerimeter.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/IslandPerimeter.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b7920d9b55e9fbd761350ec1948976d37103b201d3769b6eae7b58980f317d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): company/google/WordSquares.java:20-44 | leetcode/trie/WordSquares.java:20-44 \u2014 before extracting anything, compare \u0060company/google/WordSquares.java\u0060 and \u0060leetcode/trie/WordSquares.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/WordSquares.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c18aa79dcf30b08ce92596a8aed02c25d659ea6f3fe21c8ed928177c0a6e92b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): cracking-the-coding-interview/chapter-one-arrays-and-strings/DeleteDups.java:5-17 | cracking-the-coding-interview/chapter-two-linked-lists/DeleteDups.java:5-17 \u2014 \u0060cracking-the-coding-interview/chapter-one-arrays-and-strings/DeleteDups.java\u0060 and \u0060cracking-the-coding-interview/chapter-two-linked-lists/DeleteDups.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 13 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cracking-the-coding-interview/chapter-one-arrays-and-strings/DeleteDups.java"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"535e40827f20031f7d18df6afc9790d8295ebe73491a5fb7555ee72a91a4431d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): company/facebook/ImplementTrie.java:33-44 | company/google/ImplementTrie.java:33-44 | company/twitter/ImplementTrie.java:34-45 | company/uber/ImplementTrie.java:33-44 | leetcode/trie/ImplementTrie.java:37-48 \u2014 \u0060company/facebook/ImplementTrie.java\u0060 and \u0060company/google/ImplementTrie.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 41 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/ImplementTrie.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"30238611a19d3cb7dcef26cda2fea367239d3d77ac873736d7ed463fd5636cd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): company/airbnb/HouseRobber.java:7-25 | company/linkedin/HouseRobber.java:7-25 | leetcode/dynamic-programming/HouseRobber.java:7-25 \u2014 \u0060company/airbnb/HouseRobber.java\u0060 and \u0060company/linkedin/HouseRobber.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 19 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/airbnb/HouseRobber.java"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a454cf49f10a349abfc7b0fde7573761d760c0006a9cf5674ee2bf28d4c1e3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): company/facebook/BinaryTreePaths.java:37-48 | company/google/BinaryTreePaths.java:37-48 | leetcode/tree/BinaryTreePaths.java:37-48 \u2014 \u0060company/facebook/BinaryTreePaths.java\u0060 and \u0060company/google/BinaryTreePaths.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 23 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/BinaryTreePaths.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"24de64e68ea4c416b9db1d97a7cfa8ea7fa3bc0727a0b26b6a8a3e3449a2f02e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): company/facebook/AddAndSearchWordDataStructureDesign.java:29-40 | leetcode/trie/AddAndSearchWordDataStructureDesign.java:29-40 \u2014 before extracting anything, compare \u0060company/facebook/AddAndSearchWordDataStructureDesign.java\u0060 and \u0060leetcode/trie/AddAndSearchWordDataStructureDesign.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/AddAndSearchWordDataStructureDesign.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfb7ef6ff7d3e70847e6bb968f2c48e964096768123cbbd6e0d2c8a68c6dc3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): company/facebook/AddAndSearchWordDataStructureDesign.java:47-64 | leetcode/trie/AddAndSearchWordDataStructureDesign.java:47-64 \u2014 before extracting anything, compare \u0060company/facebook/AddAndSearchWordDataStructureDesign.java\u0060 and \u0060leetcode/trie/AddAndSearchWordDataStructureDesign.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/AddAndSearchWordDataStructureDesign.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e8017526af0a257ebcd0dbcdf24685cf2f6beac4fe71f1a91399a6684d8f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): company/facebook/MergeSortedArray.java:8-19 | leetcode/two-pointers/MergeSortedArray.java:8-19 \u2014 before extracting anything, compare \u0060company/facebook/MergeSortedArray.java\u0060 and \u0060leetcode/two-pointers/MergeSortedArray.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/MergeSortedArray.java"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d2bbda459a4353d7365b66b2c4d75986a00b22caf31a78729a29ad1da3f5dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): company/facebook/SubsetsII.java:19-30 | leetcode/array/SubsetsII.java:19-30 \u2014 before extracting anything, compare \u0060company/facebook/SubsetsII.java\u0060 and \u0060leetcode/array/SubsetsII.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/SubsetsII.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e66b8f944885d2d0b8745280a0beb1f69895944741ff6f8b76cf1141e4ee67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): company/google/BombEnemy.java:49-60 | leetcode/dynamic-programming/BombEnemy.java:49-60 \u2014 before extracting anything, compare \u0060company/google/BombEnemy.java\u0060 and \u0060leetcode/dynamic-programming/BombEnemy.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/BombEnemy.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb74b681e801d6a27693cf39d8c8fb943e140b52f482fc640222643e3f86d0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): cracking-the-coding-interview/chapter-four-trees-and-graphs/BinaryTreeIsBalanced.java:14-25 | cracking-the-coding-interview/chapter-three-stacks-and-queues/BinaryTreeIsBalanced.java:14-25 \u2014 \u0060cracking-the-coding-interview/chapter-four-trees-and-graphs/BinaryTreeIsBalanced.java\u0060 and \u0060cracking-the-coding-interview/chapter-three-stacks-and-queues/BinaryTreeIsBalanced.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 18 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cracking-the-coding-interview/chapter-four-trees-and-graphs/BinaryTreeIsBalanced.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"96de1c38ff0bbf5151e1634c6de00319b597af146a6928e25bebfe5a9701268e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): company/airbnb/ContainsDuplicatesII.java:6-17 | company/palantir/ContainsDuplicatesII.java:6-17 | leetcode/array/ContainsDuplicatesII.java:6-17 | leetcode/hash-table/ContainsDuplicatesII.java:6-17 \u2014 \u0060company/airbnb/ContainsDuplicatesII.java\u0060 and \u0060company/palantir/ContainsDuplicatesII.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 12 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/airbnb/ContainsDuplicatesII.java"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a78c3f36e821c4293a0f05c92e94efaeb1d4dd882f7f4bcd0c0a66a7896184"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): company/facebook/PalindromicSubstrings.java:19-29 | company/linkedin/PalindromicSubstrings.java:19-29 | leetcode/dynamic-programming/PalindromicSubstrings.java:19-29 | leetcode/string/PalindromicSubstrings.java:19-29 \u2014 \u0060company/facebook/PalindromicSubstrings.java\u0060 and \u0060company/linkedin/PalindromicSubstrings.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 18 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/PalindromicSubstrings.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2979a411469cda6f58cbfb42691263d3abd7766906b4a8e23f3df02fdda157"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): company/facebook/SparseMatrixMultiplication.java:25-43 | company/linkedin/SparseMatrixMultiplication.java:25-43 | leetcode/hash-table/SparseMatrixMultiplication.java:25-43 \u2014 \u0060company/facebook/SparseMatrixMultiplication.java\u0060 and \u0060company/linkedin/SparseMatrixMultiplication.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 19 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/SparseMatrixMultiplication.java"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53b10395b9593a1d3570b6ccfdff4e189f718f7a170182359f72c39dc17c7fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): company/facebook/WallsAndGates.java:34-46 | company/google/WallsAndGates.java:34-46 | leetcode/breadth-first-search/WallsAndGates.java:34-46 \u2014 \u0060company/facebook/WallsAndGates.java\u0060 and \u0060company/google/WallsAndGates.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 21 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/WallsAndGates.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9947460c693999ffd6815c91430e537c39554acda4a48a90668773b323e2960"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): company/google/ClosestBinarySearchTreeValue.java:18-28 | leetcode/binary-search/ClosestBinarySearchTreeValue.java:18-28 \u2014 before extracting anything, compare \u0060company/google/ClosestBinarySearchTreeValue.java\u0060 and \u0060leetcode/binary-search/ClosestBinarySearchTreeValue.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/ClosestBinarySearchTreeValue.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"25552402343f6b1deea5ec234be62b50c372a1cf1bc17ca376175873185c6c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): company/google/GeneralizedAbbreviation.java:17-27 | leetcode/backtracking/GeneralizedAbbreviation.java:17-27 \u2014 before extracting anything, compare \u0060company/google/GeneralizedAbbreviation.java\u0060 and \u0060leetcode/backtracking/GeneralizedAbbreviation.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/GeneralizedAbbreviation.java"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c52151ad5a4ee57dcf996fc0ef95dfe56c4e356ed92673eadeb28b547e330a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 6): company/airbnb/ValidParentheses.java:7-28 | company/amazon/ValidParentheses.java:7-28 | company/facebook/ValidParentheses.java:7-28 | company/google/ValidParentheses.java:7-28 | company/twitter/ValidParentheses.java:7-28 | leetcode/string/ValidParentheses.java:7-28 \u2014 \u0060company/amazon/ValidParentheses.java\u0060 and \u0060company/facebook/ValidParentheses.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 22 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/airbnb/ValidParentheses.java"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d26a3322f8c8dc3afd88ccee5cd4c4c76cff5869983cf324a4937b9f74e51e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): company/amazon/LetterCombinationsOfAPhoneNumber.java:44-53 | company/facebook/LetterCombinationsOfAPhoneNumber.java:44-53 | company/google/LetterCombinationsOfAPhoneNumber.java:44-53 | company/uber/LetterCombinationsOfAPhoneNumber.java:44-53 | leetcode/backtracking/LetterCombinationsOfAPhoneNumber.java:44-53 \u2014 \u0060company/amazon/LetterCombinationsOfAPhoneNumber.java\u0060 and \u0060company/facebook/LetterCombinationsOfAPhoneNumber.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 33 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/LetterCombinationsOfAPhoneNumber.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39a117e92b889c2fd01a5a3a88fea2b5c66b5d0a5eee537539e51e79696ddcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): company/amazon/WordBreak.java:13-25 | company/facebook/WordBreak.java:13-25 | company/google/WordBreak.java:12-24 | company/uber/WordBreak.java:12-24 | leetcode/dynamic-programming/WordBreak.java:13-25 \u2014 \u0060company/amazon/WordBreak.java\u0060 and \u0060company/facebook/WordBreak.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 13 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060company/amazon/WordBreak.java:13\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/WordBreak.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd78a0d7f6d3f7ae38024faab47465138319549349bb11d7f75e7bd345019efd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): company/amazon/BestTimeToBuyAndSellStock.java:26-35 | company/facebook/BestTimeToBuyAndSellStock.java:26-35 | company/uber/BestTimeToBuyOrSellStock.java:26-35 | leetcode/array/BestTimeToBuyAndSellStock.java:26-35 \u2014 \u0060company/amazon/BestTimeToBuyAndSellStock.java\u0060 and \u0060company/facebook/BestTimeToBuyAndSellStock.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 24 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060company/amazon/BestTimeToBuyAndSellStock.java:26\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/BestTimeToBuyAndSellStock.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e14ef9cde5b4c3bedad6ebf1ed6e63e81d7155f303e422a9462de53536c95f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): company/facebook/MultiplyStrings.java:12-28 | company/twitter/MultiplyStrings.java:12-29 | leetcode/string/MultiplyStrings.java:12-28 \u2014 \u0060company/facebook/MultiplyStrings.java\u0060 and \u0060company/twitter/MultiplyStrings.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 37 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/MultiplyStrings.java"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"91449650ec37695868b6051da4d3dd2a83fc94dde10a70f2377361559f65c34c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): company/facebook/IntegerToEnglishWords.java:36-45 | leetcode/string/IntegerToEnglishWords.java:35-44 \u2014 before extracting anything, compare \u0060company/facebook/IntegerToEnglishWords.java\u0060 and \u0060leetcode/string/IntegerToEnglishWords.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/IntegerToEnglishWords.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bd2b37b84ca863cb25e3c6710eee340fb968938c59a87ecd3de8023cc8a2f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): company/facebook/WordSearch.java:19-30 | leetcode/array/WordSearch.java:19-30 \u2014 before extracting anything, compare \u0060company/facebook/WordSearch.java\u0060 and \u0060leetcode/array/WordSearch.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/WordSearch.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80ec15794a8161581a327d8b94fce08d39bd43931cb2eb2878045734a773050"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): company/google/PacificAtlanticWaterFlow.java:65-78 | leetcode/breadth-first-search/PacificAtlanticWaterFlow.java:64-77 \u2014 before extracting anything, compare \u0060company/google/PacificAtlanticWaterFlow.java\u0060 and \u0060leetcode/breadth-first-search/PacificAtlanticWaterFlow.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/PacificAtlanticWaterFlow.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f25a65ce746e10bff09a596a7997374ada0df40fa6872f5d0ffd59aefd7672"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): company/linkedin/MaximumProductSubarray.java:8-28 | leetcode/array/MaximumProductSubarray.java:8-27 \u2014 before extracting anything, compare \u0060company/linkedin/MaximumProductSubarray.java\u0060 and \u0060leetcode/array/MaximumProductSubarray.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/linkedin/MaximumProductSubarray.java"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52ee91d2aa6e538b562f3df6884bc67909941146b51012b8565be5e1c3e8bd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): company/linkedin/SymmetricTree.java:36-45 | leetcode/breadth-first-search/SymmetricTree.java:36-45 \u2014 before extracting anything, compare \u0060company/linkedin/SymmetricTree.java\u0060 and \u0060leetcode/breadth-first-search/SymmetricTree.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/linkedin/SymmetricTree.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3efc97ce93d258fd543067e696bd1e0dd2d648a8027e53cab6aef4390eec50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): leetcode/bit-manipulation/CountingBits.java:8-17 | leetcode/dynamic-programming/CountingBits.java:13-22 \u2014 \u0060leetcode/bit-manipulation/CountingBits.java\u0060 and \u0060leetcode/dynamic-programming/CountingBits.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 10 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/bit-manipulation/CountingBits.java"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3f7becd2a1b4be4ef2c65785573d9f82ac6c2c7b2973e4b629f612f1ba733d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 5): company/airbnb/RegularExpressionMatching.java:22-53 | company/facebook/RegularExpressionMatching.java:22-53 | company/twitter/RegularExpressionMatching.java:22-53 | company/uber/RegularExpressionMatching.java:22-53 | leetcode/dynamic-programming/RegularExpressionMatching.java:22-53 \u2014 \u0060company/airbnb/RegularExpressionMatching.java\u0060 and \u0060company/facebook/RegularExpressionMatching.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 32 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/airbnb/RegularExpressionMatching.java"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d43d4f6209561742366eec45f815bc750e14e9376e285406f1afa619822de0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): company/google/DailyTemperatures.java:9-20 | leetcode/hash-table/DailyTemperatures.java:9-20 | leetcode/stack/DailyTemperatures.java:9-20 \u2014 before extracting anything, compare \u0060company/google/DailyTemperatures.java\u0060 and \u0060leetcode/hash-table/DailyTemperatures.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/DailyTemperatures.java"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"de140f5089109f419af9703de6124a634081eefdea9dc259abf26b4e92054949"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): company/amazon/RotateImage.java:10-25 | leetcode/array/RotateImage.java:10-25 \u2014 before extracting anything, compare \u0060company/amazon/RotateImage.java\u0060 and \u0060leetcode/array/RotateImage.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/RotateImage.java"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ebbd89e7283001f394e79396e657807134e0191ccf3344755322c4cff067e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): company/apple/ReverseWordsInAString.java:8-15 | company/bloomberg/ReverseWordsInAString.java:8-15 | company/microsoft/ReverseWordsInAString.java:8-15 | company/snapchat/ReverseWordsInAString.java:8-15 | company/yelp/ReverseWordsInAString.java:8-15 | leetcode/string/ReverseWordsInAString.java:8-15 \u2014 \u0060company/apple/ReverseWordsInAString.java\u0060 and \u0060company/bloomberg/ReverseWordsInAString.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 8 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/apple/ReverseWordsInAString.java"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f28a62ca6f4734caadda2fe751b1085a3de637f45f3ba129efe33eb68eda08e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): company/amazon/LongestPalindromicSubstring.java:15-29 | company/bloomberg/LongestPalindromicSubstring.java:15-29 | company/microsoft/LongestPalindromicSubstring.java:15-29 | leetcode/string/LongestPalindromicSubstring.java:15-29 \u2014 \u0060company/amazon/LongestPalindromicSubstring.java\u0060 and \u0060company/bloomberg/LongestPalindromicSubstring.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 26 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/LongestPalindromicSubstring.java"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5b144784e2a5f5658d5e48ea2b2b73268e29eaf26d636fe91219aa862b9230"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): company/facebook/InsertInterval.java:24-38 | company/google/InsertInterval.java:24-38 | company/linkedin/InsertInterval.java:24-38 | leetcode/array/InsertInterval.java:24-38 \u2014 \u0060company/facebook/InsertInterval.java\u0060 and \u0060company/google/InsertInterval.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 15 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/InsertInterval.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7d344f4da8576bb9e1fadc7ac024482e7f786c4f3864d0a346868fbf4fbdd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): company/amazon/ValidateBinarySearchTree.java:38-45 | company/facebook/ValidateBinarySearchTree.java:38-45 | leetcode/tree/ValidateBinarySearchTree.java:38-45 \u2014 \u0060company/amazon/ValidateBinarySearchTree.java\u0060 and \u0060company/facebook/ValidateBinarySearchTree.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 8 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/ValidateBinarySearchTree.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa50f9641976c4622f3726ccc39a76b2788341604559093af32133fd5c6f26e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): company/google/GameOfLife.java:50-57 | leetcode/array/GameOfLife.java:50-57 \u2014 before extracting anything, compare \u0060company/google/GameOfLife.java\u0060 and \u0060leetcode/array/GameOfLife.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060company/google/GameOfLife.java:50\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/GameOfLife.java"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a6e4717dede4cbcb4fc8198e34f60a2f4282481b3df45cf63f0bf582537c2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): company/google/WiggleSort.java:7-15 | leetcode/array/WiggleSort.java:7-15 \u2014 before extracting anything, compare \u0060company/google/WiggleSort.java\u0060 and \u0060leetcode/array/WiggleSort.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/WiggleSort.java"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0884631cad327e83fb90cd5f6a6caee02253baffd3632e1b7750e4cef5604f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4): company/apple/ValidSudoku.java:10-29 | company/snapchat/ValidSudoku.java:10-29 | company/uber/ValidSudoku.java:10-29 | leetcode/hash-table/ValidSudoku.java:10-29 \u2014 \u0060company/apple/ValidSudoku.java\u0060 and \u0060company/snapchat/ValidSudoku.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 20 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/apple/ValidSudoku.java"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"70580085a0b8f7608cc4ff29b9fad7fcf38794930308d01040f8e30ec36f44b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): company/facebook/WallsAndGates.java:22-29 | company/google/WallsAndGates.java:22-29 | leetcode/breadth-first-search/WallsAndGates.java:22-29 \u2014 \u0060company/facebook/WallsAndGates.java\u0060 and \u0060company/google/WallsAndGates.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 21 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/WallsAndGates.java"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ef4734ae76600453355718a7165cff8c2108a15043988e494c686039d26f70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): company/google/MissingRanges.java:10-17 | leetcode/array/MissingRanges.java:9-15 \u2014 before extracting anything, compare \u0060company/google/MissingRanges.java\u0060 and \u0060leetcode/array/MissingRanges.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060company/google/MissingRanges.java:10\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/MissingRanges.java"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1e70ab02078ce664448b8dab1a7c8664bfce36bde883269223e62671988b59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): company/google/StrobogrammaticNumber.java:9-16 | leetcode/hash-table/StrobogrammaticNumber.java:9-16 \u2014 before extracting anything, compare \u0060company/google/StrobogrammaticNumber.java\u0060 and \u0060leetcode/hash-table/StrobogrammaticNumber.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/StrobogrammaticNumber.java"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69b2b5b49087999fe8b62de970a2fc7ad927442c2d6b9a217d45ed91108cba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): company/linkedin/MaximumSubarray.java:8-20 | leetcode/array/MaximumSubarray.java:10-26 \u2014 before extracting anything, compare \u0060company/linkedin/MaximumSubarray.java\u0060 and \u0060leetcode/array/MaximumSubarray.java\u0060 as WHOLE FILES: 91% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/linkedin/MaximumSubarray.java"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"66971948ee65b234768a74f47cfc0bd264d60d9bb123d4d4fce7bb0196dfc65d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): company/linkedin/PaintHouse.java:14-19 | leetcode/dynamic-programming/PaintHouse.java:14-19 \u2014 before extracting anything, compare \u0060company/linkedin/PaintHouse.java\u0060 and \u0060leetcode/dynamic-programming/PaintHouse.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060company/linkedin/PaintHouse.java:14\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/linkedin/PaintHouse.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c54ac379c8b9a1e04becbd532afa15b8061dcd5efafc5b19080c33374527d74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): leetcode/array/MinimumPathSum.java:12-26 | leetcode/dynamic-programming/MinimumPathSum.java:12-26 \u2014 \u0060leetcode/array/MinimumPathSum.java\u0060 and \u0060leetcode/dynamic-programming/MinimumPathSum.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 15 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/array/MinimumPathSum.java"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e060f7953e058fc5b9657b6da35b00ee63480ca0b51d067212b0f735b5af8a42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): uva/Friends.java:62-67 | uva/Friends.java:72-77 | uva/ICanGuessTheDataStructure.java:101-105 | uva/TheSettlersOfCatan.java:75-80 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060uva/Friends.java:62\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/Friends.java"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee64efb60fff6a150dfdf875099ed7ca9515a76e18bd583be394bfb7a9dc3046"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): company/adobe/AddDigits.java:1-21 | company/microsoft/AddDigits.java:1-21 | leetcode/math/AddDigits.java:1-21 \u2014 \u0060company/adobe/AddDigits.java\u0060 and \u0060company/microsoft/AddDigits.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 21 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060company/adobe/AddDigits.java:1\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/adobe/AddDigits.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35e3d1311790363239c930b8b8d0d8ac0c2f2b5b3e304d5dc56f3d0084dfebe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): company/airbnb/ContainsDuplicate.java:1-16 | company/palantir/ContainsDuplicate.java:1-16 | company/yahoo/ContainsDuplicate.java:1-16 | leetcode/hash-table/ContainsDuplicate.java:1-16 \u2014 \u0060company/airbnb/ContainsDuplicate.java\u0060 and \u0060company/palantir/ContainsDuplicate.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 16 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060company/airbnb/ContainsDuplicate.java:1\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/airbnb/ContainsDuplicate.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6d5474630817555e8e19dfd0b6ce2a8fd87d64e967df039befae404312411b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 6): company/amazon/EncodeAndDecodeTinyURL.java:1-36 | company/facebook/EncodeAndDecodeTinyURL.java:1-36 | company/google/EncodeAndDecodeTinyURL.java:1-36 | company/uber/EncodeAndDecodeTinyURL.java:1-36 | leetcode/hash-table/EncodeAndDecodeTinyURL.java:1-36 | leetcode/math/EncodeAndDecodeTinyURL.java:1-36 \u2014 \u0060company/amazon/EncodeAndDecodeTinyURL.java\u0060 and \u0060company/facebook/EncodeAndDecodeTinyURL.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 36 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060company/amazon/EncodeAndDecodeTinyURL.java:1\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/EncodeAndDecodeTinyURL.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8caeaa7bf358fa6c8591b3a7694796a6e41d1ab74bbb949eb023eaf8ba5a55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 9): company/amazon/InsertDeleteGetRandomO1.java:37-69 | company/facebook/InsertDeleteGetRandomO1.java:37-69 | company/google/InsertDeleteGetRandomO1.java:37-69 | company/twitter/InsertDeleteGetRandomO1.java:37-69 | company/uber/InsertDeleteGetRandomO1.java:37-69 | company/yelp/InsertDeleteGetRandomO1.java:37-69 | leetcode/array/InsertDeleteGetRandomO1.java:37-69 | leetcode/design/InsertDeleteGetRandomO1.java:37-69 | leetcode/hash-table/InsertDeleteGetRandomO1.java:37-69 \u2014 \u0060company/amazon/InsertDeleteGetRandomO1.java\u0060 and \u0060company/facebook/InsertDeleteGetRandomO1.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 33 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/InsertDeleteGetRandomO1.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4bf0dc4c4fbab678b312169cb7ecc3ff357ba4895812fe805558b4bd09a122"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 8): company/amazon/MinStack.java:21-54 | company/bloomberg/MinStack.java:21-54 | company/facebook/MinStack.java:15-48 | company/google/MinStack.java:21-54 | company/snapchat/MinStack.java:21-54 | company/uber/MinStack.java:21-54 | leetcode/design/MinStack.java:21-54 | leetcode/stack/MinStack.java:21-54 \u2014 \u0060company/amazon/MinStack.java\u0060 and \u0060company/bloomberg/MinStack.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 34 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060company/amazon/MinStack.java:21\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/MinStack.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d452ee334f159a4a331ea5c5758d4a28b8a130de68d90234597a4410e8f2712b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 5): company/amazon/ReverseLinkedList.java:1-27 | company/facebook/ReverseLinkedList.java:1-27 | company/twitter/ReverseLinkedList.java:1-27 | company/uber/ReverseLinkedList.java:1-27 | leetcode/linked-list/ReverseLinkedList.java:1-27 \u2014 \u0060company/amazon/ReverseLinkedList.java\u0060 and \u0060company/facebook/ReverseLinkedList.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 27 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060company/amazon/ReverseLinkedList.java:1\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/ReverseLinkedList.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf71affc0f601df50889611f0f579aa05749cc3a829c4917db6cbd1db982db6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 4): company/facebook/BinarySearchTreeIterator.java:1-45 | company/google/BinarySearchTreeIterator.java:1-46 | company/linkedin/BinarySearchTreeIterator.java:1-46 | leetcode/stack/BinarySearchTreeIterator.java:1-45 \u2014 \u0060company/facebook/BinarySearchTreeIterator.java\u0060 and \u0060company/google/BinarySearchTreeIterator.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 46 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060company/facebook/BinarySearchTreeIterator.java:1\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/BinarySearchTreeIterator.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07c3bb3c71474acdf980ed94e5784d3a69097f082d29c688cc6706fc6e40bfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): company/facebook/FirstBadVersion.java:1-26 | leetcode/binary-search/FirstBadVersion.java:1-26 \u2014 before extracting anything, compare \u0060company/facebook/FirstBadVersion.java\u0060 and \u0060leetcode/binary-search/FirstBadVersion.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060company/facebook/FirstBadVersion.java:1\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/FirstBadVersion.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6874d81cca1e6b3a1611b209abaac8476a994ecd95c3ed2b2513502b3e788e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): company/facebook/InorderSuccessorInBST.java:1-28 | leetcode/tree/InorderSuccessorInBST.java:1-28 \u2014 before extracting anything, compare \u0060company/facebook/InorderSuccessorInBST.java\u0060 and \u0060leetcode/tree/InorderSuccessorInBST.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060company/facebook/InorderSuccessorInBST.java:1\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/InorderSuccessorInBST.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"703bf0f2b0bf095cba2cead0d7dd74b88a8a7307411ed5b079d567d63e7c37f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): company/google/MovingAverageFromDataStream.java:1-36 | leetcode/queue/MovingAverageFromDataStream.java:1-36 \u2014 before extracting anything, compare \u0060company/google/MovingAverageFromDataStream.java\u0060 and \u0060leetcode/queue/MovingAverageFromDataStream.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060company/google/MovingAverageFromDataStream.java:1\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/MovingAverageFromDataStream.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edd4ec856fba30dd155de9c1e0d2ea3d26769bf70c9af06e0e73b80b41261f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): company/google/PlusOneLinkedList.java:1-49 | leetcode/linked-list/PlusOneLinkedList.java:1-49 \u2014 before extracting anything, compare \u0060company/google/PlusOneLinkedList.java\u0060 and \u0060leetcode/linked-list/PlusOneLinkedList.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060company/google/PlusOneLinkedList.java:1\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/PlusOneLinkedList.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cc7a700d6960b032889384e0b9dfd7341ca07731f52312ff5f53cfb9f0a606"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): company/google/ZigZagIterator.java:1-40 | leetcode/design/ZigZagIterator.java:1-39 \u2014 before extracting anything, compare \u0060company/google/ZigZagIterator.java\u0060 and \u0060leetcode/design/ZigZagIterator.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060company/google/ZigZagIterator.java:1\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/ZigZagIterator.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3f6b3e994c151baf9cbf7b1ff26fdee563c4a1ce8f6fc72175b447642d0e8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): company/linkedin/MaximumDepthOfABinaryTree.java:1-21 | company/uber/MaximumDepthOfABinaryTree.java:1-21 | leetcode/depth-first-search/MaximumDepthOfABinaryTree.java:1-21 \u2014 \u0060company/linkedin/MaximumDepthOfABinaryTree.java\u0060 and \u0060company/uber/MaximumDepthOfABinaryTree.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 21 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060company/linkedin/MaximumDepthOfABinaryTree.java:1\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/linkedin/MaximumDepthOfABinaryTree.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04172f5fad66a399ee32d99dba7a8a44c09af255cc42c211e36bfde608d82f8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): cracking-the-coding-interview/chapter-three-stacks-and-queues/MyQUeue.java:6-39 | cracking-the-coding-interview/chapter-three-stacks-and-queues/MyQueue.java:6-39 \u2014 before extracting anything, compare \u0060cracking-the-coding-interview/chapter-three-stacks-and-queues/MyQUeue.java\u0060 and \u0060cracking-the-coding-interview/chapter-three-stacks-and-queues/MyQueue.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cracking-the-coding-interview/chapter-three-stacks-and-queues/MyQUeue.java"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de2410c6fcd5572143a48de40593de8e1ac7ca2292f437dec14b7aa290833a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): leetcode/array/RemoveElement.java:1-19 | leetcode/two-pointers/RemoveElement.java:1-19 \u2014 \u0060leetcode/array/RemoveElement.java\u0060 and \u0060leetcode/two-pointers/RemoveElement.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 19 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060leetcode/array/RemoveElement.java:1\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/array/RemoveElement.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6612b0883dff5aecb73a8562a6b764b9a48eb96eb7f7508f4891498e06649961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): company/airbnb/ConvertSortedArrayToBinarySearchTree.java:13-21 | leetcode/depth-first-search/ConvertSortedArrayToBinarySearchTree.java:13-21 \u2014 before extracting anything, compare \u0060company/airbnb/ConvertSortedArrayToBinarySearchTree.java\u0060 and \u0060leetcode/depth-first-search/ConvertSortedArrayToBinarySearchTree.java\u0060 as WHOLE FILES: 95% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/airbnb/ConvertSortedArrayToBinarySearchTree.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"44302b76031c6b988d59dea28dd670b4d6b211d3a775f0f5e6096a86a5886515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): company/amazon/LongestPalindromicSubstring.java:31-41 | company/bloomberg/LongestPalindromicSubstring.java:31-41 | company/microsoft/LongestPalindromicSubstring.java:31-41 | leetcode/string/LongestPalindromicSubstring.java:31-41 \u2014 \u0060company/amazon/LongestPalindromicSubstring.java\u0060 and \u0060company/bloomberg/LongestPalindromicSubstring.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 26 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/LongestPalindromicSubstring.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9d7031c99881b2ae72dcd1786df13265845f710b008731ead72d66c914aa3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): company/amazon/Subsets.java:20-26 | company/facebook/Subsets.java:20-26 | company/uber/Subsets.java:20-26 | leetcode/array/Subsets.java:20-26 \u2014 \u0060company/amazon/Subsets.java\u0060 and \u0060company/facebook/Subsets.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 21 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/Subsets.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55930aadecf7d389adc0b782f349867dd3f57c12d2368252fa0359f78c834ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): company/facebook/BinaryTreePaths.java:24-34 | company/google/BinaryTreePaths.java:24-34 | leetcode/tree/BinaryTreePaths.java:24-34 \u2014 \u0060company/facebook/BinaryTreePaths.java\u0060 and \u0060company/google/BinaryTreePaths.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 23 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/BinaryTreePaths.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7dce8660f4324fa313a1a76c934edf466d8416277c246254a89cc1f810120c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): company/facebook/CountAndSay.java:13-24 | leetcode/string/CountAndSay.java:12-20 \u2014 before extracting anything, compare \u0060company/facebook/CountAndSay.java\u0060 and \u0060leetcode/string/CountAndSay.java\u0060 as WHOLE FILES: 88% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/CountAndSay.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"42520b51dad3ab73b7237ed36eefd668c934c5f8fbca542ed2b3dad6be056820"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): company/facebook/ExpressionAddOperators.java:11-21 | company/google/ExpressionAddOperators.java:11-21 | leetcode/divide-and-conquer/ExpressionAddOperators.java:11-20 \u2014 \u0060company/facebook/ExpressionAddOperators.java\u0060 and \u0060company/google/ExpressionAddOperators.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 35 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/ExpressionAddOperators.java"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3542b229baa688dd32ac03986cb630823592f07c06dd8f8d1b5926f48f72c726"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): company/facebook/FlattenNestedListIterator.java:35-39 | company/google/FlattenNestedListIterator.java:35-39 | company/twitter/FlattenNestedListIterator.java:35-39 | leetcode/stack/FlattenNestedListIterator.java:35-39 \u2014 \u0060company/facebook/FlattenNestedListIterator.java\u0060 and \u0060company/google/FlattenNestedListIterator.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 21 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/FlattenNestedListIterator.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7bdf4d580858f134d477f33f8b0ec48666ec38b22652343fb51b8e3583622d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): company/facebook/ImplementTrie.java:67-79 | company/google/ImplementTrie.java:67-79 | company/twitter/ImplementTrie.java:68-80 | company/uber/ImplementTrie.java:67-79 | leetcode/trie/ImplementTrie.java:71-83 \u2014 \u0060company/facebook/ImplementTrie.java\u0060 and \u0060company/google/ImplementTrie.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 41 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/ImplementTrie.java"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14af9faeac051a7ddc7aef331262629bd810faac1c1d020324d72062c70995c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): company/facebook/PalindromicSubstrings.java:31-37 | company/linkedin/PalindromicSubstrings.java:31-37 | leetcode/dynamic-programming/PalindromicSubstrings.java:31-37 | leetcode/string/PalindromicSubstrings.java:31-37 \u2014 \u0060company/facebook/PalindromicSubstrings.java\u0060 and \u0060company/linkedin/PalindromicSubstrings.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 18 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/PalindromicSubstrings.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"616ededc9ae40b7b9c312de01ddda6b836a5c921a66ff93907fc1661df956069"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): company/facebook/RemoveInvalidParentheses.java:11-17 | leetcode/breadth-first-search/RemoveInvalidParentheses.java:11-15 \u2014 before extracting anything, compare \u0060company/facebook/RemoveInvalidParentheses.java\u0060 and \u0060leetcode/breadth-first-search/RemoveInvalidParentheses.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/RemoveInvalidParentheses.java"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf7018fd3489149a7a057b2443b73659f82b94567f8f97b500238558d63c165"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): company/google/BombEnemy.java:63-75 | leetcode/dynamic-programming/BombEnemy.java:63-75 \u2014 before extracting anything, compare \u0060company/google/BombEnemy.java\u0060 and \u0060leetcode/dynamic-programming/BombEnemy.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/BombEnemy.java"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebfeb71974036ada0819f01cd64e91ac7b226bd926f008dbc064c0e3949ce78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): company/google/GeneralizedAbbreviation.java:8-14 | leetcode/backtracking/GeneralizedAbbreviation.java:8-14 \u2014 before extracting anything, compare \u0060company/google/GeneralizedAbbreviation.java\u0060 and \u0060leetcode/backtracking/GeneralizedAbbreviation.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/GeneralizedAbbreviation.java"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"062332aeef52525fd40dad59afde3fc0b85242e112f6bc2686aba32aa663e048"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): company/google/GenerateParentheses.java:14-19 | company/uber/GenerateParentheses.java:2-7 | leetcode/backtracking/GenerateParentheses.java:14-19 | leetcode/string/GenerateParentheses.java:14-19 \u2014 \u0060company/google/GenerateParentheses.java\u0060 and \u0060company/uber/GenerateParentheses.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 19 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/GenerateParentheses.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bdb7ccde53ee20ec58f8d87b5608cd8abea824b5e1fc415f395866b4e94426"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): company/google/MissingRanges.java:19-27 | leetcode/array/MissingRanges.java:17-25 \u2014 before extracting anything, compare \u0060company/google/MissingRanges.java\u0060 and \u0060leetcode/array/MissingRanges.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/MissingRanges.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"87eaf13f1248ad7804f5fa11736d0d404d9d7fae49a536b9ebdfdf1dfe0266e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): company/google/UniqueWordAbbreviation.java:57-63 | leetcode/hash-table/UniqueWordAbbreviation.java:57-63 \u2014 before extracting anything, compare \u0060company/google/UniqueWordAbbreviation.java\u0060 and \u0060leetcode/hash-table/UniqueWordAbbreviation.java\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/UniqueWordAbbreviation.java"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4c69d661f8d749e7b3eb4c9e9d0c6bdce6dfec740c0670a18685c8a291deed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cracking-the-coding-interview/chapter-four-trees-and-graphs/BinaryTreeIsBalanced.java:6-11 | cracking-the-coding-interview/chapter-three-stacks-and-queues/BinaryTreeIsBalanced.java:6-11 \u2014 \u0060cracking-the-coding-interview/chapter-four-trees-and-graphs/BinaryTreeIsBalanced.java\u0060 and \u0060cracking-the-coding-interview/chapter-three-stacks-and-queues/BinaryTreeIsBalanced.java\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 18 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cracking-the-coding-interview/chapter-four-trees-and-graphs/BinaryTreeIsBalanced.java"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"565adc447ef39b553ea403e8d5433c0b4a9e35524473c5bf7e69e9e2f659a962"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): uva/Friends.java:129-140 | uva/VirtualFriends.java:104-110 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/Friends.java"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"203afff5aad737135a28e2b46b0ad7106b44f597b78d1e79829f05eb06eeda72"}},{"ruleId":"D8","level":"error","message":{"text":"No automated tests: No automated tests \u2014 no test code was found in this repository. Untested code is the largest single risk to changing it safely. Start with the code you change most often: add a suite in a framework a runner can collect (JUnit (with Kotest or MockK on Kotlin)), and run it in CI so the gap cannot reopen."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3132564c6310e5d01a231f252a02d5d2f5a542c0a8fa29a14c89693f1e3df871"}},{"ruleId":"D34","level":"note","message":{"text":"Dormant codebase: 48 of 48 significant files have no living knowledge \u2014 the codebase as a whole is dormant, not 48 separate risks. Counted over 48 of the 516 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. Re-engage owners or document before change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4c69f1e54b7dd6fe9029dd02df6ba8f8145b789f2f18dbdaa086c40ded49dba6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/ICanGuessTheDataStructure.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"832e15017e0f287d0d3007738d1173285be072159a548660b142389fa52d058e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/Friends.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2db4f6d91170a1d2ac1f6649d9d714e243e4689ec6e091c83a4fd3a47e4da8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/OpenSource.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b928b5f59c36cca60ec4aa6363a5778a006dda39b23c2822640f392c73395231"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/TheSettlersOfCatan.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"663ecc97b8af1af1f3ec921880ba67e9b5cf27360dc82af423fbc48e27a60e12"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/PrimeFactors.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4539ecf334d7fe31daffe06bd12adfcbc33475f60836e8cd5acc35f00b5ae5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/VirtualFriends.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67797216f7657943eb985a569d9a4639ad022b71fcc574a47f379b9e04f6781"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/GoogleIsFeelingLucky.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"409be51b98d1285479a01964bf0f11dd0d7fe064e374aed0a7d6bfa9c889375c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/WhatBaseIsThis.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafb19b145f13ecefa83def1756b768e0cbb2ae514e6e2b543721c630101c8ce"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/ShortestDistanceFromAllBuildings.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"842cde835a8afbcd9457dd07ed7001754f5c9733122d91fea00953d642c882a4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/breadth-first-search/ShortestDistanceFromAllBuildings.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aceab46f0c895e7a4aff06376b11552b83651268834d7da8bd0b9ce9cae081b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/backtracking/AndroidUnlockPatterns.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"878b6f10977898c45c721dc3e21cb8b31dd560c1d4aceb3b4e338d73dc2effdb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/AndroidUnlockPatterns.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"265870b031dc9e6617cadc548712d083af8f86564e4407dda1e38dd2b0d5ac27"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/PeskyPalindromes.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5976c69667c3870c59eea733f622284beb73b8fbba70c18cf5b07c305bb6984e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/Ants.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccda09dedee92e3eb09d8ea048aeb11016ddb59732eccd0fb839575ff03bcae3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/AddingReversedNumbers.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcb51ae0649c2375180568ee5b33593943eb081410b61388aa7cb6e9e547e01"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/FactorialFrequenices.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a94959306662c11b8680708afa62d65ccca88238dae9249c204acd7389e834f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/MischievousChildren.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34528bf29f2f20bbe7f96c5cee7293db7aaf5585273f080ee824849453d644e9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/CoconutsRevisited.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc01fc0a14f5b639c3550bff7e4fdbfcc40ae911246eaa615c78b36d31116fed"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/GoldbachConjecture.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2471f6cd1e5c7fab16a9b75be4dadfc56a09e8fec4a060533e31193944f37be"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/Newspaper.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"437b195e34d8b2eff3a244a31b467f6e77441e36588b7eeff7ed72c98fcd93ea"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/BackToIntermediateMath.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c9ee0765d8bccf00145665ff354a9bbb4b15843b1c4e1bc7cfd5f13221d823"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/PacificAtlanticWaterFlow.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85927895004cef728c54046ad5c36478f3e6ee99f31935e7854f54a5be8c482"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/breadth-first-search/PacificAtlanticWaterFlow.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3144232e8bf8e85909b630d022a6c9c8e926d2bd4564251ff73e985ff8bb877a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/AverageSpeed.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be967debd28948c3b70c12b04fc52050edef52bbbd0c418992d25ad60e0cb178"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/BrickGame.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fd9def1d533321c773e4dbf5366618133ec06bcfafd73fc1c2102b02415ffb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/stack/ExclusiveTimeOfFunctions.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f765308332b48ca3325867d537abb86b39daa60bdb2875c61283bc250513e063"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/uber/ExclusiveTimeOfFunctions.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff973578c6c1163519a1c301cc13cd3ec90fcc09ca219aca5e552c550e7ca7d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/ExclusiveTimeOfFunctions.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09dda795e2916feb8609e7cfb0030aae2fb42e0cf88de9073c9cc9e0eb69ed25"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/BasicallySpeaking.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e409de35deeaeb859a8135fc8d5f3d3e91be60c580ed10101da39791332a83e7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/array/GameOfLife.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3806157069889d6425b9562e04c1db8c3ca7831ce2941479f29400404646f45"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/GameOfLife.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b84f67b0980d32bfb91aa83392cd01925a6f14510dfd4283e5b6b0e1bb668c5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/TheHugeOne.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ec2f3f03748291ab55851068cede8d18eb1d288e8666b9aa2df81e9fe75661"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/NumberingRoads.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f8f529c74aefc7f94e072ea60ff3f1f77cc4a6c344a75c906b69146b68b198"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/SkewBinary.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34105bdc5bee2bd85cfe4a95318de560682c7f27dedfa2219823ed8ae94dc395"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/BinaryTreeVerticalOrderTraversal.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"171345d31787bddfb1ed61a847e6feba0394c42c29d28073bb4d44e7c7006921"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/DecodeString.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5da179fd4ceff98681e0d0058e1295bad959e6ac7259384ba242a65d7db09d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/stack/DecodeString.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c6c002f66a7a6471e70573d3a2bac2c4345fb7fe999eff2948d75a6fef2e7f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/hash-table/BinaryTreeVerticalOrderTraversal.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4df6a591b740f7449a2d75ac5f8843717348f3ae71e6f60b53a18aa5d8f6f4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/BinaryTreeVerticalOrderTraversal.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"997a42f6c29860b231a6ecc0f7068a03b885ae5fb136cdee4df02f5d0d235f56"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/hash-table/InsertDeleteGetRandomO1.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17dc2c3cc5df15505dbe132f7a4f52058d03d35b41e30d12ebb42bcac356cd4d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/design/InsertDeleteGetRandomO1.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3369237188acd3049375b6ecc0bd0fb2174e23cc8b7bd4a31be70823a1ad32"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"leetcode/array/InsertDeleteGetRandomO1.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee7ee70fd318b382537e98e737883bfa849cae2b77fd0a66834df2f3691a933"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/yelp/InsertDeleteGetRandomO1.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"891daad7aae7b07db3a9e8bb509268da0b97928ab43824350b16bf3d80631fcf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/uber/InsertDeleteGetRandomO1.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c2d9be1ac4be04f489da1ff042e8e8050993a5e9bc1b6f1aeacbd9ac9e2e48"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/twitter/InsertDeleteGetRandomO1.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"306a1aaf16954ea184bd747a7c35f5c08932bb3023bba84bc05e9286b56f0edd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/InsertDeleteGetRandomO1.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a5b9983dff56b24d87d32f69ad9144a9af4cc5e6ad401999a39a600f17671e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/InsertDeleteGetRandomO1.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a4e9ecb1b5814bfe8e9f13454f830cc91f677f388609fd94d14fca4486078e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/InsertDeleteGetRandomO1.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac7ddbc09a2aba4349a070e2d6b4fbcfa31f2aa02c50aaef840a480cf185084"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P1","level":"warning","message":{"text":"No CI pipeline: No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, \u2026) \u2014 changes aren\u0027t gated by an automated build/test."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44f01af96e50474fba2df84d95ddf4f7e1d34c29c307830b9efc9057daa6b670"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add spotbugs with find-sec-bugs (or \u0060semgrep --config=auto\u0060, which runs on any language) \u2014 this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Character.isLetterOrDigit(s.charAt(left)) \u0026\u0026 left \u003C right\u0060 appears character-identically in 3 files \u2014 company/facebook/ValidPalindrome.java, company/uber/ValidPalindrome.java, leetcode/string/ValidPalindrome.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/ValidPalindrome.java"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81c5c1e7bd158f492cebe81766fa59c8cd106b23bdc995fa6f7502bf072b9fe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Character.isLetterOrDigit(s.charAt(right)) \u0026\u0026 right \u003E left\u0060 appears character-identically in 3 files \u2014 company/facebook/ValidPalindrome.java, company/uber/ValidPalindrome.java, leetcode/string/ValidPalindrome.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/ValidPalindrome.java"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"25aeb5535ddf59626055120b9e3d659799626a85c11768c0bfb000d37f064399"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!map.containsKey(getKey(word))||map.get(getKey(word)).equals(word)\u0060 appears character-identically in 2 files \u2014 company/google/UniqueWordAbbreviation.java, leetcode/hash-table/UniqueWordAbbreviation.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/UniqueWordAbbreviation.java"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a025f90f03502db934ca7a8f3220c76a927ed051c777b6972e263975b7bc8b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!stack.isEmpty() \u0026\u0026 temperatures[i] \u003E temperatures[stack.peek()]\u0060 appears character-identically in 3 files \u2014 company/google/DailyTemperatures.java, leetcode/hash-table/DailyTemperatures.java, leetcode/stack/DailyTemperatures.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/DailyTemperatures.java"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"da23071f417da0c12aacb59adf91a689663d7bd180100cd0ecd2cb2d4671c5cc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!visited[i] \u0026\u0026 (skip[current][i] == 0 || visited[skip[current][i]])\u0060 appears character-identically in 2 files \u2014 company/google/AndroidUnlockPatterns.java, leetcode/backtracking/AndroidUnlockPatterns.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/AndroidUnlockPatterns.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"18591eb445a27d9bdd99116e26fec66615f27694ef8d9d9ab08a2d15e6bc9a35"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060board[i][j] != \u0027.\u0027 \u0026\u0026 !rows.add(board[i][j])\u0060 appears character-identically in 4 files \u2014 company/apple/ValidSudoku.java, company/snapchat/ValidSudoku.java, company/uber/ValidSudoku.java, leetcode/hash-table/ValidSudoku.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/apple/ValidSudoku.java"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67afb766cb062b523de87a8138484247fa93f66d57fa3218092e18f21074d2b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060board[i][j] == 1 \u0026\u0026 lives \u003E= 2 \u0026\u0026 lives \u003C= 3\u0060 appears character-identically in 2 files \u2014 company/google/GameOfLife.java, leetcode/array/GameOfLife.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/GameOfLife.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bf1eef85631c09619b450e09688f79d3a12ac91d3ac7c0ac87e92f3f2efc83"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060board[j][i]!=\u0027.\u0027 \u0026\u0026 !columns.add(board[j][i])\u0060 appears character-identically in 4 files \u2014 company/apple/ValidSudoku.java, company/snapchat/ValidSudoku.java, company/uber/ValidSudoku.java, leetcode/hash-table/ValidSudoku.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/apple/ValidSudoku.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecc646c5add970d7c97895ecbfd37d3b3aa90c3b6604e385dd6afa1fe53aa36"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060board[rowIndex \u002B j / 3][columnIndex \u002B j % 3] != \u0027.\u0027 \u0026\u0026 !box.add(board[rowIndex \u002B j / 3][columnIndex \u002B j % 3])\u0060 appears character-identically in 4 files \u2014 company/apple/ValidSudoku.java, company/snapchat/ValidSudoku.java, company/uber/ValidSudoku.java, leetcode/hash-table/ValidSudoku.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/apple/ValidSudoku.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d13d71396e617a0dac998db7935feb2d10ce1bdc8eaaa533f5de2412165c02"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060characters.get(c) \u003E -1 \u0026\u0026 characters.get(c) \u003C min\u0060 appears character-identically in 6 files \u2014 company/amazon/FirstUniqueCharacterInAString.java, company/bloomberg/FirstUniqueCharacterInAString.java, company/google/FirstUniqueCharacterInAString.java, company/microsoft/FirstUniqueCharacterInAString.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/FirstUniqueCharacterInAString.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"135c57a99ab55d6b4ff3d5c60deca6b99fb818d535bf1d6bbadac0c5d8b5726d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dp[i \u002B 1][j] || dp[i][j \u002B 1] || dp[i \u002B 1][j - 1]\u0060 appears character-identically in 5 files \u2014 company/airbnb/RegularExpressionMatching.java, company/facebook/RegularExpressionMatching.java, company/twitter/RegularExpressionMatching.java, company/uber/RegularExpressionMatching.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/airbnb/RegularExpressionMatching.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a6e5bf6f043e56b1bf2b3d1531009ce6d498cae95670f6f2728f1ae9d4ef9d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dp[j] \u0026\u0026 wordDict.contains(s.substring(j, i))\u0060 appears character-identically in 5 files \u2014 company/amazon/WordBreak.java, company/facebook/WordBreak.java, company/google/WordBreak.java, company/uber/WordBreak.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/WordBreak.java"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"418dcac4859862230478bcf9159467bc5d6ecf9d9b44f9f7a23d3f3863349efa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fast != null \u0026\u0026 fast.next != null \u0026\u0026 fast != slow\u0060 appears character-identically in 6 files \u2014 company/amazon/LinkedListCycle.java, company/bloomberg/LinkedListCycle.java, company/microsoft/LinkedListCycle.java, company/yahoo/LinkedListCycle.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/LinkedListCycle.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f917cf58d79f947afc69c4acf4e55ad4c75793a7d5b619bb7ea51dfc55f7a590"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060grid == null || grid.length == 0 || grid[0].length == 0\u0060 appears character-identically in 4 files \u2014 company/google/BombEnemy.java, company/google/ShortestDistanceFromAllBuildings.java, leetcode/breadth-first-search/ShortestDistanceFromAllBuildings.java, leetcode/dynamic-programming/BombEnemy.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/BombEnemy.java"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cefce448377afcd1b725a9d2226e44617dd0a14457c075d3e3cbd7ba54eeef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060grid[i][j] == 0 \u0026\u0026 reach[i][j] == numberOfBuildings\u0060 appears character-identically in 2 files \u2014 company/google/ShortestDistanceFromAllBuildings.java, leetcode/breadth-first-search/ShortestDistanceFromAllBuildings.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/ShortestDistanceFromAllBuildings.java"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfcd9be2ba84eaa0c770fb4101cf63575f995632f4211276d728d1ff9bc9a65"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060helper(left.right, right.left) \u0026\u0026 helper(left.left, right.right)\u0060 appears character-identically in 2 files \u2014 company/linkedin/SymmetricTree.java, leetcode/breadth-first-search/SymmetricTree.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/linkedin/SymmetricTree.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a080a91227c16a88451fa2cc6cab77aac82790c1dd8b4b79757abf86df8a8e37"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i != candidate \u0026\u0026 knows(candidate, i) || !knows(i, candidate)\u0060 appears character-identically in 3 files \u2014 company/facebook/FindTheCelebrity.java, company/linkedin/FindTheCelebrity.java, leetcode/array/FindTheCelebrity.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/FindTheCelebrity.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbedcb2c763a3411c06c3010fcdbe19a8f22019916ec1a30ef003f903c07da5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u002B 1 \u003C nums.length \u0026\u0026 (nums[i \u002B 1] - nums[i] == 1)\u0060 appears character-identically in 2 files \u2014 company/google/SummaryRanges.java, leetcode/array/SummaryRanges.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/SummaryRanges.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5ed6e3d68494b490983e8162e1f504e26d94ab6ca62d0dbe9f9b141094e46a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C 0 || i \u003E= board.length || j \u003C 0 || j \u003E= board[0].length\u0060 appears character-identically in 2 files \u2014 company/facebook/WordSearch.java, leetcode/array/WordSearch.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/WordSearch.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"950649d2e5def12606916818160a7bda11bcacf7861b9cf2c08c6814e56819a0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C 0 || i \u003E= grid.length || j \u003C 0 || j \u003E= grid[0].length || grid[i][j] == \u00270\u0027\u0060 appears character-identically in 4 files \u2014 company/amazon/NumberOfIslands.java, company/facebook/NumberOfIslands.java, company/google/NumberOfIslands.java, leetcode/depth-first-search/NumberOfIslands.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/NumberOfIslands.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af709051a606a7752056d30118f99d5997ad7de9bd22e60f44226d0133a9576"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C 0 || i \u003E= rooms.length || j \u003C 0 || j \u003E= rooms[0].length || rooms[i][j] \u003C distance\u0060 appears character-identically in 3 files \u2014 company/facebook/WallsAndGates.java, company/google/WallsAndGates.java, leetcode/breadth-first-search/WallsAndGates.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/WallsAndGates.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fc36fdd9cffec120cfe8d2a5fb172a37c6156f671aed647e6905204320251d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C intervals.size() \u0026\u0026 intervals.get(i).end \u003C newInterval.start\u0060 appears character-identically in 4 files \u2014 company/facebook/InsertInterval.java, company/google/InsertInterval.java, company/linkedin/InsertInterval.java, leetcode/array/InsertInterval.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/InsertInterval.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce04f5dcd5dd0e3df978eecb8a247a31ddb45318a1b62c5b230abf665c80a57"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C intervals.size() \u0026\u0026 intervals.get(i).start \u003C= newInterval.end\u0060 appears character-identically in 4 files \u2014 company/facebook/InsertInterval.java, company/google/InsertInterval.java, company/linkedin/InsertInterval.java, leetcode/array/InsertInterval.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/InsertInterval.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c528030dd1475540d70342d5d2881047acedc1ae6480211090df1498760079b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C= grid.length -1 \u0026\u0026 grid[i][j] != \u0027W\u0027\u0060 appears character-identically in 2 files \u2014 company/google/BombEnemy.java, leetcode/dynamic-programming/BombEnemy.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/BombEnemy.java"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4d0f976bacd0ea29e38915c125fcabb2c56ea0fc61cadce36bb044ada12d06"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060intervals == null || intervals.size() == 0\u0060 appears character-identically in 5 files \u2014 company/facebook/MergeIntervals.java, company/google/MergeIntervals.java, company/linkedin/MergeIntervals.java, company/twitter/MergeIntervals.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/MergeIntervals.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6721f0e063efa626b623079a124b7f5bdfd1390dad51567be43f364f978af233"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isBalanced(root.left) \u0026\u0026 isBalanced(root.right)\u0060 appears character-identically in 2 files \u2014 cracking-the-coding-interview/chapter-four-trees-and-graphs/BinaryTreeIsBalanced.java, cracking-the-coding-interview/chapter-three-stacks-and-queues/BinaryTreeIsBalanced.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cracking-the-coding-interview/chapter-four-trees-and-graphs/BinaryTreeIsBalanced.java"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6091736da415aa7f58e7da30ba61a53bf951f14c3ea42d6d7bdfea02c4a6e6e7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060j - i \u003E longestPalindromicSubstring.length() \u0026\u0026 isPalindrome(s.substring(i, j))\u0060 appears character-identically in 4 files \u2014 company/amazon/LongestPalindromicSubstring.java, company/bloomberg/LongestPalindromicSubstring.java, company/microsoft/LongestPalindromicSubstring.java, leetcode/string/LongestPalindromicSubstring.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/LongestPalindromicSubstring.java"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3e5c2714c9ed79b510b677a8dbcbfd78452d9230aa09243cb605095820c41d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060j \u003C= grid[0].length-1 \u0026\u0026 grid[i][j] != \u0027W\u0027\u0060 appears character-identically in 2 files \u2014 company/google/BombEnemy.java, leetcode/dynamic-programming/BombEnemy.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/BombEnemy.java"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ee13a6a81528bf95f4a08dc818e1031d30e373f9ecc45c646a50f11eaa0097"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left == null || right == null || left.val != right.val\u0060 appears character-identically in 2 files \u2014 company/linkedin/SymmetricTree.java, leetcode/breadth-first-search/SymmetricTree.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/linkedin/SymmetricTree.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0074e2637ab78d9b6682af9c58615446b523b947aad58e17bed2a07d8c93c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left \u003E= 0 \u0026\u0026 right \u003C s.length() \u0026\u0026 s.charAt(left) == s.charAt(right)\u0060 appears character-identically in 4 files \u2014 company/facebook/PalindromicSubstrings.java, company/linkedin/PalindromicSubstrings.java, leetcode/dynamic-programming/PalindromicSubstrings.java, leetcode/string/PalindromicSubstrings.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/PalindromicSubstrings.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01913b83a8e9b776f48fe5e8320222249265ee89ea8fd6519da5e86842211ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060map.containsKey(current) \u0026\u0026 i - map.get(current) \u003C= k\u0060 appears character-identically in 4 files \u2014 company/airbnb/ContainsDuplicatesII.java, company/palantir/ContainsDuplicatesII.java, leetcode/array/ContainsDuplicatesII.java, leetcode/hash-table/ContainsDuplicatesII.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/airbnb/ContainsDuplicatesII.java"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"046b9a488f022c8d44e8d66c18a38d5f053000fdd2663e5015346d782385edb7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060map.containsKey(current) \u0026\u0026 map.get(current) \u002B 1 \u003E nums.length / 2\u0060 appears character-identically in 2 files \u2014 company/adobe/MajorityElement.java, leetcode/array/MajorityElement.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/adobe/MajorityElement.java"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16480a5e894109eab9a3570d75fe7b910ee0b7dc20e204945cd8c91297dee36"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060matrix == null || matrix.length == 0 || matrix[0].length == 0\u0060 appears character-identically in 2 files \u2014 company/google/PacificAtlanticWaterFlow.java, leetcode/breadth-first-search/PacificAtlanticWaterFlow.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/PacificAtlanticWaterFlow.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80967975e52c82445fe29d7b349d956d462185013f8ff89b8c151a9d08bca5a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060min1 \u003C 0 || costs[i][j] \u003C costs[i][min1]\u0060 appears character-identically in 2 files \u2014 company/facebook/PaintHouseII.java, leetcode/dynamic-programming/PaintHouseII.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/PaintHouseII.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8580f7793873c23eb63920ea7cf9a46cfc2b3c47b0bd0a6abfb142a3b0d020"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060min2 \u003C 0 || costs[i][j] \u003C costs[i][min2]\u0060 appears character-identically in 2 files \u2014 company/facebook/PaintHouseII.java, leetcode/dynamic-programming/PaintHouseII.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/PaintHouseII.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"918489e028ed4796f1eca31a0ebf42d16228e458f0f6700fafe2bd9e26bbf705"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060nextRow \u003E= 0 \u0026\u0026 nextRow \u003C rows \u0026\u0026 nextColumn \u003E= 0 \u0026\u0026 nextColumn \u003C columns \u0026\u0026 grid[nextRow][nextColumn] == 0 \u0026\u0026 !visited[nextRow][nextColumn]\u0060 appears character-identically in 2 files \u2014 company/google/ShortestDistanceFromAllBuildings.java, leetcode/breadth-first-search/ShortestDistanceFromAllBuildings.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/ShortestDistanceFromAllBuildings.java"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3921daac40575eda4ab63eeccd363320c4404ea4deb53d4c91c0f12c86fe2d17"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.children[chs[k] - \u0027a\u0027] != null \u0026\u0026 match(chs, k \u002B 1, node.children[chs[k] - \u0027a\u0027])\u0060 appears character-identically in 2 files \u2014 company/facebook/AddAndSearchWordDataStructureDesign.java, leetcode/trie/AddAndSearchWordDataStructureDesign.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/AddAndSearchWordDataStructureDesign.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27695090d32a80b4754a3e9e05bd5a85527ce7aff795682fce78735d0d029dc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.charAt(j - 1) != s.charAt(i) \u0026\u0026 p.charAt(j - 1) != \u0027.\u0027\u0060 appears character-identically in 5 files \u2014 company/airbnb/RegularExpressionMatching.java, company/facebook/RegularExpressionMatching.java, company/twitter/RegularExpressionMatching.java, company/uber/RegularExpressionMatching.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/airbnb/RegularExpressionMatching.java"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9281aa4e8b482e07a1a4873ddada12cdde81f6af8f6b84de75bad68c198e0f2c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.size() == 0 || result.get(result.size() - 1).end \u003C i.start\u0060 appears character-identically in 5 files \u2014 company/facebook/MergeIntervals.java, company/google/MergeIntervals.java, company/linkedin/MergeIntervals.java, company/twitter/MergeIntervals.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/MergeIntervals.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf3e4bdda505e69627605b7172cf239e00c6b5d335c7b0d65546a813c38c339"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060root.left.left == null \u0026\u0026 root.left.right == null\u0060 appears character-identically in 2 files \u2014 company/facebook/SumOfLeftLeaves.java, leetcode/tree/SumOfLeftLeaves.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/SumOfLeftLeaves.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc757324566e3347c7cd7ffb265ef2a7ae518c6ed814bde55789299f05cf814"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060root.val \u003E= maxValue || root.val \u003C= minValue\u0060 appears character-identically in 3 files \u2014 company/amazon/ValidateBinarySearchTree.java, company/facebook/ValidateBinarySearchTree.java, leetcode/tree/ValidateBinarySearchTree.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/ValidateBinarySearchTree.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c26da10aad11ddbe3a66bf5e5a264726bbf51c7d60e9339438e0b1822beb00"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rowStart \u003C= rowEnd \u0026\u0026 colStart \u003C= colEnd\u0060 appears character-identically in 5 files \u2014 company/google/SpiralMatrix.java, company/microsoft/SpiralMatrix.java, company/uber/SpiralMatrix.java, leetcode/array/SpiralMatrix.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/SpiralMatrix.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35b1cac9dd88ac250253d8fa92d180823aa2398c210afaff7935bf9de72c38d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060s.charAt(i) == \u0027(\u0027 || s.charAt(i) == \u0027[\u0027 || s.charAt(i) == \u0027{\u0027\u0060 appears character-identically in 6 files \u2014 company/airbnb/ValidParentheses.java, company/amazon/ValidParentheses.java, company/facebook/ValidParentheses.java, company/google/ValidParentheses.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/airbnb/ValidParentheses.java"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc8171977bfcab3803308f068f0abc8ea8d6326cd7461d2034df04e6676f296"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060s.charAt(i) == \u0027)\u0027 \u0026\u0026 !stack.isEmpty() \u0026\u0026 stack.peek() == \u0027)\u0027\u0060 appears character-identically in 5 files \u2014 company/amazon/ValidParentheses.java, company/facebook/ValidParentheses.java, company/google/ValidParentheses.java, company/twitter/ValidParentheses.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/ValidParentheses.java"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1de93d5c1f04ee2478291a099f8517608dc487c8571a45f704dca6695c5d65"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060s.charAt(i) == \u0027]\u0027 \u0026\u0026 !stack.isEmpty() \u0026\u0026 stack.peek() == \u0027]\u0027\u0060 appears character-identically in 5 files \u2014 company/amazon/ValidParentheses.java, company/facebook/ValidParentheses.java, company/google/ValidParentheses.java, company/twitter/ValidParentheses.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/ValidParentheses.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02c378938c32bf23fcedf4090948b31641457aa5656655b285435262d8a90a3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060s.charAt(i) == \u0027}\u0027 \u0026\u0026 !stack.isEmpty() \u0026\u0026 stack.peek() == \u0027}\u0027\u0060 appears character-identically in 5 files \u2014 company/amazon/ValidParentheses.java, company/facebook/ValidParentheses.java, company/google/ValidParentheses.java, company/twitter/ValidParentheses.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/ValidParentheses.java"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffe91b4d1ebd88dfc879a51b60ece71c96a18e23c07c6027d2a6069201ca2e1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060s.charAt(j) == par[1] \u0026\u0026 (j == last_j || s.charAt(j - 1) != par[1])\u0060 appears character-identically in 2 files \u2014 company/facebook/RemoveInvalidParentheses.java, leetcode/breadth-first-search/RemoveInvalidParentheses.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/RemoveInvalidParentheses.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd4024fd03d175c75cb6de26cd018724ebe500baf2868988e3675d10031f68c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060search(board, i \u002B 1, j, w, index \u002B 1) || search(board, i - 1, j, w, index \u002B 1) || search(board, i, j \u002B 1, w, index \u002B 1) || search(board, i, \u2026\u0060 appears character-identically in 2 files \u2014 company/facebook/WordSearch.java, leetcode/array/WordSearch.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/WordSearch.java"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf847372812aa683a7d08e94a27203cd1f7bbe0c8f8fd926d3bdef0af7e6cc6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start \u003C end \u0026\u0026 !vowels.contains(chars[end] \u002B \u0022\u0022)\u0060 appears character-identically in 2 files \u2014 company/google/ReverseVowelsOfAString.java, leetcode/string/ReverseVowelsOfAString.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/ReverseVowelsOfAString.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc6cd2e81a49d9252f64106db1817258ec21ebedac306c4e6285b51c24ba4ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start \u003C end \u0026\u0026 !vowels.contains(chars[start] \u002B \u0022\u0022)\u0060 appears character-identically in 2 files \u2014 company/google/ReverseVowelsOfAString.java, leetcode/string/ReverseVowelsOfAString.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/ReverseVowelsOfAString.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9546eb50b7739d408bc8e5405632dda8f43a722c966d6bce4ec8e0dd2ca49128"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start \u003E 0 \u0026\u0026 s.charAt((start - 1) % l) != \u0027 \u0027\u0060 appears character-identically in 2 files \u2014 company/google/SentenceScreenFitting.java, leetcode/dynamic-programming/SentenceScreenFitting.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/SentenceScreenFitting.java"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b26deb6be693c1eb868013d29ffe04a85a4f36b990f5d112c94f4d5faa31882"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target \u003C nums[mid] \u0026\u0026 target \u003E= nums[left]\u0060 appears character-identically in 4 files \u2014 company/facebook/SearchInRotatedSortedArray.java, company/linkedin/SearchInRotatedSortedArray.java, company/uber/SearchInRotatedSortedArray.java, leetcode/array/SearchInRotatedSortedArray.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/SearchInRotatedSortedArray.java"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f333fdcf70d35dd9aa33c710f8675b4fa432e82267aa3b584e13f1902d0e9e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target \u003E nums[mid] \u0026\u0026 target \u003C= nums[right]\u0060 appears character-identically in 4 files \u2014 company/facebook/SearchInRotatedSortedArray.java, company/linkedin/SearchInRotatedSortedArray.java, company/uber/SearchInRotatedSortedArray.java, leetcode/array/SearchInRotatedSortedArray.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/facebook/SearchInRotatedSortedArray.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a00cd6d72d53e269e854fe1836677cdb5059ffbe709779d99939c65d1ba2459"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060validBSTRecursive(root.left, minValue, root.val) \u0026\u0026 validBSTRecursive(root.right, root.val, maxValue)\u0060 appears character-identically in 3 files \u2014 company/amazon/ValidateBinarySearchTree.java, company/facebook/ValidateBinarySearchTree.java, leetcode/tree/ValidateBinarySearchTree.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/amazon/ValidateBinarySearchTree.java"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"25905757a1726be733f43b190fa700c12fd6f5a0bcbf16fd5beaa00d506ef367"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x \u003C 0 || x \u003E= n || y \u003C 0 || y \u003E= m || visited[x][y] || matrix[x][y] \u003C height\u0060 appears character-identically in 2 files \u2014 company/google/PacificAtlanticWaterFlow.java, leetcode/breadth-first-search/PacificAtlanticWaterFlow.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company/google/PacificAtlanticWaterFlow.java"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fdec8f394026261520ac2e0f9f5858daba985a9ce9bc01899b933e0b57dfb0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/WhatBaseIsThis.java"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f577521ea6445e1261a2738400d95f2d5f00b325870b8fbe36474f16aad8be"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"uva/WhatBaseIsThis.java"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa1a2588c04b6156aacaafcdb8d00493effb94b6515123046030ca48df80acb"}},{"ruleId":"X5","level":"note","message":{"text":"Java packages are not null-marked everywhere: 0/44 of this repository\u0027s Java package directories are under a non-null default: a \u0060package-info.java\u0060 declaring \u0060@NullMarked\u0060 (JSpecify) or \u0060@NonNullApi\u0060, \u0060@ParametersAreNonnullByDefault\u0060, \u0060@NonNullByDefault\u0060, \u0060@DefaultQualifier(NonNull.class)\u0060; a \u0060module-info.java\u0060 declaring \u0060@NullMarked\u0060; every type in it \u0060@NullMarked\u0060; or a build that runs NullAway with the package in \u0060AnnotatedPackages\u0060, or the Checker Framework\u0027s \u0060NullnessChecker\u0060. Elsewhere every reference admits null and no checker warns on the dereference that throws a \u0060NullPointerException\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"419201f6fc7ba243aef2cfb154378641588a8190e6269cea04a7b48c3d343bd5"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":0,"secretScannerRunsExcluded":0}}}]}