diff --git a/two-sum-ii-input-array-is-sorted/sol.go b/two-sum-ii-input-array-is-sorted/sol.go
new file mode 100644
index 0000000..88b302d
--- /dev/null
+++ b/two-sum-ii-input-array-is-sorted/sol.go
@@ -0,0 +1,18 @@
+package main
+
+// Time: O(n)
+// Space: O(1)
+func twoSum(numbers []int, target int) []int {
+	p1, p2 := 0, len(numbers)-1
+	for p1 < p2 {
+		s := numbers[p1] + numbers[p2]
+		if s > target {
+			p2--
+		} else if s < target {
+			p1++
+		} else {
+			return []int{p1 + 1, p2 + 1}
+		}
+	}
+	return []int{}
+}