i
Bounteous x
Accolite
Filter interviews by
OOP (Object-Oriented Programming) is a programming paradigm based on objects and classes, promoting code reusability and modularity.
Encapsulation: Bundling data and methods that operate on the data within one unit (e.g., a class).
Inheritance: Mechanism to create a new class from an existing class, inheriting attributes and methods (e.g., a 'Dog' class inheriting from an 'Animal' class).
Polymorphism: Ability to pre...
The question requires writing code, likely involving algorithms or data structures.
Understand the problem requirements clearly before coding.
Break down the problem into smaller, manageable parts.
Choose appropriate data structures (e.g., arrays, lists, trees).
Write pseudocode to outline your logic before actual coding.
Test your code with various inputs to ensure correctness.
Deadlock occurs when two or more processes are unable to proceed because each is waiting for the other to release resources.
Mutual Exclusion: Resources cannot be shared; they are allocated exclusively to one process.
Hold and Wait: Processes holding resources are allowed to request additional resources.
No Preemption: Resources cannot be forcibly taken from a process; they must be voluntarily released.
Circular Wait:...
Reversing a linked list involves changing the direction of the pointers between nodes.
Iterate through the list while maintaining three pointers: previous, current, and next.
Set the current node's next pointer to the previous node.
Move the previous and current pointers one step forward.
Repeat until the end of the list is reached.
Example: For list 1 -> 2 -> 3, the reversed list will be 3 -> 2 -> 1.
Merge Sort is a divide-and-conquer algorithm that recursively divides an array into two halves, sorts them, and then merges them.
Divide the array into two halves
Recursively sort each half
Merge the sorted halves
Count the number of occurrences of each character in a given string.
Create a dictionary to store the count of each character.
Iterate through the string and update the count in the dictionary.
Return the dictionary with character count.
Diamond problem occurs in multiple inheritance when two base classes have a common method. It is solved using virtual inheritance.
Diamond problem occurs when a derived class inherits from two base classes that have a common method.
Virtual inheritance is used to solve the diamond problem.
Virtual inheritance ensures that only one instance of the common base class is created.
To check for a loop in a linked list, we use the Floyd's cycle-finding algorithm.
Create two pointers, slow and fast, and initialize them to the head of the linked list.
Move slow pointer by one node and fast pointer by two nodes.
If there is a loop, the two pointers will eventually meet.
If there is no loop, the fast pointer will reach the end of the linked list.
Time complexity of this algorithm is O(n) and space com...
Reverse a linked list in groups of k
Create a function to reverse a linked list
Iterate through the linked list in groups of k
Reverse each group using the function
Connect the reversed groups back together
Return the new head of the linked list
Runtime polymorphism is the ability of an object to take on multiple forms during runtime.
It is achieved through method overriding
It allows for more flexibility and extensibility in code
It is a key feature of object-oriented programming
Example: Animal class with different subclasses such as Dog, Cat, and Bird
It was an easy-medium level exam. It included 2 questions.
The question requires writing code, likely involving algorithms or data structures.
Understand the problem requirements clearly before coding.
Break down the problem into smaller, manageable parts.
Choose appropriate data structures (e.g., arrays, lists, trees).
Write pseudocode to outline your logic before actual coding.
Test your code with various inputs to ensure correctness.
I applied via Campus Placement and was interviewed in Oct 2024. There was 1 interview round.
I applied for Python coding round but instead they told to code with c
I applied via Approached by Company and was interviewed in Nov 2023. There were 5 interview rounds.
I applied via Campus Placement and was interviewed before Apr 2023. There were 5 interview rounds.
CS Fundamentals
OOPs Concept
Problem Solving(1 Question)
Developed a project management tool for tracking tasks and deadlines.
Implemented user authentication and authorization for secure access.
Utilized a relational database to store project data and user information.
Designed a user-friendly interface with drag-and-drop functionality for task management.
Aptitude test for online coding round
2 Coding question and questions related to project
Accolite stands out for its innovative culture, diverse projects, and commitment to employee growth and client success.
Innovative Culture: Accolite fosters a creative environment where new ideas are encouraged, leading to cutting-edge solutions.
Diverse Projects: The opportunity to work on a variety of projects across different industries enhances my skill set and keeps work engaging.
Commitment to Growth: Accolite inves...
I applied via Job Portal and was interviewed before Aug 2023. There were 3 interview rounds.
DSA related questions
DSA related questions
I applied via Cuvette and was interviewed before Dec 2023. There was 0 interview round.
I applied via Referral and was interviewed before Sep 2023. There were 4 interview rounds.
Dsa questions on graph and array
Use tree traversal to find the minimum number in a tree structure.
Start at the root node and compare it with its children to find the minimum value.
Use depth-first search or breadth-first search to traverse the tree.
Keep track of the minimum value found so far as you traverse the tree.
Consider implementing a recursive function to traverse the tree efficiently.
I applied via Campus Placement and was interviewed before Sep 2023. There were 5 interview rounds.
DBMS, OOPS, OS, CN, Aptitude
Graph and tree based question.
Top trending discussions
Some of the top questions asked at the Bounteous x Accolite Software Engineer interview -
The duration of Bounteous x Accolite Software Engineer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 22 interview experiences
Difficulty level
Duration
based on 84 reviews
Rating in categories
Senior Software Engineer
1.7k
salaries
| ₹6.2 L/yr - ₹26 L/yr |
Software Engineer
635
salaries
| ₹6 L/yr - ₹14 L/yr |
Associate Technical Delivery Manager
434
salaries
| ₹20.3 L/yr - ₹36.3 L/yr |
Senior Test Engineer
235
salaries
| ₹8.2 L/yr - ₹17.9 L/yr |
Technical Delivery Manager
129
salaries
| ₹28 L/yr - ₹47.9 L/yr |
Xoriant
CitiusTech
HTC Global Services
Exela Technologies