Filter interviews by
I applied via Campus Placement and was interviewed before Sep 2022. There were 6 interview rounds.
Can prepare for basic aptitude
Can take test in any language
Simple dsa problem u can find most question from leetcode
I applied via Walk-in and was interviewed before Aug 2023. There were 2 interview rounds.
It was deciphering spoken language to subtitle for a complicated accented show
I am passionate about the company's mission and values, and I believe my skills and experience align well with the opportunities here.
Passionate about company's mission and values
Skills and experience align well with opportunities
Excited about potential for growth and development
I am passionate about using data analysis to drive business decisions and improve processes.
I have always been fascinated by the power of data to uncover insights and drive strategic decision-making.
I enjoy working with large datasets and using statistical tools to extract meaningful information.
I believe that data-driven decision-making is crucial for businesses to stay competitive in today's market.
For example, in my...
posted on 13 Jul 2017
I applied via Naukri.com and was interviewed in Jun 2020. There were 4 interview rounds.
React has three main phases in its lifecycle: mounting, updating, and unmounting.
Mounting: when a component is created and inserted into the DOM
Updating: when a component is updated due to changes in props or state
Unmounting: when a component is removed from the DOM
Lifecycle methods can be used to perform actions at each phase, such as componentDidMount() or componentWillUnmount()
React also has error handling methods,
Strict mode is a way to write secure and optimized JavaScript code.
Enables catching of silent errors
Disallows duplicate property names or parameters
Prevents use of undeclared variables
Makes `eval()` safer to use
Throws errors on invalid usage of `this` keyword
CURD operations along with implementation of a mock UI
I appeared for an interview in Jan 2021.
Round duration - 120 minutes
Round difficulty - Hard
This round was very difficult. I never do these much difficulty level of coding questions. But i give my best, and just do every questions by using step by step process.
Given an integer 'N', print an hourglass pattern based on the value of 'N'.
The first and only line of input contains an integer, denoting the value of N.
Print an hourglass pattern based on the given integer 'N'.
Read the integer 'N' as input
Print the top half of the hourglass pattern with decreasing numbers
Print the bottom half of the hourglass pattern with increasing numbers
Handle the constraints for 'N' values between 1 and 50
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
BFS traversal in a disconnected graph starting from vertex 0.
Use BFS algorithm to traverse the graph starting from vertex 0.
Explore neighbor nodes first before moving to the next level neighbors.
Consider bidirectional edges in an undirected graph.
Output the BFS traversal sequence for each test case in a separate line.
Ensure the BFS path starts from vertex 0 and print connected nodes in numerical sort order.
You are given a stack. Your task is to sort the elements within the stack in ascending order using only push and pop operations. You are allowed to use one additional stack ...
Sort a given stack in ascending order using only push and pop operations with the help of an additional stack.
Use one additional stack to assist in sorting the elements.
Pop elements from the input stack and push them onto the auxiliary stack in sorted order.
Keep track of the current minimum element to maintain ascending order.
Pop elements from the auxiliary stack back to the input stack to get the sorted order.
Round duration - 90 minutes
Round difficulty - Easy
This round is also coding round in this round we have a small video call interaction too, in which hr ask few questions to only those whose coding question is correct.
You are given a palindrome number represented as a string S
. Your task is to find the largest palindrome number that is strictly less than S
.
T...
Find the largest palindrome number strictly less than a given palindrome number.
Iterate from the middle towards the start of the number and decrement the digits to create the largest palindrome less than the given number.
Handle cases where the number is all '9's by changing the middle digit to '9' and decrementing the rest of the digits.
If the number has an odd length, simply mirror the first half to create the largest
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find minimum time to rot all fresh oranges adjacent to rotten oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process.
Track the time taken to rot all fresh oranges.
Return -1 if all fresh oranges cannot be rotten.
Handle edge cases like empty grid or no fresh oranges.
Tip 1 : Relax and don't stress. Practice
Tip 2 : Build Resume according to Job Description , but don't lie.
Tip 3 : Have good projects and knowledge regarding important subjects related to interviews
Tip 1 : Include only genuine information, never lie in resume , it will impact to bad impression.
Tip 2 : Skills relevant to Job Description
Tip 3 : Resume should not be more than 2 pages
Tip 4 : Have some projects and internship on your resume because it will give good impression
based on 1 interview
Interview experience
based on 9 reviews
Rating in categories
Member Technical Staff
26
salaries
| ₹7.9 L/yr - ₹27 L/yr |
Security Analyst
19
salaries
| ₹5.5 L/yr - ₹9 L/yr |
Technical Staff Member 3
13
salaries
| ₹11.9 L/yr - ₹40 L/yr |
Staff Engineer
12
salaries
| ₹26 L/yr - ₹52 L/yr |
Customer Success Manager
11
salaries
| ₹13 L/yr - ₹42 L/yr |
Aurigo
Prime Focus Technologies
Peel-works
Yodlee