Filter interviews by
Be the first one to contribute and help others!
I applied via Naukri.com and was interviewed in Nov 2020. There was 1 interview round.
I appeared for an interview before Sep 2020.
Round duration - 30 minutes
Round difficulty - Easy
It was in the day time. I was asked the programming language of my choice. It was mostly focused on programming fundamentals. I was asked 2 questions based on Data Structures and Algorithms.
A loop in a linked list can be detected using Floyd's Cycle Detection Algorithm.
Use two pointers - slow and fast, where slow moves one step at a time and fast moves two steps at a time.
If there is a loop, the two pointers will eventually meet at some point within the loop.
To detect the start of the loop, reset one pointer to the head and move both pointers one step at a time until they meet again.
Round duration - 30 minutes
Round difficulty - Easy
This round was mostly focused on my resume and projects.
Round duration - 30 minutes
Round difficulty - Easy
It was in the evening. I went to their office in Gurgaon. It was taken by one of the technology director who had a lot of experience.
Do practice a lot of data structures questions as mostly questions in interviews are based on them. Also, do prepare for projects mentioned in your resume and skills which you have mentioned. Coding ninjas has a big hand in making my interview clear as I have taken a course from the coding Ninjas which helped me a lot to make my concepts clear.
Application resume tips for other job seekersKeep it short and crisp. Go through it properly before the interview. Make sure that you haven't put anything in it that can cause you problems during the interview.
Final outcome of the interviewSelectedI applied via Referral and was interviewed before Sep 2020. There was 1 interview round.
I successfully led projects that improved efficiency, increased sales, and enhanced team collaboration in my previous roles.
Increased sales by 20% in one year by implementing a new marketing strategy.
Led a team of 10 in a project that reduced operational costs by 15%.
Developed a training program that improved employee performance and satisfaction.
Successfully managed a cross-departmental initiative that streamlined com...
I applied via Campus Placement
I appeared for an interview before May 2016.
I have a proven track record of successfully leading teams, driving growth, and exceeding targets.
I have over 10 years of experience in senior leadership roles.
I have consistently delivered results and exceeded targets in my previous roles.
I have a strong strategic mindset and have successfully led teams through periods of change and growth.
I am a strong communicator and relationship builder, able to collaborate effect...
I am a Senior Associate in the field of finance, specializing in investment management.
I have expertise in analyzing financial data and making investment recommendations.
I work closely with clients to understand their financial goals and risk tolerance.
I monitor market trends and economic indicators to make informed investment decisions.
I have experience in portfolio management and asset allocation.
I may hold certifica...
My ambition is to become a respected leader in my field, making a positive impact through innovative solutions and mentorship.
To continuously learn and grow in my role
To lead and inspire a team towards success
To contribute to the advancement of the organization and industry
To mentor and guide junior colleagues in their professional development
I appeared for an interview before Dec 2020.
Round duration - 60 Minutes
Round difficulty - Medium
This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.
Use level-order input to construct the Binary Tree.
Traverse the Binary Tree recursively to generate the required traversals.
Ensure proper handling of null nodes represented by -1 in the input.
Return the three traversals as ...
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
Round duration - 45 Minutes
Round difficulty - Medium
This round basically tested some concepts from Data Structures and File Manipulation .
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal and update the intersection array.
Return the intersection array as the result.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I appeared for an interview in Feb 2017.
I am a detail-oriented analyst with a strong background in data analysis and problem-solving skills.
I have a Bachelor's degree in Economics with a focus on statistical analysis
I have experience using various data analysis tools such as Excel, SQL, and Tableau
I have successfully completed projects that involved forecasting trends and identifying key insights from data
I chose this company because of its strong reputation, innovative projects, and commitment to employee growth.
Strong reputation in the industry
Innovative projects and technologies
Commitment to employee growth and development
I am interested in the Analyst position.
Strong analytical skills
Experience with data analysis tools
Ability to interpret complex data
Excellent problem-solving abilities
I possess strong analytical skills, attention to detail, and proficiency in data analysis tools.
Strong analytical skills demonstrated through previous data analysis projects
Attention to detail shown in accuracy of reports and presentations
Proficiency in data analysis tools such as Excel, SQL, and Tableau
I applied via Campus Placement
based on 2 reviews
Rating in categories
Udaan
BigBasket
Aditya Birla Fashion and Retail
American Express