Delhivery Front end Developer Interview Questions and Answers

Find the longest sequence of ascending numbers in an array.

• Iterate through the array and keep track of the current sequence length

• Reset the sequence length when a number is not in ascending order

• Return the longest sequence found

Find a pair of numbers in a list that subtract to a target value

• Iterate through the list of numbers and store each number in a hashmap along with its index

• For each number, check if the difference between the target and the number exists in the hashmap

• Return the pair of numbers if found, otherwise return an empty array