i
Bounteous x
Accolite
Filter interviews 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 applicati...
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]
Find unique characters in a window of k size in a string.
Use a sliding window approach.
Maintain a hash table to keep track of character frequency.
Remove characters from hash table as the window slides.
Convert given no to corresponding excel no.
Excel no starts from 1 and goes up to 16384
Excel no is calculated using column and row numbers
For example, 1 corresponds to A, 27 corresponds to AA, 28 corresponds to AB, and so on
To find the second highest salary from employees table and traverse a binary tree in pre-order, in-order, and post-order.
To find the second highest salary, you can use a subquery or window function like ROW_NUMBER() or DENSE_RANK().
For pre-order traversal, visit the root node first, then recursively do a pre-order traversal of the left subtree, followed by the right subtree.
For in-order traversal, recursively do a...
A regular language is a language that can be recognized by a finite automaton.
Regular languages can be described by regular expressions.
Regular languages are closed under union, concatenation, and Kleene star operations.
Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.
Grammar in compiler design defines the syntax and structure of a programming language.
Grammar specifies the rules for forming valid statements in a programming language.
It consists of a set of production rules that define how valid programs can be constructed.
There are different types of grammars such as context-free grammar, regular grammar, etc.
Example: In C programming language, the grammar specifies that a for...
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading or...
Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.
Split the input string by spaces to get individual words
Reverse the list of words
Join the reversed words with a single space in between
Handle leading/trailing spaces by stripping them before and after reversing
A token in compiler design is a basic unit of syntax that the compiler can understand and process.
Tokens are the smallest units of a program that are meaningful to the compiler.
Examples of tokens include keywords, identifiers, operators, and punctuation symbols.
Tokens are generated by the lexical analysis phase of the compiler.
Tokens are used by the parser to build the abstract syntax tree of the program.
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
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
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 21 interview experiences
Difficulty level
Duration
based on 22 reviews
Rating in categories
Senior Software Engineer
1.7k
salaries
| ₹5.5 L/yr - ₹24.8 L/yr |
Software Engineer
597
salaries
| ₹6 L/yr - ₹14 L/yr |
Associate Technical Delivery Manager
438
salaries
| ₹20.2 L/yr - ₹36 L/yr |
Senior Test Engineer
229
salaries
| ₹8.1 L/yr - ₹17.8 L/yr |
Technical Delivery Manager
129
salaries
| ₹22 L/yr - ₹54.9 L/yr |
Xoriant
CitiusTech
HTC Global Services
HERE Technologies