Cipla Interview Questions and Answers

The task is to find the total number of ways to make change for a specified value using given denominations.

• Use dynamic programming to keep track of the number of ways to make change for each value up to the target value.

• Iterate through each denomination and update the number of ways to make change for each value based on the current denomination.

• The final answer will be the number of ways to make change for the target value.

• Consider edge cases such as when the target value i...read more

The minimum operations problem involves finding the minimum number of operations required to make all elements in an array equal.

• Iterate through the array to find the maximum and minimum values.

• Calculate the difference between the maximum and minimum values.

• The minimum number of operations needed is the difference between the maximum and minimum values.

The problem involves finding the number of distinct ways to climb N stairs by taking 1 or 2 steps at a time.

• Use dynamic programming to solve the problem efficiently.

• The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.

• Handle base cases for N=0 and N=1 separately.

• Consider using modulo operation to avoid overflow when dealing with large numbers.

Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.

• Implement the Merge Sort algorithm which recursively divides the input array into two halves and then merges them in sorted order.

• Ensure the base case of the recursion is when the size of the array is 1.

• Time complexity of Merge Sort is O(n log n) and space complexity is O(n).

• Example: For input [3, 1, 4, 1, 5], the output should be [1, 1, 3, 4, 5].

Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.

• Use Floyd's Tortoise and Hare algorithm to detect a cycle in the linked list.

• Initialize two pointers, slow and fast, and move them at different speeds through the list.

• If there is a cycle, the fast pointer will eventually meet the slow pointer.

• If the fast pointer reaches the end of the list (null), there is no cycle.

• Time complexity: O(N), Space complexity: O(1)

Merge two sorted linked lists into a single sorted linked list without using additional space.

• Create a dummy node to start the merged list

• Compare the values of the two linked lists and add the smaller value to the merged list

• Move the pointer of the merged list and the respective linked list with the smaller value

• Continue this process until one of the linked lists is fully traversed

• Append the remaining elements of the other linked list to the merged list

Given a pattern and a list of words, determine if the words align with the pattern.

• Iterate through the pattern and words simultaneously to check for alignment.

• Use a hashmap to store the mapping between characters in the pattern and words.

• Return 'True' if the words match the pattern sequence, else return 'False'.