Submission Week Nine #9

nazmulwanted · 2022-07-16T13:57:51Z

No description provided.

Sadman007 · 2022-07-29T11:36:25Z

week09/maximum_depth_of_a_binary_tree.cpp

@@ -0,0 +1,7 @@
+// Time complexity: O(N), N = Number of nodes.
+// Space complexity: O(1)


Actually the space complexity is O(H) where H = depth of the recursion.

Sadman007 · 2022-07-29T11:36:55Z

week09/number_of_islands.cpp

@@ -0,0 +1,31 @@
+// Time complexity: O(M * N), M = Number of rows, N = Number of columns of the grid.
+// Space complexity: O(1)


Same thing as above.

Sadman007

LGTM

nazmulwanted added 2 commits July 11, 2022 23:01

Problem 1: Maximum depth of a binary tree. Done.

a065570

Problem 4: Number of islands. Done.

123edcc

nazmulwanted requested a review from Sadman007 July 16, 2022 13:57

Problem 6: Course schedule. Done.

bf09d43

Sadman007 reviewed Jul 29, 2022

View reviewed changes

Sadman007 approved these changes Jul 29, 2022

View reviewed changes

Provide feedback

		@@ -0,0 +1,7 @@
		// Time complexity: O(N), N = Number of nodes.
		// Space complexity: O(1)

		@@ -0,0 +1,31 @@
		// Time complexity: O(M * N), M = Number of rows, N = Number of columns of the grid.
		// Space complexity: O(1)