Filter interviews by
I applied via Naukri.com and was interviewed before Apr 2022. There were 6 interview rounds.
Questions on data structure
Top trending discussions
posted on 8 Dec 2022
I applied via Campus Placement
I am a highly motivated and detail-oriented software engineer with a passion for problem-solving and continuous learning.
Highly motivated
Detail-oriented
Passionate about problem-solving
Continuous learner
A perfect employer is one who values employee growth, fosters a positive work environment, and promotes work-life balance.
Values employee growth and provides opportunities for professional development
Fosters a positive work environment with open communication and collaboration
Promotes work-life balance by offering flexible schedules and benefits
Recognizes and rewards employee achievements
Provides a competitive salary a
Had to solve 50 questions in 12 minutes. Questions were very easy, only headache was to attempt as many as you could in 12 minutes. .
Had questions regarding core subjects in the multiple choice section in the 1st section of this round. In the section 2nd of this round you had 3 questions of data structures (2 easy and 1 of moderate difficulty level).
posted on 16 Dec 2024
I applied via Campus Placement and was interviewed in Nov 2024. There were 2 interview rounds.
The aptitude test was relatively straightforward, consisting of both aptitude and technical questions, with a difficulty level ranging from easy to medium.
posted on 5 Feb 2025
posted on 26 Dec 2024
I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.
I am a Software Development Engineer with 5 years of experience in developing web applications using Java, Spring, and Angular.
5 years of experience in software development
Proficient in Java, Spring, and Angular
Strong problem-solving skills
Experience in developing web applications
Good team player
Merge Sort is a divide and conquer algorithm that divides the input array into two halves, recursively sorts them, and then merges the sorted halves.
Divide the input array into two halves
Recursively sort the two halves
Merge the sorted halves back together
Quick Sort is a popular sorting algorithm that uses a divide-and-conquer approach to sort elements in an array.
Choose a pivot element from the array.
Partition the array into two sub-arrays: elements less than the pivot and elements greater than the pivot.
Recursively apply the same process to the sub-arrays.
Combine the sorted sub-arrays to get the final sorted array.
posted on 27 Nov 2024
I applied via Company Website and was interviewed in Oct 2024. There was 1 interview round.
Asked to write a bank application - which includes adding,removing,transferring of money
I applied via Company Website and was interviewed in Apr 2024. There were 3 interview rounds.
posted on 29 Sep 2024
Queue question - create queue from array
Interview experience
Software Developer
31
salaries
| ₹4 L/yr - ₹8 L/yr |
Software Engineer
7
salaries
| ₹4.5 L/yr - ₹11 L/yr |
Full Stack Developer
5
salaries
| ₹5 L/yr - ₹17.5 L/yr |
Design Engineer
4
salaries
| ₹2.8 L/yr - ₹5.2 L/yr |
Front end Developer
4
salaries
| ₹3 L/yr - ₹6.5 L/yr |
TCS
Infosys
Wipro
HCLTech