Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Agumentik Software Full Stack Developer Interview Questions and Answers

Updated 23 Feb 2021

Agumentik Software Full Stack Developer Interview Experiences

1 interview found

Interview Questionnaire 

1 Question

  • Q1. They gave me a project and told me to complete in 6 hour

Interview questions from similar companies

I applied via Company Website and was interviewed before Dec 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Questions on Java,SQL,some trending technologies(IOT,Big data),pattern questions, programming questions with different approaches.

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare basics of DSA, have knowledge about the databases, some common dml ,ddl statements, programming knowledge of a particular language like C,Java, python,etc...have good command on oops concepts... little bit of frameworks knowledge will also help

I applied via Company Website and was interviewed in May 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Coding questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Be thorough with the concepts of coding, data structures and algorithms. Focus on topics like trees, linked list, arrays.

I was interviewed in Dec 2020.

Round 1 - Face to Face 

(1 Question)

Round duration - 25 Minutes
Round difficulty - Medium

Very friendly interviewer. Although waiting time was very high

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

    • If the complement exists, add the pair to the result list.

    • Sort the result list based on the criteria mentioned in the question.

    • Return the sorted list of pairs.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNoAmazon interview preparation:Topics to prepare for the interview - CV points, Leadership principles, ecommerce basics, problem solving, case studiesTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : be confident about your CV points
Tip 2 : practice consulting cases and how to answer situational questions

Application resume tips for other job seekers

Tip 1 : be crisp about achievement
Tip 2 : add data points to support your achievements

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Easy

This is a written round on paper for everyone. Three coding questions were given. Two out of three must be correct covering every single edge case to qualify for the next round. Only the most optimal solution was to be considered. 

  • Q1. 

    Maximum Subarray Sum Problem Statement

    Given an array arr of length N consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.

    Explanation...

  • Ans. 

    Find the sum of the subarray with the maximum sum among all subarrays in an array of integers.

    • Iterate through the array and keep track of the maximum sum subarray encountered so far.

    • Use Kadane's algorithm to efficiently find the maximum subarray sum.

    • Consider the sum of an empty subarray as 0.

    • Example: For input arr = [-2, 1, -3, 4, -1], the maximum subarray sum is 4.

  • Answered by AI
  • Q2. 

    Connecting Ropes with Minimum Cost

    You are given 'N' ropes, each of varying lengths. The task is to connect all ropes into one single rope. The cost of connecting two ropes is the sum of their lengths. Yo...

  • Ans. 

    Connect ropes with minimum cost by merging two smallest ropes at a time.

    • Sort the array of rope lengths in ascending order.

    • Merge the two smallest ropes at a time and update the cost.

    • Repeat the process until all ropes are merged.

    • Return the total cost as the minimum cost to connect all ropes.

  • Answered by AI
  • Q3. 

    Left View of a Binary Tree Problem Statement

    Given a binary tree, your task is to print the left view of the tree.

    Example:

    Input:
    The input will be in level order form, with node values separated by a...
  • Ans. 

    Print the left view of a binary tree given in level order form.

    • Traverse the tree level by level and print the first node encountered at each level

    • Use a queue to perform level order traversal

    • Keep track of the level while traversing the tree

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 50 minutes
Round difficulty - Easy

This was face to face interview round.

  • Q1. 

    Finding Triplets in a Binary Tree Problem Statement

    You are given a Binary Tree of integers and an integer 'X'. Your task is to find all the triplets in the tree whose sum is strictly greater than 'X'. Th...

  • Ans. 

    Find all triplets in a binary tree whose sum is greater than a given integer X, with a grandparent-parent-child relationship.

    • Traverse the binary tree to find all possible triplets with the required relationship.

    • Keep track of the sum of each triplet and compare it with the given integer X.

    • Return the triplets that satisfy the condition in any order.

    • Ensure each triplet follows the format (grand-parent, parent, child).

  • Answered by AI
  • Q2. 

    Loot Houses Problem Statement

    A thief is planning to steal from several houses along a street. Each house has a certain amount of money stashed. However, the thief cannot loot two adjacent houses. Determi...

  • Ans. 

    Determine the maximum amount of money a thief can steal from houses without looting two consecutive houses.

    • Use dynamic programming to keep track of the maximum amount of money that can be stolen up to each house.

    • At each house, the thief can either choose to steal from the current house or skip it and steal from the previous house.

    • The maximum amount of money that can be stolen at the current house is the maximum of the ...

  • Answered by AI
Round 3 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

This was face to face interview round.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in ChennaiAmazon interview preparation:Topics to prepare for the interview - Computer Fundamentals, Data Structures and AlgorithmsTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Participate in live contests on websites like Codechef, Codeforces, etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.

Application resume tips for other job seekers

Only write those things in the resume which you are confident of and keep practicing.

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

This is a written round on paper for everyone. Three coding questions were given. Two out of three must be correct covering every single edge case to qualify for the next round. Only the most optimal solution was to be considered.

  • Q1. 

    Maximum Subarray Sum Problem Statement

    Given an array ARR consisting of N integers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.

    Example of Sub...

  • Ans. 

    Find the maximum sum of a contiguous subarray in an array of integers.

    • Use Kadane's algorithm to find the maximum subarray sum in linear time.

    • Initialize two variables: maxSum and currentSum.

    • Iterate through the array and update currentSum by adding the current element or starting a new subarray.

    • Update maxSum if currentSum becomes greater than maxSum.

    • Return maxSum as the maximum subarray sum.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 50 Minutes
Round difficulty - Easy

This was face to face interview round.

  • Q1. 

    Finding Triplets in a Binary Tree Problem Statement

    You are given a Binary Tree of integers and an integer 'X'. Your task is to find all the triplets in the tree whose sum is strictly greater than 'X'. Th...

  • Ans. 

    Find all triplets in a binary tree whose sum is greater than a given integer X, with a grandparent-parent-child relationship.

    • Traverse the binary tree to find all possible triplets.

    • Check if the sum of each triplet is greater than X.

    • Ensure the relationship of grandparent-parent-child in each triplet.

    • Return the valid triplets in any order.

    • Handle constraints and edge cases appropriately.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

FACE TO FACE ROUND INTERVIEW

  • Q1. Can you tell me about yourself?
  • Q2. What is the difference between Mutex and Semaphores? Please provide a real-life example.
  • Ans. 

    Mutex is used for exclusive access to a resource by only one thread at a time, while Semaphores can allow multiple threads to access a resource simultaneously.

    • Mutex is binary and allows only one thread to access a resource at a time, while Semaphores can have a count greater than one.

    • Mutex is used for protecting critical sections of code, while Semaphores can be used for controlling access to a pool of resources.

    • Exampl...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in NoidaEligibility criteriaabove 7 cgpaAmazon interview preparation:Topics to prepare for the interview - Computer Fundamentals, Data Structures and AlgorithmsTime required to prepare for the interview - 6 MonthsInterview preparation tips for other job seekers

Tip 1 : Participate in previous interview questions from leetcode, geeksforgeeks
Tip 2 : Revise computer science subjects like dbms and oops thoroughly
Tip 3 : Participate in live contests on CodeChef, Codeforces

Application resume tips for other job seekers

Tip 1 : Only write the things on which you are the most confident about

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. Who is the CEO of amazon?
  • Q2. Andy Jassy

I was interviewed before Sep 2020.

Round 1 - Coding Test 

Round duration - 60 minutes
Round difficulty - Easy

Round 2 - Face to Face 

Round duration - 50 minutes
Round difficulty - Easy

Round 3 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.

Round 4 - Face to Face 

Round duration - 40 minutes
Round difficulty - Easy

 

The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.

Round 5 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked me some Com­puter Sci­ence‍ fundamentals in this round as well as some behavioural questions.

  • Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
  • Ans. 

    Implement a Trie data structure with insert and search functions.

    • Create a TrieNode class with children and isEndOfWord attributes.

    • Implement insert function to add words by iterating through characters.

    • Implement search function to check if a word exists by traversing the Trie.

    • Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteria 7 CGPA Amazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Operating System, Database Management System, Object-Oriented Programming SystemTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Do lot of hard work and practice of  Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.

Application resume tips for other job seekers

Make your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

Round duration - 90 minutes
Round difficulty - Easy

This round consist of two questions and we have to solve both the questions to qualify for the next round.

Round 2 - Face to Face 

Round duration - 40 minutes
Round difficulty - Easy

A single coding question was asked that had a lot of corner cases.

Round 3 - Face to Face 

(1 Question)

Round duration - 45 minutes
Round difficulty - Easy

It had 3 coding questions followed by basic concepts of DP.

  • Q1. How do you find the maximum difference between a node and its descendant in the same path in a binary tree?
  • Ans. 

    To find the maximum difference between a node and its descendant in the same path in a binary tree, we can perform a depth-first search while keeping track of the minimum value encountered so far.

    • Perform a depth-first search on the binary tree, keeping track of the minimum value encountered so far in the path.

    • At each node, calculate the difference between the current node value and the minimum value encountered so far ...

  • Answered by AI
Round 4 - Face to Face 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

It had 2 coding questions which were of good level.

  • Q1. How can you find a Minimum Spanning Tree (MST) from a given graph using Kruskal’s algorithm?
  • Ans. 

    Kruskal's algorithm finds MST by sorting edges, adding smallest edge that doesn't create a cycle, repeat until all vertices are connected.

    • Sort all edges in non-decreasing order of their weights.

    • Initialize an empty graph to store the MST.

    • Iterate through sorted edges and add the smallest edge that doesn't create a cycle in the MST.

    • Repeat until all vertices are connected in the MST.

  • Answered by AI
Round 5 - Face to Face 

Round duration - 30 minutes
Round difficulty - Easy

This was the last round.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Delhi Technological University. I applied for the job as SDE - 1 in HyderabadAmazon interview preparation:Topics to prepare for the interview - Data structures and Algorithms, Computer fundamentals subjects. Basics of every skill that you have written in your resume and also knowledge of concepts related to your projects. You should know whatever you have written in your resume.Time required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Don’t create panic in any case in the interview , as even if you are not selected you will learn a lot from your interview experience and perform well in the future. Also I would recommend you Coding Ninjas as according to me it is a good platform to learn basic coding concepts and to practice coding.   

Application resume tips for other job seekers

Write whatever you are sure about and have actually done that. CGPA plays a good role but not a complete role as it is just eligibility criteria for some companies. Have at least 1 or 2 good projects from which you know everything involved in the project.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 150 minutes
Round difficulty - Medium

We could attempt at any time out of the 3 given days.
The round was very time constrained and we could NOT go back to the question that we already attempted.

  • Q1. 

    Merge Two Sorted Linked Lists

    Given two sorted linked lists, your task is to merge them into a single sorted linked list. Return the head of the newly combined list.

    Note:

    The given linked lists may or ...
  • Ans. 

    Merge two sorted linked lists into a single sorted linked list.

    • Create a dummy node to start the merged list

    • Compare nodes from both lists and add the smaller one to the merged list

    • Move the pointer of the merged list and the list with the smaller node

    • Handle cases where one list is exhausted before the other

    • Return the head of the merged list

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Hard

Evening at 5:00 pm. It was held on Amazon Chime app
Face cam was to be kept on COMPULSARILY. You could however not see the interviewer.
Codepen type environment was also used for typing my code which could be edited by the interviewer also.
(Shared document kind of)
Interviewer was very professional and was trying to push me towards getting the most optimal solution. Each and every answer was asked a counter question as to why I made that choice

  • Q1. 

    Missing Numbers Problem Statement

    You are provided with an array called ARR, consisting of distinct positive integers. Your task is to identify all the numbers that fall within the range of the smallest a...

  • Ans. 

    Identify missing numbers within the range of smallest and largest elements in an array.

    • Find the smallest and largest elements in the array.

    • Generate a list of numbers within the range of smallest and largest elements.

    • Remove the numbers that are present in the array to get the missing numbers.

    • Sort and return the missing numbers.

  • Answered by AI
  • Q2. 

    Find Maximum Element Between Two Nodes in a BST

    Given a Binary Search Tree (BST) and two integers, NODE1 and NODE2, determine the maximum element found in the path between NODE1 and NODE2.

    Explanation:

    ...

  • Ans. 

    Find the maximum element between two nodes in a Binary Search Tree (BST) path.

    • Traverse the BST to find the path between NODE1 and NODE2.

    • Keep track of the maximum element encountered in the path.

    • Return the maximum element found, or -1 if NODE1 or NODE2 are not in the BST or no elements exist between them.

  • Answered by AI
  • Q3. 

    String Compression Problem Statement

    Implement a program that performs basic string compression. When a character is consecutively repeated more than once, replace the consecutive duplicates with the coun...

  • Ans. 

    Implement a program to compress a string by replacing consecutive duplicates with the count of repetitions.

    • Iterate through the string and keep track of consecutive characters and their counts.

    • Replace consecutive duplicates with the count of repetitions.

    • Ensure the count of repetitions is ≤ 9.

    • Return the compressed string.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Veermata Jijabai Technological Institute. I applied for the job as SDE - 1 in BangaloreEligibility criteriaOnly femalesAmazon interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, DBMS, Dynamic programming, Computer network basicsTime required to prepare for the interview - 1.5 monthsInterview preparation tips for other job seekers

Tip 1 : Be very very clear with your basics.
Tip 2 : Think well before giving an answer
Tip 3 : Practice, practice, practice DS Algo questions

Application resume tips for other job seekers

Tip 1 : Limit it to 1 page ONLY.
Tip 2 : Be ready to face all kinds of questions on topics you have mentioned in the resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Recently Viewed

INTERVIEWS

Quantiphi Analytics Solutions Private Limited

No Interviews

INTERVIEWS

Sanmar Group

No Interviews

INTERVIEWS

Deloitte

No Interviews

INTERVIEWS

Simplilearn

No Interviews

INTERVIEWS

Mazars

No Interviews

INTERVIEWS

Crowe Horwath

No Interviews

INTERVIEWS

Skill Lync

No Interviews

INTERVIEWS

Bank of America

No Interviews

INTERVIEWS

Iris Software

No Interviews

INTERVIEWS

PwC

No Interviews

Tell us how to improve this page.

Fast track your campus placements

View all
Agumentik Software Full Stack Developer Salary
based on 4 salaries
₹1.8 L/yr - ₹8 L/yr
45% less than the average Full Stack Developer Salary in India
View more details
Compare Agumentik Software with

TCS

3.7
Compare

Infosys

3.6
Compare

Wipro

3.7
Compare

HCLTech

3.5
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