Definition
Largest value
Return the greatest element in a list of numbers.
Find Maximum Value of an Array in Python
Overview
What You’ll Learn
Finding the maximum in an unsorted list is a single left-to-right scan: start with arr[0], then update whenever a larger value appears. This tutorial covers the pattern, empty-list handling, negatives, a live preview, worked Python examples, edge cases, and complexity.
Linear Scan
One pass
Track a running maximum while walking the list.
Init Rule
arr[0] first
Seed max_val with the first element, then compare the rest.
Empty Guard
No max
Reject empty lists before scanning.
Live Preview
Sample → 42
Run the classic sample list in the browser.
O(n) Cost
O(1) space
One pass, constant extra memory — faster than sorting.
Introduction
Finding the maximum in an unsorted list means returning the largest value. Start with the first element as the current maximum; whenever you see a larger number, update it.
After one pass, the running maximum is the answer. The same idea works for all-negative lists — the maximum is simply the greatest (least negative) value.
Why it matters?
It is a classic interview warm-up that tests loops, comparisons, and empty-input thinking — and it mirrors finding the minimum.
Key Highlights
Running Max
Update whenever x > max_val.
Seed With First
Avoid sentinel values that break negatives.
Empty Guard
Raise or validate before indexing.
Beat Sorting
Do not sort when you only need the max.
In short: if the list is non-empty, set max_val = arr[0], then for each later value update when larger.
Foundation
📝 Problem & Approach
Given a non-empty list of integers, return the largest value using one linear scan.
python
# [14, 7, 25, 31, 10, 42] -> 42
# max_val starts at 14, then updates to 25, 31, 42Inputs & Outputs
| Item | Type | Description |
|---|---|---|
arr | list[int] | Non-empty list of numbers. |
| Return / print | int / text | The largest value in the list. |
Minimal workflow
Pseudocode
function find_max(arr):
if arr is empty:
error
max_val <- arr[0]
for each value in arr from second element:
if value > max_val:
max_val <- value
return max_valMethod comparison
| Method | Idea | Notes |
|---|---|---|
| Linear scan | Running maximum | Interview default — O(n), O(1) space |
Built-in max | max(arr) | Fine in apps; show loops in interviews |
| Sort then take last | Sort ascending | Slower — avoid when only max is needed |
Cheat Sheet
⚡ Quick Reference
| Goal | Pattern |
|---|---|
| Seed | max_val = arr[0] |
| Update | if arr[i] > max_val: max_val = arr[i] |
| Empty guard | if not arr: raise ValueError(...) |
| Slice loop | for x in arr[1:]: |
| Track index | Keep max_i when updating |
| Built-in | max(arr) (after explaining the scan) |
Compare
📋 Scan vs max() vs Sort
Same answer — different costs and interview signals.
Linear scan
running maxThis page — clear O(n) interview style
Built-in
max(arr)Production shortcut after you can explain it
Sort
sorted(arr)[-1]Overkill — usually O(n log n)
Interview tip
mention emptyDefine behavior for [] up front
Context
When This Problem Shows Up
Reach for a running maximum whenever you need the largest value in one pass.
Interview warm-ups
Loops, comparisons, and empty-list discussion.
Before minimum
Same pattern; next page flips the comparison.
Scores and readings
Highest score, peak temperature, top sale.
Teaching comparisons
Practice greater-than updates and negatives.
Not for sorting needs
If you need order of all elements, sort instead.
Key benefit: one short loop that locks in running state, empty guards, and O(n) reasoning.
Interactive
🔮 Live Preview
Uses the same sample list as Example 1: 14, 7, 25, 31, 10, 42.
Hands-On
Examples Gallery
Three complete Python programs — classic scan to 42, all-negative list, and max-with-index tracking. Click View Output to reveal sample console results.
📚 Getting Started
A reusable helper and a mixed positive sample.
Example 1 — Find Maximum (Reference Program)
A reusable helper function and a sample list with answer 42.
python
def find_max(arr: list[int]) -> int:
if not arr:
raise ValueError("Array must contain at least one element.")
max_val = arr[0]
for i in range(1, len(arr)):
if arr[i] > max_val:
max_val = arr[i]
return max_val
def main() -> None:
array = [14, 7, 25, 31, 10, 42]
max_value = find_max(array)
print(f"Maximum value in the array: {max_value}")
if __name__ == "__main__":
main()How It Works
The function raises a clear error for empty input and uses one simple pass for normal lists. Running max starts at 14, then updates to 25, 31, and finally 42.
⚡ Negatives Still Work
The maximum is the greatest value — even when every element is negative.
Example 2 — When Every Element Is Negative
The same algorithm still works; maximum is the least negative value.
python
def find_max(arr: list[int]) -> int:
if not arr:
raise ValueError("Array must contain at least one element.")
max_val = arr[0]
for x in arr[1:]:
if x > max_val:
max_val = x
return max_val
def main() -> None:
negatives = [-9, -3, -1, -7]
print(f"Maximum (least negative): {find_max(negatives)}")
if __name__ == "__main__":
main()How It Works
Seeding with arr[0] (not zero) is essential — initializing to 0 would wrongly beat every negative. Here -1 is greater than -3, -7, and -9.
⚙️ Track Position Too
Common follow-up: return both the maximum and its first index.
Example 3 — Maximum With Index
Updates both value and index whenever a strictly larger element appears.
python
def find_max_with_index(arr: list[int]) -> tuple[int, int]:
if not arr:
raise ValueError("Array must contain at least one element.")
max_val = arr[0]
max_i = 0
for i in range(1, len(arr)):
if arr[i] > max_val:
max_val = arr[i]
max_i = i
return max_val, max_i
array = [14, 7, 25, 31, 10, 42]
value, index = find_max_with_index(array)
print(f"Maximum {value} found at index {index}")How It Works
Strict > keeps the first occurrence if duplicates exist. Use >= only if you intentionally want the last index of the maximum.
🧠 How the Algorithm Finds the Max
1
Guard empty
If the list is empty, raise an error — no maximum exists.
Safety
2
Seed max_val
Set max_val = arr[0] as the first candidate.
Init
3
Scan and update
For each later element, replace max_val when larger.
Loop
=
Maximum ready
Return the final running maximum.
Trace
🔎 Worked Walkthrough — Sample List
Trace the running maximum for [14, 7, 25, 31, 10, 42].
| Step | See | max_val |
|---|---|---|
| Start | 14 | 14 |
| Next | 7 | 14 (unchanged) |
| Next | 25 | 25 |
| Next | 31 | 31 |
| Next | 10 | 31 (unchanged) |
| Next | 42 | 42 |
Final answer: 42 — matching Example 1.
Use Cases
Where finding a list maximum shows up beyond the interview prompt.
1. Interview Warm-Ups
One-pass loops and empty-list talk.
Example: write find_max(arr).
2. Before Minimum
Same scan; next page flips the comparison.
Example: swap > for <.
3. Scores & Peaks
Highest score or peak reading in a series.
Example: max temperature today.
4. Negatives Practice
Show why seeding with arr[0] beats using 0.
Example: max of [-9, -1].
5. Complexity Talk
State O(n) vs sorting for interviews.
Example: n-1 comparisons lower bound.
6. Index Follow-Ups
Return position of the maximum too.
Example: Example 3 pattern.
Pro Tip: open with “empty check, seed arr[0], one pass with >” before writing code.
Advantages
Why the linear-scan approach works well in interviews.
1. Optimal Simple Cost
O(n) time and O(1) extra space for unsorted input.
2. Easy to Trace
Dry-run a short list and watch max_val update.
3. Handles Negatives
Seeding with arr[0] works for all-negative lists.
4. Easy to Extend
Track index, or flip to minimum with one change.
Pro Tip: lead with the manual scan; mention max(arr) only as a production aside.
Usage Tips
Small habits that keep max-finding solutions interview-ready.
1. Guard Empty First
Raise before reading
arr[0].2. Seed With arr[0]
Do not initialize to 0 when negatives are possible.
3. Prefer Strict >
Keeps the first index if you also track position.
4. Skip Sorting
Sorting is slower when you only need the max.
5. State O(n) / O(1)
One pass, constant extra memory.
Pro Tip: dry-run 14 → 25 → 31 → 42 aloud — if that matches, your update logic is correct.
Common Pitfalls
Mistakes that commonly break max-finding solutions.
1. Empty List Crash
Reading
arr[0]when the list is empty.→ Guard with
if not arrfirst.2. Initializing to Zero
Using
max_val = 0on all-negative lists.→ Seed with
arr[0]instead.3. Sorting Unnecessarily
Sorting just to take the last element.
→ Use one O(n) scan.
4. Off-by-One Loop
Starting the loop at 0 and comparing arr[0] to itself only.
→ Loop from index 1 (or use
arr[1:]).5. Wrong Comparison for Min
Copying max code but forgetting to flip > to <.
→ Minimum uses the opposite comparison.
Edge Cases
Handle these before claiming the scan is complete.
Empty
Empty list
No maximum exists; handle this before scanning.
Single
One element
That element is automatically the maximum.
Negatives
All negative
Maximum is the least negative value (e.g. -1).
Dupes
Repeated maximum
Value is unchanged; index depends on > vs >=.
Mixed
Positives and negatives
Same scan — no special case needed.
Floats
Non-integers
Same comparison logic works for floats.
Theory
⚖️ Facts Worth Knowing
Handy follow-ups interviewers sometimes ask.
- Lower bound. Unsorted max needs at least n-1 comparisons in the worst case.
- Idempotent on dups. Multiple copies of the max do not change the returned value.
- Symmetric twin. Minimum uses the same pass with < instead of >.
- Online-friendly. You can update the max as new values arrive without storing all of them.
Drill
🎯 Practice Problems
Try these variations to lock in the pattern.
1. Dry-run the sample
- Trace [14, 7, 25, 31, 10, 42]
- Expect final max 42
2. All negatives
- Reproduce Example 2
- Confirm answer -1
3. Empty guard
- Call find_max([])
- Assert ValueError (or your chosen policy)
4. Max with index
- Implement Example 3
- Decide first vs last on ties
Important
Notes
- Algorithm: running maximum in one pass.
- Cost:
O(n)time,O(1)extra space. - Important edge: define behavior for empty list.
- Python has
max(arr), but interviewers often ask for the manual scan first. Huge data can combine partial maxima in parallel.
Quick Takeaway: guard empty, seed with arr[0], update on >, return in O(n) time.
Analysis
⏱️ Time and Space Complexity
| Approach | Time | Extra space |
|---|---|---|
| Single scan | O(n) | O(1) |
Built-in max | O(n) | O(1) |
| Sort then take last | O(n log n) | depends on sort |
For unsorted input, a single scan is the standard interview answer.
🎉 Conclusion
Finding the maximum is a one-pass running maximum: guard empty lists, seed with arr[0], and update on greater values. The same pattern works for negatives and extends cleanly to tracking the index.
Practice the three examples above, then continue to finding the minimum value of an array.
Empty check first, then max_val = arr[0], update when x > max_val.
Pro Tips
💡 Best Practices
✅ Do
- Guard empty lists first
- Seed with
arr[0] - Use one O(n) scan
- Mention negatives and duplicates
- State O(n) time / O(1) space
❌ Don’t
- Index empty lists
- Initialize max to 0 blindly
- Sort just to find the max
- Skip the empty-list discussion
- Forget that -1 > -9
Summary
Key Takeaways
Knowledge Unlocked
Five things to remember about array maximum
Find the largest value the interview-friendly way.
5
Core concepts 01
Scan
Running max
Pattern 02
Seed
Start at arr[0]
Init 03
Empty
Guard first
Safety 04
Negatives
Still works
Edge 05
Cost
O(n) / O(1)
Analysis❓ Frequently Asked Questions
It picks the first element as the initial candidate, then every later element gets compared against it.
There is no maximum value for an empty list. Handle this case explicitly with an error or validation.
Yes. The maximum is still the greatest value, even if it is negative (for example -1 is greater than -3).
The algorithm still returns that maximum value. Duplicates do not change the answer.
No. Sorting is usually slower than a single scan when you only need the maximum.
One pass over n elements: O(n) time and O(1) extra space.
It is fine in real code. Interviews often ask you to write the manual linear scan first so you show the comparison logic.
Same one-pass pattern; only the comparison flips from greater-than to less-than.
Did you Know? 🔊
Finding the maximum in an unsorted list needs at least n - 1 comparisons in the worst case. A single left-to-right scan gives O(n) time and O(1) extra space.
Continue to Array Minimum
Learn the same one-pass pattern with the opposite comparison to find the smallest value.
About the author
8 people found this page helpful