CodeNation Interview Questions and Answers

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

• Iterate through the array to find the coverage of each fountain.

• Keep track of the farthest coverage reached by activating fountains.

• Activate the fountain that covers the farthest distance to minimize the number of fountains activated.

Count distinct values obtained by applying bitwise OR operation on all possible subarrays of an array of positive integers.

• Use a set to store distinct values obtained by bitwise OR operation on all subarrays.

• Iterate through all subarrays efficiently to calculate distinct values.

• Optimize the solution to handle large input sizes efficiently.

• Handle bitwise OR operation on subarrays using bitwise operators.

• Consider using dynamic programming or sliding window technique for optimiz...read more

Count the total number of inversions in an integer array.

• Iterate through the array and for each pair of elements, check if the inversion condition is met.

• Use a nested loop to compare each pair of elements efficiently.

• Keep a count of the inversions found and return the total count at the end.

Given an array and a non-negative integer K, perform K operations on the array by replacing each element with MX - element, where MX is the maximum element of the array.

• Find the maximum element in the array.

• Perform the operation on each element K times.

• Update the array after each operation.

• Print the transformed array elements after K operations.

The task is to color a graph with two colors in a way that no two adjacent vertices share the same color.

• Check if the graph can be colored using two colors without any adjacent vertices sharing the same color.

• Use graph coloring algorithms like BFS or DFS to solve the problem.

• If there are odd cycles in the graph, it is not possible to color the graph as described.

• If the graph is bipartite, then it is possible to color the graph as described.

Design a data structure to find the kth largest number in a continuous stream of integers.

• Design a specialized data structure to handle continuous stream of numbers

• Implement add(DATA) function to add integers to the pool

• Implement getKthLargest() function to retrieve the kth largest number

• Maintain the pool of numbers and update it based on queries

• Output the kth largest number for each Type 2 query