Filter interviews by
I applied via Naukri.com and was interviewed before Apr 2021. There were 2 interview rounds.
Top trending discussions
I applied via Campus Placement and was interviewed before Apr 2020. There were 4 interview rounds.
posted on 14 Jan 2022
I applied via Campus Placement and was interviewed before Jan 2021. There were 4 interview rounds.
Concatenate two linked lists alternatively
Create a new linked list
Traverse both linked lists simultaneously
Alternate between adding nodes from each list to the new list
If one list is longer than the other, add the remaining nodes to the end of the new list
I applied via Recruitment Consultant and was interviewed before Mar 2020. There was 1 interview round.
Printing names of 4 threads in a given order using an array of strings.
Create an array of strings with the names of the threads in the desired order.
Use a loop to iterate through the array and print each thread name.
Ensure that the threads are started in the same order as the names in the array.
posted on 19 Aug 2022
I applied via Referral and was interviewed before Aug 2021. There were 2 interview rounds.
I applied via Naukri.com and was interviewed before Sep 2020. There were 4 interview rounds.
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.
posted on 21 Nov 2020
posted on 18 May 2021
I applied via Naukri.com and was interviewed in Nov 2020. There were 4 interview rounds.
I appeared for an interview in Sep 2017.
Software Developer
15
salaries
| ₹5 L/yr - ₹12.5 L/yr |
Project Manager
8
salaries
| ₹10 L/yr - ₹23 L/yr |
Implementation Executive
7
salaries
| ₹3.6 L/yr - ₹6 L/yr |
Senior Software Developer
7
salaries
| ₹3.5 L/yr - ₹16.5 L/yr |
Assistant Manager
7
salaries
| ₹4 L/yr - ₹8.5 L/yr |
ITC Infotech
CMS IT Services
KocharTech
3i Infotech