i
Aptara
Filter interviews by
Clear (1)
I applied via Walk-in and was interviewed in Sep 2022. There were 5 interview rounds.
Not tough but intresting like IQ test
Have to write few words on topic given by invistigator
I applied via Referral and was interviewed before Dec 2022. There were 3 interview rounds.
Top trending discussions
posted on 1 Aug 2024
Yes, I am open to relocating for the right opportunity.
I am willing to relocate for the right job opportunity
I have relocated for previous roles and am comfortable with the process
I am open to exploring new locations and experiences
I can join within two weeks of receiving an offer.
I am currently wrapping up my current projects and can transition smoothly within two weeks.
I can start as soon as necessary, but would appreciate a two-week notice period.
I am flexible with my start date and can discuss further details during the offer stage.
I applied via Referral and was interviewed before Sep 2021. There were 2 interview rounds.
posted on 7 Jul 2017
posted on 21 Nov 2022
I applied via Naukri.com and was interviewed before Nov 2021. There were 2 interview rounds.
posted on 15 Sep 2021
I was interviewed before Sep 2020.
Round duration - 45 minutes
Round difficulty - Medium
I was asked 2 coding questions, questions from my projects and questions related to different java concepts. One question from cloud computing was also asked.
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.
Find the sum of the subarray with the maximum sum among all subarrays in a given array.
Iterate through the array and keep track of the current sum and maximum sum seen so far.
If the current sum becomes negative, reset it to 0 as it won't contribute to the maximum sum.
Return the maximum sum as the result.
Example: For input arr = [-2, 1, -3, 4, -1], the maximum subarray sum is 4.
You are given two singly linked lists, where each list represents a positive number without any leading zeros.
Your task is to add these two numbers and return the sum as ...
Add two numbers represented as linked lists and return the sum as a linked list.
Traverse both linked lists simultaneously while keeping track of carry
Create a new linked list to store the sum
Handle cases where one list is longer than the other
Consider edge cases like carry at the end of addition
Round duration - 15 minutes
Round difficulty - Easy
It was a normal discussion about the role, the job expectations and about the company culture.
Tip 1 : Do at-least 200+ dsa problems from various topics.
Tip 2 : Make 2-3 projects and be well versed with their functionality.
Tip 3 : Practice aptitude questions and time yourself while doing the questions.
Tip 1: Keep your resume short, try to make it one pager only.
Tip 2: Mention only position specific projects, and if you have got a good academic score mention it on top.
posted on 28 Dec 2021
I applied via Naukri.com and was interviewed before Dec 2020. There were 4 interview rounds.
posted on 18 May 2021
I applied via Naukri.com and was interviewed in Nov 2020. There were 4 interview rounds.
based on 4 interviews
Interview experience
based on 9 reviews
Rating in categories
Financial Analyst
213
salaries
| ₹0 L/yr - ₹0 L/yr |
Copy Editor
185
salaries
| ₹0 L/yr - ₹0 L/yr |
Html Programmer
185
salaries
| ₹0 L/yr - ₹0 L/yr |
Project Manager
153
salaries
| ₹0 L/yr - ₹0 L/yr |
Editorial Assistant
141
salaries
| ₹0 L/yr - ₹0 L/yr |
Cactus Communications
Integra Software Services
Newgen Software Technologies
SunTec Web Services