Filter interviews by
I applied via Naukri.com and was interviewed in Oct 2024. There was 1 interview round.
HashMap is a data structure that stores key-value pairs and uses hashing to efficiently retrieve values based on keys.
HashMap internally uses an array of linked lists to store key-value pairs.
When a key-value pair is added, the key is hashed to determine the index in the array where the pair will be stored.
If multiple keys hash to the same index, a linked list is used to handle collisions.
Retrieving a value involves ha...
A singleton class is a class that can only have one instance created and provides a global point of access to that instance.
Ensure the class has a private constructor to prevent external instantiation.
Provide a static method to access the single instance of the class.
Use lazy initialization to create the instance only when needed.
Consider thread safety if the singleton will be accessed by multiple threads.
Top trending discussions
Improving quality of education in India
Investing in teacher training and development
Increasing access to technology and digital resources
Encouraging parental involvement in education
Promoting vocational education and skill development
Addressing the issue of inadequate infrastructure and resources
I am a software engineer with experience in developing web applications and expertise in programming languages such as Java and Python.
Proficient in Java and Python programming languages
Experience in developing web applications using frameworks such as Spring and Django
Familiarity with database technologies such as MySQL and MongoDB
Strong problem-solving and analytical skills
Ability to work in a team and collaborate ef
In the next 5 years, I see myself as a senior software engineer leading a team of developers.
I plan to continue learning and expanding my skillset
I hope to take on more leadership roles and mentor junior developers
I aim to contribute to the development of innovative software solutions
I plan to stay up-to-date with the latest technologies and industry trends
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.
based on 2 interviews
Interview experience
based on 27 reviews
Rating in categories
Java Developer
17
salaries
| ₹10.7 L/yr - ₹32.2 L/yr |
Application Support Engineer
11
salaries
| ₹4.5 L/yr - ₹14 L/yr |
Senior Java Developer
8
salaries
| ₹24 L/yr - ₹43.5 L/yr |
Project Manager
7
salaries
| ₹7 L/yr - ₹18.2 L/yr |
Technical Lead
6
salaries
| ₹27 L/yr - ₹32 L/yr |
HDFC Bank
ICICI Bank
Axis Bank
State Bank of India