Ruiz #27
Ruiz #27
Conversation
There was a problem hiding this comment.
🐶 While this solution does work, it is nearly word for word the instructor solution with just the one of the colors change. While it is okay to look to resources for help when you are stuck, it is much harder for me to give feedback as to your understanding of the problem.
Since you didn't properly identify the time complexity of the solution, I'm not fully confident you understand everything happening in the solution to this problem. We can talk this over and solidify any misconceptions you have during our meeting today.
🟡
|
|
||
| def possible_bipartition(dislikes): | ||
| """ Will return True or False if the given graph | ||
| can be bipartitioned without neighboring nodes put | ||
| into the same partition. | ||
| Time Complexity: ? | ||
| Space Complexity: ? | ||
| Time Complexity: o(n) |
There was a problem hiding this comment.
⏱ Time complexity is actually O(N + E) here where N is the number of nodes in dislikes and E is the number of edges in the graph. This is because depth first search will traverse each node and edge once.
No description provided.