Intuit Senior Software Engineer Interview Questions, Process, and Tips

Round duration - 60 minutes
Round difficulty - Medium

Technical interview round that lasted for around 60 minutes. The interviewer asked me programming questions, puzzles, Java basics and some output based questions.

Q1. 
Maximum Non-Adjacent Subsequence Sum
Given an array of integers, determine the maximum sum of a subsequence without choosing adjacent elements in the original array.
Input:
The first line consists of an...read more
Ans. 
Find the maximum sum of a subsequence without choosing adjacent elements in an array.
• Use dynamic programming to keep track of the maximum sum at each index, considering whether to include the current element or not.

• At each index, the maximum sum can be either the sum of the current element and the element two positions back, or the maximum sum at the previous index.

• Iterate through the array and update the maximum sum a...read more
Answered by AI
Add your answer