Filter interviews by
I applied via Naukri.com and was interviewed in Sep 2022. There were 3 interview rounds.
Top trending discussions
Java hash map is a data structure that stores key-value pairs and uses hashing to efficiently retrieve values based on keys.
HashMap in Java implements the Map interface and allows null keys and values.
It uses hashing to store and retrieve key-value pairs, providing O(1) time complexity for get() and put() operations.
Example: HashMap
posted on 9 Jan 2023
Find the second largest element from the array.
Sort the array in descending order and return the second element.
Iterate through the array and keep track of the two largest elements.
Use a priority queue to find the second largest element.
Sort array and return second last element
Use built-in sort function
Access second last element using array index -2
posted on 24 Aug 2022
I applied via Naukri.com and was interviewed in Jul 2022. There was 1 interview round.
I applied via Recruitment Consulltant and was interviewed in Nov 2021. There were 4 interview rounds.
I applied via Campus Placement and was interviewed in Sep 2024. There were 3 interview rounds.
There were 3 coding questions totally based on dsa- hard
Use Dijkstra's algorithm to find the node with the shortest distance in a graph.
Implement Dijkstra's algorithm to calculate the shortest distance from a starting node to all other nodes in the graph.
Select the node with the smallest distance that has not been visited yet as the current node.
Update the distances of neighboring nodes from the current node if the new distance is smaller than the previously recorded distan...
I applied via Naukri.com and was interviewed in Jul 2024. There was 1 interview round.
Arrow functions are more concise and have a lexical 'this' binding compared to normal functions.
Arrow functions do not have their own 'this' keyword, they inherit it from the parent scope.
Arrow functions do not have their own 'arguments' object.
Arrow functions cannot be used as constructors with 'new'.
Arrow functions are more concise and have implicit return when no curly braces are used.
forEach is used to iterate over an array and perform a function on each element, while map creates a new array by applying a function to each element.
forEach does not return a new array, while map does
forEach does not modify the original array, while map creates a new array
forEach is used for side effects, while map is used for transformation
Example: forEach - array.forEach(item => console.log(item)), map - const newAr
FIFO stands for First In, First Out. LIFO stands for Last In, First Out.
FIFO is a method for organizing and manipulating a data buffer, where the first element added is the first to be removed.
LIFO is a method where the last element added is the first to be removed.
FIFO is like a queue, while LIFO is like a stack.
Example: In a FIFO queue, if elements A, B, and C are added in that order, they will be removed in the same...
I applied via campus placement at Maulana Azad National Institute of Technology (NIT), Bhopal and was interviewed in Jul 2024. There were 2 interview rounds.
3 questions easy-medium level leetcode problem I solved 2 completely and 3rd question partially (9/15 test cases passed) to move on to 2nd round
based on 1 interview
Interview experience
Electrical Engineer
8
salaries
| ₹2.8 L/yr - ₹4.8 L/yr |
Supervisor
7
salaries
| ₹2.7 L/yr - ₹3.6 L/yr |
Safety Officer
6
salaries
| ₹3 L/yr - ₹5 L/yr |
C&I Engineer
5
salaries
| ₹3.6 L/yr - ₹5.5 L/yr |
Engineer
5
salaries
| ₹3.2 L/yr - ₹4.2 L/yr |
Adani Green Energy
Azure Power
ReNew
Acme Cleantech Solutions