Skip to content

Commit

Permalink
Delete program.exe
Browse files Browse the repository at this point in the history
  • Loading branch information
Dipanita45 committed Oct 12, 2024
1 parent 59eaf93 commit 5209fd8
Show file tree
Hide file tree
Showing 2 changed files with 1 addition and 0 deletions.
Original file line number Diff line number Diff line change
Expand Up @@ -56,4 +56,5 @@ Return Maximum Profit: Having processed all days, we have found that the maximum
## Time and Space Complexity
The time complexity of the given function is O(n), where n is the length of the input list prices. This is because the function includes a single loop that iterates through each element in the list exactly once, performing a constant amount of work at each step; thus, the total work done is linear in the size of the input.

## Space Complexity
The space complexity of the function is O(1), indicating that the amount of additional memory used by the function does not depend on the size of the input.
Binary file removed Trie/Aggressive Cows/output/Program.exe
Binary file not shown.

0 comments on commit 5209fd8

Please sign in to comment.