Loading the journal
Loading the journal
Linear Scan
Go step by step: try it yourself before the video and the visual. Progress saves on this device.
Step 1
Know these before you start
Tick what you already know
Watch the concept video if the pattern is new to you.
Step 2
Try it on paper
5–10 minutes, no code yet
Given an array of N integers, find and return the maximum element in the array.
Input:
Line 1: Integer N — size of array
Line 2: N space-separated integers
Output:
Single integer — the maximum element
Example:
Input: 5
3 1 9 2 7
Output: 9
1 ≤ N ≤ 10^5
-10^9 ≤ arr[i] ≤ 10^9
Step 6
Get it accepted
All test cases pass
Step 7
Review it so it sticks
Re-solve from memory after
Reading the solution first feels like progress, but it makes the next similar problem — and the interview version — much harder, because you skipped the part where you figure it out. Give it an honest 20–30 minutes. Stuck? Re-read the pattern, watch the concept video, or try the brute force first.
Hidden: approach · solution code · optimal solution