β‘ Optimize parseList performance to O(N) #69
Merged
+2
β1
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.



π‘ What: Replaced the spread operator
[...prev, curr]withprev.push(curr)inside thereduceloop insrc/utils.ts.π― Why: The spread operator creates a shallow copy of the array in each iteration, leading to quadratic time complexity O(N^2).
Array.pushoperates in amortized O(1) time, resulting in linear time complexity O(N) for the entire operation.π Measured Improvement:
Verified with a benchmark test and regression tests.
PR created automatically by Jules for task 2566441461268710797 started by @thib3113