10+ Genesys Telecommunications Laboratories Interview Questions and Answers

The challenge involves splitting an array into sub-arrays to minimize cost based on unique elements and repetitions.

• Iterate through the array and keep track of unique elements and repetitions

• Calculate cost for each sub-array based on the rules provided

• Sum up the costs for all sub-arrays to get the total minimum cost

Find the length of the longest subsequence common to two arrays consisting only of prime numbers.

• Iterate through both arrays and check if the numbers are prime.

• Use dynamic programming to find the longest common subsequence of prime numbers.

• Keep track of the length of the common prime subsequence.

• Return the length of the longest common prime subsequence.

Find the minimum number of fountains to activate to water the entire garden.

• Iterate through the array and keep track of the farthest point each fountain can cover.

• Activate the fountain that covers the farthest point not covered by any previous fountain.

• Continue this process until the entire garden is covered.

• Return the count of activated fountains as the minimum number required.

Find the equilibrium index of an array where sum of elements on left equals sum of elements on right.

• Iterate through the array and calculate the total sum of elements.

• For each index, calculate the sum of elements on the left and right side and check for equilibrium.

• Return the left-most equilibrium index found, or -1 if none exist.

Given N meetings with start and end times, find the maximum number of meetings that can be organized in a single room without overlap.

• Sort the meetings based on end times.

• Iterate through the sorted meetings and select the next meeting whose start time is greater than or equal to the end time of the previous meeting.

• Return the selected meetings in the order they are organized.

Split the array into maximum number of subarrays such that first and last occurrence of every distinct element lies within a single subarray.

• Iterate through the array and keep track of the first and last occurrence of each element.

• Use a hashmap to store the indices of each element.

• Count the number of subarrays where the first and last occurrence of each element are within the same subarray.

The problem involves splitting an array into 'K' consecutive subarrays of length 'M' with each subarray containing a single distinct element.

• Iterate through the array and check if each subarray of length 'M' contains only one distinct element.

• Keep track of the count of distinct elements in each subarray.

• Return 1 if it is possible to split the array according to the condition, otherwise return 0.

Given an array of positive integers representing water in buckets, find the minimum amount of water to be removed to equalize all buckets.

• Sort the array in non-decreasing order to easily identify the buckets with excess water.

• Calculate the average water volume by dividing the total water volume by the number of buckets.

• Iterate through the array and calculate the excess water in each bucket compared to the average.

• Sum up the excess water in all buckets to get the minimum amoun...read more

Find all possible paths for a rat in a maze from source to destination.

• Use backtracking to explore all possible paths in the maze.

• Keep track of visited cells to avoid revisiting them.

• Explore all possible directions (up, down, left, right) from each cell.

• Add the current direction to the path and recursively explore further.

• When reaching the destination, add the path to the list of valid paths.

Minimize cash flow among friends by optimizing transactions.

• Create a graph where nodes represent friends and edges represent transactions.

• Calculate net amount each friend owes or is owed.

• Use a recursive algorithm to settle debts by minimizing cash flow.

• Update the graph after each transaction to reflect the new balances.

• Repeat the process until all balances are settled.

Find the length of the longest subarray with zero sum in an array of integers.

• Iterate through the array and keep track of the running sum using a hashmap.

• If the running sum is seen before, it means there is a subarray with zero sum.

• Calculate the length of the subarray with zero sum and update the maximum length found so far.