Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Julia Kingrey #32

Open
wants to merge 5 commits into
base: master
Choose a base branch
from
Open

Julia Kingrey #32

wants to merge 5 commits into from

Conversation

Kalakalot
Copy link

No description provided.

Copy link

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Awesome work! You hit all the learning goals here. Well done.

Comment on lines +2 to 4
# Time Complexity: O(n) because we have do our if/else operations on every element in the array
# Space Complexity: O(1) because we are re-using the same variable
def max_sub_array(nums)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +3 to 5
# Time complexity: O(n) because we need to perform our "what is the p?" steps n times
# Space Complexity: also O(n) because we are adding an element to the sequence array for every n
def newman_conway(num)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Really nice example of recursion and dynamic programming together. WEll done.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants