Filter interviews by
I applied via Naukri.com and was interviewed in May 2024. There was 1 interview round.
Agile maturity can be measured through various factors such as team collaboration, continuous improvement, and adherence to Agile principles.
Assess team collaboration and communication
Evaluate the frequency and effectiveness of retrospectives
Review the team's ability to adapt to change and embrace Agile principles
Monitor the team's delivery speed and quality of work
Track the level of stakeholder engagement and satisfac
I would promote Agile/Scrum Framework by emphasizing its benefits, providing training, coaching teams, and leading by example.
Educate team members and stakeholders on Agile principles and values
Facilitate Scrum events and ceremonies to ensure adherence to the framework
Provide continuous feedback and support to teams to improve their Agile practices
Lead by example by demonstrating Agile mindset and behaviors in daily in...
Top trending discussions
I applied via Recruitment Consultant
I applied via Referral and was interviewed before Jul 2021. There were 2 interview rounds.
I applied via Naukri.com and was interviewed before Aug 2021. There were 2 interview rounds.
Standard Coding questing
I applied via Naukri.com and was interviewed before Apr 2021. There were 2 interview rounds.
I applied via Naukri.com
I applied via Naukri.com and was interviewed in Jul 2020. There were 5 interview rounds.
I applied via Naukri.com and was interviewed in Aug 2020. There were 3 interview rounds.
Hashmap is key-value pair collection while Hashset is a unique value collection.
Hashmap allows duplicate values but not duplicate keys while Hashset only allows unique values.
Hashmap uses key to access values while Hashset uses object reference.
Hashmap is faster for accessing values while Hashset is faster for checking if a value exists.
Example: Hashmap - {1: 'apple', 2: 'banana', 3: 'apple'}, Hashset - {'apple', 'bana
Hashmap is a data structure that stores key-value pairs and uses hashing to locate values based on their keys.
Hashmap uses an array to store the key-value pairs
The key is hashed to generate an index in the array
If multiple keys hash to the same index, a linked list is used to store them
Hashmap provides constant time complexity for insertion, deletion, and retrieval of values
Java's HashMap class is an implementation of
I applied via Referral and was interviewed in Sep 2020. There was 1 interview round.
based on 1 interview
Interview experience
TCS
Accenture
Wipro
Cognizant