i
Microland
Filter interviews by
I applied via Campus Placement and was interviewed in Nov 2023. There were 4 interview rounds.
Arithmetic, reasoning, English
posted on 10 Dec 2024
I applied via Campus Placement and was interviewed before Dec 2023. There were 2 interview rounds.
Easy numerics, logical, coding, technical
Reverse an array of integers in place
Create two pointers, one at the start and one at the end of the array
Swap the elements at the two pointers and move them towards the center until they meet
Time complexity: O(n), Space complexity: O(1)
Function to find duplicates in an array of integers and return a list of unique duplicates.
Iterate through the array and keep track of elements seen before using a hash set.
If an element is already in the hash set, add it to the result list.
Return the list of unique duplicates found.
posted on 7 Jul 2017
posted on 26 Nov 2020
I applied via Naukri.com and was interviewed before Nov 2019. There were 4 interview rounds.
posted on 20 Feb 2021
I applied via Recruitment Consultant and was interviewed before Feb 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.
posted on 19 Feb 2021
I applied via Naukri.com and was interviewed in Jan 2021. There was 1 interview round.
posted on 15 Sep 2021
I appeared for an interview 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.
based on 3 interviews
Interview experience
based on 5 reviews
Rating in categories
Senior Engineer
362
salaries
| ₹2.2 L/yr - ₹5 L/yr |
Senior Administrator
260
salaries
| ₹3 L/yr - ₹14 L/yr |
Sme Associate
218
salaries
| ₹6 L/yr - ₹19 L/yr |
System Administrator
207
salaries
| ₹2.2 L/yr - ₹8 L/yr |
Senior Analyst
196
salaries
| ₹4 L/yr - ₹12 L/yr |
ITC Infotech
3i Infotech
Sify Technologies
Newgen Software Technologies