Filter interviews by
I applied via Naukri.com and was interviewed before Dec 2019. There were 5 interview rounds.
I applied via Walk-in and was interviewed before Aug 2020. There was 1 interview round.
I appeared for an interview in Aug 2019.
I applied via Referral and was interviewed before Jun 2020. There were 5 interview rounds.
Developed a solution for optimizing a complex algorithm for a client in the finance industry
Client had a large dataset that needed to be processed quickly
Implemented parallel processing to speed up the algorithm
Optimized the code to reduce memory usage
Collaborated with the client to fine-tune the algorithm for their specific needs
I applied via Campus Placement and was interviewed before Feb 2023. There were 2 interview rounds.
It was 1 coding question with 10 test cases. They asked a question based on binary search. I got 3 hrs to clear that test. I went in as a campus fresher. For lateral joinees, it is a much more difficult question that you have to clear in 4hrs.
The best way to find the majority element in an array is by using the Boyer-Moore Voting Algorithm.
Initialize a candidate variable and a count variable.
Iterate through the array and for each element:
- If the count is 0, set the current element as the candidate.
- If the current element is the same as the candidate, increment the count.
- Otherwise, decrement the count.
After the iteration, the candidate will be the ...
Reverse a linked list in K groups
Iterate through the linked list in groups of size K
Reverse each group of nodes using a temporary pointer
Connect the reversed groups to form the final reversed linked list
I applied via Recruitment Consulltant and was interviewed before Oct 2023. There were 3 interview rounds.
Coding round with medium complexity
A linked list is a data structure where each element points to the next element in the sequence.
Create a Node class with data and a reference to the next Node
Initialize a LinkedList class with a head Node
Implement methods to add, remove, search, and traverse the linked list
I applied via Referral and was interviewed in Jan 2024. There were 4 interview rounds.
C coding questions on bitwise concepts
DSA coding concepts
The number of complete squares inscribed in a circle can be calculated using a formula based on the number of sides of the square.
The formula to calculate the number of complete squares inscribed in a circle is n*(n+1)*(2n+1)/6, where n is the number of sides of the square.
For example, if the circle has a square with 4 sides inscribed in it, the number of complete squares would be 30 (4*(4+1)*(2*4+1)/6 = 30).
Seeking new challenges and growth opportunities in a different environment.
Desire for new challenges and growth
Opportunity for career advancement
Seeking a change in work environment
Exploring new technologies or industries
1. Revere Linked List
2. Maximum water in a container
ArrayList is a resizable array implementation in Java. Appium locators include ID, name, class name, xpath, etc. UI Automator 1 and 2 are tools for testing Android apps.
ArrayList is a dynamic array that can grow or shrink in size. Example: ArrayList
Appium locators include ID, name, class name, xpath, etc. Example: driver.findElement(By.id("elementID"));
UI Automator 1 is a testing framework for...
1. What is same for you and even for PM of US?
based on 1 interview
Interview experience
based on 6 reviews
Rating in categories
Assistant Engineer
440
salaries
| ₹2.4 L/yr - ₹4.8 L/yr |
Sales Executive
439
salaries
| ₹1 L/yr - ₹5.8 L/yr |
Team Lead
425
salaries
| ₹1.9 L/yr - ₹7.4 L/yr |
Assistant Manager
249
salaries
| ₹4.2 L/yr - ₹15.7 L/yr |
Sales Promoter
241
salaries
| ₹1 L/yr - ₹4.5 L/yr |
OPPO
Dell
LG Electronics
Godrej & Boyce Manufacturing