i
Bounteous x Accolite
Filter interviews by
I applied via Google updates and was interviewed before Oct 2022. There were 3 interview rounds.
I was interviewed in Apr 2021.
Round duration - 30 Minutes
Round difficulty - Easy
Timing of test start from 11 AM and everything goes well here .
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.
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
Round duration - 60 Minutes
Round difficulty - Easy
It happen nicely and no problem occur.
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...
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.
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
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).
Round duration - 90 mintues
Round difficulty - Hard
Environment is very bad the intervier video call is lagging.
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...
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.
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.
Tip 1 : Prepare Data structure and algorithm
Tip 2 : Focus on operating system
Tip 3 : RDBMS and CAO are also important
Tip 1 : Have some projects on resume.
Tip 2 : Always write things which you can explain there.
I was interviewed in Feb 2021.
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)
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...
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
Given an array containing N
distinct positive integers and a number K
, determine the Kth largest element in the array.
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...
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.
Round duration - 60 minutes
Round difficulty - Easy
It was in the morning at around 10 a.m conducted on Skype.
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...
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.
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...
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
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.)
Tip 1 : Practice atleast 20-30 Questions for each topic in DSA
Tip 2 : Try to make some projects which solve real world problems.
Tip 3 : Try to host your project, so that interviewer can try the project hands on.
Tip 1 : Never put anything which you don't know on your resume
Tip 2 : Keep your resume up to the point. Don't overfill it with things like your full address OR your interests. It is not required.
I was interviewed in Apr 2021.
Round duration - 90 minutes
Round difficulty - Hard
Timing was 10 AM. Platform was very lagging. So overall it was not a good experience.
You are given a directed acyclic graph (DAG). Your task is to perform topological sorting of the graph and return any valid ordering.
A directed acyclic g...
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
Tip 1 : Do some projects.
Tip 2 : Practice DS and algo questions.
Tip 1 : Keep it short.
Tip 2 : Do not put false things on resume
Bounteous x Accolite interview questions for designations
I was interviewed in Nov 2020.
Round duration - 90 Minutes
Round difficulty - Easy
This round contains only 1 coding question which you have to solve in the language selected by you at the time of registration.
(Note: One can have to attempt the question in C language is he/she had selected C++ language at the time of registration).
Given a Directed Acyclic Graph (DAG) consisting of V
vertices and E
edges, your task is to find any topological sorting of this DAG. You need to return an array of size ...
Topological sort of a Directed Acyclic Graph (DAG) is found by ordering the vertices in such a way that for every directed edge u -> v, u comes before v in the ordering.
Use Depth First Search (DFS) to find the topological ordering of the vertices.
Start by visiting a vertex and recursively visit its neighbors before adding it to the result array.
Maintain a visited array to keep track of visited vertices and a stack t...
Round duration - 60 Minutes
Round difficulty - Easy
This is a technical interview which was held on google meet. The interviewer helps me to be comfortable. He first asked me some basic questions on OOPS concepts like function overloading and overriding. Then he asked me to explain any of my project and also put some question around it. After that he asked me one DSA question and share a google docs on which I have to code it. Then we dry run the code and he was satisfied with the solution.
You are given two strings 'A' and 'B' of lengths 'N' and 'M' respectively. Your task is to determine how many distinct ways string 'B' occurs as a subsequence in str...
Count the number of distinct occurrences of one string as a subsequence in another string.
Iterate through string A and string B to find all occurrences of B as a subsequence in A.
Use dynamic programming to keep track of the number of distinct occurrences.
Handle edge cases such as empty strings or strings of different lengths.
Example: For strings A='aabbcc' and B='abc', there are 3 distinct occurrences of B in A.
Round duration - 60 Minutes
Round difficulty - Easy
This round is also a Technical Interview round. The main focus of interviewer was on OOPS concepts. Around 30mins he came up with OOPS questions only like abstract class, inheritance, interfaces, exception handling and alot of other topics. Then he asked some DBMS concepts like normalization and some SQL queries for which I gave him satisfactory answer. He also asked questions around Data structures like what are queues, stack, hashmap etc. In the end he asked one DSA question around Linked List.
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...
Find the node where two linked lists merge, return -1 if no merging occurs.
Traverse both lists to find their lengths and the difference in lengths
Move the pointer of the longer list ahead by the difference
Traverse both lists simultaneously until they meet at the merging point
Tip 1 : Practice previous year interview questions.
Tip 2 : They focus on OOPS concept so be clear in those.
Tip 3 : Should stand on your resume, whatever written there should be completely clear to you.
Tip 1 : Resume should be of one page with experience, projects, skills, education, certifications(not mandatory) columns in it.
Tip 2 : It is ok to have few things on resume but do not provide false information or points on which you cannot stand on if asked.
Get interview-ready with Top Bounteous x Accolite Interview Questions
Top trending discussions
I applied via Company Website and was interviewed before Dec 2020. There were 4 interview rounds.
I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.
I applied via Referral and was interviewed before Apr 2021. There were 2 interview rounds.
Puzzles, Psychometric Test
I applied via Walk-in and was interviewed before Jul 2021. There was 1 interview round.
I applied via Company Website and was interviewed before Jun 2021. There were 2 interview rounds.
First round was coding as well as aptitude done together went well I guess focusing on codes helps a lot.
based on 1 interview
1 Interview rounds
based on 5 reviews
Rating in categories
Senior Software Engineer
1.5k
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
553
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Technical Delivery Manager
426
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Test Engineer
209
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Delivery Manager
153
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
HCLTech