Conversation
There was a problem hiding this comment.
Hi Ro, I'm marking this project as a yellow since time and space complexity are missing and that's something we'd really like to think about with dynamic programming. A yellow is a passing score so resubmission is not required, but you are free to resubmit with the time and space complexity filled out for a green score. Let me know what questions you have
🟡
| @@ -7,6 +7,16 @@ def max_sub_array(nums): | |||
| """ | |||
There was a problem hiding this comment.
🤔 Implementations looks great, but what about time and space complexity?
| Time Complexity: ? | ||
| Space Complexity: ? |
There was a problem hiding this comment.
🤔 Implementation looks mostly good again here, but what about time and space complexity?
| current_list.append(current_list[current_list[count - 1]] + current_list[count - current_list[count - 1]]) | ||
| count += 1 | ||
|
|
||
| return [str(item) for item in current_list] |
There was a problem hiding this comment.
🤔 To pass the tests, you want to return the newman conway numbers as a string (ex. "0 1 1") instead of a list of strings
2 participants
No description provided.