Filter interviews by
I applied via Naukri.com and was interviewed before Jun 2023. There were 6 interview rounds.
The number of companies that join varies each year based on market conditions and business strategies.
The number of companies joining can be influenced by economic factors such as growth opportunities, industry trends, and competition.
Companies may join to expand their market reach, increase revenue, or diversify their product offerings.
For example, in a booming economy, more companies may join to take advantage of inc...
Continuously seek opportunities for professional growth and development in your career.
Take on new challenges and responsibilities to expand your skill set
Seek out mentorship and training programs to enhance your knowledge
Stay updated on industry trends and best practices through networking and research
I have the necessary skills, experience, and passion to excel in this role.
I have relevant experience in the field
I possess the required skills and qualifications
I am a quick learner and adaptable to new situations
I am passionate about the industry and eager to contribute
I am a team player and work well with others
Yes, I know C language. Here's a program to print numbers from 1 to 10 excluding 5.
Use a loop to iterate from 1 to 10
Inside the loop, check if the current number is equal to 5
If it is not equal to 5, print the number
The question was about finding the average of a set of numbers.
I approached the problem by first summing all the numbers in the set.
Then, I divided the sum by the total number of elements in the set to find the average.
I used a loop to iterate through the set and keep track of the sum and count of elements.
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.
No, I am not a loner.
I enjoy working in a team and collaborating with others.
I believe that teamwork leads to better results.
I am comfortable working with people from diverse backgrounds.
I actively seek out opportunities to network and build relationships.
I am a good listener and value the opinions of others.
Customer Manager
10
salaries
| ₹1.9 L/yr - ₹2.7 L/yr |
Customer Service Manager
5
salaries
| ₹1.3 L/yr - ₹2.5 L/yr |
Collections Executive
5
salaries
| ₹1.2 L/yr - ₹1.8 L/yr |
Collections Manager
5
salaries
| ₹0.2 L/yr - ₹3.8 L/yr |
Territory Manager
5
salaries
| ₹5 L/yr - ₹9 L/yr |
TCS
Accenture
Wipro
Cognizant