CARTHAGE MAX • BIG TECH TECHNICAL INTERVIEW COCKPIT

Amazon Lead Hiring Bar RaiserMock Session: 45 min

Welcome to your official technical interview for Amazon. Problem: "Two Sum II — Array Sorted & Two Pointers". The targeted asymptote is O(n) time and O(1) memory. Use the Whiteboard tab to frame your algorithm before coding.

Technical Coding Assessment Studio

Train under authentic FAANG / Microsoft pressure. Run custom inputs, inspect Big-O curves, and receive official hiring verdicts.

45:00

Amazon Interview Standard 45 min

Two Sum II — Array Sorted & Two Pointers

Target TimeO(n)

Target SpaceO(1)

Problem Statement

Given a 1-indexed array of integers `numbers` that is already sorted in non-decreasing order, find two numbers such that they add up to a specific `target` number. Return their indices as `[index1, index2]`. You must use only O(1) auxiliary extra memory.

Examples

Input: numbers = [2,7,11,15], target = 9

Output: [1,2]

[Raisonnement]2 + 7 = 9. Les indices 1-indexed sont 1 et 2.

Input: numbers = [2,3,4], target = 6

Output: [1,3]

[Raisonnement]2 + 4 = 6. Les indices 1-indexed sont 1 et 3.

Input: numbers = [-1,0], target = -1

Output: [1,2]

Constraints

2 <= numbers.length <= 3 * 10^4
-1000 <= numbers[i] <= 1000
numbers est trié en ordre non-décroissant
-1000 <= target <= 1000
Une solution unique et valide existe exactement

solution.js

1 lines

Interactive Verification Harness

Cas nominal avec valeurs positives

Input:[[2,7,11,15], 9]

Expected Output:[1,2]

Actual Output:Run test suite to verify

Chargement...

Technical Coding Assessment Studio

Two Sum II — Array Sorted & Two Pointers

LRU Cache (Least Recently Used) Design

Trapping Rain Water

Merge K Sorted Lists

Course Schedule — Cycle Detection in Directed Graph

Median of Two Sorted Arrays — Dual Binary Search

Sliding Window Maximum — Monotonic Deque Telemetry

Two Sum II — Array Sorted & Two Pointers

Problem Statement

Examples

Constraints

Technical Coding Assessment Studio

Two Sum II — Array Sorted & Two Pointers

LRU Cache (Least Recently Used) Design

Trapping Rain Water

Merge K Sorted Lists

Course Schedule — Cycle Detection in Directed Graph

Median of Two Sorted Arrays — Dual Binary Search

Sliding Window Maximum — Monotonic Deque Telemetry

Two Sum II — Array Sorted & Two Pointers

Problem Statement

Examples

Constraints