Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Bounteous x Accolite Team. If you also belong to the team, you can get access from here

Bounteous x Accolite Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

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

Updated 1 Oct 2023

Top Bounteous x Accolite Software Developer Intern Interview Questions and Answers

  • 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') ...read more
  • Q2. 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. Y ...read more
  • Q3. 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 ...read more
View all 13 questions

Bounteous x Accolite Software Developer Intern Interview Experiences

5 interviews found

Interview experience
3
Average
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Google updates and was interviewed before Oct 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. There are three technical rounds one round will be tough
Round 3 - HR 

(2 Questions)

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

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well for DSA , but with that knowledge try for any product based company not only one in limelight you can try any other but not Accolite, because though you clear all those 3 rounds and get hired , there is nothing in this company other than false promises and mere showoff. They are either terminating or extending the internship for of no reason amid doing projects, and also you will not get the work you are trained and desired for , they will use U for QA testing rather being hired as developer

I was interviewed in Apr 2021.

Round 1 - Coding Test 

(2 Questions)

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
  • 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
Round 2 - Coding Test 

(2 Questions)

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...

  • 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
  • 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...
  • 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
Round 3 - Video Call 

(2 Questions)

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...

  • Answered by AI
  • 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:

    ...
  • 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

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Netaji Subhas University Of Technology. I applied for the job as SDE - Intern in BangaloreEligibility criteria6 CGPAAccolite interview preparation:Topics to prepare for the interview - Recursion,Tress of different types, DP, Graphs,array and pointer.Time required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : Prepare Data structure and algorithm
Tip 2 : Focus on operating system 
Tip 3 : RDBMS and CAO are also important

Application resume tips for other job seekers

Tip 1 : Have some projects on resume.
Tip 2 : Always write things which you can explain there.

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Developer Intern Interview Questions Asked at Other Companies

Q1. Sum of Maximum and Minimum Elements Problem Statement Given an ar ... read more
asked in Amazon
Q2. Fish Eater Problem Statement In a river where water flows from le ... read more
asked in Apple
Q3. Kevin and his Fruits Problem Statement Kevin has 'N' buckets, eac ... read more
asked in CommVault
Q4. Sliding Maximum Problem Statement Given an array of integers ARR ... read more
Q5. Reverse Words in a String: Problem Statement You are given a stri ... read more

I was interviewed in Feb 2021.

Round 1 - Coding Test 

(2 Questions)

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...

  • 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
  • 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, ...
  • 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
Round 2 - Video Call 

(2 Questions)

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...

  • 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
  • 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...

  • 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
Round 3 - HR 

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.)

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in DelhiEligibility criteria7 CGPAAccolite interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Dynamic Programming, Trees, GraphsTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Apr 2021.

Round 1 - Coding Test 

(1 Question)

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...

  • 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

Interview Preparation Tips

Eligibility criteriaAbove 8 CGPAAccolite interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 2.5 monthsInterview preparation tips for other job seekers

Tip 1 : Do some projects.
Tip 2 : Practice DS and algo questions.
 

Application resume tips for other job seekers

Tip 1 : Keep it short.
Tip 2 : Do not put false things on resume

Final outcome of the interviewRejected

Skills evaluated in this interview

Bounteous x Accolite interview questions for designations

 Software Developer

 (24)

 Senior Software Developer

 (2)

 Intern

 (2)

 Software Engineer

 (40)

 Software Analyst

 (1)

 Java Developer

 (11)

 Junior Developer

 (1)

 PHP Developer

 (1)

I was interviewed in Nov 2020.

Round 1 - Coding Test 

(1 Question)

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).

  • 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 ...

  • Ans. 

    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...

  • Answered by AI
Round 2 - Video Call 

(1 Question)

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.

  • Q1. 

    Distinct Occurrences Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

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.

  • Q1. 

    Intersection of Linked List Problem

    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...

  • Ans. 

    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

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Maharaja Agrasen Institute Of Technology. Eligibility criteriaB.E/B.Tech , M.tech ,MCA , M.Sc in CS/IT and Circuit BranchesAccolite interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, DBMS, OOPS, Arrays, Dynamic Programming ,Trees, StringsTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Get interview-ready with Top Bounteous x Accolite Interview Questions

Interview questions from similar companies

I applied via Company Website and was interviewed before Dec 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Questions on Java,SQL,some trending technologies(IOT,Big data),pattern questions, programming questions with different approaches.

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare basics of DSA, have knowledge about the databases, some common dml ,ddl statements, programming knowledge of a particular language like C,Java, python,etc...have good command on oops concepts... little bit of frameworks knowledge will also help

I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.

Round 1 - Aptitude Test 
Round 2 - Technical 

(1 Question)

  • Q1. Basic questions of java.
Round 3 - HR 

(1 Question)

  • Q1. Intro and other hr related questions.

Interview Preparation Tips

Interview preparation tips for other job seekers - Cover the basic questions regarding the programming language.

I applied via Referral and was interviewed before Apr 2021. There were 2 interview rounds.

Round 1 - Aptitude Test 

Puzzles, Psychometric Test

Round 2 - One-on-one 

(1 Question)

  • Q1. Some water in 3 Jars question, you had to measure out 5L correctly

Interview Preparation Tips

Interview preparation tips for other job seekers - Make the interview interactive, I got this input from another Senior. Before i went into the interview room the volunteers were telling all those who goes into Room No 1 is screwed. I was praying i don't get room no 1. But fortunately for me I got room no 1 because when the interviewer gave me the puzzle and handed over pen and paper he went back to relax his posture and when i explained i will fill the 5L Jar first, he immediately came forward to listen to me, at that moment i knew i got the job because i felt the previous candidates never made their interview interactive and that's why he went back to relax his posture.

I applied via Walk-in and was interviewed before Jul 2021. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. .net questions - routing in asp.net MVC ?

Interview Preparation Tips

Interview preparation tips for other job seekers - Nothing . Prepare well for interview on .Net technology stack

I applied via Company Website and was interviewed before Jun 2021. There were 2 interview rounds.

Round 1 - Aptitude Test 

First round was coding as well as aptitude done together went well I guess focusing on codes helps a lot.

Round 2 - Technical 

(1 Question)

  • Q1. 2nd round included tr and mr round went quite enegritic

Interview Preparation Tips

Interview preparation tips for other job seekers - Resume skills matters a lot don't fill resume the technologies you don't even aware of

Bounteous x Accolite Interview FAQs

How many rounds are there in Bounteous x Accolite Software Developer Intern interview?
Bounteous x Accolite interview process usually has 3 rounds. The most common rounds in the Bounteous x Accolite interview process are Resume Shortlist, Technical and HR.
What are the top questions asked in Bounteous x Accolite Software Developer Intern interview?

Some of the top questions asked at the Bounteous x Accolite Software Developer Intern interview -

  1. There are three technical rounds one round will be to...read more
  2. They didn't ask me anyth...read more

Tell us how to improve this page.

Bounteous x Accolite Software Developer Intern Interview Process

based on 1 interview

1 Interview rounds

  • Coding Test Round
View more
Bounteous x Accolite Software Developer Intern Salary
based on 6 salaries
₹2.4 L/yr - ₹7 L/yr
At par with the average Software Developer Intern Salary in India
View more details

Bounteous x Accolite Software Developer Intern Reviews and Ratings

based on 5 reviews

3.3/5

Rating in categories

3.6

Skill development

3.7

Work-life balance

3.0

Salary

1.9

Job security

3.6

Company culture

2.0

Promotions

3.5

Work satisfaction

Explore 5 Reviews and Ratings
Senior Software Engineer
1.5k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
553 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Technical Delivery Manager
426 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Test Engineer
209 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Technical Delivery Manager
153 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Bounteous x Accolite with

TCS

3.7
Compare

Infosys

3.6
Compare

Wipro

3.7
Compare

HCLTech

3.5
Compare
Did you find this page helpful?
Yes No
write
Share an Interview