diff --git a/1.md b/1.md
index b0dd3c5..080686f 100644
--- a/1.md
+++ b/1.md
@@ -14,8 +14,8 @@ for j := 0; j < M; j++ {
 
 ## Time Complexity
 
-YOUR ANSWER GOES HERE
+O(N+M)
 
 ## Space complexity
 
-YOUR ANSWER GOES HERE
+O(N)
diff --git a/2.md b/2.md
index 2e803bf..1f0eb99 100644
--- a/2.md
+++ b/2.md
@@ -16,8 +16,8 @@ for k := 0; k < N; k++ {
 
 ## Time Complexity
 
-YOUR ANSWER GOES HERE
+O(n**2)
 
 ## Space complexity
 
-YOUR ANSWER GOES HERE
+O(N) 
diff --git a/3.md b/3.md
index 35b790d..99dd63a 100644
--- a/3.md
+++ b/3.md
@@ -11,8 +11,7 @@ while (N > 0) {
 
 ## Time Complexity
 
-YOUR ANSWER GOES HERE
+O (Log N)
 
 ## Space complexity
-
-YOUR ANSWER GOES HERE
+O (n)
diff --git a/4.md b/4.md
index 0a2f9f4..df772d9 100644
--- a/4.md
+++ b/4.md
@@ -15,8 +15,8 @@ func count(L []int, v, start, end int) int {
 
 ## Time Complexity
 
-YOUR ANSWER GOES HERE
+O (N Log N)
 
 ## Space complexity
 
-YOUR ANSWER GOES HERE
+O (N **2)
diff --git a/5.md b/5.md
index d2c9800..dda36df 100644
--- a/5.md
+++ b/5.md
@@ -12,8 +12,8 @@ for(let i = n/2; i <= n; i++) {
 
 ## Time Complexity
 
-YOUR ANSWER GOES HERE
+O(n * n**2)
 
 ## Space complexity
 
-YOUR ANSWER GOES HERE
+O (n)
diff --git a/6.md b/6.md
index 15a33c7..ea8111e 100644
--- a/6.md
+++ b/6.md
@@ -11,9 +11,8 @@ for (int i = n; i > 1; i /= 2) {
 
 
 ## Time Complexity
-
-YOUR ANSWER GOES HERE
+O(j*(n/2))  
 
 ## Space complexity
 
-YOUR ANSWER GOES HERE
+O(c**n)