KGISL Java Developer Interview Questions and Answers

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.

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...read more
Ans. 
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.
Answered by AI
Add your answer
Q2. 
Add Two Numbers as Linked Lists
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 ...read more
Ans. 
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
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

It was a normal discussion about the role, the job expectations and about the company culture.