Filter interviews by
Hashing is a technique used to map data to a fixed-size array, collision occurs when two different inputs produce the same hash value.
Hashing involves using a hash function to map data to a fixed-size array.
Collision happens when two different inputs produce the same hash value.
Common techniques to handle collisions include chaining and open addressing.
No, time complexity of HashMap is not always O(1).
Time complexity of HashMap is O(1) on average, but can degrade to O(n) in worst case scenarios.
Worst case scenarios include hash collisions, which can lead to linear probing and degrade performance.
Load factor and capacity of the HashMap can also affect time complexity.
In scenarios where many keys hash to the same index, the time complexity can degrade.
Common coding problems difficulty laver moderate
Top trending discussions
I applied via Referral and was interviewed in Sep 2024. There were 2 interview rounds.
Node.js is a runtime environment that allows you to run JavaScript on the server side.
Node.js is built on Chrome's V8 JavaScript engine.
It uses an event-driven, non-blocking I/O model that makes it lightweight and efficient.
Node.js is commonly used for building server-side applications, APIs, and real-time applications.
It has a large ecosystem of libraries and frameworks, such as Express.js and Socket.io.
In Node.js, timers can be implemented using functions like setTimeout() and setInterval().
Use setTimeout() to execute a function once after a specified delay
Use setInterval() to execute a function repeatedly at a specified interval
Clear a timer using clearTimeout() or clearInterval()
Example: setTimeout(() => { console.log('Timer executed!'); }, 2000);
posted on 8 Jun 2022
I applied via Referral and was interviewed in May 2022. There were 2 interview rounds.
SDLC, Core Programming Langage, Agile, Architectures
posted on 10 Nov 2024
I applied via Approached by Company and was interviewed in Oct 2024. There were 2 interview rounds.
1 dsa question 1 sql and 18 mcq questions
Binary Search questions
posted on 9 Dec 2024
Tree algorithm about some riddels
gcd stands for greatest common divisor, the largest positive integer that divides two or more numbers without leaving a remainder.
gcd is used to find the largest integer that can evenly divide two or more numbers.
It is commonly used in mathematics and computer science algorithms.
For example, the gcd of 12 and 18 is 6, as 6 is the largest number that can divide both 12 and 18 without leaving a remainder.
ARC stands for Automatic Reference Counting, a memory management technique used in programming languages like Objective-C and Swift.
ARC automatically tracks and manages the memory used by objects in a program
It increases the retain count of an object when it is referenced and decreases it when it is no longer needed
ARC helps prevent memory leaks and retain cycles in iOS and macOS development
based on 4 reviews
Rating in categories
Junior Engineer
171
salaries
| ₹2 L/yr - ₹4.5 L/yr |
Lead Engineer
53
salaries
| ₹12 L/yr - ₹23 L/yr |
Trainee
47
salaries
| ₹1.5 L/yr - ₹3 L/yr |
Assistant Engineer
46
salaries
| ₹3.4 L/yr - ₹5.5 L/yr |
Enterprise Application Engineer
35
salaries
| ₹8.9 L/yr - ₹15 L/yr |
Rolls-Royce
Pratt & Whitney
Honeywell Aerospace
Safran Aircraft Engines