i
Filter interviews by
I appeared for an interview before Aug 2024, where I was asked the following questions.
My first call with a recruiter was both exciting and nerve-wracking, filled with questions about my skills and aspirations.
The recruiter introduced themselves and explained the role they were hiring for.
I was asked about my previous experience and how it relates to the position.
I felt nervous but prepared, having researched the company beforehand.
The recruiter provided insights into the company culture and team dynamic...
Top trending discussions
posted on 18 May 2021
I applied via Naukri.com and was interviewed in Nov 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 appeared for an interview in Oct 2020.
posted on 22 Jul 2021
I applied via Naukri.com and was interviewed in Jan 2021. There were 4 interview rounds.
posted on 24 Sep 2021
I applied via Naukri.com and was interviewed in Mar 2021. There were 4 interview rounds.
posted on 21 Oct 2021
I applied via Campus Placement and was interviewed in Apr 2021. There were 3 interview rounds.
posted on 14 Sep 2021
I applied via Recruitment Consultant and was interviewed in Oct 2020. There were 3 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 26 Nov 2020
I applied via Naukri.com and was interviewed before Nov 2019. There were 4 interview rounds.
based on 1 interview experience
Difficulty level
Duration
based on 1 review
Rating in categories
Software Developer
88
salaries
| ₹4.8 L/yr - ₹12 L/yr |
Senior Associate
87
salaries
| ₹2.5 L/yr - ₹6.5 L/yr |
Software Engineer
74
salaries
| ₹5.1 L/yr - ₹12 L/yr |
Senior Software Engineer
72
salaries
| ₹14.8 L/yr - ₹25.2 L/yr |
Team Lead
51
salaries
| ₹16 L/yr - ₹27.9 L/yr |
ITC Infotech
Test Yantra Software Solutions
Clover Infotech
Newgen Software Technologies