i
Bounteous x
Accolite
Filter interviews by
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 th...
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 by the difference in lengths
Traverse both lists simultaneously until they meet at the merging point
You are provided with 'K' different arrays/lists, each sorted in ascending order. Your task is to merge all these arrays/lists into one sorted array/list in ascendin...
Merge K sorted arrays into one sorted array in ascending order.
Iterate through all arrays/lists and merge them into one sorted array using a priority queue or merge sort algorithm.
Ensure to handle edge cases like empty arrays/lists or arrays/lists with different sizes.
Time complexity can be optimized by using a min-heap or priority queue to efficiently merge the arrays/lists.
Given a binary tree, your task is to print the left view of the tree.
The input will be in level order form, with node values separated by a ...
Print the left view of a binary tree given in level order form.
Traverse the tree level by level and print the first node of each level (leftmost node).
Use a queue to perform level order traversal.
Keep track of the current level and print the first node encountered at each level.
Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.
A subarray 'A' is considered greater than a ...
The task is to find the subarray with the maximum sum in a given array.
Iterate through the array and keep track of the current sum and maximum sum seen so far.
If the current sum becomes negative, reset it to 0 as it won't contribute to the maximum sum.
Compare the maximum sum with the sum of the current subarray to update the result.
Handle cases where all elements are negative by returning the maximum element in th...
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 V
...
Implement a function to find any topological sorting of a Directed Acyclic Graph (DAG).
Use Kahn's algorithm to find a topological sort of the DAG.
Start by finding all vertices with in-degree 0 and add them to the result array.
Remove these vertices and their outgoing edges from the graph, then repeat the process.
Continue until all vertices are added to the result array.
Return the result array as the topological sor...
I applied via Shine and was interviewed in Aug 2024. There were 2 interview rounds.
Normal coding round with simple oa complexity
I applied via Campus Placement
Tree question for the round 1 and 30 computer science questions total time 90 minutes
I appeared for an interview in Jan 2025, where I was asked the following questions.
I am currently working in the software development field, focusing on building scalable web applications and improving user experiences.
Developing web applications using frameworks like React and Node.js.
Collaborating with cross-functional teams to design and implement new features.
Utilizing Agile methodologies for project management and delivery.
Conducting code reviews to maintain high-quality standards.
Implementing R...
I hold a degree in Computer Science and have extensive experience in software development, specializing in full-stack web applications.
Bachelor's degree in Computer Science from XYZ University.
3 years of experience in software development, focusing on JavaScript and Python.
Proficient in frameworks like React and Django, having built several projects.
Experience with Agile methodologies, participating in sprints and stan...
As a fresher, I have a solid foundation in software development principles and hands-on experience through projects and internships.
Completed a Bachelor's degree in Computer Science, where I learned programming languages like Java, Python, and C++.
Participated in coding bootcamps and hackathons, which enhanced my problem-solving skills and teamwork.
Worked on a capstone project that involved developing a web application...
I last worked in the fintech sector, focusing on developing secure payment processing systems and enhancing user experience.
Developed a payment gateway that processed over 1 million transactions monthly.
Implemented security protocols like PCI DSS compliance to protect user data.
Collaborated with UX designers to improve the mobile app interface, resulting in a 30% increase in user engagement.
Utilized technologies like J...
1 coding question of graph , and other are B.Tech engineering questions
Problem of leetcode based on Stack medium level
I appeared for an interview in Aug 2024.
String reverse in the sentence
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
There were 2 easy - difficult leetcode questions
I am a passionate software developer with experience in building scalable applications and a strong foundation in programming languages.
Background: I have a degree in Computer Science and have worked on various projects during my studies.
Experience: I have 3 years of experience in full-stack development, primarily using JavaScript, React, and Node.js.
Projects: I developed an e-commerce platform that increased sales by ...
Spring Boot is a framework that simplifies the development of Java applications by providing pre-configured settings and tools.
Spring Boot eliminates the need for manual configuration by providing defaults for most settings.
It allows developers to create stand-alone, production-grade Spring-based Applications.
Spring Boot includes an embedded Tomcat, Jetty, or Undertow server, making it easy to deploy web applications.
I...
My last project involved developing a full-stack web application using Java and React, focusing on user experience and performance.
Technology Stack: Utilized Java Spring Boot for the backend and React for the frontend, ensuring a seamless integration between the two.
RESTful API Development: Designed and implemented RESTful APIs to handle data transactions, allowing for efficient communication between client and server.
...
DP, Binary Search, Greedy, etc
I applied via LinkedIn and was interviewed before Nov 2023. There were 2 interview rounds.
1 dsa, aptitude questions
Top trending discussions
Some of the top questions asked at the Bounteous x Accolite Software Developer interview -
The duration of Bounteous x Accolite Software Developer 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 22 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