Round 2: Technical Interview 1 (Programming, Networks): Q1: Description of one of the projects I mentioned in my resume Q2: Briefly explain all sorting algorithms I know about and which one to prefer over the other (remember: this should always depend upon no. of factors like input size, extra memory space available, etc. So, always answer accordingly) Q3: Write production level code for bubble sort, considering all the test cases, corner cases. Q4: Read and find duplicate "words" in a sentence. If any duplicate word is encountered, reverse only that word and put it back in the array or other data structure used, and then continue with reading other words. ex: if the I/P sentence is: "The mountain and the sun" then, O/P sentence: "The mountain and eht sun" Solution4: I used the two-pointer approach to traverse each word and hashmap to keep track of word count for each unique word