DSA

1. Two Sum - Brute Force to Optimal

• Aditya Dhawle
• Dsa , Leetcode

🧠 Problem Statement Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to the target.