Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Dec 2022. There were 3 interview rounds.
AA stands for Alcoholics Anonymous, a support group for individuals struggling with alcohol addiction.
AA is a 12-step program that emphasizes spiritual growth and personal accountability.
Meetings are held regularly and are open to anyone seeking help with alcohol addiction.
Anonymity is a key principle of AA, and members are encouraged to maintain confidentiality.
Sponsorship is also an important aspect of AA, where expe...
It was more of a discussion of the project I worked on, and the technologies I used...They asked me two basic SQL questions (it is a full stack position, though), and also about the Azure cloud platform.
Top trending discussions
I applied via Recruitment Consulltant and was interviewed in Feb 2024. There was 1 interview round.
Write a simple algorithm for string manipulation
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
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.
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
I was interviewed before Sep 2023.
Multithreading allows multiple threads to run concurrently within a single process, improving performance and responsiveness.
Multithreading allows for parallel execution of tasks within a single process.
Threads share the same memory space, allowing for efficient communication and data sharing.
Thread management is handled by the operating system, which schedules threads for execution.
Examples of multithreading include w...
Simple string manipulation
based on 1 review
Rating in categories
Associate
27
salaries
| ₹7.6 L/yr - ₹27.2 L/yr |
Aadhaar Enrolment Operator
25
salaries
| ₹8.9 L/yr - ₹28 L/yr |
Assistant Manager
23
salaries
| ₹9.9 L/yr - ₹31 L/yr |
Aadm
20
salaries
| ₹10.6 L/yr - ₹33 L/yr |
Software Engineer
17
salaries
| ₹6.4 L/yr - ₹26 L/yr |
Delta Air Lines
United Airlines
Southwest Airlines
Air India