Filter interviews by
I applied via LinkedIn and was interviewed in Dec 2023. There were 2 interview rounds.
Hashmap is a data structure that stores key-value pairs and allows for fast retrieval of values based on keys.
Hashmap uses a hashing function to map keys to indices in an array.
It allows for constant time complexity O(1) for insertion, deletion, and retrieval operations.
In Java, HashMap is a commonly used implementation of the Map interface.
A red-black tree is a self-balancing binary search tree with additional properties to ensure balance and efficient operations.
Red-black trees have nodes colored red or black, with rules to maintain balance during insertion and deletion.
Each node has an extra bit for color, and the tree must satisfy properties like no two red nodes in a row.
Operations like insertion and deletion involve rotations and color changes to ma...
I applied via Campus Placement and was interviewed in Feb 2022. There were 2 interview rounds.
1 Hour, Basic Java, Array, DSA Questions
Binary search on a linked list involves dividing the list into halves and searching for the target value.
Linked list must be sorted before binary search can be performed.
Binary search on linked list has a time complexity of O(log n).
The middle element of the linked list is found using slow and fast pointers.
If the target value is less than the middle element, search the left half of the list. If it's greater, search th...
A palindrome string is a string that reads the same backward as forward. Efficient methods include using two pointers and reversing the string.
Use two pointers, one starting from the beginning and the other from the end, and compare the characters at each position until they meet in the middle.
Reverse the string and compare it to the original string. If they are the same, it is a palindrome.
Use recursion to check if th...
Top trending discussions
I applied via Campus Placement
Question related to operating system and computer network
Traverse all child nodes in a tree data structure
Use depth-first or breadth-first traversal algorithms
Recursively visit each child node starting from the root node
Consider using a stack or queue data structure for traversal
Example: Traverse all nodes in a binary tree
posted on 9 Dec 2024
I applied via Approached by Company and was interviewed in Nov 2024. There were 2 interview rounds.
I applied via Naukri.com and was interviewed in Dec 2024. There were 2 interview rounds.
Java based questions and few DSA questions
I applied via Walk-in and was interviewed in Nov 2024. There were 2 interview rounds.
1st round is aptitude and pesudocode
Basic questions were given..bar graphs,pie charts
Oops concept stands for Object-Oriented Programming concepts which include principles like inheritance, encapsulation, polymorphism, and abstraction.
Oops concept is a programming paradigm that focuses on objects and classes.
It includes principles like inheritance, where a class can inherit properties and behaviors from another class.
Encapsulation is another principle where data is wrapped within a class and can only be...
based on 3 interviews
Interview experience
based on 5 reviews
Rating in categories
Software Engineer
87
salaries
| ₹7 L/yr - ₹23.3 L/yr |
Lead Engineer
70
salaries
| ₹16 L/yr - ₹36 L/yr |
Software Engineer Level 1
53
salaries
| ₹9.5 L/yr - ₹19 L/yr |
Devops Engineer
47
salaries
| ₹5.5 L/yr - ₹17.2 L/yr |
Lead Consultant
38
salaries
| ₹14 L/yr - ₹38 L/yr |
Experian
TransUnion
Equifax
Crif High Mark Credit Information Services