Aiplex Software Software Developer Interview Questions and Answers

Q1. Tell me about your Project and why you use this tech for this project.
Add your answer
Q2. Find the mid element in the link list.
Ans. 
To find the mid element in a linked list, use two pointers - one moving at double the speed of the other.
• Initialize two pointers, slow and fast, both pointing to the head of the linked list.

• Move the slow pointer by one step and the fast pointer by two steps until the fast pointer reaches the end of the list.

• The element pointed to by the slow pointer at this point is the mid element of the linked list.
Answered by AI
Add your answer

Personal information, qualification,working or not

Q1. Job related questions
Add your answer
Q2. Salary discussion and job description
Add your answer
Q3. Role of the working and project discussion
Add your answer

Q1. You have a hotel and how will you create a complete schema for hotel
Ans. 
To create a complete schema for a hotel, you need to consider various entities like rooms, guests, reservations, staff, amenities, etc.
• Entities to include: rooms, guests, reservations, staff, amenities, invoices, payments

• Relationships between entities: guest stays in a room, staff manages reservations, amenities are available in rooms

• Attributes for each entity: room number, guest name, reservation date, staff ID, ameni
Answered by AI
Add your answer

Q1. They will ask you about core java
Add your answer

Round duration - 25 minutes
Round difficulty - Easy

This was face to face interview round. All questions asked by the interviewer were based on data structures.

Q1. Detect loop
Detect loop in linked list.
Ans. 
• I told the interviewer about two pointers approach that is using the concept of the slow and fast pointer. Then he asked me to write its code which I wrote very neatly with comments in the code.
Answered by CodingNinjas
View 3 more answers
Q2. Tree Symmetricity
Given a binary tree, check whether it is a mirror of itself.
 
For example, this binary tree is symmetric:
 
       1
    /      \
  2...read more
Ans. 
• I just give recursion based approach to the interviewer by checking the current root and calling the recursion on the left and right part. Also after the discussion of approach I wrote its functional code to the interviewer.
Answered by CodingNinjas
View 1 more answer
Q3. Anagram Pairs
Check whether two given strings are anagram or not.
Ans. 
• I firstly gave sorting and comparing solution, but he asked me to optimize it so I gave him a hashing based solution and he was satisfied by my approach.
Answered by CodingNinjas
View 2 more answers