## Service Now Interview Question for Staff Engineers

Country: United States
Interview Type: In-Person

Comment hidden because of low score. Click to expand.
0
of 0 vote

#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k; //where k is target value and n is size of the array
cin>>n>>k;
int a[n],i,j;
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++){
bool flag=false;
for(j=i+1;j<n;j++){
if(a[i]+a[j]==k){
flag=true;break;
}
}
if(flag)
break;
}
cout<<a[i]<<" "<<a[j];
return 0;
}

Comment hidden because of low score. Click to expand.
0
of 0 vote

Classic Two-sum problem. Sharing my solution in Python below.

``````def twoSum(nums, target):
seenNumbers = set()

for ind, num in enumerate(nums):
complement = target - num
if complement not in seenNumbers:
else:
return [complement, num]
return []``````

Test Code

``````print('Two Sum ->', twoSum([2,4,5,9,13], 17)) # OUTPUT: Two Sum -> [4, 13]
print('Two Sum ->', twoSum([2,4,5,9,13], 100)) # OUTPUT: Two Sum -> []``````

Comment hidden because of low score. Click to expand.
0
of 0 vote

``````public class ArrayTest {

public static void main(String[] args) {
int target = 12;
int[] intArr = { 1, 3, 5, 7, 7, 8, 8, 9, -2, 14, -5, 0, 4 };
for (int i = 0; i < intArr.length; i++) {
for (int j = i + 1; j < intArr.length; j++) {
if (intArr[i] + intArr[j] == target) {
System.out.println(intArr[i] + ", " + intArr[j]);
}
}
}
}
}``````

Output =
3, 9
5, 7
5, 7
8, 4
8, 4
-2, 14

Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

### Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

### Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.