Bounteous x Accolite Software Developer Intern Interview Questions, Process, and Tips

Q1. There are three technical rounds one round will be tough
Add your answer

Q1. They didn't ask me anything
Add your answer
Q2. Will give U false promises and showoff about the company
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

Timing of test start from 11 AM and everything goes well here .

Q1. What is segmentation in the context of operating systems?
Ans. 
Segmentation in operating systems is a memory management technique where memory is divided into segments of variable sizes.
• Segments are logical units of a program such as code, data, stack, etc.

• Each segment has its own base address and length.

• Segmentation allows for more efficient memory management and protection.

• Examples include Intel x86 architecture with segment registers like CS, DS, SS, etc.
Answered by AI
Add your answer
Q2. How many levels of normalization are there in database management systems?
Ans. 
There are 3 levels of normalization in database management systems.
• First Normal Form (1NF) - Eliminate duplicate data and ensure data is stored in a tabular format.

• Second Normal Form (2NF) - Meet 1NF requirements and ensure all non-key attributes are fully functional dependent on the primary key.

• Third Normal Form (3NF) - Meet 2NF requirements and ensure that there are no transitive dependencies between non-key attribut
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It happen nicely and no problem occur.

Q1. 
Trapping Rain Water Problem Statement
You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...read more
Ans. 
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
• Iterate through the array and calculate the maximum height on the left and right of each bar.

• Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.

• Sum up the trapped water at each bar to get the total trapped water for the entire array.
Answered by AI
Add your answer
Q2. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. 
Sort an array of 0s, 1s, and 2s in linear time complexity.
• Use three pointers to keep track of 0s, 1s, and 2s while iterating through the array.

• Swap elements based on the values encountered to sort the array in-place.

• Time complexity should be O(N) and space complexity should be O(1).
Answered by AI
Add your answer

Round duration - 90 mintues
Round difficulty - Hard

Environment is very bad the intervier video call is lagging.

Q1. What are the sub-parts or phases of the analysis part in compiler design?
Ans. 
The sub-parts or phases of the analysis part in compiler design include lexical analysis, syntax analysis, and semantic analysis.
• Lexical analysis involves breaking the input into tokens such as keywords, identifiers, and operators.

• Syntax analysis checks the structure of the tokens to ensure they conform to the grammar rules of the language.

• Semantic analysis verifies the meaning of the program by checking for type compa...read more
Answered by AI
Add your answer
Q2. 
Left Rotations of an Array
Given an array of size N and Q queries, each query requires left rotating the original array by a specified number of elements. Return the modified array for each query.
Input:
...read more
Ans. 
Rotate an array left by a specified number of elements for each query.
• Iterate through each query and rotate the array left by the specified number of elements using array slicing.

• Handle cases where the number of rotations exceeds the length of the array by taking the modulo of the rotations.

• Return the modified array after each query.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

It was a Coding round with 2 programming questions which need to solved in 60 minutes in any of the languages (C/C++/Java/Python)

Q1. 
Ninja and the Maze Problem Statement
Ninja is stuck in a maze represented as a 2D grid. He can move in four directions (Up, Down, Left, Right) until he hits a wall ('1'). Once stopped, he can choose a new...read more
Ans. 
The problem involves determining if a ninja can reach the destination in a maze by moving in four directions until hitting a wall.
• Create a function that takes in the maze, starting point, and destination coordinates as input.

• Implement a recursive algorithm to explore all possible paths in the maze.

• Check if the destination can be reached from the starting point by moving in four directions.

• Return 'True' if a path exists
Answered by AI
View 1 more answer
Q2. 
Kth Largest Element Problem
Given an array containing N distinct positive integers and a number K, determine the Kth largest element in the array.
Example:
Input:
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...read more
Ans. 
Find the Kth largest element in an array of distinct positive integers.
• Sort the array in non-increasing order and return the Kth element.

• Use a priority queue or quick select algorithm for efficient solution.

• Ensure the array contains distinct positive integers for accurate result.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

It was in the morning at around 10 a.m conducted on Skype.

Q1. 
Median of Two Sorted Arrays
Given two sorted arrays A and B of sizes N and M, find the median of the merged array formed by combining arrays A and B. If the total number of elements, N + M, is even, the m...read more
Ans. 
Find the median of two sorted arrays by merging them and calculating the median of the combined array.
• Merge the two sorted arrays into one sorted array.

• Calculate the median of the merged array based on the total number of elements.

• If the total number of elements is even, take the mean of the two middle elements as the median.
Answered by AI
Add your answer
Q2. 
Distance Between Two Nodes in a Binary Tree
Given a binary tree and the values of two distinct nodes, determine the distance between these two nodes in the tree. The distance is defined as the minimum num...read more
Ans. 
Calculate the distance between two nodes in a binary tree.
• Traverse the tree to find the paths from the root to each node

• Find the lowest common ancestor of the two nodes

• Calculate the distance by summing the distances from each node to the common ancestor
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

A HR Round in which the interviewer discussed about me and some things about my resume (Achievements, Projects etc.)

Round duration - 90 minutes
Round difficulty - Hard

Timing was 10 AM. Platform was very lagging. So overall it was not a good experience.

Q1. 
Topological Sort Problem Statement
You are given a directed acyclic graph (DAG). Your task is to perform topological sorting of the graph and return any valid ordering.
Explanation:
A directed acyclic g...read more
Ans. 
Implement a function to perform topological sorting on a directed acyclic graph (DAG) and return any valid ordering.
• Create a graph using adjacency list representation

• Perform a depth-first search (DFS) to find the topological ordering

• Use a stack to store the ordering of nodes

• Pop elements from the stack to get the final topological ordering
Answered by AI
Add your answer