Skip to content

Conversation

nazmulwanted
Copy link
Owner

No description provided.

@nazmulwanted nazmulwanted requested a review from Sadman007 May 21, 2022 17:31
@@ -0,0 +1,66 @@
// Time complexity: O(N * M) * O(4 * 3 ^ (length of word)), N = number of rows, M = number of columns.
Copy link
Collaborator

Choose a reason for hiding this comment

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

Suggested change
// Time complexity: O(N * M) * O(4 * 3 ^ (length of word)), N = number of rows, M = number of columns.
// Time complexity: O(N * M * 4 * 3 ^ (length of word)), N = number of rows, M = number of columns.

Copy link
Collaborator

@Sadman007 Sadman007 left a comment

Choose a reason for hiding this comment

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

Hi @nazmulwanted

I can see submissions of only such problems that have been directly in the classes. I am absolutely sure that you can do much better and you will eventually do it in the next week! Best of luck!

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