Moglix Software Engineer Interview Questions and Answers

Merge two sorted arrays into one sorted array in reverse order.

• 1. Initialize two pointers for each array starting from the end.

• 2. Compare elements from both arrays and add the larger one to the result.

• 3. Continue until all elements from both arrays are processed.

• 4. If any elements remain in either array, add them to the result.

• 5. Reverse the result array to get the final output.

Remove duplicates from a string by retaining the first occurrence of each character.

• Use a set to track seen characters. Example: 'hello' -> 'helo'.

• Iterate through the string and build a new result string. Example: 'banana' -> 'ban'.

• Consider using a dictionary to maintain order if needed. Example: 'abracadabra' -> 'abrcd'.

The maximum sum of a subarray is to be found.

• Use Kadane's algorithm to find the maximum sum of a subarray.

• Initialize two variables, maxSum and currentSum, to track the maximum sum.

• Iterate through the array and update currentSum by adding the current element.

• If currentSum becomes negative, reset it to 0.

• If currentSum is greater than maxSum, update maxSum.

• Return maxSum as the maximum sum of a subarray.

Find the length of the longest substring with distinct characters in a given string.

• Use a sliding window approach to keep track of the current substring.

• Maintain a set or map to check for duplicate characters within the window.

• Update the maximum length of the substring whenever a longer substring is found.

The question asks to merge two sorted arrays and delete a node in a linked list.

• To merge two sorted arrays, we can use a two-pointer approach.

• To delete a node in a linked list, we need to update the pointers of the previous and next nodes.

• Example: Merge [1, 3, 5] and [2, 4, 6] to get [1, 2, 3, 4, 5, 6].

• Example: Delete node with value 3 from linked list [1, 2, 3, 4, 5] to get [1, 2, 4, 5].