You will be given an unsorted array of integers and a target t. How will you implement a program using a Hashmap to find the position of two numbers whose sum equals target t?

You will be given an unsorted array of integers and a target t. How will you implement a program using a Hashmap to find the position of two numbers whose sum equals target t?

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: medium

标签: interviewbit, hashmap, topic-specific, data-structures

参考答案摘要

Approach: A general approach for solving such kinds of problems is that first, you have to create a map of Integers. Then iterate through the given array and subtract the current value in the array fr...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。