AirAsia Senior Software Engineer and Lead Interview Questions and Answers

C and c++ collectively 20 questions.14 is my achievement by the grace of Allah and his messager(S.A.W) peace be upon him.

Q1. C,c++,os,dsa,core cse subjects
Add your answer

Q1. I was frustrated attending many interviews every one told me WE WILL GET BACK YOU.Same thing told in this company also by both HR I thing Anitha mam and our respective DIRECTOR SIR Prasad chorgudi.But fina...read more
Add your answer

Q1. Node js working in detail
Ans. 
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.
Answered by AI
Add your answer
Q2. Timer working in node
Ans. 
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);
Answered by AI
Add your answer

Q1. HLD questions on db and backend
Add your answer
Q2. Relational non relational db
Add your answer

Q1. What is the internal implementation of Hashing and what is collision?
Ans. 
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.
Answered by AI
Add your answer
Q2. Is time complexity of HashMap always O(1) ?
Ans. 
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.
Answered by AI
Add your answer

Q1. Yet to have the interview. Ambition box is forcefully making me enter these details
Add your answer

1 dsa question 1 sql and 18 mcq questions

Q1. Lot of questions from resumes and projects
Add your answer
Q2. Easy DSA questions and oops questions
Add your answer

Q1. AWS system design question
Add your answer

Q1. About sdlc stlc manual testing topics
Add your answer

Q1. Coding, few automation topics
Add your answer

Q1. General topics discussion
Add your answer

Q1. Salary Discussion
Add your answer

Tree algorithm about some riddels

Q1. What is gcd? And explain it
Ans. 
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.
Answered by AI
Add your answer
Q2. What is arc and explain it
Ans. 
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
Answered by AI
Add your answer