Ascendion Senior Java Developer Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Medium

It was very good

Q1. 
Find the Longest Palindromic Substring
Given a string ‘S’ composed of lowercase English letters, your task is to identify the longest palindromic substring within ‘S’.
If there are multiple longest palin...read more
Ans. 
Find the longest palindromic substring in a given string, returning the rightmost one if multiple exist.
• Use dynamic programming to check if substrings are palindromes

• Iterate through the string and expand around each character to find palindromic substrings

• Keep track of the longest palindromic substring found
Answered by AI
Add your answer
Q2. 
Minimum Sum in Matrix Problem Statement
You are given a 2D matrix 'ARR' of size 'N x 3' with integers, where 'N' is the number of rows. Your task is to compute the smallest sum achievable by selecting one...read more
Ans. 
Find the smallest sum achievable by selecting one element from each row of a 2D matrix, following certain constraints.
• Iterate through each row and calculate the minimum sum by selecting elements that do not violate the constraints.

• Keep track of the minimum sum achieved so far.

• Avoid selecting elements directly beneath previously selected elements.

• Example: For input [[1, 2, 3], [4, 8, 6], [1, 5, 3]], the optimal selectio
Answered by AI
Add your answer

Round duration - 1 hour
Round difficulty - Medium

It was a good interview

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.

Thre are aptitude question with coding round

Q1. Introduction Basics of programming
Add your answer

Q1. HR questions introduced yourself family background
Add your answer

Q1. General Java, springboot and oops
Add your answer

Q1. Managerial round with Technical Lld and design related questions
Add your answer

Q1. Client round technical LLD AND HLD questions
Add your answer

Q1. HR discussion about salary and client details
Add your answer