Pregunta de entrevista de Celigo
2 Sum DSA problem asked
Respuesta de la entrevista
Anónimo
23 de ago de 2025
class Solution { public: vector twoSum(vector& nums, int target) { unordered_map numToIndex; vector ans(2); for (int i = 0; i < nums.size(); i++) { int complement = target - nums[i]; if (numToIndex.find(complement) != numToIndex.end()) { ans[0] = numToIndex[complement]; ans[1] = i; } numToIndex[nums[i]] = i; } return ans; } };