spring1843 / go-dsa

100%

main: 100%

LAST BUILD ON BRANCH feature/equal-sum-subarrays-linear-time

branch: feature/equal-sum-subarrays-linear-time

CHANGE BRANCH

x

Reset

• feature/equal-sum-subarrays-linear-time
• add-artwork
• add-find-first-missing-positive
• add-more-export-flags
• fix-header
• head-count-patch
• longest-dictionary-word-fix
• main
• patch-1
• review-heaps
• rm-review-stacks
• rm/add-asset-path
• rm/add-complete-output-to-release
• rm/backtracking-example
• rm/backtracking-improve-wording
• rm/bit
• rm/dnc
• rm/fix-bug-report
• rm/fix-circular-queue
• rm/fix-links
• rm/fix-lint-problems
• rm/fix-setup-go-version
• rm/generate-doc-on-release
• rm/linked-list-review
• rm/linkedlist-review
• rm/problem-title-cleanup
• rm/recursion
• rm/review-array
• rm/review-hash-tables
• rm/review-queus
• rm/review-trees
• rm/time-complexity-array-product-of-all
• spring1843-patch-1
• strings-review

Build # 21373009735

Build Type

Pull #193

github

Committed by BytesAndBosons

Commit Message

Equal sum subarrays in O(N) time

- Adjust problem description (mention that sub-arrays must be partitions)
- Adjust findSplitPoint function to make it O(N) time

Pull Request Pull Request #193: Equal sum subarrays in O(N) time

Run Details

7 of 7 new or added lines in 1 file covered. (100.0%)

2318 of 2318 relevant lines covered (100.0%)

247.26 hits per line