Comviva Technology
IKIO Lighting Interview Questions and Answers
Q1. Merge Sort Task
Given a sequence of numbers, denoted as ARR
, your task is to return a sorted sequence of ARR
in non-descending order using the Merge Sort algorithm.
Example:
Explanation:
The Merge Sort algorith...read more
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Divide the input array into two halves recursively until each part has a size of '1'.
Merge the sorted arrays to return one fully sorted array.
Time complexity of Merge Sort is O(n log n).
Q2. Count Nodes within K-Distance Problem Statement
Given a connected, undirected, and acyclic graph where some nodes are marked and a positive integer 'K'. Your task is to return the count of nodes such that the d...read more
Count nodes within K-distance from marked nodes in a connected, undirected, acyclic graph.
Create an adjacency list to represent the graph.
Use BFS to traverse the graph and calculate distances from marked nodes.
Keep track of visited nodes and distances to avoid revisiting nodes.
Return the count of nodes with distances less than 'K' from all marked nodes.
Handle edge cases like empty graph or marked nodes.
Q3. Ways To Make Coin Change
Given an infinite supply of coins of each denomination from a list, determine the total number of distinct ways to make a change for a specified value. If making the change isn't possib...read more
Given coin denominations and a target value, find the total number of ways to make change.
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.
Handle base cases such as making change for 0 value.
Consider all possible combinations of denominations to make change for the target value.
Q4. Count Occurrences of X in Sorted Array
Given a sorted array or list of integers with size N and an integer X, you need to determine how many times X appears in the array/list.
Input:
The first line of the input...read more
Count occurrences of a given integer in a sorted array.
Use binary search to find the first and last occurrence of X in the array.
Calculate the count by subtracting the indices of the last and first occurrences.
Handle cases where X is not present in the array.
Implement Stack with Linked List
Your task is to implement a Stack data structure using a Singly Linked List.
Explanation:
Create a class named Stack
which supports the following operations, each in O(1) time:
Implement a Stack data structure using a Singly Linked List with operations in O(1) time.
Create a class named Stack with getSize, isEmpty, push, pop, and getTop methods.
Use a Singly Linked List to store the elements of the stack.
Ensure each operation runs in O(1) time complexity.
Handle edge cases like empty stack appropriately.
Example: For input '5 3 10 5 1 2 4', the output should be '10 1 false'.
Q6. Pillers of oops , explain data science, concepts of ACID
Pillars of OOPs are Inheritance, Encapsulation, Polymorphism, and Abstraction. Data science involves analyzing and interpreting complex data. ACID stands for Atomicity, Consistency, Isolation, Durability.
Pillars of OOPs: Inheritance, Encapsulation, Polymorphism, Abstraction
Data science: Analyzing and interpreting complex data to gain insights
ACID: Atomicity, Consistency, Isolation, Durability
Q7. explain opps concept
OOPs concept stands for Object-Oriented Programming, a programming paradigm based on the concept of objects.
OOPs focuses on creating objects that contain data in the form of attributes and code in the form of methods.
Encapsulation, Inheritance, Polymorphism, and Abstraction are the four main principles of OOPs.
Example: In a banking system, a 'Customer' object can have attributes like name and account number, and methods like deposit and withdraw.
Interview Process at IKIO Lighting
Top Software Developer Interview Questions from Similar Companies
Reviews
Interviews
Salaries
Users/Month