Filter interviews by
I applied via Company Website and was interviewed before Jan 2024. There were 2 interview rounds.
I have over 5 years of experience in business development, including identifying new opportunities, building relationships, and closing deals.
Identifying new business opportunities through market research and networking
Building and maintaining relationships with clients and partners
Negotiating and closing deals to drive revenue growth
Developing and implementing strategic plans to expand business reach
Utilizing CRM syst
I am passionate about community outreach and believe in the mission of your organization.
I have experience in organizing successful outreach events in my previous role.
I am excited about the opportunity to make a positive impact in the community.
I admire the work your organization has done and want to be a part of it.
My greatest strength is my ability to effectively communicate and build relationships with diverse groups of people.
Strong communication skills
Ability to connect with people from different backgrounds
Experience in building and maintaining relationships
Adaptability in various communication styles
Proven track record of successful outreach efforts
I applied via Job Portal and was interviewed before Aug 2023. There were 3 interview rounds.
I am a dedicated and experienced facilitator with a passion for helping individuals and teams reach their full potential.
I have over 5 years of experience facilitating workshops and training sessions
I excel at creating a supportive and engaging environment for participants
I have a strong background in conflict resolution and team building
I am skilled in using various facilitation techniques such as brainstorming, group...
I have over 5 years of experience working as a facilitator in various industries, including education and corporate settings.
Facilitated team-building workshops for a Fortune 500 company
Led training sessions for new employees on communication skills
Organized and facilitated community events to promote collaboration and networking
The group session went smoothly and was productive.
Participants actively engaged in discussions and activities
Goals and objectives were met
Positive feedback received from participants
I applied via Referral and was interviewed before Jan 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed before May 2021. There were 2 interview rounds.
Numerical ability and logical reasoning followed by some coding mcqs
Printing 1 to 100 without for loop
Use recursion to print numbers from 1 to 99
Print 100 outside the recursion
Use a base case to stop recursion at 100
I applied via Campus Placement and was interviewed before Jun 2021. There were 2 interview rounds.
Simple aptitude test
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
I applied via Naukri.com
I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.
I appeared for an interview in Aug 2017.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
I applied via Naukri.com and was interviewed in May 2019. There were 4 interview rounds.
based on 2 interviews
Interview experience
based on 21 reviews
Rating in categories
Facilitator
17
salaries
| ₹3 L/yr - ₹5 L/yr |
Center Head
7
salaries
| ₹6 L/yr - ₹7.4 L/yr |
Placement Coordinator
7
salaries
| ₹1.1 L/yr - ₹3.8 L/yr |
Outreach Coordinator
5
salaries
| ₹2 L/yr - ₹3.6 L/yr |
Assistant Manager
4
salaries
| ₹4.8 L/yr - ₹6.5 L/yr |
TCS
Accenture
Wipro
Cognizant