Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Amnex Infotechnologies Team. If you also belong to the team, you can get access from here

Amnex Infotechnologies Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Amnex Infotechnologies Java Developer Interview Questions and Answers

Updated 4 Jul 2024

Amnex Infotechnologies Java Developer Interview Experiences

1 interview found

Java Developer Interview Questions & Answers

user image Milan Gondaliya

posted on 4 Jul 2024

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Jun 2024. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. What is overriding
  • Ans. 

    Overriding is a concept in object-oriented programming where a subclass provides a specific implementation of a method that is already provided by its superclass.

    • Occurs when a subclass provides a specific implementation of a method that is already provided by its superclass

    • Method in subclass must have the same name, return type, and parameters as the method in superclass

    • Used to achieve runtime polymorphism

    • Example: clas...

  • Answered by AI
  • Q2. What is overloading
  • Ans. 

    Overloading is the ability to define multiple methods in the same class with the same name but different parameters.

    • Overloading allows a class to have multiple methods with the same name but different parameters.

    • The compiler determines which method to call based on the number and type of arguments passed.

    • Example: having multiple methods named 'calculate' in a class, with different parameter types like int, double, floa

  • Answered by AI

Java Developer Jobs at Amnex Infotechnologies

View all

Interview questions from similar companies

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

Round duration - 30 minutes
Round difficulty - Medium

This was a MCQ round. 30 ques in 30 mins consisting of difficult quantitative aptitude questions were to be solved.

Round 2 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

In this test round, 2 coding questions were given. Either write the code or pseudo code

  • Q1. 

    N Queens Problem

    Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.

    Explanation:

    A queen can attack another queen if they ar...

  • Ans. 

    The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.

    • Use backtracking algorithm to explore all possible configurations.

    • Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.

    • Generate all valid configurations and print them out.

  • Answered by AI
  • Q2. 

    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...
  • Ans. 

    Sort an array of 0s, 1s, and 2s in linear time complexity.

    • Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.

    • Swap elements based on the values encountered to sort the array in-place.

    • Time complexity should be O(N) and space complexity should be O(1).

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions on DSA.

  • Q1. 

    Reverse Words in a String: Problem Statement

    You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...

  • Ans. 

    Reverse words in a string while handling leading, trailing, and multiple spaces.

    • Split the input string by spaces to get individual words

    • Reverse the order of the words

    • Join the reversed words with a single space in between

  • Answered by AI
  • Q2. 

    Circular Linked List Detection

    You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.

    Note:
    • A linked list is considered circula...
  • Ans. 

    Detect if a given linked list is circular by checking if it forms a closed loop.

    • Traverse the linked list using two pointers, one moving at double the speed of the other.

    • If the two pointers meet at any point, the linked list is circular.

    • If the faster pointer reaches the end of the list (NULL), the linked list is not circular.

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMAQ Software interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Sep 2023. There were 3 interview rounds.

Round 1 - Aptitude Test 

Basic aptitude questions

Round 2 - Coding Test 

3 basic questions they asked

Round 3 - Coding Test 

Pointer and SQL related questions

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Jul 2022. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

3 Questions of mid difficulty

Round 3 - Coding Test 

2 questions of mid to hard difficulty

Round 4 - Technical 

(2 Questions)

  • Q1. Basic DSA and problem solving related questions
  • Q2. How to design and implement a dictionary application
  • Ans. 

    Design and implement a dictionary application for easy word lookup

    • Define data structure to store words and their meanings

    • Implement search functionality to look up words quickly

    • Include features like word suggestions, synonyms, and antonyms

    • Allow users to add new words and meanings to the dictionary

    • Consider implementing a user-friendly interface for easy navigation

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
More than 8 weeks
Result
Selected Selected

I appeared for an interview before Feb 2023.

Round 1 - Aptitude Test 

Good and easy learn dsa and algo

Round 2 - Coding Test 

Learn dsa and algo binary tree and lists

Round 3 - Technical 

(1 Question)

  • Q1. Learn basic subjects and topics like OS and Cloud
Round 4 - HR 

(1 Question)

  • Q1. Short round based on aptitude and attidtude
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Aptitude,reasoning,verbal,C language,Java,C++

Round 2 - Technical 

(2 Questions)

  • Q1. What is interface in JAVA
  • Q2. Explain OOPS in JAVA

Interview Preparation Tips

Interview preparation tips for other job seekers - NA
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Apr 2023. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Properly align and format text in your resume. A recruiter will have to spend more time reading poorly aligned text, leading to high chances of rejection.
View all tips
Round 2 - Coding Test 

It was an 1hr interview session

Round 3 - One-on-one 

(1 Question)

  • Q1. Find the occurrence of each element in an array
  • Ans. 

    Count the occurrence of each element in an array of strings

    • Iterate through the array and use a hashmap to store the count of each element

    • If element already exists in the hashmap, increment its count by 1

    • Return the hashmap with element counts

  • Answered by AI
Round 4 - HR 

(1 Question)

  • Q1. Tell me about yourself

Interview Preparation Tips

Topics to prepare for MAQ Software Software Developer interview:
  • array
  • string
  • map
  • dynamic programming

Skills evaluated in this interview

I appeared for an interview in Mar 2021.

Round 1 - Coding Test 

(4 Questions)

Round duration - 120 minutes
Round difficulty - Medium

Timing was 9: 30 AM. Platform was quite good and easy to understand.

  • Q1. 

    Reverse Only Letters Problem Statement

    You are given a string S. The task is to reverse the letters of the string while keeping non-alphabet characters in their original position.

    Example:

    Input:
    S = "...
  • Ans. 

    Reverse the letters of a string while keeping non-alphabet characters in their original position.

    • Iterate through the string and maintain two pointers, one at the start and one at the end, to reverse only the letters

    • Use isalpha() function to check if a character is an alphabet or not

    • Swap the letters at the two pointers until they meet in the middle

  • Answered by AI
  • Q2. 

    Find Duplicates in an Array

    Given an array ARR of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.

    Return the duplicate elements in any orde...

  • Ans. 

    Find duplicates in an array of integers within a specified range.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Return elements with count greater than 1 as duplicates.

    • Time complexity can be optimized to O(N) using a set to store duplicates.

    • Example: For input [0, 3, 1, 2, 3], output should be [3].

  • Answered by AI
  • Q3. 

    Pancake Sorting Problem Statement

    You are given an array of integers 'ARR'. Sort this array using a series of pancake flips. In each pancake flip, you need to:

    Choose an integer 'K' where 1 <= 'K' <...
  • Ans. 

    Sort an array using pancake flips and return the sequence of flips made.

    • Iterate through the array and find the position of the maximum element in each iteration.

    • Perform pancake flips to move the maximum element to the correct position.

    • Continue this process until the array is sorted.

    • Return the sequence of positions from where flips were made.

  • Answered by AI
  • Q4. 

    Sum of Digits Problem Statement

    Given an integer 'N', continue summing its digits until the result is a single-digit number. Your task is to determine the final value of 'N' after applying this operation ...

  • Ans. 

    Given an integer, find the final single-digit value after summing its digits iteratively.

    • Iteratively sum the digits of the given integer until the result is a single-digit number

    • Output the final single-digit integer for each test case

    • Handle multiple test cases efficiently

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Medium

Timing was 9:30 AM. The interviewer was very nice.

  • Q1. 

    Fibonacci Number Verification

    Identify if the provided integer 'N' is a Fibonacci number.

    A number is termed as a Fibonacci number if it appears in the Fibonacci sequence, where each number is the sum of...

  • Ans. 

    Check if a given number is a Fibonacci number or not.

    • Iterate through the Fibonacci sequence until you find a number greater than or equal to the given number.

    • Check if the given number matches the Fibonacci number found in the sequence.

    • If the number matches, output 'YES'; otherwise, output 'NO'.

  • Answered by AI
  • Q2. Write an SQL query to find the second highest salary from a table.
  • Ans. 

    SQL query to find the second highest salary from a table

    • Use the MAX() function to find the highest salary

    • Use the WHERE clause to exclude the highest salary

    • Order the salaries in descending order and limit the result to 1

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 30 Minutes
Round difficulty - Medium

Timing was 12 PM. Interviewer was not good.

  • Q1. 

    Character Frequency Problem Statement

    You are given a string 'S' of length 'N'. Your task is to find the frequency of each character from 'a' to 'z' in the string.

    Example:

    Input:
    S : abcdg
    Output:
    1...
  • Ans. 

    The task is to find the frequency of each character from 'a' to 'z' in a given string.

    • Create an array of size 26 to store the frequency of each character from 'a' to 'z'.

    • Iterate through the string and increment the count of the corresponding character in the array.

    • Print the array of frequencies as the output for each test case.

  • Answered by AI
  • Q2. What is normalization and can you explain the concept of Third Normal Form (3NF)?
  • Ans. 

    Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.

    • Normalization is a technique used to organize data in a database efficiently.

    • Third Normal Form (3NF) is a level of normalization that ensures that data is stored in a way that prevents certain types of data anomalies.

    • In 3NF, every non-prime attribute is fully functionally dependent on the primary key.

    • For exampl...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteriaAbove 8 CGPAMAQ Software interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming, DBMS, OSTime required to prepare for the interview - 2.5 monthsInterview preparation tips for other job seekers

Tip 1 : Do 2 projects.
Tip 2 : Practice data structures programs.
Tip 3 : Take a course on Coding Ninjas.

Application resume tips for other job seekers

Tip 1 : Keep it short.
Tip 2 : Do not put false things on resume.

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview in Apr 2021.

Round 1 - Coding Test 

(4 Questions)

Round duration - 120 minutes
Round difficulty - Easy

Timing was 9: 30 AM. Platform was quite good and easy to understand.

  • Q1. 

    Reverse Only Letters Problem Statement

    You are given a string S. The task is to reverse the letters of the string while keeping non-alphabet characters in their original position.

    Example:

    Input:
    S = "...
  • Ans. 

    Reverse the letters of a string while keeping non-alphabet characters in their original position.

    • Iterate through the string and store the non-alphabet characters in their original positions

    • Reverse the letters using two pointers technique

    • Combine the reversed letters with the non-alphabet characters to get the final reversed string

  • Answered by AI
  • Q2. 

    Find the Duplicate Number Problem Statement

    Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...

  • Ans. 

    Find the duplicate number in an array of integers from 0 to N-2.

    • Iterate through the array and keep track of the frequency of each number using a hashmap.

    • Return the number with a frequency greater than 1 as the duplicate number.

  • Answered by AI
  • Q3. 

    Reverse Array Elements

    Given an array containing 'N' elements, the task is to reverse the order of all array elements and display the reversed array.

    Explanation:

    The elements of the given array need to...

  • Ans. 

    Reverse the order of elements in an array and display the reversed array.

    • Iterate through the array from both ends and swap the elements until the middle is reached.

    • Use a temporary variable to store the element being swapped.

    • Print the reversed array after all elements have been swapped.

  • Answered by AI
  • Q4. 

    Sum of Digits Problem Statement

    Given an integer 'N', continue summing its digits until the result is a single-digit number. Your task is to determine the final value of 'N' after applying this operation ...

  • Ans. 

    Given an integer, find the final single-digit value after summing its digits iteratively.

    • Iteratively sum the digits of the given integer until the result is a single-digit number

    • Output the final single-digit integer for each test case

    • Handle multiple test cases efficiently

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Easy

Timing was 9:30 AM. The interviewer was very nice.

  • Q1. 

    Nth Fibonacci Number Problem Statement

    Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.

    Input:

    ...
  • Ans. 

    Calculate the Nth Fibonacci number efficiently using dynamic programming.

    • Use dynamic programming to store and reuse previously calculated Fibonacci numbers.

    • Start with base cases F(1) and F(2) as 1, then calculate subsequent Fibonacci numbers.

    • Optimize the solution to avoid redundant calculations by storing intermediate results.

    • Time complexity can be reduced to O(N) using dynamic programming.

    • Example: For N = 5, the 5th F

  • Answered by AI
  • Q2. Write an SQL query to find the second highest salary from a table.
  • Ans. 

    SQL query to find the second highest salary from a table

    • Use the MAX() function to find the highest salary

    • Use the NOT IN operator to exclude the highest salary from the results

    • Order the results in descending order and limit the query to return only the second row

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Medium

Timing was 12 PM. Interviewer was not good.

  • Q1. 

    Character Frequency Problem Statement

    You are given a string 'S' of length 'N'. Your task is to find the frequency of each character from 'a' to 'z' in the string.

    Example:

    Input:
    S : abcdg
    Output:
    1...
  • Ans. 

    The task is to find the frequency of each character from 'a' to 'z' in a given string.

    • Create an array of size 26 to store the frequency of each character from 'a' to 'z'.

    • Iterate through the string and increment the corresponding index in the array for each character encountered.

    • Print the array of frequencies as the output for each test case.

  • Answered by AI
  • Q2. What is normalization and can you explain the concept of Third Normal Form (3NF)?
  • Ans. 

    Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.

    • Normalization is a database design technique used to structure a relational database in a way that reduces data redundancy and improves data integrity.

    • Third Normal Form (3NF) is a level of database normalization where every non-prime attribute of a table is dependent on the primary key.

    • To achieve 3NF, a table m...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteriaAbove 8 CGPAMAQ Software interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Do 2 projects.
Tip 2 : Practice data structures programs.
Tip 3 : Take a course on Coding Ninjas.

Application resume tips for other job seekers

Tip 1 : Keep it short.
Tip 2 : Do not put false things on resume.

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview in Oct 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

There were two section Aptitude and Coding.

  • Q1. 

    Buy and Sell Stock Problem Statement

    Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...

  • Ans. 

    The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.

    • Iterate through the array of stock prices and calculate the maximum profit that can be achieved by buying and selling at different points.

    • Keep track of the maximum profit after the first transaction and the maximum profit overall by considering different combinations of buy a...

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

This was the first technical interview.

  • Q1. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Find pairs of elements in an array that sum up to a given value, sorted in a specific order.

    • Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.

    • Keep track of pairs in a hash set to avoid duplicates.

    • Sort the pairs based on the criteria mentioned in the question.

    • Return the sorted list of pairs.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from National Institute of Technology, Raipur. I applied for the job as SDE - 1 in HyderabadEligibility criteria7 CGPAMAQ Software interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, Operating System, DBMS, Computer NetworksTime required to prepare for the interview - 6 MonthsInterview preparation tips for other job seekers

Tip 1 : Prepare theory subjects well
Tip 2 : Start doing some development and learn a framework from 2nd year
 

Application resume tips for other job seekers

Tip 1: Mention projects with technologies
Tip 2: Make important words in bold

Final outcome of the interviewRejected

Skills evaluated in this interview

Amnex Infotechnologies Interview FAQs

How many rounds are there in Amnex Infotechnologies Java Developer interview?
Amnex Infotechnologies interview process usually has 1 rounds. The most common rounds in the Amnex Infotechnologies interview process are Technical.
How to prepare for Amnex Infotechnologies Java Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Amnex Infotechnologies. The most common topics and skills that interviewers at Amnex Infotechnologies expect are Angular, Java, Spring Boot, MVC and Postgresql.
What are the top questions asked in Amnex Infotechnologies Java Developer interview?

Some of the top questions asked at the Amnex Infotechnologies Java Developer interview -

  1. What is overrid...read more
  2. What is overload...read more

Tell us how to improve this page.

Amnex Infotechnologies Java Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
Amnex Infotechnologies Java Developer Salary
based on 6 salaries
₹3.1 L/yr - ₹10 L/yr
5% less than the average Java Developer Salary in India
View more details

Amnex Infotechnologies Java Developer Reviews and Ratings

based on 1 review

3.0/5

Rating in categories

4.0

Skill development

4.0

Work-life balance

2.0

Salary

4.0

Job security

3.0

Company culture

3.0

Promotions

4.0

Work satisfaction

Explore 1 Review and Rating
JAVA Developer

Ahmedabad

1-4 Yrs

₹ 3.05-5.5 LPA

Explore more jobs
Software Developer
51 salaries
unlock blur

₹2.8 L/yr - ₹12.2 L/yr

Associate Consultant
44 salaries
unlock blur

₹1.9 L/yr - ₹6.8 L/yr

Project Manager
43 salaries
unlock blur

₹3.8 L/yr - ₹16 L/yr

Senior Software Developer
28 salaries
unlock blur

₹4.4 L/yr - ₹13.3 L/yr

System Analyst
22 salaries
unlock blur

₹2.2 L/yr - ₹6 L/yr

Explore more salaries
Compare Amnex Infotechnologies with

MAQ Software

1.9
Compare

Alchemy Techsol India

3.7
Compare

Apisero

4.3
Compare

Tudip Technologies

3.1
Compare
Did you find this page helpful?
Yes No
write
Share an Interview