Onsurity Technologies Software Developer Intern Interview Questions and Answers for Freshers

Q1. Maintenance of BFP
Add your answer

Case study on AI Machine Learning project to be submitted

Assignment questions on python librabies and implementation

Round duration - 60 minutes
Round difficulty - Medium

Problem Solving and coding interview. Friendly interviewer.

Q1. 
Merge Two Binary Max Heaps Problem Statement
You are given two integer arrays Arr1 and Arr2 of sizes N and M respectively. Both Arr1 and Arr2 represent Max-Heaps. Your task is to merge these two arrays wh...read more
Ans. 
Merge two Max-Heap arrays while retaining order and construct the merged Max-Heap.
• Merge the two arrays while maintaining their respective order.

• Construct the Max-Heap obtained after merging the arrays.

• Ensure the final Max-Heap is valid based on the given heaps.
Answered by AI
Add your answer
Q2. 
Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...read more
Ans. 
Determine if two strings are anagrams of each other.
• Create character frequency maps for both strings

• Compare the frequency of characters in both maps

• Return True if the frequency maps are equal, else False
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

General round of interview. Questions based on resume (very few).
Behavioural Round

Q1. 
Log Cutting Minimum Moves Calculation
Ninja, the log cutter, has 'K' axes and an infinite amount of logs. Using a log cutting stand with a capacity 'N', he can attempt to cut at most 'N' logs at a time. A...read more
Ans. 
Yes, this problem can be solved with a worst-case time complexity of N^1/3.
• Use binary search to find the maximum number of logs an axe can cut without breaking.

• Divide the search space into three parts: low, mid, and high.

• Check if the mid value is feasible, if yes, move to the left half, else move to the right half.

• Repeat the process until the optimal value is found.

• Example: For K=2 and N=6, the minimum number of moves ...read more
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

This was a straight coding round with three questions , I was able to solve all 3

Q1. 
Kth Largest Number Problem Statement
You are given a continuous stream of numbers, and the task is to determine the kth largest number at any moment during the stream.
Explanation:
A specialized data st...read more
Ans. 
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
Answered by AI
Add your answer
Q2. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Ans. 
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.

• Recursively try moving in all directions (up, down, left, right) until reaching the destination.

• Add the valid path to the result list when the destination is reached.

• Sort the result list in alphabetical order before returning.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

As this was my first system design round, I was not expecting to be able to tell anything , but to my surprize he interested in just the idea what I can think , how I can solve some issues which need not be definitely to have a solution / or multiple solutions are possible from common sense.

I was given an Idea based question

Round duration - 60 Minutes
Round difficulty - Medium

The round consisted of 3 questions of medium difficulty to be completed in 60 minutes.

Q1. 
Minimum Insertions to Make a Palindrome
Given a string STR of length N composed of lowercase English letters, your task is to determine the minimum number of characters that need to be added to make the s...read more
Ans. 
Given a string, find the minimum number of characters needed to make it a palindrome.
• Iterate through the string from both ends and count the number of characters that need to be added to make it a palindrome.

• Use dynamic programming to optimize the solution by considering subproblems.

• Handle edge cases such as an already palindrome string or an empty string.

• Example: For input 'abb', the output should be 1 as adding 'a' m...read more
Answered by AI
Add your answer
Q2. 
Cousins of a Given Node in a Binary Tree
Given a binary tree with 'N' nodes and a specific node in this tree, you need to determine and return a sorted list of the values of the node's cousins. The cousin...read more
Ans. 
Given a binary tree and a specific node, return a sorted list of the node's cousins.
• Traverse the binary tree to find the parent of the given node and its depth.

• Traverse the tree again to find nodes at the same depth but with different parents.

• Return the sorted list of cousin node values or -1 if no cousins exist.
Answered by AI
Add your answer
Q3. 
Move All Negative Numbers To Beginning
Rearrange a given array 'ARR' with 'N' integers so that all negative numbers appear before all positive numbers.
Follow Up:
Can you solve this in O(1) auxiliary sp...read more
Ans. 
Rearrange array with negative numbers at the beginning, order not important.
• Iterate through the array and swap negative numbers to the beginning using two pointers approach.

• Maintain one pointer for negative numbers and another for positive numbers.

• Time complexity: O(N), Space complexity: O(1).
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

One interviewer asked the same question to two of us.
Both of us could qualify if we solved it correctly.

Q1. 
Convert Binary Tree to Mirror Tree
Convert a given binary tree into its mirror tree, where the left and right children of all non-leaf nodes are interchanged.
Input:
An integer ‘T’ denoting the number o...read more
Ans. 
Convert a binary tree into its mirror tree by interchanging left and right children of non-leaf nodes.
• Traverse the tree in postorder fashion and swap the left and right children of each node.

• Recursively call the function on the left and right subtrees.

• Modify the tree in place without creating a new tree.
Answered by AI
Add your answer

Round duration - 75 minutes
Round difficulty - Easy

Timing it is around 11 am and Environment is good .

Q1. 
Bird and Maximum Fruit-Gathering Problem Statement
A ninja bird can gather fruits from trees arranged in a circle. Each tree has an associated fruit value. The bird can gather all the fruits from a tree i...read more
Ans. 
The task is to find the maximum number of fruits a bird can gather within a given time frame, moving between adjacent trees.
• Start from each tree and calculate the maximum fruits that can be gathered within the time frame.

• Use a sliding window approach to keep track of the fruits collected while moving between trees.

• Choose the starting tree that gives the maximum total fruits collected.

• Example: For input N=7, M=3, ARR={2...read more
Answered by AI
Add your answer
Q2. 
Base 58 Conversion Problem Statement
You are given a decimal number 'N'. Your task is to convert this number into a base 58 representation.
The Base58 alphabet is defined by the following characters: “12...read more
Ans. 
Convert a decimal number to base 58 using a specific alphabet.
• Iterate through each test case and convert the decimal number to base 58 using the given alphabet.

• Handle the conversion by dividing the number by 58 and taking the remainder to find the corresponding base 58 character.

• Build the base 58 representation by appending the characters in reverse order.

• Output the final base 58 representation for each test case.
Answered by AI
Add your answer

Round duration - 45 mintues
Round difficulty - Medium

Environment was very friendly but questions asked are hard

Q1. 
Pair Sum Problem Statement
You are provided with an array ARR consisting of N distinct integers in ascending order and an integer TARGET. Your objective is to count all the distinct pairs in ARR whose sum...read more
Ans. 
Count distinct pairs in an array whose sum equals a given target.
• Use two pointers approach to iterate through the array and find pairs with sum equal to target.

• Keep track of visited pairs to avoid counting duplicates.

• Return -1 if no such pair exists with the given target.
Answered by AI
Add your answer
Q2. 
Triplets with Given Sum Problem
Given an array or list ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a specified number K.
Explanation:
A t...read more
Ans. 
The task is to find all distinct triplets in an array that sum up to a specified number.
• Iterate through the array and use nested loops to find all possible triplets.

• Use a set to store unique triplets and check if the sum equals the target sum.

• Handle edge cases like duplicate elements and no valid triplets.

• Return the triplets or -1 if no valid triplet exists.
Answered by AI
Add your answer