Filter interviews by
I applied via Company Website and was interviewed in Apr 2024. There were 3 interview rounds.
General knowledge and English grammar
Voice and versent round and typing skills.
I applied via Recruitment Consulltant and was interviewed before Mar 2022. There were 6 interview rounds.
It was a grammer test. Fill in the blanks
I have a total of 10 years of experience with 3 different companies. My last drawn salary was $80,000 and I can join within 30 days.
Total experience: 10 years
Number of companies: 3
Last drawn salary: $80,000
Notice period: 30 days
I can join within 2 weeks of receiving the offer.
I am currently serving a notice period of 2 weeks.
I have completed all my pending projects and can transition smoothly.
I am excited about the opportunity and can start immediately.
I can join within 2 weeks.
I am currently serving a notice period of 2 weeks.
I have completed all necessary paperwork and can start immediately.
I am flexible with the joining date and can accommodate any reasonable request.
Top trending discussions
posted on 15 Aug 2024
I applied via Referral and was interviewed in Jul 2024. There was 1 interview round.
I am a dedicated and experienced professional with a strong background in project management and team leadership.
Over 10 years of experience in project management
Proven track record of successfully leading cross-functional teams
Strong communication and interpersonal skills
Certified in project management (e.g. PMP)
Passionate about driving results and exceeding goals
In the next 5 years, I see myself advancing to a managerial role within the company, leading a team and contributing to the growth and success of the organization.
Continuing to excel in my current role and taking on additional responsibilities
Participating in leadership development programs to enhance my skills
Building strong relationships with colleagues and stakeholders to foster collaboration and teamwork
Seeking opp...
I applied via LinkedIn and was interviewed in Oct 2023. There were 2 interview rounds.
posted on 13 May 2021
Yes, I have experience working under pressure.
I have successfully managed multiple high-pressure projects simultaneously.
I am accustomed to meeting tight deadlines and delivering quality work under pressure.
I thrive in fast-paced environments and remain calm and focused during stressful situations.
I have received positive feedback from supervisors and colleagues for my ability to handle pressure.
For example, in my prev...
Yes, I have experience working with teams.
I have worked in cross-functional teams on various projects.
I have collaborated with colleagues from different departments to achieve common goals.
I have participated in team meetings, brainstorming sessions, and project planning.
I have effectively communicated and coordinated with team members to ensure smooth workflow.
I have contributed to team success by sharing ideas, provi...
posted on 28 Jan 2025
I was interviewed in Dec 2024.
posted on 13 Oct 2023
I applied via LinkedIn and was interviewed in Sep 2023. There were 3 interview rounds.
Total nodes in a binary tree can be found using depth-first or breadth-first traversal algorithms with time complexity O(n) and space complexity O(h), where h is the height of the tree.
Use depth-first traversal (pre-order, in-order, post-order) or breadth-first traversal to visit each node and count the total nodes.
Time complexity is O(n) where n is the number of nodes in the tree.
Space complexity is O(h) where h is th...
Construct 4 Array Tree and implement operations
Create an array to represent the tree structure
Implement operations like insert, delete, search, and traversal
Example: Construct a binary search tree using arrays
Use hashing to compare the JSON files in O(1) time complexity.
Create a hash function to convert the JSON data into a unique hash value.
Calculate the hash value for each JSON file and compare the hash values.
If the hash values are equal, the JSON files are identical.
Example: Use MD5 or SHA-256 hash functions for generating hash values.
Use array indices to map parent to children in a 4 Array tree in O(1) space complexity.
Assign children of a parent at indices 4*i+1, 4*i+2, 4*i+3, 4*i+4 where i is the index of the parent.
To find parent of a child at index j, use (j-1)/4 to get the parent index.
I applied via Referral and was interviewed before Mar 2023. There were 3 interview rounds.
Basic english and accounting
I applied via Naukri.com
It depends on process to process
based on 3 interviews
Interview experience
based on 21 reviews
Rating in categories
Senior Associate
105
salaries
| ₹2 L/yr - ₹5.3 L/yr |
Associate
96
salaries
| ₹1.4 L/yr - ₹5 L/yr |
Assurant Operations Associate
90
salaries
| ₹1.8 L/yr - ₹5.2 L/yr |
Team Lead
51
salaries
| ₹4.1 L/yr - ₹9 L/yr |
Software Engineer
33
salaries
| ₹3.3 L/yr - ₹10 L/yr |
Cognizant
Genpact
Accenture
Wipro