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

There was coding test in which we were asked graph based question along which cs fundamental mcqs.

Q1. Parenthesis match (using stack),DBMS,OS questions, OOPS questions
Add your answer

All MCQ questions 2hrs time , difficulty easy-medium then coding will be asked

Q1. Total 3 technical rounds will be there , in round 1 theory concepts will be asked
Add your answer
Q2. About DS, array lists , Linked lists os concepts sql resume based
Add your answer

3 coding question i have to code on a platform. Need good knowledge of DSA to solve these.

Q1. 2 Coding question asked that a have to code while sharing screen with interviewer. Array, Linked List And Tree. These are importantly they asked.
Add your answer

Q1. In this round they asked about projects mentioned in resume. And basics questions from your skill set that you mentioned in your resume.
Add your answer

Q1. Final salary and location discussion. And some discussion on company work culture.
Add your answer

2 coding questions were given.solved both

Q1. Started with intro and then asked dsa questions on binary search,linked list,trees like zigzag traversal,finding nth node from end.dbms questions also were asked
Add your answer

Q1. Started with intro and then asked two sum, detection of cycle in direct graph,grouping anagrams,dbms questions like normalisation and projects discussion
Add your answer

Q1. Intro and situation based questions and hr questions
Add your answer

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
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 ...read more
Ans. 
Implement a function to find any topological sorting of a Directed Acyclic Graph (DAG).
• Use Kahn's algorithm to find a topological sort of the DAG.

• Start by finding all vertices with in-degree 0 and add them to the result array.

• Remove these vertices and their outgoing edges from the graph, then repeat the process.

• Continue until all vertices are added to the result array.

• Return the result array as the topological sort of
Answered by AI
Add your answer

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).
• Create a graph data structure to represent the DAG.

• Use depth-first search (DFS) to perform topological sorting.

• Maintain a visited array to keep track of visited nodes.

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