Hi, Developer community
Today I learnt DSA problem "Reverse Array" in Python language.
Approach: (In-place)
1. Iterate through the array using two pointers (start and end)
2. Swap the element at index start and end.
3. Increment start and decrement end until they meet or cross.