Filter interviews by
I applied via Naukri.com and was interviewed in Apr 2023. There were 3 interview rounds.
posted on 28 Sep 2023
I applied via Referral and was interviewed before Sep 2022. There were 2 interview rounds.
posted on 6 Sep 2024
I applied via Naukri.com and was interviewed before Sep 2023. There was 1 interview round.
Experienced professional with a background in retail management and a proven track record of driving sales and leading teams.
Worked as a retail manager for 5+ years, overseeing daily operations and staff management
Successfully implemented sales strategies that resulted in a 20% increase in revenue
Led a team of 15 employees, providing training and support to ensure high performance
Strong communication and problem-solvin
I have 5 years of leadership experience on paper.
I have held leadership positions in previous jobs where I was responsible for managing teams and making strategic decisions.
I have completed leadership training programs and workshops to enhance my skills in leading and motivating others.
I have received positive feedback from supervisors and colleagues regarding my leadership abilities.
I have successfully led projects fr...
posted on 2 Sep 2023
I applied via Newspaper Ad and was interviewed in Apr 2024. There were 2 interview rounds.
Some java and python codings.
Some case based questions.
posted on 19 May 2022
I appeared for an interview before May 2021.
Round duration - 60 Minutes
Round difficulty - Easy
Given a binary tree with 'N' nodes, your task is to print the nodes in spiral order traversal.
The binary tree is represented i...
Print nodes of a binary tree in spiral order traversal.
Use a queue to perform level order traversal of the binary tree.
Alternate between printing nodes from left to right and right to left at each level.
Handle null nodes represented by '-1' appropriately.
Example: For input '1 2 3 -1 -1 4 5 -1 -1 -1 -1', the output should be '1 3 2 4 5'.
Round duration - 60 Minutes
Round difficulty - Easy
You are given a list of N
strings called A
. Your task is to determine whether you can form a given target string by combining one or more strings from A
.
The strings from A
c...
Given a list of strings, determine if a target string can be formed by combining one or more strings from the list.
Iterate through all possible combinations of strings from the list to form the target string.
Use recursion to try different combinations of strings.
Check if the current combination forms the target string.
Return true if a valid combination is found, otherwise return false.
Round duration - 60 Minutes
Round difficulty - Easy
Design an elevator system for efficient vertical transportation.
Divide building into zones to optimize elevator usage.
Implement algorithms for efficient elevator scheduling.
Include safety features like emergency stop buttons and overload sensors.
Consider user interface for passengers to select floors and monitor elevator status.
Tip 1 : Never give up
Tip 2 : Practice
Tip 3 : Be positive
Tip 1 : Keep it short
Tip 2 : Highlight skills and achievements
I appeared for an interview in Jul 2019.
I applied via Naukri.com and was interviewed in Mar 2020. There were 4 interview rounds.
Rotational shifts refer to working in different shifts at different times. Web service flow is the sequence of steps involved in a web service request. Checking ports on Unix or Solaris machine involves using the netstat command.
Rotational shifts involve working in different shifts at different times, such as day shift, night shift, and swing shift.
Web service flow involves a sequence of steps, such as sending a reques...
I applied via Campus Placement and was interviewed before Jun 2020. There were 4 interview rounds.
I appeared for an interview before Sep 2020.
Round duration - 120minutes
Round difficulty - Easy
It was an online MCQ's + coding round consisting of 20 MCQ’s and 1 coding problem.
Check for a loop in a linked list by using two pointers moving at different speeds.
Use two pointers, one moving at double the speed of the other.
If there is a loop, the two pointers will eventually meet at the same node.
Example: 1 -> 2 -> 3 -> 4 -> 5 -> 2 (loop back to 2), the two pointers will meet at node 2.
Round duration - 50 minutes
Round difficulty - Easy
The interview started at 8:30 pm in cc of Delhi Technological University itself and it was quite late. There was only a single interviewer and he asked me one coding question related to overflow of integers.
To check for integer overflow when multiplying two integers, use the properties of integer overflow and check if the result is within the valid range of the integer type.
Check if the signs of the two integers are the same to avoid overflow in case of multiplication.
Use the properties of integer overflow to detect if the result exceeds the maximum or minimum value of the integer type.
Consider using a larger data type or...
Round duration - 15 minutes
Round difficulty - Easy
It was quite late . There was only one interviewer and I was asked about my family , education and future plannings and few questions related joining locations and documents etc.
Focus on data structures and algorithms part more. Tell the interviewer , starting from the brute force approach to the most optimal solution as this will give a good impression to the interviewer.
Application resume tips for other job seekersTo be honest, the problem-solving ability is the only thing that most companies care about. So you can manipulate your resume according to that. Mention your competitive programming handles in your resume and also other coding ranks or achievements which you have achieved.
Final outcome of the interviewSelectedbased on 1 interview
Interview experience
based on 5 reviews
Rating in categories
Software Engineer
3.3k
salaries
| ₹5 L/yr - ₹16.3 L/yr |
Senior Software Engineer
3.3k
salaries
| ₹9.5 L/yr - ₹28 L/yr |
Claims Associate
2.4k
salaries
| ₹1.7 L/yr - ₹4.8 L/yr |
Associate Software Engineer
1.3k
salaries
| ₹3 L/yr - ₹9.5 L/yr |
Associate
1k
salaries
| ₹1.8 L/yr - ₹6 L/yr |
Oracle
Amdocs
Automatic Data Processing (ADP)
24/7 Customer