|
🚀 Live Counter |
📈 Growth Metrics |
💼 Professional Status |
🔥 Contribution Streak |
|
|
|||
|
|
JavaScript 
|
C++ 
|
Python 
|
MySQL 
|
React 
|
Docker 
|
AWS 
|
GitHub 
|
REST API 
|
Nginx
|
x
📈 Contribution Metrics
“Code. Commit. Conquer. — My journey, my style.”
🎯 Click to reveal today's challenge!
**Challenge: Two Sum Problem**
**Date:** October 10, 2024 *(Update this date daily!)*
**Difficulty:** 🟡 Medium
> Given an array of integers `nums` and an integer `target`, return the indices of the **two numbers** that add up to `target`.
> You may assume exactly one solution exists. Return the answer in **any order**.
**Example:**
- Input: `nums = [2,7,11,15]`, `target = 9`
- Output: `[0,1]`
- Explanation: `nums[0] + nums[7] == 9`
Use a hash map to store seen numbers and their indices. For each number, check if its "complement" (target - current) exists in the map.
💡 Hint (Click to Reveal)
Use a hash map to store seen numbers and their indices. For each number, check if its "complement" (target - current) exists in the map.
```javascript
/**
* @param {number[]} nums
* @param {number} target
* @return {number[]}
*/
function twoSum(nums, target) {
const map = new Map(); // Stores {number: index}
for (let i = 0; i < nums.length; i++) {
const complement = target - nums[i];
if (map.has(complement)) {
return [map.get(complement), i]; // Found the pair!
}
map.set(nums[i], i); // Store current number
}
return []; // No solution (edge case, per problem assumption)
}
// Test your solution
console.log(twoSum([2, 7, 11, 15], 9)); // Expected: [0, 1]
console.log(twoSum([3, 2, 4], 6)); // Expected: [1, 2]
console.log(twoSum([3, 3], 6)); // Expected: [0, 1]
```
**Try It Yourself:** Copy the code into your browser console or a JS editor. What's your time complexity? (O(n) with the map!)
**Next Challenge Teaser:** Tomorrow—something with arrays and sorting... 🔮
💡 "Innovation happens at the intersection of curiosity and code" 🎯 "Focus on progress, not perfection" 🔥 "Build it, break it, make it better" ⚡ "Learn in public, fail in private, succeed everywhere"
