Filter interviews by
Top trending discussions
posted on 3 Feb 2025
I was interviewed in Jan 2025.
posted on 7 Jan 2025
Group discussion (GD) involves addressing a specific problem or situation collaboratively through discussion and problem-solving.
Group discussion (GD) entails tackling a specific issue or topic collaboratively.
My attitude is typical.
My CV is attached for your review.
The question is asking about the origin or starting point of something.
The question could be referring to the origin of a flight or transportation service.
It could also be asking about the source or starting point of a process or system.
Examples: 'Where is the flight running from?' or 'Where is the project running from?'
An HR representative can be someone from the HR department or a designated employee trained in HR responsibilities.
HR department staff
Designated employee with HR training
External HR consultant
Manager with HR responsibilities
The human resources department is structured with specialized teams handling recruitment, training, employee relations, and benefits.
The human resources department is typically divided into teams such as recruitment, training and development, employee relations, and benefits administration.
Each team is responsible for specific functions within the HR department, such as sourcing and hiring new employees, providing trai...
posted on 21 Jan 2025
I applied via Recruitment Consulltant and was interviewed in Dec 2024. There was 1 interview round.
I applied via Company Website and was interviewed in Aug 2024. There were 3 interview rounds.
I was interviewed in Dec 2024.
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.
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 Company Website and was interviewed in Oct 2024. There were 3 interview rounds.
So many coding words and also maths Question in percentage of clothes price about nature types
10 th pass Question Ans and are very easy to solve i like it very much i try to do my best.
I applied via Recruitment Consulltant and was interviewed in Aug 2024. There were 2 interview rounds.
I handled data imbalance by using techniques like oversampling, undersampling, SMOTE, or using ensemble methods.
Used oversampling to increase minority class instances
Used undersampling to decrease majority class instances
Applied SMOTE (Synthetic Minority Over-sampling Technique) to generate synthetic samples for minority class
Utilized ensemble methods like Random Forest or Gradient Boosting to handle imbalance
Advanced sql and basics of data science
posted on 29 Jan 2025
I was interviewed before Jan 2024.
Interview experience
InterGlobe Aviation
Air India Sats Airport Services
Qatar Airways
Airports Authority of India