i
Bounteous x Accolite
Filter interviews by
I applied via Naukri.com and was interviewed in Oct 2023. There were 3 interview rounds.
Implement a data structure and algorithm for finding repeated elements in an array.
Use a hash map to store the frequency of each element in the array.
Iterate through the array and update the frequency in the hash map.
Return the elements with frequency greater than 1 as the repeated elements.
Implementing DSA for sorting array of strings
Use a sorting algorithm like bubble sort, selection sort, or merge sort
Compare strings using built-in comparison functions or custom comparison functions
Ensure the sorting algorithm is efficient and handles edge cases
Css3 questions JavaScript also. Login page and positions and dsa for flattened the nested array
I appeared for an interview in May 2021.
Functional components are simpler and easier to test, while class components have more features and better performance.
Functional components are stateless and use hooks for state management.
Class components have lifecycle methods and can hold state.
Functional components are easier to read and write.
Class components have better performance in certain scenarios.
Functional components are recommended for simple UI componen...
Props are inputs passed to React components. There are two types: ownProps and childrenProps.
ownProps are passed directly to the component from its parent
childrenProps are passed to the component through its children
ownProps can be accessed using this.props in the component
childrenProps can be accessed using this.props.children in the component
Redux is a predictable state container for JavaScript apps.
Redux is a state management library for JavaScript applications.
It provides a centralized store to manage the state of an application.
Redux follows a unidirectional data flow pattern.
Actions are dispatched to update the state in the store.
Reducers are pure functions that update the state based on the dispatched actions.
Selectors are used to retrieve data from t...
Top trending discussions
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
We were supposed to give test in any time between 3 PM to 9 PM.
You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...
The problem involves finding the total number of unique paths from the top-left to bottom-right cell of a matrix by moving only right or down.
Use dynamic programming to solve the problem efficiently.
Create a 2D array to store the number of unique paths at each cell.
Initialize the first row and first column with 1 as there is only one way to reach them.
For each cell (i, j), the number of unique paths is the sum of paths...
We are provided with a tree containing 'N' nodes, numbered from 0 to N-1. The objective is to determine the total number of nodes within each subtree of the provided tree. Speci...
Given a tree with N nodes, find the number of elements in each subtree rooted at every node.
Traverse the tree using Depth First Search (DFS) to calculate subtree sizes for each node.
Use an array to store subtree sizes for each node, starting with leaf nodes having size 1.
The subtree size of a node is the sum of subtree sizes of its children plus 1 for the node itself.
Round duration - 120 minutes
Round difficulty - Medium
Pair Programming Interview( this round is similar to machine coding round) it started around 11 AM
Focus Areas: Problem solving and implementation of extensions.
The pair coding round is focused on OOPS concepts. You are paired with a TWer for this round. They let you code first for an hour and in the next hour they review your code and suggest changes which would improve the code structure, readability and make it modular and reusable and functional.
Ninja stands at the start of a wooden bridge over a river. Some segments of the bridge are damaged. The undamaged segments, marked as 'safe', are listed in an array S...
Check if Ninja can cross the river by jumping from one safe segment to another based on given constraints.
Iterate through the 'SAFE' array and check if Ninja can make the required jumps to reach the last safe segment.
Ensure that the next jump is either 'X' - 1, 'X', or 'X' + 1 units from the previous jump.
Return 'true' if Ninja can successfully cross the river, otherwise return 'false'.
Round duration - 120 minutes
Round difficulty - Medium
Students who were shortlisted from Pair Programming round was selected for this round around 3 PM. In this round there were two interviewer.
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...
Return the middle element of a singly linked list, or the one farther from the head if there are even elements.
Traverse the linked list with two pointers, one moving twice as fast as the other
When the fast pointer reaches the end, the slow pointer will be at the middle
Return the element pointed to by the slow pointer
Tip 1 : Have good grasp on OOPS since they have a round named Pair Programming round which is focused upon this.
Tip 2 : Write clean, modular and functional code.
Tip 3 : Practice Data Structures and Algorithms
Tip 4 : You should know breadth and depth of whatever is mentioned in your resume.
Tip 5 : Be loud and clear.
Tip 1 : Make single page resume.
Tip 2 : Mention relevant things on resume.
Tip 3 : Do not put any false things on resume. Projects, internships you are mentioning be ready to answer questions related to it regarding what you solved, idea, databases, design.
Tip 4 : Contribute in open source, participate in hackathons.
I applied via Approached by Company and was interviewed before Mar 2021. There were 4 interview rounds.
DSA
About Social changes
posted on 3 Feb 2021
I applied via Naukri.com and was interviewed before Oct 2022. There were 4 interview rounds.
Its a MCQ realted to all Tech lang like java, sql , database , spring , cloud
Coding round on virtual box
Reverse a string without using any inbuilt method.
Iterate through the string from the last character to the first
Create a new string and append each character to it
Return the reversed string
Convert a smallcased string to all capital case.
Use the toUpperCase() method to convert the string to uppercase.
Assign the result to a new variable or overwrite the original string.
Make sure to handle any non-alphabetic characters appropriately.
Hashmap is a data structure that stores key-value pairs and uses hashing to retrieve values quickly.
Hashmap uses an array to store the key-value pairs
The keys are hashed to generate an index in the array
If two keys hash to the same index, a linked list is used to store the values
Retrieving a value involves hashing the key to find the index and then traversing the linked list if necessary
Questions regarding Java were asked.
based on 1 interview
Interview experience
Senior Software Engineer
1.5k
salaries
| ₹6.4 L/yr - ₹28.9 L/yr |
Software Engineer
579
salaries
| ₹4.8 L/yr - ₹16.9 L/yr |
Associate Technical Delivery Manager
435
salaries
| ₹11 L/yr - ₹40 L/yr |
Senior Test Engineer
215
salaries
| ₹5 L/yr - ₹21.2 L/yr |
Technical Delivery Manager
146
salaries
| ₹16 L/yr - ₹60.4 L/yr |
Xoriant
CitiusTech
HTC Global Services
HERE Technologies