Fungible Interview Question
Developer Program EngineersCountry: United States
Interview Type: In-Person
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.
#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;
}
import java.util.Arrays;
- coder March 10, 2017public 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));
}
}