Bounteous x Accolite Software Engineer Interview Questions, Process, and Tips

Aptitude test with basic numericals and technical questions on OS, CN, DBMS and Data structures

2 coding questions
Level easy to medium

Q1. Questions on Data structures and puzzles
Add your answer
Q2. Tree and Linked list questions
Add your answer

Questions on data structures and code for given problem

Data structure, system design, SQL

Round duration - 90 minutes
Round difficulty - Hard

1 coding question was given to be solved within 90 minutes. The platform was provided by Eduthrill. It was user friendly. Audio and Video was required to be ON in this round.

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 representation using adjacency list or matrix

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

• Use a stack to keep track of the ordering

• Return the ordering as an array of integers
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

This round was a Technical Interview 1. The round started at 7:30 pm in the evening and ended at around 8:20 pm. The video call was conducted using Google Meet and the coding of the given question was done on any of the compiler of my choice by screen sharing.

Q1. 
Loot Houses Problem Statement
A thief is planning to steal from several houses along a street. Each house has a certain amount of money stashed. However, the thief cannot loot two adjacent houses. Determi...read more
Ans. 
Determine the maximum amount of money a thief can steal from houses without looting two consecutive houses.
• Create an array 'dp' to store the maximum money that can be stolen up to the i-th house.

• Iterate through the houses and update 'dp' based on whether the current house is stolen or not.

• Return the maximum value in 'dp' as the answer.

• Example: For input N=4 and values=[6, 7, 1, 30], the output should be 36.
Answered by AI
Add your answer