Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Agilysys Technologies India Associate Software Engineer Interview Questions and Answers

Updated 2 Jul 2024

Agilysys Technologies India Associate Software Engineer Interview Experiences

2 interviews found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

A normal aptitude test

Round 2 - Coding Test 

A normal coding interview

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare Data structutes
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
-
Result
Selected Selected

I applied via Naukri.com and was interviewed before Feb 2023. There were 3 interview rounds.

Round 1 - Aptitude Test 

Multiple Choice Questions

Round 2 - Coding Test 

Right side view of a binary search tree

Round 3 - Technical 

(1 Question)

  • Q1. Technical HR with the director

Associate Software Engineer Interview Questions Asked at Other Companies

asked in Accenture
Q1. Triplets with Given Sum Problem Given an array or list ARR consis ... read more
asked in Gainsight
Q2. Connecting Ropes with Minimum Cost You are given 'N' ropes, each ... read more
Q3. Intersection of Two Arrays II Given two integer arrays ARR1 and A ... read more
asked in Clarivate
Q4. Best Time to Buy and Sell Stock II Problem Statement Given the st ... read more
Q5. Ninja and Alternating Largest Problem Statement Ninja is given a ... read more

Interview questions from similar companies

I applied via Campus Placement and was interviewed before Nov 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Basic programming questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident with answers

Interview Preparation Tips

Round: Test
Experience: Objective based questions covering general aptitude, c programming, algorithms, os, dbms, software engineering

Round: HR Interview
Experience: Candidates are eliminated after each round of interviews. Number of interviews varies from candidate to candidate. However 1 HR and 1 Tech interview is compulsory. Some may have separate tech and coding interviews.

General Tips: The 1st round aptitude paper is not too tough but ensures that not everyone is able to clear the cutoff.
In the tech interview programming questions were easy but OS questions are tricky and interviewer is looking for a candidate with a solid basics.
Skill Tips: Try to score as much as you can in the 1st written round. If you have a good score it will help you during the interviews. Try to score as much as you can in the 1st written round. If you have a good score it will help you during the interviews.
Do not spend too much effort on coding questions. Instead focus on fundamentals of OS, DBMS concepts like paging, threading, system calls etc
Skills:
College Name: NIT Surathkal

Interview Questionnaire 

1 Question

  • Q1. Tell me about yourself

Interview Preparation Tips

Interview preparation tips for other job seekers - Be yourself.

I was interviewed before May 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Timing - flexible 12 hours window to take the test. (9AM - 9PM)
Test was proctored

  • Q1. 

    Combination Sum Problem Statement

    Given three integers X, Y, and Z, calculate the sum of all numbers that can be formed using the digits 3, 4, and 5. Each digit can be used up to a maximum of X, Y, and Z ...

  • Ans. 

    Calculate the sum of all numbers that can be formed using the digits 3, 4, and 5 with given constraints.

    • Iterate through all possible combinations of 3, 4, and 5 based on the given constraints.

    • Calculate the sum of each combination and add them up.

    • Return the final sum modulo 10^9 + 7.

  • Answered by AI
  • Q2. 

    Longest Path In Directed Graph Problem Statement

    Given a Weighted Directed Acyclic Graph (DAG) comprising 'N' nodes and 'E' directed edges, where nodes are numbered from 0 to N-1, and a source node 'Src'....

  • Ans. 

    The task is to find the longest distances from a source node to all nodes in a weighted directed acyclic graph.

    • Implement a function that takes the number of nodes, edges, source node, and edge weights as input.

    • Use a topological sorting algorithm to traverse the graph and calculate the longest distances.

    • Return an array of integers where each element represents the longest distance from the source node to the correspondi

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 40 minutes
Round difficulty - Easy

Timing - 9:00 AM - 9:40 AM

  • Q1. 

    Factorial Trailing Zeros Problem

    You are provided with a positive integer N. Your goal is to determine the smallest number whose factorial has at least N trailing zeros.

    Example:

    Input:
    N = 1
    Output:
    ...
  • Ans. 

    Find the smallest number whose factorial has at least N trailing zeros.

    • Calculate the number of 5's in the prime factorization of the factorial to determine the trailing zeros.

    • Use binary search to find the smallest number with at least N trailing zeros.

    • Consider edge cases like N = 0 or N = 1 for factorial trailing zeros problem.

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a singly linked list of integers, your task is to return the head of the reversed linked list.

    Example:

    Input:
    The given linked list is 1 -> 2 -> 3 -&g...
  • Ans. 

    To reverse a singly linked list of integers, return the head of the reversed linked list.

    • Iterate through the linked list, reversing the pointers to point to the previous node instead of the next node.

    • Keep track of the previous, current, and next nodes while traversing the list.

    • Update the head of the reversed linked list to be the last element of the original list.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 40 minutes
Round difficulty - Easy

Timing - 12:00 Pm to 12:40 PM

  • Q1. 

    Implementing a Priority Queue Using Heap

    Ninja has been tasked with implementing a priority queue using a heap data structure. However, he is currently busy preparing for a tournament and has requested yo...

  • Ans. 

    Implement a priority queue using a heap data structure by completing the provided functions: push(), pop(), getMaxElement(), and isEmpty().

    • Understand the operations: push() to insert element, pop() to remove largest element, getMaxElement() to return largest element, and isEmpty() to check if queue is empty.

    • Implement a heap data structure to maintain the priority queue.

    • Handle different types of queries based on the inp...

  • Answered by AI
  • Q2. 

    Largest BST Subtree Problem

    Given a binary tree with 'N' nodes, determine the size of the largest subtree that is also a BST (Binary Search Tree).

    Input:

    The first line contains an integer 'T', represen...
  • Ans. 

    The problem involves finding the size of the largest subtree that is also a Binary Search Tree in a given binary tree.

    • Traverse the binary tree in a bottom-up manner to check if each subtree is a BST.

    • Keep track of the size of the largest BST subtree encountered so far.

    • Use recursion to solve the problem efficiently.

    • Consider edge cases like empty tree or single node tree.

    • Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1

  • Answered by AI
Round 4 - Video Call 

(1 Question)

Round duration - 40 minutes
Round difficulty - Medium

Timing - 6:00 PM - 6:30 PM

  • Q1. Can you design a system similar to Splitwise and identify three features that you would change or improve?
  • Ans. 

    Design a system similar to Splitwise and suggest three features for improvement.

    • Implement a real-time notification system for updates on shared expenses

    • Integrate a feature for automatic currency conversion for international transactions

    • Enhance the user interface with data visualization tools for better expense tracking

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Netaji Subhas University Of Technology. I applied for the job as Associate Software Engineer in BangaloreEligibility criteriaNo criteriaSalesforce interview preparation:Topics to prepare for the interview - Data Structures, Dynamic Programming, OOPS, OS, DBMS.Time required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : For fresher role, System design is not very important.
Tip 2 : Do at least 1-2 good quality projects.
 

Application resume tips for other job seekers

Tip 1 : Have 1-2 good engaging projects in resume.
Tip 2 : Internships are helpful.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Referral and was interviewed in Jul 2023. 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 Resume tips
Round 2 - Assignment 

Platform - Hackerrank
time- 90 minutes
2 dsa questions
output- got link for technical interview same day

Round 3 - Technical 

(2 Questions)

  • Q1. Binary tree traversal
  • Q2. Longest common subsequence
  • Ans. 

    Longest common subsequence is the longest sequence of characters that appear in the same order in both strings.

    • Use dynamic programming to solve this problem efficiently.

    • Create a 2D array to store the lengths of longest common subsequences.

    • Iterate through the strings and fill the array based on the characters' matches.

    • Trace back the array to find the actual longest common subsequence.

  • Answered by AI
Round 4 - Technical 

(2 Questions)

  • Q1. Medium questions on OOPS
  • Ans. Questions on polymorphism and a design class question
  • Answered Anonymously
  • Q2. Explain all projects
  • Ans. Explain in detail and interviewer asked followup questions
  • Answered Anonymously

Interview Preparation Tips

Topics to prepare for SAP Associate Software Engineer interview:
  • OOPS
Interview preparation tips for other job seekers - Prepare Medium leetcode questions and oops

Skills evaluated in this interview

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

I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.

Round 1 - Coding Test 

It was easy. Only basic questions were asked.

Round 2 - Technical 

(2 Questions)

  • Q1. What was your project?
  • Ans. 

    Developed a web-based inventory management system for a retail company

    • Used HTML, CSS, and JavaScript for front-end development

    • Utilized PHP and MySQL for back-end development

    • Implemented features such as product tracking, order processing, and reporting

    • Collaborated with team members to ensure project completion within deadline

  • Answered by AI
  • Q2. How can you improve your website?
  • Ans. 

    Improving a website involves optimizing performance, enhancing user experience, and updating content regularly.

    • Optimize website speed by compressing images and minifying code

    • Enhance user experience by improving navigation and adding interactive features

    • Update content regularly to keep information fresh and relevant

  • Answered by AI

I was interviewed in Apr 2022.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This round had 2 questions with Easy to Medium level of difficulty

  • Q1. 

    Problem: Total Area of Overlapping Rectangles

    You are given two rectangles situated on a 2-D coordinate plane, which may overlap. Your task is to compute the total area covered by these rectangles.

    Input...
  • Ans. 

    Calculate total area covered by two overlapping rectangles on a 2-D plane.

    • Calculate the area of each rectangle separately using the given coordinates.

    • Find the overlapping region by determining the intersection of the two rectangles.

    • Calculate the area of the overlapping region by multiplying its width and height.

    • Add the areas of the two rectangles and subtract the area of the overlapping region to get the total area cov

  • Answered by AI
  • Q2. 

    Rearrange Array: Move Negative Numbers to the Beginning

    Given an array ARR consisting of N integers, rearrange the elements such that all negative numbers are located before all positive numbers. The orde...

  • Ans. 

    Yes, this can be achieved by using a two-pointer approach to rearrange the array with negative numbers at the beginning.

    • Use two pointers, one starting from the beginning and one from the end of the array.

    • Swap elements at the two pointers if one is negative and the other is positive, and move the pointers accordingly.

    • Continue this process until the two pointers meet in the middle of the array.

    • The resulting array will ha...

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 70 minutes
Round difficulty - Medium

Standard DS/Algo round with 2 questions

  • Q1. 

    Middle Node of a Linked List Problem Statement

    Given the head node of a singly linked list, return a pointer to the middle node of the linked list. If there are an odd number of nodes, return the middle o...

  • Ans. 

    Return the middle node of a singly linked list, considering odd and even number of nodes.

    • Traverse the linked list with two pointers, one moving at twice the speed of the other

    • When the faster pointer reaches the end, the slower pointer will be at the middle node

    • Handle cases for odd and even number of nodes separately

    • Return null if the list is empty

  • Answered by AI
  • Q2. 

    All Prime Numbers Less Than or Equal to N

    Given a positive integer N, your task is to return all the prime numbers less than or equal to N.

    Note:

    1) A prime number is a number that has only two factors:...
  • Ans. 

    Return all prime numbers less than or equal to a given positive integer N.

    • Iterate from 2 to N and check if each number is prime using a helper function.

    • A number is prime if it is not divisible by any number from 2 to its square root.

    • Store and return the prime numbers in an array in increasing order.

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

This was a Technical Cum HR round where I was first asked some basic Java-related concepts and then we discussed my expectations from the company, learnings and growth in the forthcoming years. I would suggest be honest and try to communicate your thoughts properly in these types of rounds to maximise your chances of getting selected.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Associate Software Engineer in BangaloreEligibility criteria0-3 years of ExperienceSAP Labs interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, SQL, Angular, JavaTime required to prepare for the interview - 2 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 : Resume should be informative but not more than two pages
Tip 2 : Provide the links of all your achievements, projects and certificates in your resume

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
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 Resume tips
Round 2 - Group Discussion 

Corona Pandemic, digitalization

Round 3 - Aptitude Test 

Qualitative and quantitative questions + gmat

Round 4 - Technical 

(1 Question)

  • Q1. Dbms, os, programming
Contribute & help others!
anonymous
You can choose to be anonymous

Agilysys Technologies India Interview FAQs

How many rounds are there in Agilysys Technologies India Associate Software Engineer interview?
Agilysys Technologies India interview process usually has 2-3 rounds. The most common rounds in the Agilysys Technologies India interview process are Aptitude Test, Coding Test and Technical.

Recently Viewed

INTERVIEWS

Agarwal Packers and Movers Limited

No Interviews

SALARIES

Agilysys Technologies India

SALARIES

Evolent Health International

INTERVIEWS

Infocepts Technologies

5.6k top interview questions

LIST OF COMPANIES

Discover companies

Find best workplace

CAMPUS PLACEMENT

SRM university (SRMU)

INTERVIEWS

Agarwal Packers and Movers Limited

No Interviews

INTERVIEWS

Agarwal Packers and Movers Limited

No Interviews

INTERVIEWS

Agarwal Packers and Movers Limited

No Interviews

JOBS

Foundever

No Jobs

Tell us how to improve this page.

Agilysys Technologies India Associate Software Engineer Interview Process

based on 2 interviews

Interview experience

4
  
Good
View more
Agilysys Technologies India Associate Software Engineer Salary
based on 19 salaries
₹5 L/yr - ₹10.5 L/yr
32% more than the average Associate Software Engineer Salary in India
View more details

Agilysys Technologies India Associate Software Engineer Reviews and Ratings

based on 2 reviews

3.5/5

Rating in categories

2.0

Skill development

4.0

Work-life balance

5.0

Salary

5.0

Job security

3.4

Company culture

3.0

Promotions

3.0

Work satisfaction

Explore 2 Reviews and Ratings
Software Analyst
389 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Analyst
198 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Quality Analyst
175 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Software Analyst
152 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Quality Analyst
73 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Agilysys Technologies India with

Oracle

3.7
Compare

SAP

4.2
Compare

Microsoft Corporation

4.0
Compare

IBM

4.0
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent