SDE - Intern

Given an array of numbers, find the maximum sum of any contiguous subarray of the array.

For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since we would take elements 42, 14, -5, and 86.

Given the array [-5, -1, -8, -9], the maximum sum would be -1.

Follow up: Do this in O(N) time.

What is operator overloading?
What is OOP?
Basic concepts of OOP?
Explain polymorphism, abstraction, encapsulation, and inheritance with real-life examples.

Which SQL query have you worked on?
Normalization

Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.

Example :

Merge Sort Algorithm -

Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.

The above illustrates shows how merge sort works.

Note :

It is compulsory to use the ‘Merge Sort’ algorithm.

Introduce yourself.
Family background.
Why do you want to join Amdocs?
Your strength and weaknesses.
Your achievements.
Have you interviewed any other company before?
Explain your college project

Difference between semaphore and mutex?