Find Element Rotated HARD Sorting Searching 50 XP 0 solved
Mobile coding works. A laptop is faster for long sessions.

Problem

Given a rotated sorted array (all unique), and X, print the index (0-based) of X or -1 if not present.

Input format

Input input.txt

- The first line contains N (1 ≤ N ≤ 100). - The second line contains N unique integers. - The third line contains X.

Output format

Output output.txt

- Index of X, or -1.

Example

input
7
4 5 6 7 0 1 2
0
output
4

Ready to solve this challenge?

Create a free account to write code, submit solutions, and track your progress.

⌨️ Keyboard Shortcuts

Code Editor
Run Code
Ctrl Enter
Submit Code
Ctrl Shift Enter
Format Code
Shift Alt F
Toggle Comment
Ctrl /
Undo
Ctrl Z
Redo
Ctrl Y
Navigation
Global Search
/
Show Shortcuts
?
Close Modal
Esc

🔍 Interactive Debugger

0 / 0

Analyzing your code...

📦 Variables

No variables yet

📚 Call Stack
main() line 1
📤 Output
We use cookies

Essential cookies are always active. You can choose to enable preference and analytics cookies. Learn more