← All problemsSign in

2511. Maximum Enemy Forts That Can Be Captured

LeetCodeArrayTwo PointersOpen on judge ↗

You are given a 0-indexed integer array forts of length n representing the positions of several forts. forts[i] can be -1, 0, or 1 where: - -1 represents there is no fort at the ith position. - 0 indicates there is an enemy fort at the ith position. - 1 indicates the fort at the ith the position is under your command. Now you have decided to move your army from one of your forts at position i

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start