Two Number Sum
Code
Python
- Solution 1
- Solution 2
- Solution 3
def twoNumberSum(array, targetSum):
for i in range(len(array) - 1):
firstNum = array[i]
for j in range(i + 1, len(array)):
secondNum = array[j]
if firstNum + secondNum == targetSum:
return [firstNum, secondNum]
return []
JavaScript
- Solution 1
- Solution 2
- Solution 3
function twoNumberSum(array, targetSum) {
for (let i = 0; i < array.length - 1; i++) {
const firstNum = array[i];
for (let j = i + 1; j < array.length; j++) {
const secondNum = array[j];
if (firstNum + secondNum === targetSum) {
return [firstNum, secondNum];
}
}
}
return [];
}
exports.twoNumberSum = twoNumberSum;
TypeScript
- Solution 1
- Solution 2
- Solution 3
export function twoNumberSum(array: number[], targetSum: number) {
for (let i = 0; i < array.length - 1; i++) {
const firstNum = array[i];
for (let j = i + 1; j < array.length; j++) {
const secondNum = array[j];
if (firstNum + secondNum === targetSum) {
return [firstNum, secondNum];
}
}
}
return [];
}
Java
- Solution 1
- Solution 2
- Solution 3
class Program {
public static int[] twoNumberSum(int[] array, int targetSum) {
for (int i = 0; i < array.length - 1; i++) {
int firstNum = array[i];
for (int j = i + 1; j < array.length; j++) {
int secondNum = array[j];
if (firstNum + secondNum == targetSum) {
return new int[] {firstNum, secondNum};
}
}
}
return new int[0];
}
}
C++
- Solution 1
- Solution 2
- Solution 3
#include <vector>
using namespace std;
vector<int> twoNumberSum(vector<int> array, int targetSum) {
for (int i = 0; i < array.size() - 1; i++) {
int firstNum = array[i];
for (int j = i + 1; j < array.size(); j++) {
int secondNum = array[j];
if (firstNum + secondNum == targetSum) {
return vector<int>{firstNum, secondNum};
}
}
}
return {};
}
Space-Time Complexity
- Solution 1
- Solution 2
- Solution 3
| Time | Space | |
|---|---|---|
| Worse | O(n2) | O(1) |
Where n is the length of the input array