Technology consultant ii Interview Questions | Glassdoor.co.in

# Technology consultant ii Interview Questions

642

technology consultant ii interview questions shared by candidates

## Top Interview Questions

Sort: RelevancePopular Date

### Software Engineer II at Amazon was asked...

19 Jun 2012
 Given an large list of unsorted numbers, find the smallest number. You can access the list only 3 numbers at a time, and keep moving forward 1 number at a time.6 AnswersOtherwise called the sliding window problemUse the selection sort and after the pass stop the iterating. Time complexity will be O(N) & only one swap.Use the selection sort and after the first pass stop the iterating. Time complexity will be O(N) & only one swap.Show more responsesDid they asked to write the code of the solution? or just pseudo code.And did they added any constraints? Otherwise this is pretty straight forward problem using Insertion sort.You can access the list only 3 numbers at a time: It tells we can read three numbers one after other in N/3 Iterations. So Time complexity will be O(N/3)This is sliding window problem and priority queue DS can be used to solve this.

### Software Development Engineer II at Amazon was asked...

4 Oct 2012
 Two sorted arrays. you can start from any one them, and then at common element you may or may not jump to other array. Continue in this manner till you reach the end of an array. Find the path that results the maximum sum.3 AnswersGreedy algorithm O(m+n); not really hard once you know it's greedy.DP can also be used... O(m+n) again...import java.util.*; class gAlg{ public static void main(String[] args){ int[] a = new int[5]; int[] b = new int[5]; int[] c = new int[5]; int sum= 0; a[0]=2;a[1]=8;a[2]=9;a[3]=7;a[4]=10; b[0]=3;b[1]=2;b[2]=10;b[3]=9;b[4]=9; System.out.println(Arrays.toString(a)); System.out.println(Arrays.toString(b)); int i; for(i=0;i<5;i++){ c[i]=Math.max(a[i],b[i]); sum = sum+c[i]; } System.out.println(Arrays.toString(c)); System.out.println(sum); } }

22 Jul 2017

### Sales Officer II at Asian Paints was asked...

20 Apr 2013
 how will u convince an irritating dealer ??2 AnswersFirst be calm and listen to him carefully to try and understand his actual problem, then start crossquesting which has very simple answer and which may lead to answer to his question also which is irritating him.First of all listen his problem very carefully and provide him solution step by step, of-course during conversation he will interrupt, but no need to inter-fer his word neither cut out his sentence directly , show patience and always treat like a good sales person.

### Software Development Engineer-II at Amazon was asked...

19 Mar 2019
 Trees, DP, Arrays3 AnswersIt's literally waste of time. It's been more than a month I gave interview, and no response from the HR team.Especially this mahadevpura office HR team. I and two of my friends gave interview and passed all rounds. After two weeks of gap sent me an email saying you'll have to give chime call. In that two weeks gap I have mailed 3-4 times asking about the status, no response from the HR team. So I completed my chime call interview as well and it went pretty well. It's been more than a month no updates from the HR team. Same as before sent them couple of emails , no response.What questions were asked in chime call?

### UI Engineer II at Flipkart was asked...

26 Apr 2017
 Q: How do you flat an Array?3 Answersvar flattenArray = [].prototype.concate.apply([], UnflattenArray) OR function flatten(arr) { return arr.reduce(function (flat, toFlatten) { return flat.concat(Array.isArray(toFlatten) ? flatten(toFlatten) : toFlatten); }, []); }[[1],[[2],[3]]].reduce((acc, curr) => { return acc.concat(Array.prototype.concat.apply([],curr)); }, [])// Method 1 const flattenArr = (arr) => { if(arr instanceof Array && arr.length === 0) return []; else if(!(arr instanceof Array)) return [arr]; return flattenArr(arr[0]).concat(flattenArr(arr.slice(1))); } // Method 2 const flattenArr = (arr) => { const result = []; const helper = (arr) => { if(Number.isInteger(arr)) { result.push(arr); } else if (Array.isArray(arr)) { for(let i = 0; i < arr.length; i++) { helper(arr[i]); } } } helper(arr); return result; }

### Software Engineer II at OneAssist Consumer Solutions was asked...

28 Feb 2019
 rainwater collection problem2 Answerssolved and written code using 2 arrays containing the left and right side maximas for each elementOneassist is cheater company. They could not support to his customer. His policy is very bad. I can not believe that Organization is very cheater quality policy.

### Software Development Engineer II at Microsoft was asked...

27 Oct 2012
 I was asked two questions. One was given an array of integers find triplets such that a^2 + b^2 = c^2.2 AnswersOne way to do this could be ____________________________________________________ #include #include "math.h" using namespace std; int arr[] = {1,0,4,5,3,2,1,8,0,7}; void test(int a, int b, int c) { if( a*a + b*b == c*c) { cout << "Found a triplet: (" << a << "," << b << "," << c << ")" << endl; } } int main() { int size = sizeof(arr) / sizeof(int); if(size < 3) return -1; for(int a=0; aHere is a O(n) solution int[] nums = new int[] { 3, 5, 6, 2, 4, 16, 61,8,10,7}; int[] lengths = new int[nums.Max() + 1]; for (int i = 0; i > pythaTriplets = new List> (); for (int i = 2; i ( 2*i,i*i-1,i*i+1)); } } catch { continue;} } pythaTriplets.Dump(); //2x, x*x-1, x*x+1

### SDE-II at Amazon was asked...

17 Jul 2020
 Competition tracking for one of Amazon product by crawling reviews and finding top competitors2 AnswersUsed in-place array to track frequencies of competitors with O(n2)Better use heap Looking for interview coaching? We have helped 1000+ people land a job at Google, Facebook and other top companies. Visit aonecode.com for ONE-ON-ONE private lessons by FB and Google engineers! SYSTEM DESIGN ALGORITHMS (conquer DP, Greedy, Graph, Advanced Algorithms, Clean Coding), latest interview questions from FAANG, mock interviews. Get hired from Google, FB, Amazon, LinkedIn and other top-tier companies after weeks of training.

### Network Engineer Level II at CSS Corporation was asked...

16 Jun 2015
 syn cookies anti replay perfeect forward secrecy in ipsec vpn DDOS and DOS prevention IP headrsize tcp header size MTU ARP, proxy Arp, syn flood maximum segment size2 AnswersI did not had answer for most questions.You question seems to be about initiator cookies in first packet of Ipsec packet.
110 of 642 Interview Questions