Ignitarium Technology Solutions Software Developer Interview Questions and Answers

Round duration - 30 minutes
Round difficulty - Easy

Q1. How do you search for a node in a linked list?
Ans. 
To search for a node in a linked list, iterate through the list and compare each node's value with the target value.
• Start at the head of the linked list

• Iterate through each node by following the 'next' pointer

• Compare the value of each node with the target value

• Return the node if found, otherwise return null
Answered by AI
Add your answer
Q2. How do you detect a loop in a linked list?
Ans. 
To detect a loop in a linked list, we can use Floyd's Cycle Detection Algorithm.
• Initialize two pointers, slow and fast, at the head of the linked list.

• Move slow pointer by one step and fast pointer by two steps.

• If there is a loop, the two pointers will eventually meet.

• Alternatively, we can use a hash set to store visited nodes and check for duplicates.
Answered by AI
Add your answer
Q3. Implement a stack using a singly linked list.
Ans. 
Implement a stack using a singly linked list
• Create a Node class with data and next pointer

• Create a Stack class with top pointer pointing to the top of the stack

• Implement push, pop, and peek operations by manipulating the linked list

• Example: Node class - Node { int data; Node next; }
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

Q1. What is the top view of a binary tree?
Ans. 
The top view of a binary tree shows the nodes visible from the top when looking down from the root node.
• The top view of a binary tree is the set of nodes visible from the top when looking down from the root node.

• Nodes at the same horizontal distance from the root are considered at the same level in the top view.

• If multiple nodes are at the same horizontal distance, only the topmost node at that level is included in the...read more
Answered by AI
Add your answer
Q2. Explain the process of deleting a node from a linked list, covering all possible cases.
Ans. 
Deleting a node from a linked list involves updating pointers to maintain the list's integrity.
• Identify the node to be deleted by traversing the list

• Update the previous node's next pointer to skip the node to be deleted

• Free the memory allocated to the node to be deleted
Answered by AI
Add your answer

General aptitude questions

Problem solving, solved 2 out of 3 questions

General topics were given in gd

Q1. Programming concepts
Add your answer
Q2. Projects and coding round questions solved
Add your answer

Its basically a test comprising 32 mcq
12- logical reasoning
20- core C,DBMS, OS , Computer Networks

2 coding Questions

Q1. He just Gave me to design a React Page and removed all the starting code and gave me blank folder and asked to code all by myself
Add your answer
Q2. He asked me SQL queries which was quite tough as its of nested queries
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Its a zoom call interview which lasted for 45 minutes. initially there are two panel members in which one is very targetting at me. They asked me different type of questions like jumping from DSA to project then to python then again java. Its a mixed combo pack type interview. for each and every question they asked me the real time example. The discussion on my project lasted for 15-20 mins.

Q1. 
Count Set Bits Problem Statement
Given a positive integer N, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can...read more
Ans. 
Count the total number of set bits in the binary representation of numbers from 1 to N modulo 1e9+7.
• Use bitwise operations to count the set bits in each number from 1 to N.

• Keep track of the total set bits and return the result modulo 1e9+7.

• Optimize the solution to handle large values of N efficiently.

• Consider using dynamic programming or precomputing values for faster computation.
Answered by AI
Add your answer

Round duration - 30 mins
Round difficulty - Easy

This round was a zoom interview. The interview started with my brief introduction. This time the interview was more interested in my hobbies and passions. He asked me what do you do to keep yourself updated with the latest technology trends?

Frog jump dp problem

Q1. Microservices, Kubernetes
Add your answer
Q2. Rbac and access control
Add your answer

Tecnology for tribal areas

Q1. What is Polymorphism
Ans. 
Polymorphism is the ability of a function or method to behave differently based on the object it is acting upon.
• Polymorphism allows objects of different classes to be treated as objects of a common superclass.

• It enables a single interface to represent multiple data types.

• Examples include method overloading and method overriding in object-oriented programming.
Answered by AI
Add your answer

Q1. Reverse a string
Ans. 
Reverse a given string
• Use a loop to iterate through the characters of the string

• Append each character to a new string in reverse order

• Return the reversed string
Answered by AI
Add your answer
Q2. Basic programming questions
Add your answer

Q1. What is oops concept example with each one
Ans. 
Object-oriented programming concepts include encapsulation, inheritance, polymorphism, and abstraction.
• Encapsulation: bundling data and methods that operate on the data into a single unit (class). Example: class Car with properties like make, model, and methods like start(), stop().

• Inheritance: creating new classes based on existing classes, inheriting their attributes and methods. Example: class SUV inheriting from cl...read more
Answered by AI
Add your answer
Q2. What is data structures and types with examples of all types
Ans. 
Data structures are ways of organizing and storing data in a computer so that it can be accessed and used efficiently.
• Types of data structures include arrays, linked lists, stacks, queues, trees, graphs, and hash tables.

• Arrays are a collection of elements stored in contiguous memory locations, accessed using an index.

• Linked lists are a series of nodes where each node contains data and a reference to the next node.

• Stack...read more
Answered by AI
Add your answer
Q3. What is class and objects with example and code
Ans. 
A class is a blueprint for creating objects in object-oriented programming. Objects are instances of classes.
• A class defines the properties and behaviors of objects. For example, a 'Car' class may have properties like 'color' and 'model', and behaviors like 'drive' and 'stop'.

• An object is an instance of a class. For example, 'myCar' can be an object of the 'Car' class with specific values for 'color' and 'model'.

• Code e...read more
Answered by AI
Add your answer
Q4. What is virutal function and staic functions
Ans. 
Virtual functions are functions in a base class that are overridden in derived classes, while static functions belong to the class itself rather than instances.
• Virtual functions allow for dynamic binding and polymorphism in object-oriented programming.

• Static functions are associated with the class itself and can be called without creating an instance of the class.

• Example: virtual void display() = 0; // pure virtual fun...read more
Answered by AI
Add your answer
Q5. What is project u did in present company
Ans. 
Developed a web-based project management tool for tracking tasks and deadlines.
• Used AngularJS for front-end development

• Implemented RESTful APIs for communication between front-end and back-end

• Utilized MySQL database for storing project data
Answered by AI
Add your answer

Write a function over loading and friend class with example?