Aviotron Aerospace pvt Ltd interview experience Real time questions & tips from candidates to crack your interview

Backend Developer

Aviotron Aerospace pvt Ltd

1 rounds | 2 Coding problems

Anonymous

Fresher | Jan 2025

Rejected

Interview preparation journey

Journey

My journey began with learning programming languages like C, C++, and Java, gradually progressing to web development and problem-solving through competitive programming, projects, and internships. Along the way, I explored frameworks like React, honed technical skills, and improved communication and teamwork. Preparing for this company, I focused on aligning my skills with its core values of innovation and collaboration. I worked on impactful projects, learned from challenges, and gained hands-on experience that strengthened my confidence. This journey taught me persistence, adaptability, and the importance of continuous learning, shaping me into a well-rounded individual ready to contribute meaningfully in a dynamic environment.

Application story

I applied for the position online, which led to the interview process. During the interview, I had the opportunity to showcase my skills and discuss my previous work. The entire journey was a valuable learning experience, helping me understand the role better and identify areas for improvement in my preparation.

Why selected/rejected for the role?

I was not selected for the role because I lacked confidence in explaining my thought process during one of the coding questions. While I had a good understanding of the underlying concepts, I struggled to effectively communicate my approach and reasoning to the interviewer. Also I was not able to solve one interview question given to me by the interviewer.

Preparation

Duration: 1.5 Months

Topics: Array, String, Sliding Window, OOPS, Trees, Linked List, Hash Maps, Node JS, JavaScript, Python-Flask

Tip

Tip 1: Collaborate on GitHub projects to showcase your skills, learn teamwork, and gain real-world coding experience.
Tip 2: Practice at least 100-150 coding questions to strengthen problem-solving skills on online coding platforms.
Tip 3: Simulate interview scenarios to improve problem-solving, communication, and time management under pressure.

Application process

Where: Other

Eligibility: NA, (Salary package: 4.2 LPA)

Resume tip

Tip 1: Have 3 unique and full stack projects according to the role you're applying to.
Tip 2: Avoid including inaccurate information on your resume.

Interview rounds

Round

Hard

Face to Face

Duration80 minutes

Interview date13 Jan 2025

Coding problem2

1. Longest Increasing Subsequence

Moderate

30m average time

65% success

0/80

Asked in companies

Find the longest increasing subsequence in a given array of integers in O(n log n) time complexity

Problem approach

I was not able to solve this.

Try solving now

2. Kth Smallest Element

Moderate

0/80

Asked in companies

Given a 2D matrix of integers, where each row is sorted in ascending order, find the kth smallest element in the matrix. You cannot flatten the matrix or use sorting. Solve this problem in O(n log k) time complexity, where n is the total number of elements in the matrix.

Problem approach

Step 1: Initialize a min-heap to keep track of the smallest elements in the matrix. This heap will store elements in the form of (value, row, column), where value is the element's value, and row and column represent its position in the matrix.
Step 2: Traverse the matrix and perform the following steps:
For the first element of each row, push it into the heap.
If the heap has fewer than k elements, continue adding elements from the same row. For each new element, store its value along with its corresponding row and column index.
Step 3: Pop the smallest element from the heap and replace it with the next element from the same row (if available). Repeat this process k-1 times:
For each pop operation, if there’s a next element in the same row, push it into the heap.
Step 4: After k-1 pops, the root of the heap will hold the kth smallest element in the matrix. Return this value.

Try solving now