Filter interviews by
I applied via Walk-in and was interviewed in Apr 2024. There were 3 interview rounds.
Equals and hashcode are important for object comparison and hashing in Java.
Equals method is used to compare two objects for equality.
Hashcode method is used to generate a unique integer value for an object.
Equals and hashcode are used in collections like HashMap and HashSet for efficient retrieval and storage.
Comparable is an interface used for natural ordering, while Comparator is an interface used for custom ordering.
Comparable is implemented by the class itself to define the natural ordering of objects.
Comparator is implemented by a separate class to define custom ordering of objects.
Comparable uses the compareTo() method to compare objects, while Comparator uses the compare() method.
Example: String class implements Comp...
Singleton design pattern ensures a class has only one instance and provides a global point of access to it.
Create a private static instance of the class
Provide a public static method to access the instance
Ensure the constructor is private to prevent instantiation
HashMap is non-synchronized and allows null values, while Hashtable is synchronized and does not allow null keys or values.
HashMap is non-synchronized, while Hashtable is synchronized
HashMap allows null values, while Hashtable does not allow null keys or values
HashMap is faster than Hashtable
HashMap is part of the Java Collections Framework, while Hashtable is a legacy class
At my last company, effective communication and collaboration among team members went well, but there were challenges with project timelines and resource allocation.
Effective communication and collaboration among team members
Challenges with project timelines
Challenges with resource allocation
Top trending discussions
I appeared for an interview before Mar 2016.
Joins, Jobs, stored procedures,cursors.
HackerEarth / Hacker rank Test
Using dynamic programming to find the lowest cost for metro passes based on given days.
Create an array to store the minimum cost for each day.
Iterate through each day and calculate the minimum cost based on 1, 7, or 30 day pass.
Update the minimum cost for each day using dynamic programming.
Return the minimum cost for the total number of days needed.
Behavioural and culture fit
Simple algorithm question about sorting
The time complexity of the quicksort algorithm is O(n log n).
Quicksort has an average time complexity of O(n log n).
The best case time complexity of quicksort is O(n log n) when the pivot element divides the array into two equal halves.
The worst case time complexity of quicksort is O(n^2) when the pivot element is the smallest or largest element in the array.
I applied via Recruitment Consulltant and was interviewed in Nov 2021. There were 3 interview rounds.
Basic data structure related coding questions like creating a linked list and adding items to it median.
Max heap implementation.
Concurrency related questions.
posted on 22 Aug 2022
I applied via Company Website and was interviewed in Jul 2022. There were 2 interview rounds.
General knowledge and development skills and new things..
I applied via Naukri.com and was interviewed before Jun 2023. There was 1 interview round.
posted on 21 Oct 2024
I applied via Recruitment Consulltant and was interviewed in Sep 2024. There were 4 interview rounds.
Basic hacker rank problem
based on 1 interview
Interview experience
Senior Analyst
2.7k
salaries
| ₹3.5 L/yr - ₹13.5 L/yr |
Software Engineer
990
salaries
| ₹8 L/yr - ₹29.6 L/yr |
Operations Analyst
780
salaries
| ₹2 L/yr - ₹6 L/yr |
Associate Vice President
727
salaries
| ₹13 L/yr - ₹44 L/yr |
Analyst
632
salaries
| ₹1.4 L/yr - ₹7.1 L/yr |
HDFC Bank
ICICI Bank
Axis Bank
Kotak Mahindra Bank