i
Bounteous x
Accolite
Filter interviews by
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.
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.
Use binary search to find the first and last occurrence of the character, then calculate the frequency.
Use binary search to find the first occurrence of the character in the string.
Use binary search to find the last occurrence of the character in the string.
Calculate the frequency by subtracting the indices of the last and first occurrences and adding 1.
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.
Implementing a binary search tree and its traversal methods.
Start by defining a Node class with left and right child pointers.
Implement insert() method to add nodes to the tree.
Implement inorder(), preorder(), and postorder() traversal methods.
Implement search() method to find a node in the tree.
Implement delete() method to remove a node from the tree.
Consider edge cases like empty tree, duplicate nodes, etc.
Code to split an array of integers into two subarrays with equal sum.
Iterate through the array and calculate the total sum.
Divide the sum by 2 to get the target sum for each subarray.
Use dynamic programming to find a subset of the array that adds up to the target sum.
Return the two subarrays.
Example: [1, 2, 3, 4, 5, 6] -> [1, 2, 3, 6], [4, 5]
Example: [1, 2, 3, 4, 5] -> [1, 4, 5], [2, 3]
Program to find all palindromic strings in a given string.
Iterate through the string and check for palindromic substrings using two pointers.
Add the palindromic substrings to an array of strings.
Return the array of palindromic strings.
SQL query to find the 2nd highest salary in a table.
Use ORDER BY and LIMIT to sort and select the 2nd highest salary.
Use subquery to avoid duplicates if necessary.
Finally is a block of code that executes after try-catch block. It will not execute if System.exit() is called.
Finally block is used to execute a block of code after try-catch block
It will execute even if an exception is thrown
Finally block will not execute if the JVM exits before the block is executed
System.exit() terminates the JVM and finally block will not execute
I applied via Job Fair and was interviewed in Nov 2024. There was 1 interview round.
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 appeared for an interview in Feb 2025, where I was asked the following questions.
I appeared for an interview in Oct 2024, where I was asked the following questions.
I applied via Naukri.com and was interviewed in Oct 2023. There were 2 interview rounds.
How to remove duplicate words from string and print the occurrence of words
I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.
Quants, Logical aptitude. 3 coding questions, included Maximum Sum Subarray
Any recent trending topic.
OOPs concepts and pillars. Design a Vehicle class based on requirements.
OOPs concepts: Abstraction, Encapsulation, Inheritance, Polymorphism
Vehicle class requirements: attributes like make, model, year, methods like start, stop, accelerate
Use binary search to find the first and last occurrence of the character, then calculate the frequency.
Use binary search to find the first occurrence of the character in the string.
Use binary search to find the last occurrence of the character in the string.
Calculate the frequency by subtracting the indices of the last and first occurrences and adding 1.
Bounteous is an innovative digital agency that values collaboration, creativity, and impactful solutions for clients.
Culture of Collaboration: Bounteous fosters a team-oriented environment where diverse ideas are welcomed, enhancing creativity and innovation.
Focus on Impactful Solutions: The company prioritizes delivering meaningful results for clients, as seen in their successful projects like the redesign of major e-...
I applied via Referral and was interviewed in Jan 2024. There was 1 interview round.
I applied via Campus Placement and was interviewed before Jul 2023. There were 5 interview rounds.
1 graph question, leetcode hard
A top view of a binary tree shows the nodes visible from the top when looking down from the root node.
The top view of a binary tree can be obtained by performing a level order traversal and keeping track of the horizontal distance of each node from the root.
Nodes with the same horizontal distance are at the same level in the top view.
Example: For the binary tree 1 -> 2 -> 3 -> 4 -> 5, the top view would be 1 -> 2 -> 3 ...
In 5 years, I see myself as a senior software engineer leading a team of developers on innovative projects.
Leading a team of developers on innovative projects
Advancing to a senior software engineer role
Continuing to grow and develop my skills in software development
I want to join Accolite because of their reputation for cutting-edge technology and innovative projects.
Accolite is known for working on challenging and innovative projects
I am impressed by Accolite's reputation for using cutting-edge technology
I believe Accolite will provide me with opportunities for growth and learning
It was not good, it contain mostly question of java programming.
Factorial of n and sum of n numbers using recursion
Create a recursive function to calculate factorial of n
Use a recursive function to calculate the sum of all n numbers
Handle base cases for both factorial and sum calculations
Example: Factorial of 5 = 5 * 4 * 3 * 2 * 1 = 120, Sum of first 5 numbers = 1 + 2 + 3 + 4 + 5 = 15
I appeared for an interview in Jun 2023.
Manual testing MCQs questions
Top trending discussions
Some of the top questions asked at the Bounteous x Accolite interview for freshers -
The duration of Bounteous x Accolite interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 16 interview experiences
Difficulty level
Duration
based on 867 reviews
Rating in categories
Senior Software Engineer
1.7k
salaries
| ₹5.5 L/yr - ₹25.9 L/yr |
Software Engineer
599
salaries
| ₹6 L/yr - ₹14.1 L/yr |
Associate Technical Delivery Manager
438
salaries
| ₹20.2 L/yr - ₹36 L/yr |
Senior Test Engineer
230
salaries
| ₹8.2 L/yr - ₹17.7 L/yr |
Technical Delivery Manager
126
salaries
| ₹28 L/yr - ₹45 L/yr |
Xoriant
CitiusTech
HTC Global Services
HERE Technologies