BigBasket Intern Interview Questions and Answers

Reverse a linked list in pairs of three.

• Create a function that takes the head of the linked list as input.

• Traverse the linked list in pairs of three and reverse each pair.

• Update the head of the linked list to the new head after reversing each pair.

• Return the new head of the linked list.

Search a number in sorted rotated array.

• Use binary search to find the pivot point where the array is rotated

• Determine which half of the array the target number may be in

• Perform binary search on the appropriate half of the array to find the target number

Find frequency of 2 in sorted array of integers in log(n) time.

• Use binary search to find first and last occurrence of 2 in array.

• Calculate frequency by subtracting last index from first index and adding 1.

• Time complexity is O(log(n)).

Find the maximum frequency integer to the right of each index in an array of numbers.

• Create a frequency map of the array.

• Iterate through the array and for each index, find the maximum frequency integer to the right using the frequency map.

• If there are no integers to the right, return -1.