Filter interviews by
I applied via Referral and was interviewed before Feb 2023. There were 2 interview rounds.
I applied via Walk-in and was interviewed before Jun 2020. There were 3 interview rounds.
I am highly capable of handling critical situations and have strategies to increase sales.
I have a strong problem-solving ability and can think quickly on my feet.
I am skilled at analyzing data and identifying areas for improvement in the sales process.
I have experience in developing and implementing effective sales strategies.
I am adept at building and maintaining relationships with clients, which can lead to increase...
To convince a customer for selling products, it is important to understand their needs and provide a solution that meets those needs.
Listen actively to the customer's needs and concerns
Highlight the benefits and features of the product that meet their needs
Provide social proof such as customer testimonials or case studies
Offer a trial or demo to showcase the product's value
Address any objections or concerns the custome...
I can contribute to sales increase by identifying potential customers, building strong relationships, and providing excellent customer service.
Identify potential customers through market research and networking
Build strong relationships with customers through regular communication and follow-up
Provide excellent customer service by addressing concerns and offering solutions
Offer promotions and discounts to incentivize p...
I applied via Walk-in and was interviewed before Jul 2020. There was 1 interview round.
I applied via Walk-in and was interviewed before Oct 2021. There were 2 interview rounds.
Basic general knowledge about Mathematics and general knowledge
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.
posted on 17 Jan 2021
I applied via Campus Placement and was interviewed before Jan 2020. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Apr 2021. There was 1 interview round.
I applied via Referral and was interviewed in Oct 2019. There was 1 interview round.
I have 5 years of experience managing warehouse operations, including inventory control, shipping/receiving, and staff supervision.
Implemented efficient inventory management system to reduce errors and improve accuracy
Led team in achieving 99% on-time shipping rate by optimizing workflow processes
Trained staff on safety protocols and equipment operation to ensure compliance with OSHA regulations
based on 3 interviews
Interview experience
Executive Accountant
5
salaries
| ₹2 L/yr - ₹3.6 L/yr |
Estate Manager
5
salaries
| ₹3.6 L/yr - ₹6.6 L/yr |
Purchase Executive
4
salaries
| ₹3.6 L/yr - ₹4.4 L/yr |
Site Engineer
4
salaries
| ₹4.2 L/yr - ₹5.2 L/yr |
Sales Executive
4
salaries
| ₹2.4 L/yr - ₹12 L/yr |
BigBasket
Blinkit
Reliance Retail
Spencer's Retail