Application Developer

Channel Subscription
As a cable TV operator, I want to provide my customers the ability to subscribe to a channel
of their choice and upgrade to different packs based on their preference.
A customer has a certain balance in his/her account and wishes to subscribe to a channel.
The channel should get added to the list of subscribed channels for the customer.
A customer might also wish to upgrade an existing channel he/she has already subscribed
to. This should be allowed if an upgrade is possible for the channel.
All of the above should be allowed as long as the customer has the required minimum
balance needed for subscription/upgrade. After the subscription/upgrade the difference
amount should be reflected immediately in the customer’s account.
Hardcoded Data:
List of channels, with the possible upgrades. Eg:
ABC Channel:
Base: 120 INR
SD: 130 INR
HD: 150 INR
4k: 200 INR
Allowed Locations: USA, Canada
PQR Channel:
Base: 120 INR
SD: 130 INR
Allowed Locations: All
Customer Details:
Name: John Doe
Account Balance: 1000 INR
Currently Subscribed Channels: PQR (Base)

Input:
Do you want to subscribe or upgrade?
Subscribe
Enter Channel Name
ABC
Please choose subscription type: (Base, SD, HD, 4k)
4k
O/p:
Channel ABC (4k) subscribed successfully.
Available account balance: 800 INR
Continue? 
Y

Input:
Do you want to subscribe or upgrade?
Upgrade
Enter Channel Name
PQR
Please choose subscription type: (Base, SD)
SD
O/p:
Channel PQR (SD) subscribed successfully.
Available account balance: 790 INR

You are given two Singly Linked Lists of integers, which may have an intersection point.

Your task is to return the first intersection node. If there is no intersection, return NULL.

Example:-

The Linked Lists, where a1, a2, c1, c2, c3 is the first linked list and b1, b2, b3, c1, c2, c3 is the second linked list, merging at node c1.

Given a singly linked list of 'N' nodes. The objective is to determine the middle node of a singly linked list. However, if the list has an even number of nodes, we return the second middle node.

Note:

1. If the list is empty, the function immediately returns None because there is no middle node to find.
2. If the list has only one node, then the only node in the list is trivially the middle node, and the function returns that node.

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.

You are given a Singly Linked List of integers. Sort the Linked List using merge sort.

Merge Sort is a Divide and Conquer algorithm. It divides the input into two halves, calls itself for the two halves, and then merges the two sorted halves. The merge() function is used for merging two halves. The merge(arr, L, M, R) is a key process that assumes that arr[L..M] and arr[M + 1...R] are sorted and merges the two sorted subarrays into one.

How to deal with workplace conflict?

Where do you see yourself in 5 years?

As pair programming is followed at thought works what will you do if your pair doesn't listen to you?

If your female friend is not being allowed by her family members to work, how will you help her?