Filter interviews by
It was moderate level
Not tough but challenging
Java has two types of beans: stateful and stateless beans.
Stateful beans maintain conversational state with the client, while stateless beans do not.
Stateful beans are typically used for long-running conversations, while stateless beans are used for short-lived operations.
Examples of stateful beans include session beans, while examples of stateless beans include message-driven beans.
Use a sorting algorithm like bubble sort or quicksort to arrange elements in ascending order.
Use a sorting algorithm like bubble sort, quicksort, or merge sort to rearrange elements in ascending order.
For example, you can implement bubble sort to compare adjacent elements and swap them if they are in the wrong order.
Another example is using quicksort to divide the array into smaller subarrays and recursively sort them.
Iterate through the array to find the second greatest number.
Iterate through the array and keep track of the greatest and second greatest numbers.
Compare each element with the current greatest and second greatest numbers.
Update the second greatest number if a new number is found that is greater than the current second greatest but less than the greatest.
I applied via Company Website and was interviewed before Sep 2022. There were 5 interview rounds.
Aptitude + Technical
5 problem statements and need to write code in any language
Basic questions on oops and sql queries
I applied via Walk-in and was interviewed in Dec 2023. There were 2 interview rounds.
I applied via Referral and was interviewed in Nov 2022. There were 4 interview rounds.
Give a topic and ask question from the topic
Java has two types of beans: stateful and stateless beans.
Stateful beans maintain conversational state with the client, while stateless beans do not.
Stateful beans are typically used for long-running conversations, while stateless beans are used for short-lived operations.
Examples of stateful beans include session beans, while examples of stateless beans include message-driven beans.
Use a sorting algorithm like bubble sort or quicksort to arrange elements in ascending order.
Use a sorting algorithm like bubble sort, quicksort, or merge sort to rearrange elements in ascending order.
For example, you can implement bubble sort to compare adjacent elements and swap them if they are in the wrong order.
Another example is using quicksort to divide the array into smaller subarrays and recursively sort them.
Iterate through the array to find the second greatest number.
Iterate through the array and keep track of the greatest and second greatest numbers.
Compare each element with the current greatest and second greatest numbers.
Update the second greatest number if a new number is found that is greater than the current second greatest but less than the greatest.
I applied via Company Website and was interviewed before Sep 2022. There were 5 interview rounds.
Aptitude + Technical
5 problem statements and need to write code in any language
I have worked on multiple projects during my time in university, including a group project on developing a mobile application.
Developed a mobile application for a group project
Collaborated with team members to design and implement features
Tested the application for bugs and user experience
Presented the project to professors and peers for evaluation
I applied via Campus Placement and was interviewed in Dec 2021. There were 3 interview rounds.
Software Engineer
236
salaries
| ₹4 L/yr - ₹13 L/yr |
Senior Software Engineer
149
salaries
| ₹8 L/yr - ₹20.4 L/yr |
Salesforce Developer
112
salaries
| ₹4.5 L/yr - ₹14.2 L/yr |
Software Developer
89
salaries
| ₹4 L/yr - ₹10.4 L/yr |
QA Engineer
76
salaries
| ₹3.5 L/yr - ₹10 L/yr |
Infosys
TCS
Wipro
HCLTech