Filter interviews by
I applied via Monster and was interviewed before Aug 2020. There was 1 interview round.
Hashmap is unordered while LinkedHashmap maintains insertion order.
Hashmap uses hashing to store key-value pairs while LinkedHashmap uses a doubly linked list to maintain order.
Hashmap allows null values and one null key while LinkedHashmap does not allow null keys or values.
Hashmap has O(1) time complexity for basic operations while LinkedHashmap has O(1) for insertion and deletion but O(n) for iteration.
Example: Hash...
Top trending discussions
I applied via Campus Placement and was interviewed before May 2023. There were 2 interview rounds.
Binary search algorithm efficiently finds the target value in a sorted array.
Divide array in half and compare target with middle element
If target is smaller, search left half; if larger, search right half
Repeat process until target is found or subarray is empty
One example of a design pattern is the Singleton pattern.
Singleton pattern ensures a class has only one instance and provides a global point of access to it.
It involves a static method to access the instance and a private constructor to prevent instantiation from other classes.
Example: Singleton pattern is commonly used in logging classes, database connections, and thread pools.
Hackerrank coding test
Questions on Aws services
I applied via Referral and was interviewed in Jan 2022. There were 2 interview rounds.
I applied via Walk-in
45 mins, maths
I applied via Naukri.com and was interviewed in Nov 2021. There was 1 interview round.
I applied via Approached by Company and was interviewed before Jun 2023. There were 2 interview rounds.
I applied via Campus Placement and was interviewed before Sep 2023. There was 1 interview round.
Random forest is an ensemble learning method that builds multiple decision trees and merges them to improve accuracy and prevent overfitting.
Random forest is a type of ensemble learning method.
It builds multiple decision trees during training.
Each tree is built using a subset of the training data and a random subset of features.
The final prediction is made by averaging the predictions of all the individual trees.
Random...
Boosting is a machine learning ensemble technique where multiple weak learners are combined to create a strong learner.
Boosting is an iterative process where each weak learner is trained based on the errors of the previous learners.
Examples of boosting algorithms include AdaBoost, Gradient Boosting, and XGBoost.
Boosting is used to improve the accuracy of models and reduce bias and variance.
based on 5 reviews
Rating in categories
Senior Engineer
881
salaries
| ₹5.6 L/yr - ₹22.9 L/yr |
Senior Software Engineer
564
salaries
| ₹6.9 L/yr - ₹26.2 L/yr |
Software Engineer
273
salaries
| ₹3.5 L/yr - ₹14.5 L/yr |
Technical Specialist
208
salaries
| ₹10 L/yr - ₹38.5 L/yr |
Software Development Engineer
188
salaries
| ₹4.5 L/yr - ₹12 L/yr |
Accenture
Xoriant
CitiusTech
HTC Global Services