Axtria Software Developer Interview Questions and Answers

Arithmetic questions and logical

Aptitude auestions were there

In this round 14 mcq and 2 sql queries were given

Q1. Fundamentals based upon the role
Add your answer

Q1. Basic advance question into the technical skills like if you’re applying for backend role and your preferred language is java then how does the stack and queue works
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

Q1. 
Fruits and Baskets Problem Statement
You are given 'n' fruit trees planted along a road, numbered from 0 to n-1. Each tree bears a fruit type represented by an uppercase English alphabet. A Ninja walking ...read more
Ans. 
The problem is to find the maximum number of fruits the Ninja can put in both baskets after satisfying given conditions.
• The Ninja can start at any tree and end at any tree, but cannot skip a tree.

• He can pick one fruit from each tree until he cannot, i.e., when he has to pick a fruit of the third type.

• The restriction is that each basket can have only one type of fruit.

• We need to find the maximum number of fruits that ca
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

Was Shortlisted For this round with in total of 22 students, 7 in my profile.
It was Technical round with 30 mins of time allotted.
The interviewer was friendly, started with basic questions about me followed by project specific and then a puzzle.

Q1. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. 
The problem requires sorting an array of 0s, 1s, and 2s in a single scan.
• Use three pointers to keep track of the positions of 0s, 1s, and 2s.

• Initialize the low pointer at the beginning of the array and the high pointer at the end.

• Iterate through the array using a current pointer and swap elements based on their values.

• Move the pointers accordingly until the array is sorted.

• The time complexity of this solution is O(N) a
Answered by AI
Add your answer

Round duration - 20 Minutes
Round difficulty - Hard

The interview was scheduled for 15 mins and 12 students were shortlisted for this round. 5 in my profile.
The interviewer didn't on his video whereas mine was, the interviewer was friendly and maintained a poker voice.
Asked Basic HR questions but crossed questioned several times.

Q1. What is treeset and weakhashmap?
Ans. 
TreeSet is a sorted set implementation in Java. WeakHashMap is a hash table-based Map implementation with weak keys.
• TreeSet is implemented using a tree structure and maintains elements in sorted order.

• WeakHashMap is a Map implementation that allows keys to be garbage collected when they are no longer referenced.

• WeakHashMap is useful for caching or memoization where the keys are not always needed and can be garbage coll
Answered by AI
Add your answer
Q2. What is comparable and comparator?
Ans. 
Comparable and Comparator are interfaces used for sorting objects in Java.
• Comparable interface is used to define the natural ordering of objects based on their own class.

• Comparator interface is used to define the ordering of objects based on a separate class.

• Comparable interface has compareTo() method while Comparator interface has compare() method.

• Comparable interface is implemented by the class whose objects need to ...read more
Answered by AI
Add your answer

Basic dsa plus aptitude total of 50 ques

Q1. Array and array matrix coding question and some logical question
Add your answer

Q1. Noarmal hr question and then some logical tricky question , situation based question
Add your answer

Q1. Looker developer
Add your answer
Q2. Sql server
Add your answer

Q1. Looker developer
Add your answer
Q2. Sql server
Add your answer