Bounteous x Accolite Interview Questions, Process, and Tips

Q1. OOPS, C++, Data Structures, Algorithms, and Aptitude were asked in this round.
Add your answer

This round had only one question and the time given was 60 mins, it was a medium-level Question based on Arrays. The question was given in the form of a story just like we get on platforms like Codechef and we had to provide an optimized solution with given and hidden test cases getting the correct output.

Q1. Questions were based on LinkedList (Level – Easy) rest were asked questions based on Trees but again the level was Easy.
Add your answer
Q2. Two Questions based on Arrays
Add your answer
Q3. Questions on Sorting (Merge Sort implementation)
Add your answer
Q4. Questions on Inheritance, Pointers, Double Pointers.
Add your answer
Q5. 4 pillars of OOPS were asked
Add your answer
Q6. Encapsulation and its real-time examples
Ans. 
Encapsulation is a mechanism of wrapping data and code together into a single unit.
• Encapsulation helps in achieving data hiding and abstraction.

• It provides better control over the data by making it private and accessible only through public methods.

• Real-time examples of encapsulation include a car's engine, which is encapsulated and can only be accessed through the car's interface.

• Another example is a mobile phone, whe...read more
Answered by AI
Add your answer
Q7. Inheritance and its disadvantages
Ans. 
Inheritance allows a subclass to inherit properties and methods from a superclass, but it has some disadvantages.
• Inheritance can lead to tight coupling between classes, making it difficult to modify the superclass without affecting the subclass.

• Inheritance can also lead to the creation of deep class hierarchies, which can be difficult to understand and maintain.

• Inheritance can result in code duplication if multiple sub...read more
Answered by AI
Add your answer
Q8. What is Runtime polymorphism
Ans. 
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
Answered by AI
Add your answer
Q9. Pair Sum Problem was asked
Add your answer
Q10. A tweak to the pair sum problem: there can be any number of elements that add up to the target
Ans. 
The task is to find any number of elements in an array that add up to a given target.
• Use a recursive approach to find all possible combinations of elements that add up to the target.

• Start with the first element and recursively call the function with the remaining elements and the reduced target.

• If the target becomes zero, add the current combination to the result.

• If the target becomes negative or there are no more elem...read more
Answered by AI
Add your answer
Q11. Max multiplication of 3 numbers in an array
Ans. 
Find the maximum multiplication of 3 numbers in an array of strings.
• Convert the array of strings to an array of integers.

• Sort the array in descending order.

• Check the product of first three elements and last two elements with the first element.
Answered by AI
Add your answer
Q12. Dutch national flag problem
Ans. 
The Dutch national flag problem is a sorting problem that involves sorting an array of 3 distinct values.
• The problem involves sorting an array of 3 distinct values: red, white, and blue.

• The goal is to sort the array in-place, without using any additional data structures.

• The solution involves using three pointers to keep track of the boundaries between the different values.
Answered by AI
Add your answer
Q13. Questions on the pointer, double-pointer, and LinkedList
Add your answer
Q14. Problem on stack implementation using linked list
Add your answer
Q15. Segregate 0's and 1's in array - Dutch National Flag Algo Again
Ans. 
Segregate 0's and 1's in array using Dutch National Flag Algorithm
• Use three pointers - low, mid, and high

• low points to the first index of 1

• mid points to the first index of unknown element

• high points to the last index of 1

• If arr[mid] is 0, swap arr[low] and arr[mid], increment low and mid

• If arr[mid] is 1, increment mid

• If arr[mid] is 2, swap arr[mid] and arr[high], decrement high
Answered by AI
Add your answer
Q16. Questions of CS fundamentals (databases, computer networks, operating systems) Average level questions like What are semaphores, Primary key vs Candidate Key, Normal forms of DBMS, etc
Add your answer
Q17. Project explanation and a few questions on it.
Add your answer
Q18. Mongo which NoSQL database- document-based, other NoSQL databases, virtual dom
Add your answer
Q19. Redux, pass values in props, NoSQL vs SQL, nodejs to be used where event loop, async Javascript
Add your answer

Q1. Explain the diamond problem in Cpp, and how to solve it.
Ans. 
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.
Answered by AI
Add your answer
Q2. What are the Dynamic-link library (DLL) in Cpp and its use?
Ans. 
DLL is a library of executable functions and data that can be used by a Windows application.
• DLLs are loaded at runtime and can be shared by multiple applications.

• They allow for modular programming and reduce memory usage.

• DLLs can be used for device drivers, system utilities, and application extensions.

• Examples of DLLs include kernel32.dll, user32.dll, and msvcr100.dll.
Answered by AI
Add your answer
Q3. What are registers in Cpp?
Ans. 
Registers are small, fast memory locations in a CPU that store data for quick access.
• Registers are used to store data that is frequently accessed by the CPU.

• They are faster than accessing data from RAM.

• Registers are limited in number and size.

• Examples of registers include the program counter, stack pointer, and general-purpose registers.

• Register usage can be optimized for performance in code.

• Accessing registers can be ...read more
Answered by AI
Add your answer
Q4. Can you make a constructor private in Cpp, if not what error will you get (Compile Time Error or Runtime Error)
Ans. 
Yes, a constructor can be made private in C++ to restrict object creation outside the class.
• Private constructors are used in Singleton design pattern to ensure only one instance of the class is created.

• If a constructor is made private, it can only be accessed by the member functions of the class.

• Attempting to create an object of a class with a private constructor outside the class will result in a compile-time error.
Answered by AI
Add your answer
Q5. What are function pointers and the differences between normal function and function pointers?
Ans. 
Function pointers are pointers that point to the memory address of a function. They can be passed as arguments or returned from a function.
• Function pointers allow for dynamic function calls at runtime

• Function pointers can be used to implement callbacks

• Function pointers can be used to implement polymorphism

• Normal functions are called directly, while function pointers are called indirectly

• Function pointers can be assigne...read more
Answered by AI
Add your answer
Q6. What are the ways to prevent Instantiation of Class?
Ans. 
Ways to prevent instantiation of a class
• Declare the class as abstract

• Make the constructor private

• Implement a static factory method

• Throw an exception in the constructor

• Use the Singleton pattern
Answered by AI
Add your answer
Q7. How to check for a loop in linked list?
Ans. 
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 complexi
Answered by AI
Add your answer
Q8. Remove duplicates from Linked List. Both variants.
Ans. 
Remove duplicates from Linked List. Both variants.
• Variant 1: Using Hash Set to keep track of visited nodes and removing duplicates

• Variant 2: Using two pointers to compare each node with all subsequent nodes and removing duplicates

• Example: 1->2->3->2->4->3, Output: 1->2->3->4
Answered by AI
Add your answer
Q9. Reverse the linked list in groups of k
Ans. 
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
Answered by AI
Add your answer
Q10. Asked to print the 2nd smallest element in bst
Add your answer
Q11. Equal Sum Partition along with print that 2 arrays (DP + matrix printing)
Ans. 
Equal Sum Partition problem with DP and matrix printing
• The problem involves dividing an array into two subsets with equal sum

• Dynamic programming can be used to solve this problem efficiently

• A matrix can be used to keep track of the subsets

• Printing the subsets can be done by backtracking through the matrix
Answered by AI
Add your answer
Q12. Delete Kth node from the end of the linked list in single iteration
Ans. 
Delete Kth node from end of linked list in single iteration
• Use two pointers, one to traverse the list and another to keep track of Kth node from end

• Move both pointers simultaneously until the first pointer reaches the end

• Delete the Kth node from end using the second pointer
Answered by AI
Add your answer
Q13. Merge two sorted linked lists
Ans. 
Merge two sorted linked lists
• Create a new linked list

• Compare the first nodes of both lists and add the smaller one to the new list

• Move the pointer of the added node to the next node in the list

• Repeat until one of the lists is empty

• Add the remaining nodes of the non-empty list to the new list
Answered by AI
Add your answer
Q14. Check if a linked list is circular or not
Ans. 
To check if a linked list is circular, we can use 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 the linked list is circular, the fast pointer will eventually catch up to the slow pointer

• If the linked list is not circular, the fast pointer will reach the end of the list

• Time complexity: O(
Answered by AI
Add your answer
Q15. What is the difference between Binary Tree and Binary Search Tree
Ans. 
Binary Tree is a tree data structure where each node has at most two children. Binary Search Tree is a binary tree with the property that the left subtree of a node contains only nodes with keys lesser than the node's key and the right subtree of a node contains only nodes with keys greater than the node's key.
• Binary Tree can have any values in the nodes, while Binary Search Tree has a specific order of values.

• Binary S...read more
Answered by AI
Add your answer
Q16. Separate negative and positive numbers in a linked list.
Ans. 
Separate negative and positive numbers in a linked list.
• Create two separate linked lists for positive and negative numbers

• Traverse the original linked list and add nodes to respective lists

• Join the two lists to get the final linked list with separated numbers
Answered by AI
Add your answer
Q17. Calculating the depth of a tree
Ans. 
Calculating the depth of a tree
• Depth of a tree is the maximum distance from the root node to any leaf node

• Can be calculated recursively by finding the maximum depth of left and right subtrees

• Base case is when the node is null, return 0
Answered by AI
Add your answer

Q1. 1. Introduction and my family background.
Add your answer
Q2. 2. What are your Strengths and Weaknesses?
Ans. 
My strengths include problem-solving, adaptability, and teamwork. My weaknesses include impatience and perfectionism.
• Strength: Problem-solving - I enjoy analyzing complex problems and finding efficient solutions.

• Strength: Adaptability - I am quick to learn new technologies and adapt to changing environments.

• Strength: Teamwork - I work well in collaborative settings, valuing open communication and cooperation.

• Weakness: ...read more
Answered by AI
View 2 more answers
Q3. 3. Tell us about your hobbies
Ans. 
I enjoy hiking, playing guitar, and reading science fiction novels.
• Hiking: I love exploring nature and challenging myself physically.

• Playing guitar: I find it relaxing and enjoy learning new songs.

• Reading science fiction novels: It allows me to escape into imaginative worlds and stimulates my creativity.
Answered by AI
Add your answer
Q4. 4. What are you passionate about?
Ans. 
I am passionate about solving complex problems and creating innovative software solutions.
• I enjoy tackling challenging coding problems and finding efficient solutions.

• I am constantly learning and staying up-to-date with the latest technologies and programming languages.

• I love collaborating with a team to brainstorm ideas and develop creative software solutions.

• I am passionate about creating user-friendly and intuitive ...read more
Answered by AI
Add your answer
Q5. 5. The difference between hard work and smart work with an example.
Ans. 
Hard work is putting in a lot of effort, while smart work is finding efficient ways to achieve the same result.
• Hard work involves working long hours and putting in a lot of physical or mental effort.

• Smart work involves finding innovative and efficient ways to accomplish tasks.

• An example of hard work is studying for hours to prepare for an exam.

• An example of smart work is using study techniques like spaced repetition to...read more
Answered by AI
Add your answer
Q6. 6. The problems faced by a person working in a team during my online internship and how would can you solve those problems if you were the team leader.
Ans. 
The problems faced by a person working in a team during an online internship and how to solve them as a team leader.
• Communication issues due to lack of face-to-face interaction

• Difficulties in coordinating tasks and deadlines

• Challenges in building trust and rapport among team members

• Technical difficulties and connectivity issues

• Misalignment of goals and expectations

• Lack of accountability and responsibility
Answered by AI
Add your answer
Q7. 7. Tell me in brief about yourself and why should we select you?
Ans. 
I am a highly skilled software engineer with a strong background in programming and problem-solving. I have a passion for creating efficient and innovative solutions.
• I have a Bachelor's degree in Computer Science and extensive experience in software development.

• I am proficient in multiple programming languages such as Java, C++, and Python.

• I have a proven track record of successfully delivering complex projects on time...read more
Answered by AI
Add your answer
Q8. 8. If not engineering then what?
Ans. 
I would have pursued a career in music.
• I have been playing the guitar for over 10 years.

• I have performed at local gigs and events.

• I enjoy writing and composing my own music.
Answered by AI
Add your answer
Q9. 9. Asked about past Internships if any and projects on my resume.
Add your answer