Filter interviews by
I applied via Referral and was interviewed before Oct 2023. There was 1 interview round.
Recruitment process can be done through job portals, social media, employee referrals, recruitment agencies, and campus placements.
Job portals: Websites like Indeed, Monster, and LinkedIn are commonly used for posting job openings and attracting candidates.
Social media: Platforms like Facebook, Twitter, and Instagram can be used to reach a larger audience and promote job opportunities.
Employee referrals: Current employ...
I applied via Referral and was interviewed before Sep 2023. There was 1 interview round.
I am a seasoned HR professional with over 10 years of experience in recruitment, employee relations, and performance management.
Experience in recruitment, employee relations, and performance management
Strong communication and interpersonal skills
Proven track record of implementing HR strategies to drive business success
Top trending discussions
Polymorphism is the ability of an object to take on many forms. In C++, it is achieved through function overloading and virtual functions.
Polymorphism allows objects of different classes to be treated as objects of a common base class.
Function overloading enables multiple functions with the same name but different parameters.
Virtual functions allow derived classes to override base class functions.
Print the level order traversal of binary tree in spiral form
Perform level order traversal of the binary tree
Alternate the direction of traversal for each level
Use a stack to reverse the order of nodes in each level
Print the nodes in the order of traversal
Find the maximum element in each subarray of size k in a given array.
Iterate through the array from index 0 to n-k.
For each subarray of size k, find the maximum element.
Store the maximum elements in a separate array.
Return the array of maximum elements.
To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.
Merge the two arrays into a single sorted array using a modified merge sort algorithm.
Return the Kth element from the merged array.
Merge two sorted arrays into one sorted array with expected time complexity of (m+n).
Use a two-pointer approach to compare elements from both arrays and merge them into the first array.
Start comparing elements from the end of both arrays and place the larger element at the end of the first array.
Continue this process until all elements from the second array are merged into the first array.
Interview experience
based on 2 reviews
Rating in categories
TCS
Accenture
Wipro
Cognizant