Step through the algorithm visually — use Play or the step buttons (inspired by AlgoMaster / visualgo).
Oracle interview context: Two Sum II - Input Array Is Sorted is a Medium Two Pointers problem — Shrink the search space from both ends; works on sorted arrays and palindromes.
Use the animation above to step through each move before writing code.
Pattern: Two Pointers
Read from stdin, write to stdout. Classic interview problem #167.
Two Sum II - Input Array Is Sorted — Oracle interview prep · Two Pointers
Classic interview problem #167.
Input (stdin)
Line 1: sorted integers\nLine 2: target
Output (stdout)
Two indices (1-based), space-separated
Your program must read from stdin and write the answer to stdout (no extra debug text).
2 7 11 15 9
1 2
| Test | Status | Details |
|---|
Ready — edit the code above and click Run or Submit.
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
class Program
{
static int[] Ria(string line = null)
{
line ??= Console.ReadLine();
if (string.IsNullOrWhiteSpace(line)) return Array.Empty<int>();
return line.Trim().Split(new[] { ' ', ',', '\t' }, StringSplitOptions.RemoveEmptyEntries)
.Select(int.Parse).ToArray();
}
static string[] Rsa()
{
int n = int.Parse(Console.ReadLine());
var arr = new string[n];
for (int i = 0; i < n; i++) arr[i] = Console.ReadLine();
return arr;
}
static void W(params object[] parts) => Console.WriteLine(string.Join(" ", parts));
static void Wb(bool v) => Console.WriteLine(v ? "true" : "false");
static void Wi(int v) => Console.WriteLine(v);
static void Ws(string v) => Console.WriteLine(v);
static void Main()
{
var nums = Ria();
int target = int.Parse(Console.ReadLine());
int l = 0, r = nums.Length - 1;
while (l < r) {
int sum = nums[l] + nums[r];
if (sum == target) break;
if (sum < target) l++; else r--;
}
W(l + 1, r + 1);
}
}Try solving on your own first, then reveal the official answer.