diff --git a/challenge-21/submissions/iamsurajmandal/solution-template.go b/challenge-21/submissions/iamsurajmandal/solution-template.go
new file mode 100644
index 000000000..66ad485f5
--- /dev/null
+++ b/challenge-21/submissions/iamsurajmandal/solution-template.go
@@ -0,0 +1,85 @@
+package main
+
+import (
+	"fmt"
+)
+
+func main() {
+	// Example sorted array for testing
+	arr := []int{1, 3, 5, 7, 9, 11, 13, 15, 17, 19}
+
+	// Test binary search
+	target := 7
+	index := BinarySearch(arr, target)
+	fmt.Printf("BinarySearch: %d found at index %d\n", target, index)
+
+	// Test recursive binary search
+	recursiveIndex := BinarySearchRecursive(arr, target, 0, len(arr)-1)
+	fmt.Printf("BinarySearchRecursive: %d found at index %d\n", target, recursiveIndex)
+
+	// Test find insert position
+	insertTarget := 8
+	insertPos := FindInsertPosition(arr, insertTarget)
+	fmt.Printf("FindInsertPosition: %d should be inserted at index %d\n", insertTarget, insertPos)
+}
+
+// BinarySearch performs a standard binary search to find the target in the sorted array.
+// Returns the index of the target if found, or -1 if not found.
+func BinarySearch(arr []int, target int) int {
+	// TODO: Implement this function
+	left, right := 0, len(arr) - 1 
+    index := -1
+    for (left <= right) {
+        mid := left + (right -left) / 2;
+        if arr[mid] == target {
+            index = mid;
+            break;
+        } else if arr[mid] < target {
+             left = mid + 1
+        } else {
+           
+            right = mid - 1
+        }
+    }
+	return index
+}
+
+// BinarySearchRecursive performs binary search using recursion.
+// Returns the index of the target if found, or -1 if not found.
+func BinarySearchRecursive(arr []int, target int, left int, right int) int {
+    mid := left + (right -left) / 2;
+    
+    if left > right {
+        return -1
+    }
+    if arr[mid] == target {
+        return mid
+    }
+    
+    if arr[mid] < target {
+        left = mid + 1
+    } else {
+        right = mid - 1
+    }
+     
+	// TODO: Implement this function
+	return BinarySearchRecursive(arr, target, left, right)
+}
+
+// FindInsertPosition returns the index where the target should be inserted
+// to maintain the sorted order of the array.
+func FindInsertPosition(arr []int, target int) int {
+	left, right := 0, len(arr) - 1 
+    for (left <= right) {
+        mid := left + (right -left) / 2;
+        if arr[mid] == target {
+            return mid;
+        } else if arr[mid] < target {
+             left = mid + 1
+        } else {
+           
+            right = mid - 1
+        }
+    }
+	return left
+}