Next Permutation — LeetCode #31 | Python Algorithm Visualization

## Description
Step-by-step algorithm visualization for LeetCode #31 (Next Permutation). This is a pure example of the classic Narayana's Next Permutation algorithm. The solution finds the next lexicographically greater permutation in-place using a two-scan approach: first, it locates the rightmost element that is smaller than its successor; then it swaps it with the smallest larger element to its right; finally, it reverses the suffix to achieve the minimal increase.

*Complexity Analysis:*
- Time Complexity: O(n) — the array is scanned at most three times: finding the pivot, finding the swap candidate, and reversing the suffix.
- Space Complexity: O(1) — all modifications are performed in-place using only index variables.

*Timestamps:*
0:00 — Problem Setup & Pivot Search
0:32 — Swap Candidate Search & Swap
0:57 — Suffix Reversal & Final State

*Resources:*
Telegram: https://t.me/benabub_algoviz
GitHub: https://github.com/benabub
Support channel: https://boosty.to/benabub

Видео Next Permutation — LeetCode #31 | Python Algorithm Visualization канала Benabub