i
Tracxn
Filter interviews by
I applied via Company Website and was interviewed in Mar 2023. There were 3 interview rounds.
No I will not write the assignment
I applied via LinkedIn and was interviewed in Jun 2022. There were 2 interview rounds.
ABOUT 1 HOUR AND UNLIMITED QUESTIONS WE HAVE TO COMPLETE HOW MANY WE CAN
Simply question test
I am a dedicated HR professional with a passion for fostering a positive work environment and supporting employee growth.
Experienced in recruitment, onboarding, and employee relations
Skilled in conflict resolution and performance management
Strong communication and interpersonal skills
Passionate about promoting diversity and inclusion in the workplace
I applied via Company Website and was interviewed before Nov 2021. There were 2 interview rounds.
In my previous company, my Key Result Area (KRA) was to develop and implement HR policies and procedures.
Developed and implemented HR policies and procedures to ensure compliance with labor laws and regulations.
Conducted regular audits to assess the effectiveness of HR policies and made necessary improvements.
Streamlined the recruitment process by implementing an applicant tracking system, resulting in reduced time-to-...
It was basic test topics which were asked was PNC, Graphs, Basic age and algebra, TBH everybody has different set of questions
As an HR Executive, my current job roles include recruitment, onboarding, employee relations, performance management, and HR policy implementation.
Recruitment of new employees through job postings, screening resumes, and conducting interviews
Onboarding new hires by facilitating orientation sessions and ensuring necessary paperwork is completed
Managing employee relations by addressing conflicts, conducting investigation...
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
HAckerrank based test
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Information Executive
259
salaries
| ₹1.5 L/yr - ₹4 L/yr |
Business Development Manager
132
salaries
| ₹3.3 L/yr - ₹8 L/yr |
Research Analyst
121
salaries
| ₹2 L/yr - ₹6 L/yr |
Senior Business Development Manager
90
salaries
| ₹4.5 L/yr - ₹11 L/yr |
Associate Vice President
82
salaries
| ₹7.1 L/yr - ₹29 L/yr |
Sequoia Capital
Matrix Partners
Kalaari Capital
Nexus Venture Partners