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 toward securing a Backend Developer role at Aviotron Aerospace has been both enriching and inspiring. It all began with a strong foundation in data structures and algorithms (DSA). I firmly believe that a solid understanding of fundamental concepts is key to solving real-world problems, which is why I devoted significant time to mastering them. While preparing, I focused on understanding how various data structures function and their practical applications. This knowledge not only helped me tackle coding problems but also equipped me with the confidence to approach challenges logically and systematically. Another crucial aspect of my preparation was honing my problem-solving skills through consistent practice. I also emphasized backend-specific skills, such as learning about databases, APIs, and server-side programming, along with essential technical concepts like system design and scalability. I discovered the opportunity at Aviotron Aerospace through Indeed, where I applied and was shortlisted for an interview. The selection process involved two rounds, and my dedication to understanding core backend development principles and applying them effectively played a pivotal role in my progress. This experience has been instrumental in shaping my technical journey and preparing me for future opportunities in backend development.

Application story

I applied for the position through Indeed, 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 believe I was not selected for this role because they were looking for a candidate with more advanced skills in backend development, particularly someone with a more comprehensive portfolio showcasing hands-on experience with real-world projects. While I had a solid understanding of the required concepts, a stronger demonstration of my practical expertise and specialized backend work could have better aligned with their expectations for the role. This experience highlighted the importance of tailoring my preparation and portfolio to match the specific technical requirements and project scope of the position.

Preparation

Duration: 1 months

Topics: Arrays, Strings, Sliding Window, OOP, Trees, Linked Lists, HashMap, Node.js, JavaScript, Python (Flask)

Tip

Tip 1: Understand the problem logic, not just the solutions (e.g., arrays, strings, sliding window).

Tip 2: Practice coding trees, linked lists, and HashMaps from scratch.

Tip 3: Build projects using Node.js, JavaScript, and Flask to develop hands-on backend skills.

Application process

Where: Other

Eligibility: No criteria

Resume tip

Tip 1: Make sure you know your projects thoroughly and be honest about them.
Tip 2: Include relevant projects that effectively showcase your skills and experience.

Interview rounds

Round

Hard

Face to Face

Duration20 minutes

Interview date15 Jan 2025

Coding problem2

1. Search Insert Position

Easy

10m average time

85% success

0/40

Asked in companies

You are given a sorted array 'arr' of distinct values and a target value 'm'. You need to search for the index of the target value in the array.

Note:

1. If the value is present in the array, return its index.
2. If the value is absent, determine the index where it would be inserted in the array while maintaining the sorted order. 
3. The given array has distinct integers.
4. The given array may be empty.

Example:

Input:  arr = [1, 2, 4, 7],  m = 6 

Output: 3

Explanation: If the given array 'arr' is: [1, 2, 4, 7] and m = 6. We insert m = 6 in the array and get 'arr' as: [1, 2, 4, 6, 7]. The position of 6 is 3 (according to 0-based indexing)

Problem approach

Step 1: Initialize two pointers, left and right, which represent the start and end indices of the array. Set left = 0 and right = len(nums) - 1.

Step 2: Enter a while loop that runs until left is less than or equal to right. This will allow us to perform a binary search.

Step 3: Calculate the middle index, mid, using the formula mid = left + (right - left) // 2.

Step 4: Compare the element at mid with the target.

Try solving now

2. Kth largest element in the unsorted array

Moderate

10m average time

90% success

0/80

Asked in companies

You are given an array consisting of 'N' distinct positive integers and a number 'K'. Your task is to find the kth largest element in the array.

Example:

Consider the array {2,1,5,6,3,8} and 'K' = 3, the sorted array will be {8, 6, 5, 3, 2, 1}, and the 3rd largest element will be 5.

Note:

1) Kth largest element in an array is the kth element of the array when sorted in non-increasing order. 

2) All the elements of the array are pairwise distinct.

Problem approach

Step 1: Initialize a min-heap with a capacity of size k. This heap will be used to keep track of the k largest elements encountered so far.
Step 2: Traverse each row of the 2D array, and for each element, do the following:

If the size of the heap is less than k, push the current element into the heap.
If the size of the heap is already k, compare the current element with the smallest element (the root) of the heap:
- If the current element is larger than the root, replace the root by popping it and pushing the current element into the heap.

Step 3: After processing all elements of the 2D array, the root of the heap will hold the kth largest element.

Try solving now