Onsurity Technologies Software Developer Intern Interview Questions and Answers for Freshers

General aptitude, programing aptitude, logical and arithametic

Q1. Oops concept, inheritance, interferance,
Add your answer
Q2. Class , object, init function in python,
Add your answer

Q1. Maintenance of BFP
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

This round contained two coding questions. I was also asked some basic android development questions as I had mentioned a couple of projects around android.

Q1. 
Convert Binary Tree to Mirror Tree Problem Statement
Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mir...read more
Ans. 
Convert a binary tree into its mirror tree by interchanging left and right children of non-leaf nodes.
• Traverse the binary tree in a recursive manner and swap the left and right children of each non-leaf node.

• Use a temporary variable to swap the children of each node.

• Ensure to handle cases where a node may have only one child or no children.

• Implement the function to convert the given binary tree to its mirror tree in pl
Answered by AI
Add your answer
Q2. How would you implement undo and redo operations for MS Word?
Ans. 
Implementing undo and redo operations for MS Word
• Maintain a stack for undo operations and another stack for redo operations

• Whenever a change is made, push the previous state onto the undo stack

• When undo is triggered, pop the state from undo stack and push it onto redo stack

• When redo is triggered, pop the state from redo stack and push it onto undo stack

• Ensure to update the document state accordingly after each undo or
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

I was asked two coding questions, some questions around OOPs concepts and DBMS.

Q1. 
Left View of a Binary Tree
Given a binary tree, your task is to print the left view of the tree. The left view of a binary tree contains the nodes visible when the tree is viewed from the left side.
Inpu...read more
Ans. 
Print the left view of a binary tree, containing nodes visible from the left side.
• Traverse the tree level by level, keeping track of the leftmost node at each level

• Use a queue for level order traversal and a map to store the leftmost nodes

• Print the values of leftmost nodes stored in the map as the left view of the tree
Answered by AI
Add your answer
Q2. 
Trie Data Structure Implementation
Design and implement a Trie (Prefix Tree) which should support the following two operations:
1. Insert a word into the Trie. The operation is marked as 'insert(word)'.
2....read more
Ans. 
Implement a Trie data structure supporting insert and search operations efficiently.
• Implement a Trie class with insert and search methods.

• Use a nested class Node to represent each node in the Trie.

• For insert operation, iterate through each character in the word and create nodes as needed.

• For search operation, traverse the Trie based on the characters in the word to check for existence.

• Return 'TRUE' if the word is found
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Online coding round.
We could only write pseudo code and couldn't test against test cases.

Q1. 
Binary Tree Level Order Traversal
You are given a binary tree of integers. Your task is to return the level order traversal of the given tree.
Input:
The first line contains an integer 'T', representing...read more
Ans. 
Return the level order traversal of a binary tree given in level order.
• Use a queue to perform level order traversal of the binary tree

• Start by pushing the root node into the queue

• While the queue is not empty, dequeue a node, print its value, and enqueue its children
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Easy

It was onsite face to face technical round where i was asked 2 coding questions.
It lasted for 40-50 minutes.

Q1. 
Kth Ancestor in a Binary Tree
You are given an arbitrary binary tree consisting of N nodes numbered from 1 to N, an integer K, and a node TARGET_NODE_VAL from the tree. Your task is to find the Kth ancest...read more
Ans. 
Find the Kth ancestor of a given node in a binary tree.
• Traverse the tree to find the path from the target node to the root node.

• Store the path in a list and return the Kth element from the end.

• Handle cases where the Kth ancestor does not exist by returning -1.
Answered by AI
Add your answer
Q2. 
Equilibrium Indices in a Sequence
You are given an array/list named 'SEQUENCE', which consists of 'N' integers. The task is to identify all equilibrium indices in this sequence.
Explanation:
An equilibr...read more
Ans. 
Identify equilibrium indices in a given sequence by finding positions where sum of elements before and after is equal.
• Iterate through the sequence and calculate prefix sum and suffix sum at each index

• Compare prefix sum and suffix sum to find equilibrium indices

• Handle edge cases where no equilibrium index exists

• Return the indices as a sequence of integers or an empty sequence
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

Only 7 students were shortlisted after the first face to face round out of 40 students.
The interviewer seemed cool and was trying to calm down me as i was getting nervous.
Again there were 2 coding questions.

Q1. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...read more
Ans. 
Reverse a singly linked list of integers and return the head of the reversed linked list.
• Iterate through the linked list and reverse the pointers to reverse the list

• Use three pointers to keep track of current, previous, and next nodes

• Update the head of the reversed linked list once the reversal is complete
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

This was the last technical round and there were only 5 students left at the end of day.
The interview started at around 6:30 in the evening.

Q1. 
Replace with Sum of Greater Nodes Problem Statement
Convert a given binary search tree (BST) with 'N' nodes into a Greater Tree. In the Greater Tree, each node's data should be updated to the sum of its o...read more
Ans. 
Convert a binary search tree into a Greater Tree by updating each node's data to the sum of its original data plus the data of all nodes with greater or equal values.
• Traverse the BST in reverse inorder (right, root, left) to update nodes with the sum of greater nodes.

• Keep track of the sum of greater nodes encountered so far while traversing.

• Update each node's data with the sum of greater nodes and continue traversal.
Answered by AI
Add your answer
Q2. 
Nuts and Bolts Problem
You are given a collection of 'N' nuts and 'N' bolts, each having unique sizes. Your objective is to match each nut with its corresponding bolt based on size, adhering to a one-to-o...read more
Ans. 
Matching nuts and bolts based on size in a one-to-one mapping strategy.
• Iterate through the nuts and bolts arrays to find matching pairs based on size.

• Use sorting algorithms like quicksort to efficiently match nuts and bolts.

• Ensure the implementation modifies the input arrays directly to reflect the proper matched order.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

6 students from the campus were selected for this round. The interviews were conducted simultaneously for all on BlueJeans along with a code sharing website. After the initial set up and introduction, a set of 2 questions from DSA were asked from all candidates. The results were announced the same day.

Q1. 
DFS Traversal Problem Statement
Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...read more
Ans. 
DFS traversal to find connected components in an undirected and disconnected graph.
• Use Depth First Search (DFS) to traverse the graph and find connected components

• Maintain a visited array to keep track of visited vertices

• For each unvisited vertex, perform DFS to explore the connected component it belongs to

• Print the vertices of each connected component in ascending order
Answered by AI
Add your answer
Q2. 
Median of Two Sorted Arrays Problem Statement
Given two sorted integer arrays A and B with sizes N and M respectively, find the median of the combined array that results from merging arrays A and B. If th...read more
Ans. 
Find the median of two sorted arrays after merging them.
• Merge the two sorted arrays into one sorted array.

• Calculate the median based on the length of the combined array.

• Handle cases where the total number of elements is even or odd.
Answered by AI
Add your answer