Solution engineer Interview Questions | Glassdoor

# Solution engineer Interview Questions

1,007

solution engineer interview questions shared by candidates

## Top Interview Questions

Sort: RelevancePopular Date

Dec 8, 2015

Jul 17, 2015

Jun 19, 2015

Sep 17, 2019
 What port does ftp use? (That seemed like a trick question because they only wanted one port)5 Answers20 and 21 but they only wanted 20.20 for TCP; 21 on command20 is for ftp and 21 is often used for ftps, i think.Show More ResponsesIn FTP, Port 20 is used for the data whilst port 21 is used for commandsPort numbers 21 and 20 are used for FTP. Port 21 is used to establish the connection between the 2 computers and port 20 to transfer data.

Mar 21, 2017

### Solutions Engineer at Deqode was asked...

Sep 19, 2019
 Given a 3-digit number, find the next number using the same digits. Eg. if number is 124, code must return 214.5 Answersbut the next number of 124 is 142. How it is 214?Edit : it's 142Show More ResponsesHello Folks, ``` #include using namespace std; typedef long long ll; typedef long double ld; #define MOD 1000000007 int main() { int t; cin>>t; while(t--) { int n; cin>>n; vector arr(n); for(int i=0; i> arr[i]; int idx = -1; for(int i=n-1; i > 0; i--){ if(arr[i-1] =0; i--) cout =idx+1; end--) { if(arr[idx] < arr[end]) break; } swap(arr[idx], arr[end]); sort(arr.begin() + idx +1 , arr.end()); for(int i=0; ifrom itertools import permutations n=int(input()) re=[] k=list(str(n)) p=list(permutations(k,len(k))) for i in range(len(p)): o="".join(p[i]) re.append(int(o)) re.sort() for i in range(len(re)): if re[i]==n: print(re[i+1]) One or more comments have been removed. Please see our Community Guidelines or Terms of Service for more information.

Sep 17, 2019
 What is the fastest Big O equation? 4 Answers1.O=n, correct answer was log(n)I think that should be O(1).1 < logn < n < nlogn < n^2 < 2n. Fastest is O(1) and slowest is O(2n)Show More ResponsesNot sure why but glassdoor replaced my less than operator with <. Replace < with less than operator for the above answer

Jul 11, 2017