## Fungible Interview Question for Developer Program Engineers

Country: United States
Interview Type: In-Person

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

import java.util.Arrays;

public class Main {

public static void main(String[] args) {
int a[] = {-6,-3,-1,2,4,5};

Arrays.stream(a).map(n -> Math.abs(n*2)).sorted().forEach(x -> System.out.println(x));

}
}

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

``````import java.util.Arrays;

public class Main {

public static void main(String[] args) {
int a[] = {-6,-3,-1,2,4,5};

Arrays.stream(a).map(n -> Math.abs(n*2)).sorted().forEach(x -> System.out.println(x));

}
}``````

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

``````import java.util.Arrays;

public class Main {

public static void main(String[] args) {
int a[] = {-6,-3,-1,2,4,5};

Arrays.stream(a).map(n -> Math.abs(n*2)).sorted().forEach(x -> System.out.println(x));

}
}``````

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

int [] array ={ -6,-3,-1,2,4,5 };
var Square = Array.ConvertAll(array, x => x * x).OrderBy(x=>x);
foreach( var element in Square)
{
Console.Write(element + " ");
}

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

The correct answer is:

How should this solution best be optimized?

1. By simplicity of code?
2. By maintainability by the person coming after me?
3. By time/speed? (Can you do it in order n?)
3. By memory utilization? (Is memory plentiful and quick?)
4. Does this need to be run on a standard CPU or are we doing funky stuff in parallel?

If you don’t think about the nature of the problem being solved, you are a coding unit, not an engineer. The code is trivial. How you think about what’s really being done and why is paramount.

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

``````#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;
int main()
{
vector<int> input={-6,-3,-1,2,4,5};
for(int i=0;i<input.size();i++)
{
int ele = input[i];
input[i]= ele * ele;
}

sort(input.begin(), input.end());
for(int i=0;i<input.size();i++)
{
cout << input[i]<< " ";
}
cout << endl;
return 0;
}``````

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.