Codemonk Senior Software Engineer 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