-
Notifications
You must be signed in to change notification settings - Fork 59
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
Scissors - Hena #31
base: master
Are you sure you want to change the base?
Scissors - Hena #31
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Nice work Hena, you hit the learning goals here. Well done.
Time Complexity: O(n) | ||
Space Complexity: O(n) | ||
""" | ||
hash_table = {} |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍 Time complexity is correct assuming English words (limited in length).
Time Complexity: O(n) | ||
Space Complexity: O(n) | ||
""" |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍 However because you're sorting, I think the time complexity is O(n log n) worst-case
@@ -24,6 +63,8 @@ def valid_sudoku(table): | |||
row, column or 3x3 subgrid | |||
Time Complexity: ? | |||
Space Complexity: ? | |||
|
|||
2powerful4me |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Nah, you just don't have time.
Hash Table Practice
Congratulations! You're submitting your assignment!
Comprehension Questions