# Solution engineer Interview Questions

solution engineer interview questions shared by candidates

## Top Interview Questions

Given a list of integers and a target number, list all pairs that sum up to that number Could you describe the onsite rounds a little bit more in detail please?? Thank you. Could you manage it properly? I can think of two solutions, one without additional memory and other with additional memory. First: With additional memory using a hash table. Just traverse the array. At each value see if target-value is in the hashtable, if it is print it, else insert the value to the hashtable. Just in one pass you can find the pair. This also prevents writing (a,b) and (b,a) which is essentially same two times. int main (int argc, char * argv[]) { vector v = {2, 3, 5, 1, 6, 9, 10}; int target = 12; map m; for(auto it = v.begin(); it!= v.end(); it++) { int diff = target - *it; if(m.find(diff) != m.end()) { cout v = {2, 3, 5, 1, 6, 9, 10}; int target = 12; std::sort(v.begin(), v.end()); int left = 0; int right = (int)v.size()-1; while(left < right) { if(v[left] + v[right] == target) { cout << v[left] << " ," << v[right] << "\n"; left++; right--; } else if (v[left] + v[right] < target) left++; else right--; } return 0; } Show More Responses |

Write a program which stores the results of the numbers in a Fibonancci sequence in an array |

What are the packets sent in a TCP connection? |

What port does ftp use? (That seemed like a trick question because they only wanted one port) |

You are to write pseudo code O(n) algorithm to maximize a one day trade. You will have 5 days of predicted prices and your algorithm must choose what day to buy and sell to maximize gains. |

Given a 3-digit number, find the next number using the same digits. Eg. if number is 124, code must return 214. |

What is the fastest Big O equation? |

Balance parenthesis by removal, generate fibonacci. |

You have two balls on different tracks, traveling without friction. Ball A is on a straight track traveling from left to right, from point a to point b. Ball B is on a track with a dip, traveling from left to right, also from point a to point b (same horizontal distance). Which ball arrives at point b first (or fastest)? |

in what cases sigkill fails |

**1**–

**10**of

**1,007**Interview Questions

## See Interview Questions for Similar Jobs

- Software Engineer
- Senior Software Engineer
- Sales Engineer
- Senior Solutions Engineer
- Software Developer
- Solutions Architect
- Product Manager
- Software Development Engineer
- Solution Engineer
- Consultant
- Technical Solutions Engineer
- Business Analyst
- Systems Engineer
- Engineer
- Engineering
- Project Manager
- Senior Consultant
- Account Executive
- Account Manager
- Analyst