Skip to content

Buy/Sell stocks #1

@ralismark

Description

@ralismark

I believe you can solve the single stock problem in O(n) by keeping a running min/max as you iterate over the array, and that divide and conquer is not necessary.

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions