??Day 6:-Two Sum
Disha Khanpara
Business Development Executive @Awarefluence | Frontend Developer & UX/UI Enthusiast | Data Analyst (SQL, Power BI, Python) | Book Reviewer | Passionate About Data & Design
I’m back! Took a short break, but now it’s time to get back on track. The next two weeks are all about consistency, and I’ll be solving & posting a DSA challenge every single day—no more excuses! ??
?? Problem Statement: Two Sum
Ever struggled with finding the perfect pair? Well, here’s a coding twist on that!
? Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. ? You cannot use the same element twice. ? There is exactly one solution.
Example Scenarios:
? Input: nums = [2,7,11,15], target = 9 Output: [0,1]
? Input: nums = [3,2,4], target = 6 Output: [1,2]
? Input: nums = [3,3], target = 6 Output: [0,1]
? Like, Share, Comment, Feedback & Subscribe for More! Feel free to share your thoughts and follow along with the challenge. Let’s learn and improve together!
?? #100DaysLeetCode #LeetCodeChallenge #Python #PythonCoding #DSA #ProblemSolving #CodingJourney #Disha100DaysChallenge