Domande di colloquio per Software Engineer II SDE2 Java Backend presso HashedIn by Deloitte

in 1st coding round There is an array of elements and you have to print the result after removing continuous same elements. Ex -> [tom , jerry, jerry, tom] Output -> [] Ex -> [tom, jerry, jerry, tom, tom, jerry, tom] [tom jerry Jerry tom ] output-> [] [tom jerry Jerry tom jerry tom] op= [Jerry tom ] 2nd ques Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index1] and numbers[index2] where 1 <= index1 < index2 <= numbers.length. ex -> Input: numbers = [2,7,11,15], target = 9 Output: [1,2] Ex -> [-1, 0] target = -1 Output -> [1, 2