Filter interviews by
Be the first one to contribute and help others!
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 applied via Recruitment Consultant and was interviewed in Jun 2020. There was 1 interview round.
I applied via Referral and was interviewed before May 2020. There was 1 interview round.
To understand the supply of restaurants in a particular area of a city, we can use various methods.
Collect data from online directories like Yelp, Zomato, etc.
Conduct surveys to gather information about the number of restaurants in the area.
Analyze the population density and demographics of the area to estimate the demand for restaurants.
Check the number of restaurant permits issued by the local government.
Use GIS mapp...
I applied via Walk-in and was interviewed before Jan 2020. There was 1 interview round.
The 5S concepts are widely used in the warehouse sector, FMCG, and FNV operations to improve efficiency and organization.
Sort: Remove unnecessary items and organize the necessary ones.
Set in Order: Arrange items in a logical and efficient manner.
Shine: Clean and maintain the workplace regularly.
Standardize: Establish standardized processes and procedures.
Sustain: Continuously maintain and improve the 5S practices.
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
I applied via Naukri.com and was interviewed in May 2019. There were 4 interview rounds.
Yes, I am comfortable traveling for work.
I have experience traveling for work in my previous roles.
I am adaptable and enjoy exploring new places.
I am willing to travel for client meetings and conferences.
I understand the importance of face-to-face interactions in sales.
I am organized and can handle the logistics of travel efficiently.
I applied via LinkedIn and was interviewed before May 2020. There was 1 interview round.
I appeared for an interview before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Easy
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
ARR = [2,...
Find the second largest element in an array of integers.
Iterate through the array to find the largest and second largest elements.
Handle cases where all elements are identical.
Return -1 if a second largest element does not exist.
Round duration - 60 Minutes
Round difficulty - Easy
System Design Round
Design a scalable system for Twitter with key components and architecture.
Use microservices architecture for scalability and fault isolation.
Key components include user service, tweet service, timeline service, and notification service.
Use a distributed database like Cassandra for storing tweets and user data.
Implement a message queue like Kafka for handling real-time updates and notifications.
Use a caching layer like ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
based on 1 interview
Interview experience
based on 17 reviews
Rating in categories
Delivery Project Executive
11
salaries
| ₹1.8 L/yr - ₹3.7 L/yr |
Team Lead
7
salaries
| ₹2.2 L/yr - ₹4 L/yr |
Executive
5
salaries
| ₹2.2 L/yr - ₹2.5 L/yr |
Quality Analyst
4
salaries
| ₹2 L/yr - ₹2.5 L/yr |
Data Analyst
4
salaries
| ₹3.6 L/yr - ₹4.2 L/yr |
WATConsult
BC Web Wise
Interactive Avenues
Dentsu Webchutney