Two Sum (Brute Force)

Given an array of integers `nums` and an integer `target`, return the indices of the two numbers that add up to `target`. Solve this without using a hash map (O(n²) solution).