Filter interviews by
I applied via Referral and was interviewed in Jul 2023. There were 3 interview rounds.
They asked me simple DSA question based on HashMap but in the question, there were 3 sections. So, first you start with a very easy section, then the hardness level increases but still I wouldn't say it was very hard. Till 3rd section, the question became more or less like Leetcode medium question. But they asked me to do it in Java as they use Java Spring Boot in backened.
They also asked me about DBMS and asked me to write me a query. A simple question was asked there with: How can you minify a url and save it in database (like you have a url but it is very length because of request parameters and blah blah, so you need to shorten this url, how would you do it, what would be your approach to handle these type of lengthy urls using DBMS). Plus some standard OOPs questions, you can expect. That's it.
Top trending discussions
I was interviewed in Aug 2022.
I applied via Walk-in and was interviewed before Jan 2020. There was 1 interview round.
I applied via Referral and was interviewed in Dec 2021. There was 1 interview round.
A cross cheque is a type of cheque that has two parallel lines drawn across its face, indicating that it can only be deposited into the bank account of the payee.
A cross cheque is a safer form of payment as it cannot be cashed by anyone other than the intended recipient.
The two parallel lines on a cross cheque can be either general or special crosses.
A general cross cheque can only be deposited into a bank account, whi...
posted on 24 Nov 2021
I applied via Instahyre and was interviewed in Oct 2021. There were 3 interview rounds.
Count occurrences of given element in a sorted array.
Use binary search to find the first and last occurrence of the element.
Subtract the indices to get the count of occurrences.
Handle edge cases like element not present in array.
Given a binary tree, find the path with the largest sum of node values.
Use depth-first search to traverse the tree and keep track of the current path sum.
At each node, compare the current path sum with the maximum path sum seen so far.
Return the path with the maximum sum.
If the tree is empty, return an empty path.
I applied via Company Website and was interviewed in Aug 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Mar 2021. There were 4 interview rounds.
based on 2 interviews
Interview experience
based on 9 reviews
Rating in categories
Business Analyst
5
salaries
| ₹2.1 L/yr - ₹5.4 L/yr |
Executive Accountant
5
salaries
| ₹2 L/yr - ₹4.5 L/yr |
Software Engineer
4
salaries
| ₹9.2 L/yr - ₹25 L/yr |
HR Manager
4
salaries
| ₹3 L/yr - ₹5.5 L/yr |
Senior Content Writer
3
salaries
| ₹2.3 L/yr - ₹8 L/yr |
TCS
Infosys
Wipro
HCLTech