i
Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed before Jan 2024. There were 2 interview rounds.
Coding questions easy level leetcode
Immutability in strings means that once a string object is created, its value cannot be changed.
String objects in Java are immutable, meaning their values cannot be modified after creation.
Any operation that appears to modify a string actually creates a new string object.
This helps in ensuring data integrity and thread safety.
Example: String str = "Hello"; str.concat(" World"); // This does not change the value of str,...
Top trending discussions
I applied via Recruitment Consulltant and was interviewed in Oct 2024. There were 3 interview rounds.
Implement a function to reverse a linked list
Create a new linked list to store the reversed elements
Traverse the original linked list and insert each node at the beginning of the new linked list
Update the head of the new linked list as the last node of the original linked list
posted on 11 Nov 2023
I applied via Approached by Company and was interviewed in Oct 2023. There were 4 interview rounds.
Just normal MCQ test.
This question involves buying and selling items in an array.
The array must contain strings.
You need to implement a function to buy and sell items from the array.
Provide examples of buying and selling operations.
I applied via Campus Placement
Normal DP question (LC med)
I was interviewed in Dec 2020.
Round duration - 120 minutes
Round difficulty - Hard
There was 2 parts. First part problems were based on Quantitative Aptitude. Problems were of 3 types- Easy, Medium and Hard with different scores. Difficulty keeps on increasing if you answer correctly and keeps on decreasing if you answer incorrectly.
First part was of 45 mins.
Second part consisted of 2 coding problems- Medium, Hard. One was based on Greedy and other was a difficult DP + Bitmask problem.
Coding part had more weightage than Aptitude.
In Ninja Land, there are cities numbered from 0 to N-1. The distances between each pair of cities are represented by an N * N matrix 'DIST', where 'DIST[i][j]' is the distance ...
The problem involves selecting K cities to install servers in Ninja Land to minimize the maximum distance from any city to a nearest server.
Iterate through all possible combinations of K cities to select for server installation.
Calculate the maximum distance from any city to the nearest server for each combination.
Choose the combination that minimizes the maximum distance.
Given a non-empty string inputString
, determine if it can be converted into a 'Beautiful String' using the defined operation.
You can perform any number of operations to con...
Determine if a given string can be converted into a 'Beautiful String' using a specific operation.
Check if the input string is already a 'Beautiful String' by checking if it contains 'abc' in the correct positions.
If 'abc' is present in the input string, check if the left and right portions satisfy the defined conditions.
If the conditions are met, return 'True', otherwise return 'False'.
Round duration - 90 minutes
Round difficulty - Medium
There were 3 interviewers in my panel. The most senior panellist asked q. related to my interests and internship experience.
Other 2 asked questions related to Coding and subjects. There was 1 coding question which was implementation based and involved many corner cases. They were checking if I was able to figure out different corner cases and handle those.
There were situation based questions also asked. One question was on system design of Arogya Setu App.
Calculate the product of two complex numbers represented as strings in the form “A+Bi”. Here, ‘A’ represents the real part, and ‘B’ represents the imaginary part.
Calculate the product of two complex numbers represented as strings in the form 'A+Bi'.
Parse the input strings to extract real and imaginary parts of both complex numbers
Perform multiplication of the complex numbers using the formula (a+bi)*(c+di) = (ac - bd) + (ad + bc)i
Format the result as a string in the form 'A+Bi' and return
Round duration - 30 minutes
Round difficulty - Easy
HR round involved basic questions related to background and behaviour. It was basically a cultural fit round.
Tip 1 : Focus on Data Structures, Algorithms as >= 75% of your interview will be dedicated to it. Practice as much as you can.
Tip 2 : Learn the fundamentals of C, C++, OS, SQL as that are basic expectations of interviewer.
Tip 3 : Keep 2 descent projects in resume. Try to have an internship. It will make your resume strong.
Tip 1 : Try to keep relevant information only. Add all your skills and achievements.
Tip 2 : Try to have links of your coding and Github profiles.
Tip 3 : Add 2 to 3 project with small descriptions. Try to keep bullet points. Do mention the Tech Stack.
Tip 4 : Don't lie on any skill. Write only those on which you have worked.
posted on 18 Apr 2024
I applied via LinkedIn and was interviewed before Apr 2023. There were 3 interview rounds.
Probability, time & distance
Advantages and disadvantages of paperless office
posted on 3 Jan 2025
All types of aptitude, verbal, coding questions, and technical questions.
I applied via Referral and was interviewed in Sep 2023. There were 4 interview rounds.
Dotnet,c#,sql,MVC,ASP.NET
Previous experience, scenario based, project architecture
I applied via LinkedIn and was interviewed in Sep 2023. There were 4 interview rounds.
To find all even numbers from a list with a specified limit, iterate through the list and add even numbers until the limit is reached.
Iterate through the list of numbers
Check if each number is even
Add the even numbers to a new list until the limit is reached
based on 1 interview
Interview experience
Senior Engineer
1.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Technical Lead
867
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Consultant
749
salaries
| ₹0 L/yr - ₹0 L/yr |
Principal Consultant
549
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
499
salaries
| ₹0 L/yr - ₹0 L/yr |
Bosch Global Software Technologies
Qualcomm
Tata Motors
BMW